The proposed SPO provides an effective alternative optimization tool for complex constrained engineering optimization tasks such as 3D UAV path planning and significantly outperforms 14 mainstream metaheuristic algorithms, including PSO, DE, SHADE, and DBO, on most test functions.
Abstract
To address the inherent limitations of existing metaheuristic algorithms in solving complex three-dimensional (3D) unmanned aerial vehicle (UAV) path planning problems, such as premature convergence and weak adaptability to multi-dimensional flight constraints, this paper proposes a novel Scallop Optimizer (SPO). Inspired by the composite survival behaviors of scallops, including filter-feeding, zigzag predation evasion, group defense, and byssus memory, SPO integrates five coordinated search modules: Adaptive Energy State Switching Mechanism (AESSM), Filter-Feeding Mechanism (FFM), Leaping-Zigzag Evasion Mechanism (LM-ZM), Group Defense-Dispersion Mechanism (GDDM), and Byssus Historical Optimal Memory Mechanism (BHM). AESSM dynamically adjusts the energy state of each individual to switch between global exploration and local exploitation; FFM enhances fine local search accuracy; LM-ZM improves the capability to escape local optima; GDDM maintains population diversity in real time; and BHM avoids redundant repeated search. Comprehensive numerical experiments on the IEEE CEC 2017 (D = 30) and CEC 2022 (D = 10 and 20) benchmark suites demonstrate that SPO achieves minimum average rankings of 1.14, 1.58, and 1.50 across three test sets, and significantly outperforms 14 mainstream metaheuristic algorithms, including PSO, DE, SHADE, and DBO, on most test functions. Further ablation experiments verify that the GDDM module contributes the most to performance improvement, with an average ranking degradation of 6.00 upon its removal. When applied to multi-constraint 3D UAV path planning, SPO obtains a minimal total flight cost of 1298.32, reducing the comprehensive path cost by 40.41% compared to the worst-performing optimizer, and generates collision-free, smooth trajectories with zero terrain and threat penalty costs. Statistical Wilcoxon signed-rank and Cohen’s d tests further validate the significant statistical superiority of SPO. The proposed SPO provides an effective alternative optimization tool for complex constrained engineering optimization tasks such as 3D UAV path planning.
Comparative experiments demonstrate that MsESO exhibits higher robustness and superiority over CMA-ES, MadDE, LSHADE-SPACMA, WOA, HHO, PPSO, MELGWO, HLOA, NRBO, ESO, and the original SO, and outperforms the comparative algorithms in UAV path planning problems, showcasing its significant potential in practical applicati...
Zong-Hui Li, Bo Zheng, Xiaoming Liu· Cluster Computing· 0 citations
Traditional Ant Colony Optimization (ACO) suffers from premature convergence, slow convergence speed, and insufficient path smoothness in three-dimensional (3D) unmanned aerial vehicle (UAV) path planning. This paper proposes a Metropolis-based dynamic exploration ACO algorithm (MACO) that introduces four complementary...
Gui-Xin Wang, Baolu Gao, Yong-Qi Wang· IEEE Jordan Conference on Ap...· 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.
The Circle-SPM chaotic map is introduced to optimize the population initialization process, effectively mitigating the premature convergence caused by uneven distribution and a lack of population diversity.
Jian Deng, Honghai Zhang, Ze-Yu Liu et al.· Cluster Computing· 0 citations
An efficient and robust algorithm for autonomous three-dimensional path planning of UAVs in complex obstacle environments is presented and coordinated improvements realize targeted optimization for UAV 3D flight characteristics.