On the Probabilistic Foundations of Probabilistic Roadmap Planning

Authors:
David Hsu;Jean-Claude Latombe;Hanna Kurniawati
Affiliations:
Department of Computer Science, National University of Singapore, Singapore, 117543;Department of Computer Science, Stanford University, Stanford, CA 94305, USA;Department of Computer Science, National University of Singapore, Singapore, 117543
Venue:
International Journal of Robotics Research
Year:
2006

Citing 9
Cited 22

Random number generation and quasi-Monte Carlo methods

Random number generation and quasi-Monte Carlo methods
An introduction to computational learning theory

An introduction to computational learning theory
Randomized query processing in robot path planning

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
On finding narrow passages with probabilistic roadmap planners

WAFR '98 Proceedings of the third workshop on the algorithmic foundations of robotics on Robotics : the algorithmic perspective: the algorithmic perspective
OBPRM: an obstacle-based PRM for 3D workspaces

WAFR '98 Proceedings of the third workshop on the algorithmic foundations of robotics on Robotics : the algorithmic perspective: the algorithmic perspective
The self-reconfiguring robotic molecule: design and control algorithms

WAFR '98 Proceedings of the third workshop on the algorithmic foundations of robotics on Robotics : the algorithmic perspective: the algorithmic perspective
Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time

Journal of the ACM (JACM)
Finding Narrow Passages with Probabilistic Roadmaps: The Small-Step Retraction Method

Autonomous Robots

Motion planning for skateboard-like robots in dynamic environments

Crossroads
Motion Planning for Haptic Guidance

Journal of Intelligent and Robotic Systems
Smoothed analysis of probabilistic roadmaps

Computational Geometry: Theory and Applications
The Belief Roadmap: Efficient Planning in Belief Space by Factoring the Covariance

International Journal of Robotics Research
Online world modeling and path planning for an unmanned helicopter

Autonomous Robots
Motion planning for high DOF anthropomorphic hands

ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
Sampling-based path planning for geometrically-constrained objects

ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
Detecting narrow passages in configuration spaces via spectra of probabilistic roadmaps

Proceedings of the 2010 ACM Symposium on Applied Computing
On the performance of deterministic sampling in probabilistic roadmap planning

MICAI'07 Proceedings of the artificial intelligence 6th Mexican international conference on Advances in artificial intelligence
Multi-modal Motion Planning in Non-expansive Spaces

International Journal of Robotics Research
A decision-theoretic formalism for belief-optimal reasoning

PerMIS '09 Proceedings of the 9th Workshop on Performance Metrics for Intelligent Systems
Motion planning under uncertainty for robotic tasks with long time horizons

International Journal of Robotics Research
Sampling-based algorithms for optimal motion planning

International Journal of Robotics Research
Autonomous motion planning of a hand-arm robotic system based on captured human-like hand postures

Autonomous Robots
A Connectivity-Based Method for Enhancing Sampling in Probabilistic Roadmap Planners

Journal of Intelligent and Robotic Systems
Linear dimensionality reduction in random motion planning

International Journal of Robotics Research
A configuration deactivation algorithm for boosting probabilistic roadmap planning of robots

International Journal of Automation and Computing
Cross-entropy motion planning

International Journal of Robotics Research
Estimation, planning, and mapping for autonomous flight using an RGB-D camera in GPS-denied environments

International Journal of Robotics Research
Real-time informed path sampling for motion planning search

International Journal of Robotics Research
On soft predicates in subdivision motion planning

Proceedings of the twenty-ninth annual symposium on Computational geometry
Path planning for grasping operations using an adaptive PCA-based sampling method

Autonomous Robots

Quantified Score

Hi-index	0.00

Visualization

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.