© 2015 IEEE. Reachable volumes are a new technique that allows one to efficiently restrict sampling to feasible/reachable regions of the planning space even for high degree of freedom and highly constrained problems. However, they have so far only been applied to graph-based sampling-based planners. In this paper we develop the methodology to apply reachable volumes to tree-based planners such as Rapidly-Exploring Random Trees (RRTs). In particular, we propose a reachable volume RRT called RVRRT that can solve high degree of freedom problems and problems with constraints. To do so, we develop a reachable volume stepping function, a reachable volume expand function, and a distance metric based on these operations. We also present a reachable volume local planner to ensure that local paths satisfy constraints for methods such as PRMs. We show experimentally that RVRRTs can solve constrained problems with as many as 64 degrees of freedom and unconstrained problems with as many as 134 degrees of freedom. RVRRTs can solve problems more efficiently than existing methods, requiring fewer nodes and collision detection calls. We also show that it is capable of solving difficult problems that existing methods cannot.
|Original language||English (US)|
|Title of host publication||2015 IEEE International Conference on Robotics and Automation (ICRA)|
|Publisher||Institute of Electrical and Electronics Engineers (IEEE)|
|Number of pages||8|
|State||Published - May 2015|
Bibliographical noteKAUST Repository Item: Exported on 2020-10-01
Acknowledged KAUST grant number(s): KUS-C1-016-04
Acknowledgements: This research supported in part by NSF awards CNS-0551685, CCF0702765, CCF-0833199, CCF-1439145, CCF-1423111, CCF-0830753, IIS-0916053, IIS-0917266, EFRI-1240483, RI-1217991, by NIH NCI R25CA090301-11, by DOE awards DE-AC02-06CH11357, DE-NA0002376,B575363, by Samsung, IBM, Intel, and by Award KUS-C1-016-04, madeby King Abdullah University of Science and Technology (KAUST). Thisresearch used resources of the National Energy Research Scientific Com-puting Center, which is supported by the Office of Science of the U.S.Department of Energy under Contract No. DE-AC02-05CH11231. ParasolLab., Dept. of Comp. Sci. and Eng., Texas A&M Univ., College Station,Texas, USA.
This publication acknowledges KAUST support, but has no KAUST affiliated authors.