An approach to speed up RRT

We present an improved algorithm to RRT ∗ in this paper. Our algorithm tries to increase the efficiency by replacing the Initialtree() of RRT ∗ with a RRT tree only contains one solution to speed up finding a feasible solution, and then applying a RRT ∗ _S algorithm to optimize the current solution....

Full description

Saved in:
Bibliographic Details
Published in2014 IEEE Intelligent Vehicles Symposium Proceedings pp. 594 - 598
Main Authors Shan, Yun-xiao, Li, Bi-jun, Jian-Zhou, Yue-Zhang
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.06.2014
Subjects
Benchmark testing
Convergence
Measurement
Optimization
Planning
Robots
Online AccessGet full text

Cover

More Information
Summary:We present an improved algorithm to RRT ∗ in this paper. Our algorithm tries to increase the efficiency by replacing the Initialtree() of RRT ∗ with a RRT tree only contains one solution to speed up finding a feasible solution, and then applying a RRT ∗ _S algorithm to optimize the current solution. This RRT ∗ _S is similar with RRT ∗ in principle, but it does not insert extra nodes into the current tree and optimizes just in fixed nodes instead of all the nearby nodes. We demonstrate the performance of this improved algorithm on two benchmark scenarios to show the effectiveness compared with RRT ∗ and RRT.
ISSN:1931-0587
2642-7214
DOI:10.1109/IVS.2014.6856473