Jul 2026· International Conference on Ubiquitous and Future Networks· pp. 708-713· 0 citations· 17 references
Abstract
Efficient path planning for multiple unmanned aerial vehicles (UAVs) is essential in disaster relief operations, where rapid response and improved survival rates are critical. Conventional metaheuristic algorithms frequently experience premature convergence and an imbalance between exploration and exploitation, especially in complex and densely constrained environments. This study introduces an Adaptive Particle Swarm Optimization (APSO) approach for cooperative multi-UAV trajectory planning in hazardous scenarios. The method utilizes a performance-driven adaptation mechanism that dynamically adjusts each particle’s inertia weight according to its fitness relative to the population average and the global best solution. This mechanism enhances exploration for low-performing particles and ensures precise exploitation for high-performing ones. The path planning problem is formulated as a multi-objective optimization task, incorporating trajectory smoothness, altitude stability, hazard avoidance, and path length. Simulation results in diverse and complex disaster environments demonstrate the effectiveness of the proposed approach. Specifically, the method achieves approximately 6% and 12% reductions in total path length compared to standard Particle Swarm Optimization (PSO) and Ant Colony Optimization (ACO), respectively. In more challenging scenarios, it further surpasses conventional PSO, achieving up to an 11% improvement in mission efficiency. These findings indicate that the adaptive strategy substantially enhances trajectory safety and operational performance, establishing it as a robust and reliable solution for autonomous multi-UAV coordination in disaster response applications.
With the popularization of unmanned aerial vehicles (UAVs) in scenarios such as military reconnaissance, logistics transportation, and post-disaster rescue, Generating optimal flight paths that guarantee both safety and timeliness amidst high-density barriers and unknown environmental factors presents a formidable chal...
Qian Wan, Tian-En Lu, Liquan Huang et al.· International Conference on...· 0 citations
Experimental results show that the proposed improved dung beetle optimization (IDBO) algorithm, which integrates multiple coordinated mechanisms to enhance the original dung beetle optimizer, can serve as a competitive optimizer for numerical benchmark problems and offline static 3D UAV path-planning simulations.
An improved Whale Optimization Algorithm (R*WOA) that integrates the Rapidly Expanding Random Tree Star (RRT*) algorithm that significantly outperforms traditional WOA, GA and HHO algorithms, enabling the planning of optimal UAV flight trajectories with shorter paths, higher safety and better smoothness in complex cons...
Experiments show that HLGWO generally outperforms several comparison algorithms in convergence accuracy, stability, and path cost, thereby improving the safety, feasibility, and optimization performance of 3D UAV path planning in complex environments.
3D UAV trajectory planning in dynamic multi-threat environments as a dynamic bi-objective optimization problem and a multi-swarm dynamic multi-objective crow search algorithm (MDMCSA) are formed.
Gengsong Li, Yi Liu, Qibin Zheng et al.· Applied Sciences· 1 citation
The Personal History Memory Mechanism is introduced, which replaces random perturbation with weighted historical experience to enhance the directional search capability of the algorithm, and a greedy selection strategy is embedded to ensure the monotonically non-deteriorating quality of population solutions.