2018 Chinese Control and Decision Conference (CCDC) 2018
DOI: 10.1109/ccdc.2018.8408258
|View full text |Cite
|
Sign up to set email alerts
|

UAV path planning based on improved rapidly-exploring random tree

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 23 publications
(9 citation statements)
references
References 1 publication
0
9
0
Order By: Relevance
“…In other terms, path planning/obstacle avoidance considers a feasible trajectory for the UAV to follow between start and end points, ensuring a smooth path while detecting and avoiding obstacles in the airspace. For the mentioned purpose, on the one hand, there exist passive and active sample-based algorithms, such as rapidly exploring random graphs [132], Probabilistic Road Maps (PRMs) [133], Rapidly exploring Random Trees (RRTs) [134], and Dynamic Domain RRT [135]. In addition, obstacles can be momentarily avoided (i.e., collision-free path) in collaboration with the RRT algorithm [136].…”
Section: Path Planning/obstacle Avoidancementioning
confidence: 99%
“…In other terms, path planning/obstacle avoidance considers a feasible trajectory for the UAV to follow between start and end points, ensuring a smooth path while detecting and avoiding obstacles in the airspace. For the mentioned purpose, on the one hand, there exist passive and active sample-based algorithms, such as rapidly exploring random graphs [132], Probabilistic Road Maps (PRMs) [133], Rapidly exploring Random Trees (RRTs) [134], and Dynamic Domain RRT [135]. In addition, obstacles can be momentarily avoided (i.e., collision-free path) in collaboration with the RRT algorithm [136].…”
Section: Path Planning/obstacle Avoidancementioning
confidence: 99%
“…A comparison of A* and Dijkstra's was performed by [8] in an environment with static obstacles, where the performance of the A* algorithm was overall good in terms of obtaining optimal paths with respect to trajectory acquisition, path length and total travelling time. The Rapidly exploring Random Trees (RRT), known for producing optimal solutions in high-dimensional spaces, have been used with different variations in [13,16] for randomly building a space-filling tree in the navigation space and finding the best path each time. Evolutionary algorithms, such as the Particle Swarm Optimization (PSO) are generally recognized for solving path planning problems [7].…”
Section: Related Workmentioning
confidence: 99%
“…In nonconvex high‐dimensional areas, new developments have been done for the RRT algorithm. Many algorithms are proposed for the improvement like dynamic value, bidirectional RRT, and dynamic length 54,55 . Efficiency and high rate success can be achieved by the improved version of RRT.…”
Section: Routing Techniquesmentioning
confidence: 99%