41 search results - page 2 / 9 » Computing simple paths among obstacles |
COMGEO
2006
ACM
13 years 5 months ago
2006
ACM
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
ECAI
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. We address the problem of continuous stochastic optimal control in the presence of hard obstacles. Due to the non-smooth character of the obstacles, the traditional appro...
ICRA
2010
IEEE
13 years 3 months ago
2010
IEEE
Suppose we want to move a passive object along a given path, among obstacles in the plane, by pushing it with an active robot. We present two algorithms to compute a push plan for...
COMPGEOM
2004
ACM
13 years 10 months ago
2004
ACM
We revisit the problem of computing shortest obstacle-avoiding paths among obstacles in three dimensions. We prove new hardness results, showing, e.g., that computing Euclidean sh...
COMPGEOM
2008
ACM
13 years 7 months ago
2008
ACM
This video illustrates an algorithm for computing a maximum number of disjoint paths for unit disks moving among a set of dynamic obstacles in the plane. The problem is motivated ...