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...
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...
: The path planning problem is relevant for all applications in which a mobil robot should autonomously navigate. Finding the shortest path in an environment that is only partialy ...
Ulrich Roth, Marc Walker, Arne Hilmann, Heinrich K...
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...
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
Esther M. Arkin, Joseph S. B. Mitchell, Valentin P...