Adaptive Budgerigar Optimization-Based Obstacle Avoidance Path Planning for Unmanned Aerial Vehicle
This paper addresses the path planning problem of Unmanned Aerial Vehicle (UAV) operating in a three-dimensional environment populated with obstacles. An enhanced Adaptive Budgerigar Optimization (ABO) algorithm is designed to navigate the UAV efficiently, ensuring collision avoidance while maintaining high solution accuracy. The primary innovation of our approach involves modifying the iteration update formula of the original Parrot Optimization algorithm by incorporating an adaptive adjustment factor. This factor dynamically regulates the convergence rate and accuracy, thereby enabling the algorithm to escape local optima and achieve globally optimal paths effectively. Through comprehensive simulation experiments, we compare the performance of the ABO algorithm against traditional Particle Swarm Optimization (PSO) and the original Budgerigar Optimization algorithm. The results demonstrate the superior convergence speed and solution quality of the proposed algorithm, thereby validating its effectiveness and feasibility.
Authors
- Mengji Shi (ORCID: https://orcid.org/0000-0003-1360-9846)
- Boxian Lin (ORCID: https://orcid.org/0000-0001-9481-2883)
- Kaiyu Qin (ORCID: https://orcid.org/0000-0002-0812-7095)
- Jingyu Liu (ORCID: https://orcid.org/0000-0002-1724-7523)
- Zhiqiang Li (ORCID: https://orcid.org/0000-0001-8611-0742)
- Meng Li (ORCID: https://orcid.org/0000-0003-1019-6118)
Institutions
- University of Electronic Science and Technology of China (CN)
- Nanjing University of Aeronautics and Astronautics (CN)
Publication Details
- Published
- 2024-12-06
- DOI
- https://doi.org/10.1109/icist63249.2024.10805303
- Primary Topic
- Robotic Path Planning Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Natural Science Foundation of Sichuan Province
- Fundamental Research Funds for the Central Universities