Rapidly-Exploring Random Vines (RRV) for Motion Planning in Configuration Spaces with Narrow Passages

Classical RRT algorithm is blind to efficiently explore configuration space for expanding the tree through a narrow passage when solving a motion planning (MP) problem. Although there have been several attempts to deal with narrow passages which are based on a wide spectrum of assumptions and configuration setups, we solve this problem in rather general way. We use dominant eigenvectors of the configuration sets formed by properly sampling the space around the nearest node, to efficiently expand the tree around the obstacles and through narrow passages. Unlike classical RRT, our algorithm is aware of having the tree nodes in front of a narrow passage and in a narrow passage, which enables a proper tree expansion in a vine-like manner. A thorough comparison with RRT, RRT-connect, and DDRRT algorithm is provided by solving three different difficult MP problems. The results suggest a significant superiority the proposed Rapidly-exploring Random Vines (RRV) algorithm might have in configuration spaces with narrow passages.

[1]  Dinko Osmankovic,et al.  Burs of free C-space: A novel structure for path planning , 2016, 2016 IEEE International Conference on Robotics and Automation (ICRA).

[2]  Dinesh Manocha,et al.  A Fast and Practical Algorithm for Generalized Penetration Depth Computation , 2007, Robotics: Science and Systems.

[3]  Sean Quinlan.  Real-time modification of collision-free paths , 1994 .

[4]  Steven M. LaValle,et al.  RRT-connect: An efficient approach to single-query path planning , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[5]  David G. Lowe,et al.  Fast Approximate Nearest Neighbors with Automatic Algorithm Configuration , 2009, VISAPP.

[6]  Ming C. Lin,et al.  Practical Local Planning in the Contact Space , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

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

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

[9]  Jean-Paul Laumond,et al.  Linear dimensionality reduction in random motion planning , 2011, Int. J. Robotics Res..

[10]  Dinesh Manocha,et al.  An efficient retraction-based RRT planner , 2008, 2008 IEEE International Conference on Robotics and Automation.

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

[12]  Dinesh Manocha,et al.  FCL: A general purpose library for collision and proximity queries , 2012, 2012 IEEE International Conference on Robotics and Automation.

[13]  James J. Kuffner,et al.  Adaptive workspace biasing for sampling-based planners , 2008, 2008 IEEE International Conference on Robotics and Automation.

[14]  Mark H. Overmars,et al.  Using Workspace Information as a Guide to Non-uniform Sampling in Probabilistic Roadmap Planners , 2005, Int. J. Robotics Res..

[15]  Nancy M. Amato,et al.  RESAMPL: A Region-Sensitive Adaptive Motion Planner , 2008, WAFR.

[16]  Oliver Brock,et al.  Decomposition-based motion planning: a framework for real-time motion planning in high-dimensional configuration spaces , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

[17]  Oliver Brock,et al.  Balancing exploration and exploitation in motion planning , 2008, 2008 IEEE International Conference on Robotics and Automation.

[18]  Oussama Khatib,et al.  Elastic bands: connecting path planning and control , 1993, [1993] Proceedings IEEE International Conference on Robotics and Automation.

[19]  Lydia Tapia,et al.  A Machine Learning Approach for Feature-Sensitive Motion Planning , 2004, WAFR.

[20]  Lydia E. Kavraki,et al.  A framework for using the workspace medial axis in PRM planners , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[21]  Russ Tedrake,et al.  Sample-Based Planning with Volumes in Configuration Space , 2011, ArXiv.

[22]  Nancy M. Amato,et al.  An obstacle-based rapidly-exploring random tree , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..