41 search results - page 3 / 9 » Computing simple paths among obstacles |
ICRA
2007
IEEE
14 years 1 months ago
2007
IEEE
— Most of present work for autonomous navigation in dynamic environment doesn’t take into account the dynamics of the obstacles or the limits of the perception system. To face ...
ICRA
2009
IEEE
14 years 1 months ago
2009
IEEE
— A novel criterion is introduced for assessing the diversity of a collection of paths or trajectories. The main idea is the notion of survivability, which measures the likelihoo...
ICRA
1994
IEEE
13 years 11 months ago
1994
IEEE
We present a simple approach for planning the motion of nonholonomic robots among obstacles. Existing methods lead to open-loop solutions which are either obtained in two stages, ...
CAPTECH
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. This paper presents a new technique for computing collisionfree navigation motions from task-level commands for animated human characters in interactive virtual environme...
COMGEO
2012
ACM
12 years 2 months ago
2012
ACM
We study a class of multi-commodity flow problems in geometric domains: For a given planar domain P populated with obstacles (holes) of K ≥ 2 types, compute a set of thick path...