Toward a deeper understanding of motion alternatives via an equivalence relation on local paths

Many problems in robot motion planning involve collision testing a set of local paths. In this paper we propose a novel solution to this problem by exploiting the structure of paths and the outcome of previous collision tests. Our approach circumvents expensive collision tests on a given path by detecting that the entire geometry of the path has effectively already been tested on a combination of other paths. We define a homotopy-like equivalence relation among local paths to detect this condition, and we provide algorithms that (1) classify paths based on equivalence, and (2) circumvent collision testing on up to 90% of them. We then prove both correctness and completeness of these algorithms and provide experimental results demonstrating a performance increase up to 300% in the rate of path tests. Additionally, we apply our equivalence relation to the navigation problem in a planning algorithm that takes advantage of information gained from equivalence relationships among collision-free paths. Finally, we explore applications of path equivalence to several other mechanisms, including kinematic chains and medical steerable needles.

[1]  Alonzo Kelly,et al.  Toward Reliable Off Road Autonomous Vehicles Operating in Challenging Environments , 2006, Int. J. Robotics Res..

[2]  Siddhartha S. Srinivasa,et al.  Hierarchical planning architectures for mobile manipulation tasks in indoor environments , 2010, 2010 IEEE International Conference on Robotics and Automation.

[3]  J. Burdick,et al.  Sensor based planning. I. The generalized Voronoi graph , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.

[4]  Jean-Paul Laumond,et al.  Feasible Trajectories for Mobile Robots with Kinematic and Environment Constraints , 1986, IAS.

[5]  Oussama Khatib,et al.  Real-Time Obstacle Avoidance for Manipulators and Mobile Robots , 1985, Autonomous Robot Vehicles.

[6]  Subhrajit Bhattacharya,et al.  Search-Based Path Planning with Homotopy Class Constraints in 3D , 2010, AAAI.

[7]  V. J. Lumelsky,et al.  Motion planning for three-link robot arm manipulators operating in an unknown three-dimensional environment , 1991, [1991] Proceedings of the 30th IEEE Conference on Decision and Control.

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

[9]  Charles E. Thorpe,et al.  Path Relaxation: Path Planning for a Mobile Robot , 1984, AAAI.

[10]  L. Shepp,et al.  OPTIMAL PATHS FOR A CAR THAT GOES BOTH FORWARDS AND BACKWARDS , 1990 .

[11]  Yoram Koren,et al.  The vector field histogram-fast obstacle avoidance for mobile robots , 1991, IEEE Trans. Robotics Autom..

[12]  Steven M. LaValle,et al.  On the Relationship between Classical Grid Search and Probabilistic Roadmaps , 2004, Int. J. Robotics Res..

[13]  Peter Sampl.  Medial Axis Construction in Three Dimensions and its Application to Mesh Generation , 2001, Engineering with Computers.

[14]  Kenneth Y. Goldberg,et al.  Motion Planning Under Uncertainty for Image-guided Medical Needle Steering , 2008, Int. J. Robotics Res..

[15]  Marilena Vendittelli,et al.  Obstacle distance for car-like robots , 1999, IEEE Trans. Robotics Autom..

[16]  Reid G. Simmons,et al.  The curvature-velocity method for local obstacle avoidance , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[17]  Leslie Pack Kaelbling,et al.  Action-Space Partitioning for Planning , 2007, AAAI.

[18]  Thierry Siméon,et al.  Path Deformation Roadmaps: Compact Graphs with Useful Cycles for Motion Planning , 2008, Int. J. Robotics Res..

[19]  Jean-Claude Latombe,et al.  Nonholonomic multibody mobile robots: Controllability and motion planning in the presence of obstacles , 2005, Algorithmica.

[20]  Ross A. Knepper,et al.  Empirical Sampling of Path Sets for Local Area Motion Planning , 2008, ISER.

[21]  Michael Farber.  Topological Complexity of Motion Planning , 2003, Discret. Comput. Geom..

[22]  Vladimir J. Lumelsky,et al.  Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape , 1987, Algorithmica.

[23]  Mitul Saha,et al.  Exact Collision Checking of Robot Paths , 2002, WAFR.

[24]  Alonzo Kelly,et al.  Toward Optimal Sampling in the Space of Paths , 2007, ISRR.

[25]  Wolfram Burgard,et al.  The Mobile Robot Rhino , 1995, SNN Symposium on Neural Networks.

[26]  Pieter Abbeel,et al.  LQG-Based Planning, Sensing, and Control of Steerable Needles , 2010, WAFR.

[27]  Kurt Konolige,et al.  The Office Marathon: Robust navigation in an indoor office environment , 2010, 2010 IEEE International Conference on Robotics and Automation.

[28]  Ross A. Knepper,et al.  Path diversity is only part of the problem , 2009, 2009 IEEE International Conference on Robotics and Automation.

[29]  D. Minhas,et al.  Modeling of Needle Steering via Duty-Cycled Spinning , 2007, 2007 29th Annual International Conference of the IEEE Engineering in Medicine and Biology Society.

[30]  O. Brock,et al.  Elastic Strips: A Framework for Motion Generation in Human Environments , 2002, Int. J. Robotics Res..

[31]  Thierry Siméon,et al.  Path Deformation Roadmaps , 2006, WAFR.

[32]  Jeffrey T. Henrikson.  Completeness and Total Boundedness of the Hausdorff Metric , 1999 .

[33]  Thomas Allen,et al.  A Planning System for Autonomous Ground Vehicles Operating in Unstructured Dynamic Environments , 2007 .

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

[35]  Hongyan Wang,et al.  The complexity of the two dimensional curvature-constrained shortest-path problem , 1998 .

[36]  Howie Choset,et al.  Sensor Based Planing, Part I: The Generalized Voronoi Graph , 1995, ICRA.

[37]  Jin Seob Kim,et al.  Nonholonomic Modeling of Needle Steering , 2006, Int. J. Robotics Res..

[38]  Harald Niederreiter,et al.  Random number generation and Quasi-Monte Carlo methods , 1992, CBMS-NSF regional conference series in applied mathematics.

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

[40]  Didier Wolf,et al.  Capture of homotopy classes with probabilistic road map , 2002, IEEE/RSJ International Conference on Intelligent Robots and Systems.

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

[42]  Chee-Keng Yap,et al.  AnO(n logn) algorithm for the voronoi diagram of a set of simple curve segments , 1987, Discret. Comput. Geom..

[43]  Howie Choset,et al.  Topology in Motion Planning , 2003, ISRR.

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