Multi-level free-space dilation for sampling narrow passages in PRM planning

Free-space dilation is an effective approach for narrow passage sampling, a well-recognized difficulty in probabilistic roadmap (PRM) planning. Key to this approach are methods for dilating the free space and for determining the amount of dilation needed. This paper presents a new method of dilation by shrinking the geometric models of robots and obstacles. Compared with existing work, the new method is more efficient in both running time and memory usage. It is also integrated with collision checking, a key operation in PRM planning. The efficiency of the dilation method enables a new PRM planner which quickly constructs a series of dilated free spaces and automatically determine the amount of dilation needed. Experiments show that both the dilation method and the planner work well in complex geometric environments. In particular, the planner reliably solved the most difficult version of the alpha puzzle, a benchmark test for PRM planners

[1]  Lydia E. Kavraki,et al.  Probabilistic roadmaps for path planning in high-dimensional configuration spaces , 1996, IEEE Trans. Robotics Autom..

[2]  Thierry Siméon,et al.  Visibility-based probabilistic roadmaps for motion planning , 2000, Adv. Robotics.

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

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

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

[6]  Dinesh Manocha,et al.  A Voronoi-based hybrid motion planner , 2001, Proceedings 2001 IEEE/RSJ International Conference on Intelligent Robots and Systems. Expanding the Societal Role of Robotics in the the Next Millennium (Cat. No.01CH37180).

[7]  Nicholas M. Patrikalakis,et al.  Computation of the Medial Axis Transform of 3-D polyhedra , 1995, Symposium on Solid Modeling and Applications.

[8]  Rajeev Motwani,et al.  Path planning in expansive configuration spaces , 1997, Proceedings of International Conference on Robotics and Automation.

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

[10]  Shuangshuang Jin,et al.  A comparison of algorithms for vertex normal computation , 2005, The Visual Computer.

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

[12]  Simon Parsons,et al.  Principles of Robot Motion: Theory, Algorithms and Implementations by Howie Choset, Kevin M. Lynch, Seth Hutchinson, George Kantor, Wolfram Burgard, Lydia E. Kavraki and Sebastian Thrun, 603 pp., $60.00, ISBN 0-262-033275 , 2007, The Knowledge Engineering Review.

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

[14]  Jean-Claude Latombe,et al.  On the Probabilistic Foundations of Probabilistic Roadmap Planning , 2006, Int. J. Robotics Res..

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

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

[17]  Mark H. Overmars,et al.  Using Workspace Information as a Guide to Non-uniform Sampling in Probabilistic Roadmap Planners , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[18]  Gert Vegter,et al.  In handbook of discrete and computational geometry , 1997 .

[19]  Jean-Claude Latombe,et al.  On Delaying Collision Checking in PRM Planning: Application to Multi-Robot Coordination , 2002, Int. J. Robotics Res..

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

[21]  Yu-Chi Chang,et al.  Finding Narrow Passages with Probabilistic Roadmaps: The Small-Step Retraction Method , 2005, 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[22]  Oliver Brock,et al.  Adapting the sampling distribution in PRM planners based on an approximated medial axis , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

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

[24]  Ho-Lun Cheng,et al.  Approximating Polygonal Objects by Deformable Smooth Surfaces , 2005, MFCS.

[25]  David Hsu,et al.  Workspace importance sampling for probabilistic roadmap planning , 2004, 2004 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) (IEEE Cat. No.04CH37566).

[26]  Mariette Yvinec,et al.  Conforming Delaunay triangulations in 3D , 2002, SCG '02.