3 search results - page 1 / 1 » On addressing the run-cost variance in randomized motion pla... |
ICRA
2003
IEEE
13 years 10 months ago
2003
IEEE
The decades of research in motion planning have resulted in numerous algorithms. Many of the most successful algorithms are randomized and can have widely differing run-times for ...
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...
IROS
2007
IEEE
13 years 11 months ago
2007
IEEE
— A central challenging problem in humanoid robotics is to plan and execute dynamic tasks in dynamic environments. Given that the environment is known, sampling-based online moti...