Optimized Particle Swarm-Ant Colony Fusion for UAV Path Planning Research
Ant Colony Algorithm (ACO) and Particle Swarm Algorithm (PSO) are two heuristic algorithms commonly used in three-dimensional path planning for UAVs. The particle swarm algorithm is prone to produce local optimization, while the ACO algorithm has a slow convergence speed. Therefore, a new fusion algorithm is proposed to address the above problems. The fusion algorithm utilizes the early and fast convergence of the particle swarm algorithm to generate a suboptimal solution as the initial condition of the pheromone distribution of the ant colony algorithm, and then fuses the two improved algorithms to obtain the final path planning scheme. Experimental results show that this fusion algorithm outperforms the other three algorithms in terms of convergence speed and convergence accuracy.
Authors
- Qiang Han (ORCID: https://orcid.org/0000-0001-5646-3950)
- Yuehao Yan (ORCID: https://orcid.org/0000-0002-2222-6436)
- Hongyan Lei (ORCID: https://orcid.org/0009-0008-4152-6662)
Institutions
- Sichuan University (CN)
- Civil Aviation Flight University of China (CN)
Publication Details
- Published
- 2024-11-01
- DOI
- https://doi.org/10.1109/aivrv63595.2024.10859709
- Primary Topic
- Robotic Path Planning Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Sichuan University of Science and Engineering