A fundamental task for an autonomous robot is to plan its own motions. Exact approaches to the solution of this motion planning problem suffer from high worst-case running times. ...
Robert-Paul Berretty, Mark H. Overmars, A. Frank v...
The heuristics used for planning and search often take the pattern databases generated from abstracted versions of the given state space. Pattern databases are typically stored p ...
Many complex control problems require sophisticated solutions that are not amenable to traditional controller design. Not only is it difficult to model real world systems, but oft...
In this paper we introduce a discrete version of the online traveling salesman problem (DOLTSP). We represent the metric space using a weighted graph, where the server is allowed t...
We propose a novel method for computing a geometrically consistent and spatially dense matching between two 3D shapes. Rather than mapping points to points we match infinitesimal...
Thomas Windheuser, Ulrich Schlickewei, Frank R. Sc...