Title :
SR-RRT: Selective retraction-based RRT planner
Author :
Lee, Junghwan ; Kwon, OSung ; Zhang, Liangjun ; Yoon, Sung-Eui
Author_Institution :
Dept. of CS, KAIST, Daejeon, South Korea
Abstract :
We present a novel retraction-based planner, selective retraction-based RRT, for efficiently handling a wide variety of environments that have different characteristics. We first present a bridge line-test that can identify regions around narrow passages, and then perform an optimization-based retraction operation selectively only at those regions. We also propose a non-colliding line-test, a dual operator to the bridge line-test, as a culling method to avoid generating samples near wide-open free spaces and thus to generate more samples around narrow passages. These two tests are performed with a small computational overhead and are integrated with a retraction-based RRT. In order to demonstrate benefits of our method, we have tested our method with different benchmarks that have varying amounts of narrow passages. Our method achieves up to 21 times and 3.5 times performance improvements over a basic RRT and an optimization-based retraction RRT, respectively. Furthermore, our method consistently improves the performances of other tested methods across all the tested benchmarks that have or do not have narrow passages.
Keywords :
optimisation; path planning; trees (mathematics); SR-RRT; bridge line-test; computational overhead; culling method; dual operator; narrow passages; noncolliding line-test; optimization-based retraction RRT; optimization-based retraction operation; performance improvements; retraction-based planner; selective retraction-based RRT planner; wide-open free spaces; Algorithm design and analysis; Benchmark testing; Bridges; Planning; Principal component analysis; Probabilistic logic; Robots;
Conference_Titel :
Robotics and Automation (ICRA), 2012 IEEE International Conference on
Conference_Location :
Saint Paul, MN
Print_ISBN :
978-1-4673-1403-9
Electronic_ISBN :
1050-4729
DOI :
10.1109/ICRA.2012.6224928