On the Probabilistic Foundations of Probabilistic Roadmap Planning
- 1 July 2006
- journal article
- research article
- Published by SAGE Publications in The International Journal of Robotics Research
- Vol. 25 (7) , 627-643
- https://doi.org/10.1177/0278364906067174
Abstract
Why is probabilistic roadmap (PRM) planning probabilistic? How does the probability measure used for sampling a robot’s configuration space affect the performance of a PRM planner? These questions have received little attention to date. This paper tries to fill this gap and identify promising directions to improve future planners. It introduces the probabilistic foundations of PRM planning and examines previous work in this context. It shows that the success of PRM planning depends mainly and critically on favorable “visibility” properties of a robot’s configuration space. A promising direction for speeding up PRM planners is to infer partial knowledge of such properties from both workspace geometry and information gathered during roadmap construction, and to use this knowledge to adapt the probability measure for sampling. This paper also shows that the choice of the sampling source—pseudo-random or deterministic—has small impact on a PRM planner’s performance, compared with that of the sampling measure. These conclusions are supported by both theoretical and empirical results.Keywords
This publication has 15 references indexed in Scilit:
- Finding Narrow Passages with Probabilistic Roadmaps: The Small-Step Retraction MethodAutonomous Robots, 2005
- On the Relationship between Classical Grid Search and Probabilistic RoadmapsThe International Journal of Robotics Research, 2004
- Measure theoretic analysis of probabilistic path planningIEEE Transactions on Robotics and Automation, 2004
- On Delaying Collision Checking in PRM Planning: Application to Multi-Robot CoordinationThe International Journal of Robotics Research, 2002
- Visibility-based probabilistic roadmaps for motion planningAdvanced Robotics, 2000
- Geometric DiscrepancyPublished by Springer Nature ,1999
- Analysis of probabilistic roadmaps for path planningIEEE Transactions on Robotics and Automation, 1998
- Useful metrics for modular robot motion planningIEEE Transactions on Robotics and Automation, 1997
- Probabilistic roadmaps for path planning in high-dimensional configuration spacesIEEE Transactions on Robotics and Automation, 1996
- Random Number Generation and Quasi-Monte Carlo MethodsPublished by Society for Industrial & Applied Mathematics (SIAM) ,1992