Tangent bundle RRT: A randomized algorithm for constrained motion planning

The Tangent Bundle Rapidly Exploring Random Tree (TB-RRT) is an algorithm for planning robot motions on curved configuration space manifolds, in which the key idea is to construct random trees not on the manifold itself, but on tangent bundle approximations to the manifold. Curvature-based methods are developed for constructing tangent bundle approximations, and procedures for random node generation and bidirectional tree extension are developed that significantly reduce the number of projections to the manifold. Extensive numerical experiments for a wide range of planning problems demonstrate the computational advantages of the TB-RRT algorithm over existing constrained path planning algorithms.

[1]  S. LaValle Rapidly-exploring random trees : a new tool for path planning , 1998 .

[2]  Oussama Khatib,et al.  Synthesis of Whole-Body Behaviors through Hierarchical Control of Behavioral Primitives , 2005, Int. J. Humanoid Robotics.

[3]  Michael E. Henderson,et al.  Multiple Parameter Continuation: Computing Implicitly Defined k-Manifolds , 2002, Int. J. Bifurc. Chaos.

[4]  Siddhartha S. Srinivasa,et al.  Manipulation planning on constraint manifolds , 2009, 2009 IEEE International Conference on Robotics and Automation.

[5]  Nancy M. Amato,et al.  Reachable Distance Space: Efficient Sampling-Based Planning for Spatially Constrained Systems , 2010, Int. J. Robotics Res..

[6]  Frank Chongwoo Park,et al.  Tangent space RRT: A randomized planning algorithm on constraint manifolds , 2011, 2011 IEEE International Conference on Robotics and Automation.

[7]  Jeffrey C. Trinkle,et al.  Motion Planning for a Class of Planar Closed-chain Manipulators , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..

[8]  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.

[9]  Steven M. LaValle,et al.  Incrementally reducing dispersion by increasing Voronoi bias in RRTs , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[10]  Léonard Jaillet,et al.  Path Planning on Manifolds Using Randomized Higher-Dimensional Continuation , 2010, WAFR.

[11]  F. Park,et al.  Tangent Space RRT with Lazy Projection: An Efficient Planning Algorithm for Constrained Motions , 2010 .

[12]  Lydia E. Kavraki,et al.  Randomized path planning for linkages with closed kinematic chains , 2001, IEEE Trans. Robotics Autom..

[13]  Jean-Claude Latombe,et al.  A Single-Query Bi-Directional Probabilistic Roadmap Planner with Lazy Collision Checking , 2001, ISRR.

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

[15]  Jean-Claude Latombe,et al.  Planning motions with intentions , 1994, SIGGRAPH.

[16]  Frank Chongwoo Park,et al.  Geometric optimization algorithims for robot kinematic design , 1995, J. Field Robotics.

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

[18]  Mike Stilman,et al.  Task constrained motion planning in robot joint space , 2007, 2007 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[19]  Katsu Yamane,et al.  Synthesizing animations of human manipulation tasks , 2004, ACM Trans. Graph..

[20]  Thierry Siméon,et al.  Adaptive tuning of the sampling domain for dynamic-domain RRTs , 2005, 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[21]  Li Han,et al.  Stratified Deformation Space and Path Planning for a Planar Closed Chain with Revolute Joints , 2006, WAFR.

[22]  Thierry Siméon,et al.  Probabilistic motion planning for parallel mechanisms , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).