Choosing good distance metrics and local planners for probabilistic roadmap methods

This paper presents a comparative evaluation of different distance metrics and local planners within the context of probabilistic roadmap methods for planning the motion of rigid objects in three-dimensional workspaces. The study concentrates on cluttered three-dimensional workspaces typical of, for example, virtual prototyping applications such as maintainability studies in mechanical CAD designs. Our results include recommendations for selecting appropriate combinations of distance metrics and local planners for such applications. Our study of distance metrics shows that the importance of the translational distance increases relative to the rotational distance as the environment becomes more crowded. We find that each local planner makes some connections than none of the others do—indicating that better connected roadmaps will be constructed using multiple local planners. We propose a new local planning method we call rotate-atthat often outperforms the common straight-line in C-space method in crowded environments.

[1]  Mark H. Overmars,et al.  A probabilistic learning approach to motion planning , 1995 .

[2]  Herbert L. Roitblat,et al.  Sonar recognition of targets embedded in sediment , 1995, Neural Networks.

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

[4]  Narendra Ahuja,et al.  Gross motion planning—a survey , 1992, CSUR.

[5]  Friedrich M. Wahl,et al.  Efficient, iterative, sensor based 3-D map building using rating functions in configuration space , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[6]  Narendra Ahuja,et al.  A potential field approach to path planning , 1992, IEEE Trans. Robotics Autom..

[7]  Bernhard Glavina,et al.  Solving findpath by combination of goal-directed and randomized search , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[8]  M. Spivak A comprehensive introduction to differential geometry , 1979 .

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

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

[11]  J. Latombe,et al.  Probabilistic Roadm Aps for Path Planning in High-dimensional Connguration Spaces , 1997 .

[12]  Jing Xiao,et al.  Computing rotation distance between contacting polyhedra , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[13]  Alistair McLean,et al.  Incremental roadmaps and global path planning in evolving industrial environments , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[14]  B. Faverjon,et al.  A practical approach to motion-planning for manipulators with many degrees of freedom , 1991 .

[15]  F. Park Distance Metrics on the Rigid-Body Motions with Applications to Mechanism Design , 1995 .

[16]  Cynthia F. Moss,et al.  Composition of biosonar images for target recognition by echolocating bats , 1995, Neural Networks.

[17]  Enrico Pagello,et al.  A practical motion planning strategy based on a plane-sweep approach , 1997, Proceedings of International Conference on Robotics and Automation.

[18]  Vipin Kumar,et al.  Parallel search algorithms for robot motion planning , 1993, [1993] Proceedings IEEE International Conference on Robotics and Automation.

[19]  Carme Torras,et al.  Collision detection algorithms for motion planning , 1998 .

[20]  El-Ghazali Talbi,et al.  The "Ariadne's clew" algorithm: global planning with local methods , 1993, Proceedings of 1993 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS '93).

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

[22]  Kamal K. Gupta,et al.  Motion planning for many degrees of freedom: sequential search with backtracking , 1995, IEEE Trans. Robotics Autom..

[23]  Dinesh Manocha,et al.  Collision Detection: Algorithms and Applications , 1996 .

[24]  Yong K. Hwang,et al.  SANDROS: a motion planner with performance proportional to task difficulty , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.

[25]  Brian Mirtich,et al.  V-Clip: fast and robust polyhedral collision detection , 1998, TOGS.

[26]  Kamal K. Gupta,et al.  A motion planning based approach for inverse kinematics of redundant robots: the kinematic roadmap , 1997, Proceedings of International Conference on Robotics and Automation.

[27]  Jean-Claude Latombe,et al.  Robot Motion Planning: A Distributed Representation Approach , 1991, Int. J. Robotics Res..

[28]  Lydia E. Kavraki,et al.  Analysis of probabilistic roadmaps for path planning , 1998, IEEE Trans. Robotics Autom..

[29]  Koichi Kondo,et al.  Motion planning with six degrees of freedom by multistrategic bidirectional heuristic free-space enumeration , 1991, IEEE Trans. Robotics Autom..

[30]  Vijay Kumar,et al.  Metrics and Connections for Rigid-Body Kinematics , 1999, Int. J. Robotics Res..

[31]  Roger W. Brockett,et al.  Kinematic Dexterity of Robotic Mechanisms , 1994, Int. J. Robotics Res..

[32]  Bruce Randall Donald,et al.  A Search Algorithm for Motion Planning with Six Degrees of Freedom , 1987, Artif. Intell..

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

[34]  S. Sathiya Keerthi,et al.  A fast procedure for computing the distance between complex objects in three-dimensional space , 1988, IEEE J. Robotics Autom..

[35]  Tsai-Yen Li,et al.  Assembly maintainability study with motion planning , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.

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

[37]  J. M. Ahuactzin,et al.  A motion planning based approach for inverse kinematics of redundant robots: the kinematic roadmap , 1998 .

[38]  Nancy M. Amato,et al.  Motion planning for a rigid body using random networks on the medial axis of the free space , 1999, SCG '99.

[39]  Lydia E. Kavraki,et al.  Random networks in configuration space for fast path planning , 1994 .

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

[41]  Roman Kuc,et al.  Physically Based Simulation Model for Acoustic Sensor Robot Navigation , 1987, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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

[43]  Elmer G. Gilbert,et al.  Growth distances: new measures for object separation and penetration , 1996, IEEE Trans. Robotics Autom..

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

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

[46]  Ming C. Lin,et al.  A fast algorithm for incremental distance calculation , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[47]  Yong K. Hwang,et al.  Path planning for everyday robotics with SANDROS , 1997, Proceedings of International Conference on Robotics and Automation.

[48]  Henning Tolle,et al.  Motion planning with many degrees of freedom-random reflections at C-space obstacles , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

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

[50]  Gregory S. Chirikjian,et al.  Useful metrics for modular robot motion planning , 1997, IEEE Trans. Robotics Autom..

[51]  Mahmoud Tarokh Implementation of a fast path planner on an industrial manipulator , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[52]  Yong K. Hwang,et al.  A heuristic and complete planner for the classical mover's problem , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.

[53]  Patrick G. Xavier,et al.  Fast swept-volume distance for robust collision detection , 1997, Proceedings of International Conference on Robotics and Automation.

[54]  Jean-Claude Latombe,et al.  Numerical potential field techniques for robot path planning , 1991, Fifth International Conference on Advanced Robotics 'Robots in Unstructured Environments.

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