Formation flight of Unmanned aerial vehicles (UAVs) has become a research hotspot in recent years. How to plan a flyable path for UAV formation when flying with a given configuration to the destination safely is an important technology. Therefore, this paper proposes a path planning method based on Pythagorean Hodograph (PH) curves and Delaunay triangulation to generate a flyable reference path for UAV formation. Firstly, the kinematic constraints of the formation path are derived, while the formation moves. Secondly, the Delaunay triangulation and the Warshall-Floyd algorithm are used to obtain the best waypoints array from starting point to destination. Thirdly, the PH curves are applied to connect each two neighbour waypoints for meeting the kinematic constraints. The multi-population hybrid particle swarm genetic algorithm is proposed to generate an optimal flyable formation path. Finally, simulations are carried out considering a formation with three UAVs in a complicated environment. The simulation results show that the paths planned are connected by several PH curves, and all the paths can meet the kinematic constraints, avoid the obstacles and threat zones. Furthermore, the single population particle swarm genetic algorithm is also applied in the same simulation, and the simulation results show that the multi-population hybrid particle swarm genetic algorithm proposed in this paper has faster convergence speed and better stability.
Reference Path Planning for UAVs Formation Flight Based on PH Curve
Lect. Notes Electrical Eng.
Asia-Pacific International Symposium on Aerospace Technology ; 2021 ; Korea (Republic of) November 15, 2021 - November 17, 2021
The Proceedings of the 2021 Asia-Pacific International Symposium on Aerospace Technology (APISAT 2021), Volume 2 ; Chapter : 12 ; 155-168
2022-09-30
14 pages
Article/Chapter (Book)
Electronic Resource
English
Flight Path Deconfliction of Autonomous UAVs
AIAA | 2005
|Path Planning for Multiple UAVs
Wiley | 2010
|Probabilistic Path Planning for UAVs
AIAA | 2003
|