On the Probabilistic Foundations of Probabilistic Roadmap PlanningDepartment of Computer Science, National University of Singapore, Singapore, 117543, dyhsu{at}comp.nus.edu.sg
Department of Computer Science, Stanford University, Stanford, CA 94305, USA, latombe{at}cs.stanford.edu
Department of Computer Science, National University of Singapore, Singapore, 117543, hannakur{at}comp.nus.edu.sg 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.
Key Words: robotics • motion planning • randomized algorithm • random sampling • probabilistic roadmap planning
The International Journal of Robotics Research, Vol. 25, No. 7,
627-643 (2006) This article has been cited by other articles:
|
||||||||||||||||
 |
|
|
 |
|
