Our goal is to find an approximate shortest path for a point robot moving in a planar subdivision with n vertices. Let 1 be a real number. Distances in each face of this subdivis...
Siu-Wing Cheng, Hyeon-Suk Na, Antoine Vigneron, Ya...
An algorithm is presented for wheeled mobile robot trajectory generation that achieves a high degree of generality and efficiency. The generality derives from numerical lineariza...
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) gr...
Abstract-- This work studies a class of hybrid mechanical systems that locomote by switching between constraints defining different dynamic regimes. We develop a geometric framewor...
Mapping opaque and confined environments such as caves and pipes is a challenging problem for mobile robots because sensor information is severely limited to the immediate proximit...