Sciweavers

Share
35 search results - page 1 / 7
» RRT-Connect: An Efficient Approach to Single-Query Path Plan...
Sort
View
ICRA
2000
IEEE
176views Robotics» more  ICRA 2000»
10 years 3 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
ICRA
2005
IEEE
111views Robotics» more  ICRA 2005»
10 years 5 months ago
Single-Query Entropy-Guided Path Planning
Motion planning for robots with many degrees of freedom requires the exploration of an exponentially large conīŦguration space. Single-query motion planners restrict exploration ...
Brendan Burns, Oliver Brock
AIPS
2009
10 years 23 days ago
Information-Theoretic Approach to Efficient Adaptive Path Planning for Mobile Robotic Environmental Sensing
Recent research in robot exploration and mapping has focused on sampling environmental hotspot fields. This exploration task is formalized by Low, Dolan, and Khosla (2008) in a se...
Kian Hsiang Low, John M. Dolan, Pradeep K. Khosla
ROBOCUP
2000
Springer
145views Robotics» more  ROBOCUP 2000»
10 years 3 months ago
Adaptive Path Planner for Highly Dynamic Environments
Abstract. This paper describes adaptive path planning, a novel approach to path planning for car-like mobile robots. Instead of creating a new plan from scratch, whenever changes i...
Jacky Baltes, Nicholas Hildreth
ICRA
2009
IEEE
126views Robotics» more  ICRA 2009»
9 years 9 months ago
Time-bounded lattice for efficient planning in dynamic environments
For vehicles navigating initially unknown cluttered environments, current state-of-the-art planning algorithms are able to plan and re-plan dynamically-feasible paths efficiently a...
Aleksandr Kushleyev, Maxim Likhachev
books