Path Planning Based on the Improved Butterfly Optimization Algorithm
Literature [1] introduces an adaptive weight strategy to accelerate population convergence while enabling the algorithm to escape local optima in a timely manner. Literature [4] uses Tent chaotic mapping and refractive reverse learning to enhance the diversity of the initial population, balancing the algorithm's global search and local exploitation capabilities. Literature [6] designs an algorithm to identify irregular U-shaped valleys, ultimately improving the search efficiency of the A* algorithm. However, traditional algorithms[2] have difficulty adapting to dynamic environments and require re-computation of mathematically planned algorithms when encountering sudden obstacles. Therefore, to address the above issues, this paper proposes a new method[3] based on the Improved Butterfly Optimization Algorithm (IBOA) applied to the dynamic path planning of unmanned aerial vehicles. The original butterfly algorithm is improved by using the normal cloud mutation strategy[5], triangular random walk strategy, and non-uniform mutation strategy.
Authors
- Yuh-Sheng Su (ORCID: https://orcid.org/0009-0000-0545-3787)
- W. Z. Jiang (ORCID: https://orcid.org/0009-0003-4314-5146)
Institutions
- Jiangsu University of Science and Technology (CN)
Publication Details
- Published
- 2025-06-20
- DOI
- https://doi.org/10.1145/3757940.3757963
- Primary Topic
- Robotic Path Planning Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00