Handle URI:
http://hdl.handle.net/10754/599452
Title:
Reachable volume RRT
Authors:
McMahon, Troy; Thomas, Shawna; Amato, Nancy M.
Abstract:
© 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.
Citation:
McMahon T, Thomas S, Amato NM (2015) Reachable volume RRT. 2015 IEEE International Conference on Robotics and Automation (ICRA). Available: http://dx.doi.org/10.1109/ICRA.2015.7139607.
Publisher:
Institute of Electrical and Electronics Engineers (IEEE)
Journal:
2015 IEEE International Conference on Robotics and Automation (ICRA)
KAUST Grant Number:
KUS-C1-016-04
Issue Date:
May-2015
DOI:
10.1109/ICRA.2015.7139607
Type:
Conference Paper
Sponsors:
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.
Appears in Collections:
Publications Acknowledging KAUST Support

Full metadata record

DC FieldValue Language
dc.contributor.authorMcMahon, Troyen
dc.contributor.authorThomas, Shawnaen
dc.contributor.authorAmato, Nancy M.en
dc.date.accessioned2016-02-28T05:51:24Zen
dc.date.available2016-02-28T05:51:24Zen
dc.date.issued2015-05en
dc.identifier.citationMcMahon T, Thomas S, Amato NM (2015) Reachable volume RRT. 2015 IEEE International Conference on Robotics and Automation (ICRA). Available: http://dx.doi.org/10.1109/ICRA.2015.7139607.en
dc.identifier.doi10.1109/ICRA.2015.7139607en
dc.identifier.urihttp://hdl.handle.net/10754/599452en
dc.description.abstract© 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.en
dc.description.sponsorshipThis 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.en
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en
dc.titleReachable volume RRTen
dc.typeConference Paperen
dc.identifier.journal2015 IEEE International Conference on Robotics and Automation (ICRA)en
dc.contributor.institutionTexas A and M University, College Station, United Statesen
kaust.grant.numberKUS-C1-016-04en
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.