IALA: An Improved Artificial Lemming Algorithm for Unmanned Aerial Vehicle Path Planning

With the increasing application of unmanned aerial vehicle (UAV) in multiple fields, the path planning problem has become a key challenge in the optimization domain. This paper proposes an Improved Artificial Lemming Algorithm (IALA), which incorporates three strategies: the optimal information retention strategy based on individual historical memory, the hybrid search strategy based on differential evolution operators, and the local refined search strategy based on directed neighborhood perturbation. These strategies are designed to enhance the algorithm’s global exploration and local exploitation capabilities in tackling complex optimization problems. Subsequently, comparative experiments are conducted on the CEC2017 benchmark suite across three dimensions (30D, 50D, and 100D) against eight state-of-the-art algorithms proposed in recent years, including SBOA and DBO. The results demonstrate that IALA achieves superior performance across multiple metrics, ranking first in both the Wilcoxon rank-sum test and the Friedman ranking test. Analyses of convergence curves and data distributions further verify its excellent optimization performance and robustness. Finally, IALA and the comparative algorithms are applied to eight 3D UAV path planning scenarios and two amphibious UAV path planning models. In the independent repeated experiments across the eight scenarios, IALA attains the optimal performance 13 times in terms of the two metrics, Mean and Std. It also ranks first in the Monte Carlo experiments for the two amphibious UAV path planning models.