111 search results - page 1 / 23 » Anytime Path Planning and Replanning in Dynamic Environments |
ICRA
2006
IEEE
13 years 11 months ago
2006
IEEE
— We present an efficient, anytime method for path planning in dynamic environments. Current approaches to planning in such domains either assume that the environment is static ...
ICRA
2007
IEEE
13 years 11 months ago
2007
IEEE
— We present a sampling-based path planning and replanning algorithm that produces anytime solutions. Our algorithm tunes the quality of its result based on available search time...
IROS
2006
IEEE
13 years 10 months ago
2006
IEEE
— This paper presents work on sensor-based motion planning in initially unknown dynamic environments. Motion detection and modeling are combined with a smooth navigation function...
ICRA
2005
IEEE
13 years 10 months ago
2005
IEEE
— The E∗ algorithm is a path planning method capable of dynamic replanning and user-configurable path cost interpolation. It calculates a navigation function as a sampling of ...
IROS
2008
IEEE
13 years 11 months ago
2008
IEEE
— Robots acting in populated environments must be capable of safe but also time efficient navigation. Trying to completely avoid regions resulting from worst case predictions of...