Measure theoretic analysis of probabilistic path planning

This paper presents a novel analysis of the probabilistic roadmap method (PRM) for path planning. We formulate the problem in terms of computing the transitive closure of a relation over a probability space, and give a bound on the expected number iterations of PRM required to find a path, in terms of the number of intermediate points and the probability of choosing a point from a certain set. Explicit geometric assumptions are not necessary to complete this analysis. As a result, the analysis provides some unification of previous work. We provide an upper bound which could be refined using details specific to a given problem. This bound is of the same form as that proved in previous analyses, but has simpler prerequisites and is proved on a more general class of problems. Using our framework, we analyze some new path-planning problems, 2k-degree-of-freedom kinodynamic point robots, polygonal robots with contact, and deformable robots with force field control. These examples make explicit use of generality in our approach that did not exist in previous frameworks.

[1]  W. Rudin.  Principles of mathematical analysis , 1964 .

[2]  James R. Munkres,et al.  Elements of algebraic topology , 1984 .

[3]  Jean-Claude Latombe,et al.  Planning motions with intentions , 1994, SIGGRAPH.

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

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

[6]  Mark H. Overmars,et al.  Coordinated motion planning for multiple car-like robots using probabilistic roadmaps , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.

[7]  John F. Canny,et al.  Impulse-based simulation of rigid bodies , 1995, I3D '95.

[8]  Lydia E. Kavraki,et al.  Randomized query processing in robot path planning , 1995, STOC '95.

[9]  Rajeev Motwani,et al.  Randomized algorithms , 1996, CSUR.

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

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

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

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

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

[15]  Mark H. Overmars,et al.  Multilevel Path Planning for Nonholonomic Robots Using Semiholonomic Subsystems , 1998, Int. J. Robotics Res..

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

[17]  Jean-Claude Latombe,et al.  CARABEAMER: a treatment planner for a robotic radiosurgical system with general kinematics , 1999, Medical Image Anal..

[18]  Jing Xiao,et al.  Automatic Generation of High-Level Contact State Space , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

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

[20]  Pavel Valtr.  On Galleries with No Bad Points , 1999, Discret. Comput. Geom..

[21]  Lydia E. Kavraki,et al.  Computational Approaches to Drug Design , 1999, Algorithmica.

[22]  Steven M. LaValle,et al.  RRT-connect: An efficient approach to single-query path planning , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[23]  Jing Xiao,et al.  On Random Sampling in Contact Configuration Space , 2000 .

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

[25]  Lydia E. Kavraki,et al.  Deformable volumes in path planning applications , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[26]  David Hsu,et al.  Randomized single-query motion planning in expansive spaces , 2000 .

[27]  Lydia E. Kavraki,et al.  A two level fuzzy PRM for manipulation planning , 2000, Proceedings. 2000 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2000) (Cat. No.00CH37113).

[28]  Xuerong Ji,et al.  Automatic Generation of High-Level Contact State Space , 2001, Int. J. Robotics Res..

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

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

[31]  Lydia E. Kavraki,et al.  Positioning of Symmetric and Nonsymmetric Parts Using Radial and Constant Fields: Computation of All Equilibrium Configurations , 2001, Int. J. Robotics Res..

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

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

[34]  G. Swaminathan.  Robot Motion Planning , 2006 .