Yuting Cao

Yuting Cao

Auto-generated profile, based on publicly available information

Yuting Cao

School of Information Intelligent Science, Donghua University, Shanghai, China

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
26 April 2010 in Optics Letters
Verified
Journal Article
Closed access
PDF file
BPBo Peng
Bo Peng
XWXiangzhao Wang
Xiangzhao Wang
ZQZicheng Qiu
Zicheng Qiu
QYQiongyan Yuan
Qiongyan Yuan
YCYuting Cao
Yuting Cao
We discuss the aberration-induced intensity imbalance of alternating phase-shifting mask (Alt-PSM) in lithographic imaging, in contrast to numerous studies on mask-induced intensity imbalance. Based on the Hopkins theory of partial coherent imaging, a linear relationship between the intensity difference of adjacent peaks in an Alt-PSM image and even aberration is established by formulations and verified by numerical results. The application of the linear relationship is briefly discussed.

15 October 2025 in Digital Signal Processing
Verified
Journal Article
Closed access
YCYuting Cao
Yuting Cao
ZLZhengpin Li
Zhengpin Li
JWJian Wang
Jian Wang
XJXue-Qin Jiang
Xue-Qin Jiang
SZShubo Zhou
Shubo Zhou

15 March 2024 in EURASIP Journal on Advances in Signal Processing
Verified
Journal Article
Open access
PDF file
YCYuting Cao
Yuting Cao
Xue-qin JiangXue-qin Jiang
Xue-qin Jiang
JWJian Wang
Jian Wang
SZShubo Zhou
Shubo Zhou
XHXinxin Hou
Xinxin Hou
In this paper, we consider the graph signals are sparse in the graph Fourier domain and propose an iterative threshold compressed sensing reconstruction (ITCSR) algorithm to reconstruct sparse graph signals in the graph Fourier domain. The proposed ITCSR algorithm derives from the well-known compressed sensing by considering a threshold for sparsity-promoting reconstruction of the underlying graph signals. The proposed ITCSR algorithm enhances the performance of sparse graph signal reconstruction by introducing a threshold function to determine a suitable threshold. Furthermore, we demonstrate that the suitable parameters for the threshold can be automatically determined by leveraging the sparrow search algorithm. Moreover, we analytically prove the convergence property of the proposed ITCSR algorithm. In the experimental, numerical tests with synthetic as well as 3D point cloud data demonstrate the merits of the proposed ITCSR algorithm relative to the baseline algorithms.

30 October 2023 in Research Square
Verified
Preprint
Open access
PDF file
YCYuting Cao
Yuting Cao
Xue-qin JiangXue-qin Jiang
Xue-qin Jiang
JWJian Wang
Jian Wang
SZShubo Zhou
Shubo Zhou
XHXinxin Hou
Xinxin Hou
In this paper, we consider the graph signals are sparse in the graph Fourier domain and propose an iterative threshold compressed sensing reconstruction (ITCSR) algorithm to reconstruct sparse graph signals in the graph Fourier domain. The proposed ITCSR algorithm derives from the well-known compressed sensing (CS) by considering a threshold for sparsity-promoting reconstruction of the under- lying graph signals. The proposed ITCSR algorithm enhances the performance of sparse graph signal reconstruction by introducing a threshold function to determine an suitable threshold. Furthermore, we demonstrate that the suitable parameters for the threshold can be automatically determined by leveraging the sparrow search algorithm (SSA). Morever, we analytically prove the convergence property of the proposed ITCSR algorithm. In the experimental, numerical tests with synthetic as well as 3D point cloud data demonstrate the merits of the proposed ITCSR algorithm relative to the baseline algorithms.

21 August 2026 in Journal of King Saud University Computer and Information Sciences
Verified
Journal Article
Open access
PDF file
YCYuting Cao
Yuting Cao
ZZZheng Zhao
Zheng Zhao
JWJiekai Wu
Jiekai Wu
CLChia Hau Lee
Chia Hau Lee
QOQi Wei Oung
Qi Wei Oung
Hoi Leong LeeHoi Leong Lee
Hoi Leong Lee
Cooperative unmanned aerial vehicle (UAV) path planning is one of the core challenges in the field of autonomous systems, requiring the simultaneous guarantee of safety, efficiency, and multi-agent collaborative consistency in continuously dynamic obstacle environments. Existing methods either rely on hand-crafted heuristic rules and thus lack adaptability, or employ deep reinforcement learning (DRL) but suffer from low sample efficiency and sparse reward problems, making it difficult to achieve high task success rates in complex dynamic scenarios. This paper proposes SkyAgent—a lightweight large language model (LLM)-driven hierarchical reinforcement learning framework specifically designed for adaptive cooperative path planning of two UAVs. SkyAgent adopts Qwen2.5-1.5B (Q4_K_M quantization, approximately 1 GB VRAM) as the high-level semantic planner, performing fully offline inference at approximately 1,900 ms model forward-pass per call on a local GPU via the Ollama framework without any external API; employs Proximal Policy Optimization (PPO) as the low-level continuous action controller; and achieves efficient decoupled coordination of the two-tier policy through an asynchronous sub-goal injection mechanism (replanning every $$K=20$$ K = 20 steps). In a continuous two-dimensional simulation environment of $$100 \times 100$$ 100 × 100 m $$^2$$ 2 containing 8 static and 3 dynamic obstacles, SkyAgent is systematically evaluated against 7 baseline methods (Random, Greedy, APF, A*, PPO, SAC, OraclePID) over 30 random seeds. Experimental results demonstrate that SkyAgent achieves a mission success rate of 96.7%, comprehensively outperforming all baseline methods, improving by 16.7 percentage points over the vanilla PPO baseline, reducing collisions by 83%, shortening path length by 27 m, and improving sample efficiency approximately 3.3 $$\times $$ × (requiring only 55k training steps to reach the 80% success rate threshold). In the Dynamic-heavy scenario (30 obstacles), the success rate still reaches 90.9%, demonstrating significant generalization robustness. Six ablation experiments quantitatively validate the indispensability of the LLM planner, sub-goal guidance, sensor observations, cooperative reward, and reward shaping components. This work provides a feasible technical pathway and a reproducible evaluation benchmark for the collaborative deployment of lightweight LLMs and RL on GPU-equipped resource-constrained edge devices; we note that the present evaluation is confined to a two-dimensional, idealized simulation and that on-board deployment presupposes a GPU-class accelerator rather than an MCU-class micro-UAV.

12 September 2026 in Signal Processing
Verified
Journal Article
Closed access
YCYuting Cao
Yuting Cao
YFYan Feng
Yan Feng