Finding Narrow Passages with Probabilistic Roadmaps: The Small-Step Retraction Method

Probabilistic Roadmaps (PRM) have been successfully used to plan complex robot motions in configuration spaces of small and large dimensionalities. However, their efficiency decreases dramatically in spaces with narrow passages. This paper presents a new method—small-step retraction—that helps PRM planners find paths through such passages. This method consists of slightly “fattening” robot's free space, constructing a roadmap in fattened free space, and finally repairing portions of this roadmap by retracting them out of collision into actual free space. Fattened free space is not explicitly computed. Instead, the geometric models of workspace objects (robot links and/or obstacles) are “thinned” around their medial axis. A robot configuration lies in fattened free space if the thinned objects do not collide at this configuration. Two repair strategies are proposed. The “optimist” strategy waits until a complete path has been found in fattened free space before repairing it. Instead, the “pessimist” strategy repairs the roadmap as it is being built. The former is usually very fast, but may fail in some pathological cases. The latter is more reliable, but not as fast. A simple combination of the two strategies yields an integrated planner that is both fast and reliable. This planner was implemented as an extension of a pre-existing single-query PRM planner. Comparative tests show that it is significantly faster (sometimes by several orders of magnitude) than the pre-existing planner.

[1]  Lydia E. Kavraki,et al.  Randomized planning for short inspection paths , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[2]  Sean Quinlan,et al.  Efficient distance computation between non-convex objects , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[3]  Pekka Isto,et al.  Constructing probabilistic roadmaps with powerful local planning and path optimization , 2002, IEEE/RSJ International Conference on Intelligent Robots and Systems.

[4]  Mark H. Overmars,et al.  The Gaussian sampling strategy for probabilistic roadmap planners , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[5]  Mitul Saha,et al.  Finding narrow passages with probabilistic roadmaps: the small step retraction method , 2005, IROS.

[6]  Sunghee Choi,et al.  The power crust , 2001, SMA '01.

[7]  Kamal K. Gupta,et al.  The kinematic roadmap: a motion planning based global approach for inverse kinematics of redundant robots , 1999, IEEE Trans. Robotics Autom..

[8]  Dinesh Manocha,et al.  I-COLLIDE: an interactive and exact collision detection system for large-scale environments , 1995, I3D '95.

[9]  Dinesh Manocha,et al.  Efficient computation of a simplified medial axis , 2003, SM '03.

[10]  Lydia E. Kavraki,et al.  Analysis of probabilistic roadmaps for path planning , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[11]  Nancy M. Amato,et al.  A general framework for sampling on the medial axis of the free space , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).

[12]  Kostas E. Bekris,et al.  Probabilistic Roadmaps of Trees for Parallel Computation of Multiple Query Roadmaps , 2003, ISRR.

[13]  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).

[14]  Jing Xiao,et al.  Planning motion compliant to complex contact states , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

[15]  Dinesh Manocha,et al.  OBBTree: a hierarchical structure for rapid interference detection , 1996, SIGGRAPH.

[16]  Tamal K. Dey,et al.  Approximate medial axis as a voronoi subcomplex , 2002, SMA '02.

[17]  Boris Bagiriski.  Local Motion Planning for Manipulators Based on Shrinking and Growing; Geometry Models , 1996 .

[18]  Rajeev Motwani,et al.  Path Planning in Expansive Configuration Spaces , 1999, Int. J. Comput. Geom. Appl..

[19]  Nancy M. Amato,et al.  MAPRM: a probabilistic roadmap planner with sampling on the medial axis of the free space , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[20]  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).

[21]  Nancy M. Amato,et al.  Solving motion planning problems by iterative relaxation of constraints , 2003 .

[22]  Katsu Yamane,et al.  Synthesizing animations of human manipulation tasks , 2004, SIGGRAPH 2004.

[23]  Timothy Bretl,et al.  Toward Autonomous Free-Climbing Robots , 2005, ISRR.

[24]  Thierry Siméon,et al.  A random loop generator for planning the motions of closed kinematic chains using PRM methods , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[25]  Jing Xiao,et al.  Planning Motions Compliant to Complex Contact States , 2001, Int. J. Robotics Res..

[26]  Lydia E. Kavraki,et al.  On finding narrow passages with probabilistic roadmap planners , 1998 .

[27]  Dinesh Manocha,et al.  Fast computation of generalized Voronoi diagrams using graphics hardware , 1999, SIGGRAPH.

[28]  Tamal K. Dey,et al.  Approximate medial axis as a voronoi subcomplex , 2002, SMA '02.

[29]  Dinesh Manocha,et al.  Fast computation of generalized Voronoi diagrams using graphics hardware , 1999, SIGGRAPH.

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

[31]  J. Latombe,et al.  Randomized Query Processing in Robot Motion Planning , 1998 .

[32]  Lydia E. Kavraki,et al.  Randomized Query Processing in Robot Path Planning , 1998, J. Comput. Syst. Sci..

[33]  Boris Baginski,et al.  Local motion planning for manipulators based on shrinking and growing geometry models , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[34]  Christoph M. Hoffmann,et al.  How to Construct the Skeleton of CSG Objects , 1990 .

[35]  Nancy M. Amato,et al.  A Kinematics-Based Probabilistic Roadmap Method for Closed Chain Systems , 2001 .

[36]  Dinesh Manocha,et al.  Collision and Proximity Queries , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

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

[38]  Daniel Vallejo,et al.  OBPRM: an obstacle-based PRM for 3D workspaces , 1998 .

[39]  Jean-Claude Latombe,et al.  Randomized Kinodynamic Motion Planning with Moving Obstacles , 2002, Int. J. Robotics Res..

[40]  Lydia E. Kavraki,et al.  Path planning using lazy PRM , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[41]  Dinesh Manocha,et al.  Interactive motion planning using hardware-accelerated computation of generalized Voronoi diagrams , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[42]  Nancy M. Amato,et al.  A randomized roadmap method for path and manipulation planning , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[43]  Steven M. LaValle,et al.  Randomized Kinodynamic Planning , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[44]  Leonidas J. Guibas,et al.  A probabilistic roadmap planner for flexible objects with a workspace medial-axis-based sampling approach , 1999, Proceedings 1999 IEEE/RSJ International Conference on Intelligent Robots and Systems. Human and Environment Friendly Robots with High Intelligence and Emotional Quotients (Cat. No.99CH36289).

[45]  David Hsu,et al.  The bridge test for sampling narrow passages with probabilistic roadmap planners , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).