26 search results - page 3 / 6 » Time-minimal path planning in dynamic current fields |
ICRA
2009
IEEE
14 years 4 days ago
2009
IEEE
Abstract— We present a novel approach to compute collisionfree paths for multiple robots subject to local coordination constraints. More specifically, given a set of robots, the...
ICRA
2009
IEEE
13 years 3 months ago
2009
IEEE
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...
AAAI
2010
13 years 7 months ago
2010
Goal-directed path planning is one of the basic and widely studied problems in the field of mobile robotics. Homotopy classes of trajectories, arising due to the presence of obsta...
MIG
2010
Springer
13 years 3 months ago
2010
Springer
In computer games, one or more groups of units need to move from one location to another as quickly as possible. If there is only one group, then it can be solved efficiently as a ...
DAIS
2003
13 years 6 months ago
2003
Communication in distributed applications across a wide area network needs to cope with heterogenous and constantly changing network conditions. A promising approach to address thi...