122 search results - page 10 / 25 » An Algorithm for Probabilistic Least-Commitment Planning |
ICRA
2010
IEEE
14 years 8 months ago
2010
IEEE
Abstract— For path planning algorithms of robots it is important that the robot does not reach a state of inevitable collision. In crowded environments with many humans or robots...
ICRA
2005
IEEE
15 years 3 months ago
2005
IEEE
Abstract— We present a novel algorithm for motion planning of a deformable robot in a static environment. Given the initial and final configuration of the robot, our algorithm ...
IROS
2008
IEEE
15 years 4 months ago
2008
IEEE
— The paper describes a navigation algorithm for dynamic, uncertain environment. Moving obstacles are supposed to move on typical patterns which are pre-learned and are represent...
IROS
2006
IEEE
15 years 3 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
15 years 3 months ago
2005
IEEE
— Probabilistic sampling-based motion planners are unable to detect when no feasible path exists. A common heuristic is to declare a query infeasible if a path is not found in a ...