Sampling Techniques for Probabilistic Roadmap Planners

The probabilistic roadmap approach is a commonly used motion planning technique. A crucial ingredient of the approach is a sampling algorithm that samples the configuration space of the moving object for free configurations. Over the past decade many sampling techniques have been proposed. It is difficult to compare the different techniques because they were tested on different types of scenes, using different underlying libraries, implemented by different people on different machines. We compared 12 of such sampling techniques within a single environment on the same scenes. The results were surprising in the sense that techniques often performed differently than claimed by the designers. The study also showed how difficult it is to evaluate the quality of the techniques. The results should help users in deciding which technique is suitable for their situation.

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

[2]  Lydia E. Kavraki,et al.  Planning Paths for Elastic Objects under Manipulation Constraints , 2001, Int. J. Robotics Res..

[3]  Jean-Claude Latombe,et al.  Robot motion planning , 1970, The Kluwer international series in engineering and computer science.

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

[5]  Bernard Chazelle,et al.  The Discrepancy Method , 1998, ISAAC.

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

[7]  Steven M. LaValle,et al.  Quasi-randomized path planning , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

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

[9]  Martti Mäntylä,et al.  On addressing the run-cost variance in randomized motion planners , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).

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

[11]  Mark H. Overmars,et al.  A random approach to motion planning , 1992 .

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

[13]  Thierry Siméon,et al.  A manipulation planner for pick and place operations under continuous grasps and placements , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[14]  Λυδια Καβρακη,et al.  RANDOM NETWORKS IN CONFIGURATION SPACE FOR FAST PATH PLANNING , 1994 .

[15]  Nancy M. Amato,et al.  Probabilistic roadmaps-putting it all together , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

[16]  Abraham Sánchez López,et al.  Motion Planning for Car-Like Robots Using Lazy Probabilistic Roadmap Method , 2002, MICAI.

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

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

[19]  Steven M. LaValle,et al.  Deterministic sampling methods for spheres and SO(3) , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[20]  Lucia K. Dale,et al.  Optimization techniques for probabilistic roadmaps , 2000 .

[21]  G.J.A. van den Bergen.  Collision detection in interactive 3D computer animation , 1999 .

[22]  Thierry Siméon,et al.  Visibility based probabilistic roadmaps , 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).

[23]  Mark H. Overmars,et al.  Motion Planning for Carlike Robots Using a Probabilistic Learning Approach , 1997, Int. J. Robotics Res..

[24]  Lydia E. Kavraki,et al.  A Random Sampling Scheme for Path Planning , 1997, Int. J. Robotics Res..

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

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

[27]  Mark H. Overmars,et al.  Coordinated path planning for multiple robots , 1998, Robotics Auton. Syst..

[28]  Lydia E. Kavraki,et al.  Randomized preprocessing of configuration for fast path planning , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[29]  Mark H. Overmars,et al.  A Comparative Study of Probabilistic Roadmap Planners , 2002, WAFR.

[30]  Lydia E. Kavraki,et al.  Planning Paths for a Flexible Surface Patch , 1998, Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146).

[31]  Fred J. Hickernell,et al.  Randomized Halton sequences , 2000 .

[32]  Takuji Nishimura,et al.  Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator , 1998, TOMC.

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

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

[35]  Ken Shoemake,et al.  Uniform Random Rotations , 1992, Graphics Gems III.