Yuting Cao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Yuting Cao has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
Jian Wang
2 shared publicationsShubo Zhou
2 shared publicationsXinxin Hou
School of Information Science and Technolog, Donghua University, Shanghai, China
2 shared publications- Xue-Qin Jiang
College of Information and Intelligent Science, Donghua University, Shanghai 201620, China
2 shared publications - Bo Peng
National Astronomical Observatories Chinese Academy of Sciences 100101 Beijing China
1 shared publication - Chia Hau Lee
Faculty of Electronic Engineering and Technology, Universiti Malaysia Perlis, Arau, Malaysia
1 shared publication
Latest Publications
- 12 September 2026
- Published by Elsevier in Signal Processing
- Vol. 251
Exogenous-driven time-varying graph learning for incomplete graph signal reconstruction
- 12 September 2026
- Published by Elsevier in Signal Processing
- Vol. 251
Exogenous-driven time-varying graph learning for incomplete graph signal reconstruction
- Open Access
- 21 August 2026
- Published by Springer Nature in Journal of King Saud University Computer and Information Sciences
- Vol. 38 (7) , 732
SkyAgent: A lightweight LLM-driven reinforcement learning framework for adaptive cooperative path planning of two UAVs
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$$ steps). In a continuous two-dimensional simulation environment of $$100 \times 100$$ m $$^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.- 21 August 2026
- Published by Springer Nature in Journal of King Saud University Computer and Information Sciences
- Vol. 38 (7) , 732
Open AccessSkyAgent: A lightweight LLM-driven reinforcement learning framework for adaptive cooperative path planning of two UAVs
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$$ steps). In a continuous two-dimensional simulation environment of $$100 \times 100$$ m $$^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. - 15 October 2025
- Published by Elsevier in Digital Signal Processing
- Vol. 168
Signal reconstruction from incomplete time-varying EEG via local and global graph learning
- 15 October 2025
- Published by Elsevier in Digital Signal Processing
- Vol. 168
Signal reconstruction from incomplete time-varying EEG via local and global graph learning
- Open Access
- 15 March 2024
- Published by Springer Nature in EURASIP Journal on Advances in Signal Processing
- Vol. 2024 (1) , 1-23
An efficient algorithm with fast convergence rate for sparse graph signal reconstruction
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.
- 15 March 2024
- Published by Springer Nature in EURASIP Journal on Advances in Signal Processing
- Vol. 2024 (1) , 1-23
Open AccessAn efficient algorithm with fast convergence rate for sparse graph signal reconstruction
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.
- Open Access
- 30 October 2023
- Published by Springer Nature in Research Square
An Efficient Algorithm with Fast Convergence Rate for Sparse Graph Signal Reconstruction
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.
- 30 October 2023
- Published by Springer Nature in Research Square
Open AccessAn Efficient Algorithm with Fast Convergence Rate for Sparse Graph Signal Reconstruction
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.
- 26 April 2010
- Published by Optica Publishing Group in Optics Letters
- Vol. 35 (9) , 1404-1406
Aberration-induced intensity imbalance of alternating phase-shifting mask in lithographic imaging
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.
- 26 April 2010
- Published by Optica Publishing Group in Optics Letters
- Vol. 35 (9) , 1404-1406
Aberration-induced intensity imbalance of alternating phase-shifting mask in lithographic imaging
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.