Return
A Global Path Planning Algorithm for Fixed-wing UAVs
DOI:10.1007/s10846-017-0729-9.png)
Abstract
En 中文
A new approach for solving the global optimal path planning problem to fixed-wing UAVs in multi-threat environments is proposed in this paper, which is mainly based on a natural combination of Genetic Algorithm (GA), Dijkstra searching algorithm, and Artificial Potential Field (APF) approach. First, a Delaunay partition of the flight space is introduced to map the continuous searching space on the Delaunay diagram, and the trajectory encoding methods for GA are designed based on the Delaunay network. Then, a shortest path is established by Dijkstra searching algorithm and the corresponding code is taken as the first population such that a GA could be conducted. Especially by considering flight turning constraints of fixedwing UAVs, artificial potential field approach is utilized to make the path smooth after each evolution in GA. Finally, a global optimal path is obtained through the suggested algorithm and simulation results validate the effectiveness in both Two-Dimensional (2-D) and Three-Dimensional (3-D) flight environments.
Keywords:
UAVs
Path planning
Graph theory
Artificial potential field
Genetic algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
J
IF:
2.8
Papers:
3.9K
Citations:
6.9K
Organization
Cited Papers
Medication preparation and administration: analysis of inquiries and information by the nursing team
Bioactive compound loaded stable silver nanoparticle synthesis from microwave irradiated aqueous extracellular leaf extracts of Naringi crenulata and its wound healing activity in experimental rat model
Acta Tropica
IF0
Personal attitudes and misconceptions, not official recommendations guide occupational physicians’ vaccination decisions
Vaccine
IF0

