Yi Jiang

Dr. Yi Jiang

orcid

Research Focus & Metrics

Academic Career Length

1Year (2026-Present)

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

Representative Publications

View All Publications
17 April 2026 in Electronics
Verified
Journal Article
Open access
PDF file
CLChen Jie Liu
Chen Jie Liu
YJYi Jiang
Yi Jiang
Dawei GongDawei Gong
Dawei Gong
Formation reconstruction for large-scale unmanned aerial vehicle (UAV) swarms faces critical challenges in computational complexity and safe navigation within high-density environments. To address the O(N3) computational bottleneck of traditional assignment algorithms, this study proposes a Dynamic Grouping Task Assignment (DGTA) method based on a hierarchical sorting strategy. Furthermore, an Integrated Hierarchical Control (IHC) framework is developed by coupling fuzzy logic velocity regulation and linear trajectory prediction with an improved Artificial Potential Field (APF) method. Numerical simulation results demonstrate that the DGTA method significantly enhances efficiency; specifically, when the swarm is partitioned into three complete groups, the task assignment time for a 600-UAV swarm is reduced by over 90% compared to non-grouping approaches. Additionally, the IHC framework reduces hazardous incidents by more than 27% in congested scenarios. This DGTA-IHC structure successfully balances global optimality with real-time safety, providing a scalable solution for the autonomous coordination of ultra-large-scale swarms.

27 August 2026 in Electronics
Verified
Journal Article
Open access
PDF file
HSHangkun Shi
Hangkun Shi
YJYi Jiang
Yi Jiang
Dawei GongDawei Gong
Dawei Gong
WZWei Zheng
Wei Zheng
Sampling-based path planning is widely used in autonomous navigation, but Informed-RRT* still relies mainly on geometric ellipsoidal sampling and does not explicitly evaluate local obstacle risk, which can lead to invalid expansion, redundant nodes, and slow convergence. This paper proposes RC-Informed-RRT*, integrating risk-density-aware adaptive corridor sampling, improvement-bound rejection, and search-state-regulated goal bias. The corridor mechanism combines reference-path deviation, obstacle clearance, and local obstacle density; the rejection mechanism filters low-contribution nodes using an optimistic improvement bound; and the goal-bias strategy adapts target-oriented sampling to the search state. Comparative simulations were conducted in sparse, dense, narrow-passage, and W-shaped environments using 50 randomized trials per algorithm with small perturbations of the start/goal positions and obstacle locations. Relative to Informed-RRT*, RC-Informed-RRT* reduced mean planning time by 45.88–74.76% and final node count by 35.92–60.13%, while reducing final path length by 0.75–4.88% and maintaining 98–100% success rates. Sequential ablation and goal-bias sensitivity experiments further support the complementary roles of the three mechanisms and the fairness of the baseline parameter setting.