Reachable volume RRT

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.

[1]  Lydia E. Kavraki,et al.  A probabilistic roadmap approach for systems with closed kinematic chains , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[2]  Troy McMahon,et al.  Sampling based motion planning with reachable volumes: Application to manipulators and closed chain systems , 2014, 2014 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[3]  D. Thalmann,et al.  Planning collision-free reaching motions for interactive object manipulation and grasping , 2008, SIGGRAPH '08.

[4]  Thierry Siméon,et al.  Dynamic-Domain RRTs: Efficient Exploration by Controlling the Sampling Domain , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

[5]  Jean-Claude Latombe,et al.  A Motion Planning Approach to Flexible Ligand Binding , 1999, ISMB.

[6]  Troy McMahon,et al.  Sampling-based motion planning with reachable volumes: Theoretical foundations , 2014, 2014 IEEE International Conference on Robotics and Automation (ICRA).

[7]  Nancy M. Amato,et al.  Choosing good distance metrics and local planners for probabilistic roadmap methods , 2000, IEEE Trans. Robotics Autom..

[8]  Steven M. LaValle,et al.  Motion Planning for Highly Constrained Spaces , 2009 .

[9]  Daniel Thalmann,et al.  Planning Collision‐Free Reaching Motions for Interactive Object Manipulation and Grasping , 2003, Comput. Graph. Forum.

[10]  Steven M. LaValle,et al.  Rapidly-Exploring Random Trees: Progress and Prospects , 2000 .

[11]  Craig D. McGray,et al.  The self-reconfiguring robotic molecule , 1998, Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146).

[12]  J-P. Merlet,et al.  Still a long way to go on the road for parallel mechanisms , 2009 .

[13]  Leonidas J. Guibas.  Controlled Module Density Helps Reconfiguration Planning , 2000 .

[14]  Craig D. McGray,et al.  The self-reconfiguring robotic molecule: design and control algorithms , 1998 .

[15]  B. Faverjon,et al.  Probabilistic Roadmaps for Path Planning in High-Dimensional Con(cid:12)guration Spaces , 1996 .

[16]  Léonard Jaillet,et al.  Path Planning with Loop Closure Constraints Using an Atlas-Based RRT , 2011, ISRR.