2018
DOI: 10.3390/electronics7120375
|View full text |Cite
|
Sign up to set email alerts
|

A Fast Global Flight Path Planning Algorithm Based on Space Circumscription and Sparse Visibility Graph for Unmanned Aerial Vehicle

Abstract: This paper proposes a new flight path planning algorithm that finds collision-free, optimal/near-optimal and flyable paths for unmanned aerial vehicles (UAVs) in three-dimensional (3D) environments with fixed obstacles. The proposed algorithm significantly reduces pathfinding computing time without significantly degrading path lengths by using space circumscription and a sparse visibility graph in the pathfinding process. We devise a novel method by exploiting the information about obstacle geometry to circums… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
20
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
9
1

Relationship

1
9

Authors

Journals

citations
Cited by 38 publications
(20 citation statements)
references
References 82 publications
0
20
0
Order By: Relevance
“…Therefore, how to efficiently and flexibly store and present geographic data is urgent to be considered. According to the investigation, the air route planning environment can be constructed using visibility graph [80], Voronoi diagram [81], [82], probabilistic [83] and cell decomposition [84] methods. The visibility graph method formed routes from a connectivity graph network of a non-directed graph.…”
Section: B Geo-information and Low-altitude Air Routesmentioning
confidence: 99%
“…Therefore, how to efficiently and flexibly store and present geographic data is urgent to be considered. According to the investigation, the air route planning environment can be constructed using visibility graph [80], Voronoi diagram [81], [82], probabilistic [83] and cell decomposition [84] methods. The visibility graph method formed routes from a connectivity graph network of a non-directed graph.…”
Section: B Geo-information and Low-altitude Air Routesmentioning
confidence: 99%
“…The simulation results were produced and compared on a PC running Windows 10, with a CPU Intel Core i5 of 2.6 GHz and 8.00 GB of RAM, using MATLAB version 9.4.0.81 (R2018a). In simulations of the proposed CPP algorithm, we consider a 25-kg UAV similar to our previous study [55]. We considered both global constraints that are related to the UAV operating environment and local constraints that are related to the UAV.…”
Section: Simulation Results and Discussionmentioning
confidence: 99%
“…Although the D-Star algorithm and artificial potential field algorithm are suitable for dynamic route planning, they cannot satisfy the constraints on maneuverability of stealth UAV. On the other hand, random search algorithm is employed to settle UAV route planning problems, such as genetic algorithm(GA) [33], [34], particle swarm optimization(PSO) [35]- [37], ant colony algorithm [38]- [40], simulated annealing algorithm [41], [42] and neural network algorithm [43], [44]. Inversely, the real combat environment is composed of various uncertain and dynamic threats, so there is no effective method to address the problem of penetration route planning for stealth UAV in 3D dynamic environment.…”
Section: Introductionmentioning
confidence: 99%