Sciweavers

10 search results - page 2 / 2
» Sampling and node adding in probabilistic roadmap planners
Sort
View
ISRR
2005
Springer
99views Robotics» more  ISRR 2005»
13 years 10 months ago
On the Probabilistic Foundations of Probabilistic Roadmap Planning
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 plan...
David Hsu, Jean-Claude Latombe, Hanna Kurniawati
ISRR
2001
Springer
161views Robotics» more  ISRR 2001»
13 years 9 months ago
A Single-Query Bi-Directional Probabilistic Roadmap Planner with Lazy Collision Checking
This paper describes the foundations and algorithms of a new probabilistic roadmap (PRM) planner that is: (1) singlequery –i.e., it does not pre-compute a roadmap, but uses the ...
Gildardo Sánchez-Ante, Jean-Claude Latombe
ICRA
2006
IEEE
114views Robotics» more  ICRA 2006»
13 years 11 months ago
Multi-level Free-space Dilation for Sampling narrow Passages in PRM Planning
— Free-space dilation is an effective approach for narrow passage sampling, a well-recognized difficulty in probabilistic roadmap (PRM) planning. Key to this approach are method...
David Hsu, Gildardo Sánchez-Ante, Ho-Lun Ch...
AI
2011
Springer
13 years 7 days ago
State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning
Planning graphs have been shown to be a rich source of heuristic information for many kinds of planners. In many cases, planners must compute a planning graph for each element of ...
Daniel Bryce, William Cushing, Subbarao Kambhampat...
FCT
2003
Springer
13 years 10 months ago
On Boundaries of Highly Visible Spaces and Applications
The purpose of this paper is to investigate the properties of a certain class of highly visible spaces. For a given geometric space C containing obstacles specified by disjoint s...
John H. Reif, Zheng Sun