Sciweavers

134 search results - page 1 / 27
» Randomized Query Processing in Robot Path Planning
Sort
View
JCSS
1998
51views more  JCSS 1998»
13 years 4 months ago
Randomized Query Processing in Robot Path Planning
d Abstract) LYDIA E. KAVRAKI   JEAN-CLAUDE LATOMBE   RAJEEV MOTWANI ¡ PRABHAKAR RAGHAVAN ¢ The subject of this paper is the analysis of a randomized preprocessing scheme that ...
Lydia E. Kavraki, Jean-Claude Latombe, Rajeev Motw...
ICRA
2000
IEEE
176views Robotics» more  ICRA 2000»
13 years 8 months ago
RRT-Connect: An Efficient Approach to Single-Query Path Planning
A simple and efficient randomized algorithm is presented for solving single-query path planning problems in high-dimensional configuration spaces. The method works by incrementall...
James J. Kuffner Jr., Steven M. LaValle
IROS
2007
IEEE
114views Robotics» more  IROS 2007»
13 years 11 months ago
Randomized statistical path planning
Rosen Diankov, James Kuffner
IROS
2009
IEEE
151views Robotics» more  IROS 2009»
13 years 11 months ago
Stochastic mobility-based path planning in uncertain environments
— The ability of mobile robots to generate feasible trajectories online is an important requirement for their autonomous operation in unstructured environments. Many path generat...
Gaurav Kewlani, Genya Ishigami, Karl Iagnemma
ICRA
2005
IEEE
111views Robotics» more  ICRA 2005»
13 years 10 months ago
Single-Query Entropy-Guided Path Planning
Motion planning for robots with many degrees of freedom requires the exploration of an exponentially large configuration space. Single-query motion planners restrict exploration ...
Brendan Burns, Oliver Brock