134 search results - page 2 / 27 » Randomized Query Processing in Robot Path Planning |
ICRA
2005
IEEE
13 years 11 months ago
2005
IEEE
— Probabilistic sampling-based motion planners are unable to detect when no feasible path exists. A common heuristic is to declare a query infeasible if a path is not found in a ...
ICRA
2007
IEEE
13 years 11 months ago
2007
IEEE
— Randomly expanding trees are very effective in exploring high-dimensional spaces. Consequently, they are a powerful algorithmic approach to sampling-based single-query motion p...
ICRA
2007
IEEE
13 years 11 months ago
2007
IEEE
— This paper describes a new extension to the Rapidly–exploring Random Tree (RRT) path planning algorithm. The Particle RRT algorithm explicitly considers uncertainty in its do...
ICRA
2009
IEEE
14 years 4 hour ago
2009
IEEE
— The reduction of the kinematics and/or dynamics of a high-DOF robotic manipulator to a low-dimension “task space” has proven to be an invaluable tool for designing feedback...
ICRA
1994
IEEE
13 years 9 months ago
1994
IEEE
There is a close relationship between harmonic functions { which have recently been proposed for path planning { and hitting probabilities for random processes. The hitting probab...