32 search results - page 1 / 7 » Minimum Distance Localization for a Robot with Limited Visib... |
ICRA
2005
IEEE
13 years 10 months ago
2005
IEEE
— Minimum distance localization is the problem of finding the shortest possible path for a robot to eliminate ambiguity regarding its position in the environment. We consider th...
IJRR
2007
13 years 4 months ago
2007
We address the problem of minimum distance localization in environments that may contain self-similarities. A mobile robot is placed at an unknown location inside a ¢¤£ self-sim...
AAAI
2004
13 years 6 months ago
2004
We study a form of the pursuit-evasion problem, in which one or more searchers must move through a given environment so as to guarantee detection of any and all evaders, which can...
AAAI
2007
13 years 6 months ago
2007
We consider problems of geometric exploration and selfdeployment for simple robots that can only sense the combinatorial (non-metric) features of their surroundings. Even with suc...
ACSC
2007
IEEE
13 years 11 months ago
2007
IEEE
As computer controlled entities are set to move and explore more complex environments they need to be able to perform navigation tasks, like finding minimal cost routes. Much wor...