Sciweavers

16 search results - page 1 / 4
» Single-Query Motion Planning with Utility-Guided Random Tree...
Sort
View
ICRA
2007
IEEE
125views Robotics» more  ICRA 2007»
13 years 11 months ago
Single-Query Motion Planning with Utility-Guided Random Trees
— 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...
Brendan Burns, Oliver Brock
ICRA
2000
IEEE
176views Robotics» more  ICRA 2000»
13 years 9 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
AIPS
2006
13 years 6 months ago
Reconfigurable Path Planning for an Autonomous Unmanned Aerial Vehicle
In this paper, we present a motion planning framework for a fully deployed autonomous unmanned aerial vehicle which integrates two sample-based motion planning techniques, Probabi...
Mariusz Wzorek, Patrick Doherty
CORR
2010
Springer
134views Education» more  CORR 2010»
13 years 5 months ago
Incremental Sampling-based Algorithms for Optimal Motion Planning
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
Sertac Karaman, Emilio Frazzoli
IJRR
2011
174views more  IJRR 2011»
13 years 12 days ago
Bounding on rough terrain with the LittleDog robot
— In this paper we develop an RRT-based motion planner that achieved bounding in simulation with the LittleDog robot over extremely rough terrain. LittleDog is a quadruped robot ...
Alexander C. Shkolnik, Michael Levashov, Ian R. Ma...