Hierarchical Cooperative Path Planning of Multiple UAVs Based on PSO-APF
A hierarchical PSO-APF algorithm fuses global optimization with local obstacle avoidance via a lightweight constraint function, cutting runtime by over 80% versus PSO and improving efficiency 31.3% over APF.
Published Jul 11, 20251 citationPaper ↗
Only vote on papers you've read. Sign in to vote.
Abstract
To address the challenges of local optima, limited adaptability, and suboptimal route efficiency in traditional multi-UAV cooperative path planning algorithms, this paper proposes a Hierarchical PSO-APF(H-PSOAPF)algorithm. By constructing a Lightweight Constraint Fusion Function (LCFF), complex constraint problems, including coverage degree, path length, turn angle limits and inter-drone spacing, are transformed into an unconstrained optimization problem via a penalty function approach. Moreover, a hierarchical structure is adopted to coordinate global path planning and local dynamic adjustment: PSO is employed to generate a globally optimized reference trajectory, while APF conducts real-time local modifications for obstacle avoidance and trajectory smoothing. Simulation results indicate that a runtime reduction of over 80% is achieved compared to PSO, and a 31.3% improvement in computational efficiency is obtained over APF by using the PS O-APF algorithm.