189 search results - page 36 / 38 » Shortest Paths Without a Map |
ALGORITHMICA
2002
13 years 7 months ago
2002
We study exploration problems where a robot has to construct a complete map of an unknown environment using a path that is as short as possible. In the rst problem setting we cons...
JCSS
2011
13 years 2 months ago
2011
The bandwidth of an n-vertex graph G is the minimum value b such that the vertices of G can be mapped to distinct integer points on a line without any edge being stretched to a di...
HRI
2010
ACM
13 years 6 months ago
2010
ACM
—This paper reports about a human-robot interaction field trial conducted with the autonomous mobile robot ACE (Autonomous City Explorer) in a public place, where the ACE robot ...
ICCV
1999
IEEE
14 years 9 months ago
1999
IEEE
In this contribution we focus on the calibration of very long image sequences from a hand-held camera that samples the viewing sphere of a scene. View sphere sampling is important...
FPGA
2009
ACM
14 years 2 months ago
2009
ACM
Aggressive scaling increases the number of devices we can integrate per square millimeter but makes it increasingly difficult to guarantee that each device fabricated has the inte...