Skip to content
Open access

A Scallop Optimizer and Its Application in 3-D UAV Path Planning

2026 · IEEE Access · Vol 14, pp. 121068-121109 · 0 citations · 64 references
Computer Science

TL;DR

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.

Read PDF

Similar papers

Conference Jul 2026

A Metropolis-Based Ant Colony Optimization Algorithm with Dynamic Exploration for UAV 3D Path Planning

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 mechanisms: (1) probabilistic acceptance of inferior solutions via the Metropolis criterion to escape local optima; (2) a linearly decaying dynamic exploration rate to balance global exploration and local exploitation; (3) adaptive step size adjustment to improve late-stage search precision; and (4) adaptive pheromone evaporation (0.7 to 0.3) to regulate convergence. Comparative experiments are conducted in a 250× 250 continuous 3D environment with six algorithms over 30 independent runs. Results show that MACO achieves the best mean fitness of $367.80 \pm 3.12$ and the shortest path length of 338.42m with a 100% collision-free rate. The Wilcoxon rank-sum test confirms MACO's statistically significant superiority $(p<0.001)$.

Gui-Xin Wang, Baolu Gao, Yong-Qi Wang · 0 citations
Open access Sep 2026

Adaptive Two-Stage Pigeon-Inspired Optimization Algorithm for UAV Three-Dimensional Path

To address slow convergence, local optimum stagnation, and multi-objective imbalance problems for unmanned aerial vehicle (UAV) three-dimensional (3D) path planning in complex obstacle environments, an improved adaptive two-stage pigeon swarm optimization (IPIO) algorithm is proposed. Firstly, a hybrid initialization strategy integrating Latin hypercube sampling and obstacle avoidance constraints is adopted to improve initial population diversity and the quality of feasible solutions. Secondly, in the map compass stage, a linearly decreasing adaptive map factor and population diversity-based dynamic perturbation strategy are introduced to balance global exploration and local exploitation while preventing premature convergence. In the landmark stage, an inverse fitness weighting elite center updating mechanism and linearly decreasing elite quantity strategy are designed to enhance the guidance of high-quality individuals and accelerate convergence. A multi-objective fitness function integrating path length, obstacle avoidance safety, and flight smoothness is constructed, whose weight coefficients (ωL=0.3, ωC=0.5, ωS=0.2) are calibrated through parameter-sensitivity analysis and Pareto frontier comparison across six representative weight combinations. Combining ablation validation for each improved module, single-UAV multi-scenario tests, and preliminary multi-UAV trials, these coordinated improvements realize targeted optimization for UAV 3D flight characteristics. Specifically, the preliminary multi-UAV trials involve three UAVs performing independent trajectory planning in shared obstacle environments without explicit inter-UAV collision avoidance constraints, and the reported improvements are based on single-UAV experiments. Finally, comparative experiments are conducted with a standard 100 × 100 × 50 m space, and varying obstacle densities are demonstrated in six diverse 3D test scenarios, where the proposed IPIO achieves an average path length reduction of 12.8% and 15.3% compared to the standard PIO and PSO, respectively. The average fitness improvement is 14.2% over PIO, 16.8% over PSO, 19.5% over GWO, 24.1% over CO, and 38.7% over CS. Key path-quality metrics include a minimum obstacle clearance of 2.37 m, average smoothness cost of 0.34, average convergence time of 0.60 s, and computational cost of O(N*D*MaxIter). Statistical tests confirm that these improvements are significant (p < 0.05) in all tested scenarios. This study presents an efficient and robust algorithm for autonomous three-dimensional path planning of UAVs in complex obstacle environments.

Gaining Han, Zong-Sheng Wu, Wei Zhang et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.