2018
DOI: 10.1016/j.eswa.2018.01.035
|View full text |Cite
|
Sign up to set email alerts
|

Quad-RRT: A real-time GPU-based global path planner in large-scale real environments

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
9
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 25 publications
(9 citation statements)
references
References 10 publications
0
9
0
Order By: Relevance
“…The probabilistic path planning algorithm is also a commonly-used method, including Probabilistic Roadmaps (Kavraki, Svestka, Latombe, & Overmars, 1994) and RRT (Jaillet, Cortes, & Simeon, 2008;Hidalgo-Paniagua, Bandera, Ruiz-de-Quintanilla, & Bandera, 2018). The basic idea of probabilistic path planning is to randomly select non-collision candidate points in a space, then connect them to generate a path.…”
Section: Literature Reviewmentioning
confidence: 99%
“…The probabilistic path planning algorithm is also a commonly-used method, including Probabilistic Roadmaps (Kavraki, Svestka, Latombe, & Overmars, 1994) and RRT (Jaillet, Cortes, & Simeon, 2008;Hidalgo-Paniagua, Bandera, Ruiz-de-Quintanilla, & Bandera, 2018). The basic idea of probabilistic path planning is to randomly select non-collision candidate points in a space, then connect them to generate a path.…”
Section: Literature Reviewmentioning
confidence: 99%
“…As RRT path planning involves random sampling, its search speed is fast because it does not need to deal with the state space in the system. Moreover, it is not limited to solving high-dimensional constrained space problems, and is therefore often used in the construction of automatic systems path planning [42]. In the field of automatic systems, the RRT algorithm has become a conventional technology to solve the single query motion-planning problem.…”
Section: Path Planning Algorithmsmentioning
confidence: 99%
“…In order to improve the convergence rate, variant improvements on RRT and RRT * algorithms have been extensively explored [13][14][15]. In [13], the D * Lite Rapidlyexploring Random Tree star (DL-RRT * ) algorithm has been proposed for path replanning in dynamic radioactive environments, which uses the expansion strength of grid search strategy from D * Lite to quickly find a high-quality initial path to accelerate the convergence rate in RRT * .…”
Section: Introductionmentioning
confidence: 99%
“…In the work [14], the authors proposed the Bidirectional RRT (B-RRT) to build two trees rooted at the start and goal configurations, respectively. Reference [15] has extended B-RRT to exploit the possibilities of dynamically dividing up the whole map into four submaps and growing the random tree in every submap using Graphic Processing Unit (GPU) threads. In the other words, Quad-RRT [15] computed four random trees instead of two trees built by bidirectional approaches.…”
Section: Introductionmentioning
confidence: 99%