80 search results - page 2 / 16 » Localizing a Robot with Minimum Travel |
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...
ICRA
2000
IEEE
13 years 9 months ago
2000
IEEE
We present a navigation algorithm, which integrates virtual obstacle concept with a potential-field-based method to maneuver cylindrical mobile robots in unknown or unstructured e...
IJAIT
2010
13 years 3 months ago
2010
Many real world industrial applications involve finding a Hamiltonian path with minimum cost. Some instances that belong to this category are transportation routing problem, scan c...
TASE
2010
IEEE
12 years 12 months ago
2010
IEEE
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
LATIN
2010
Springer
13 years 10 months ago
2010
Springer
Consider a dark polygonal region in which intruders move freely, trying to avoid detection. A robot, which is equipped with a flashlight, moves along the polygon boundary to illum...