56 search results - page 1 / 12 » Optimality and Competitiveness of Exploring Polygons by Mobi... |
ESA
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. A mobile robot, represented by a point moving along a polygonal line in the plane, has to explore an unknown polygon and return to the starting point. The robot has a sen...
COCOON
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We investigate the online exploration problem of a shortsighted mobile robot moving in an unknown cellular room without obstacles. The robot has a very limited sensor; it...
SWAT
2010
Springer
13 years 10 months ago
2010
Springer
A mobile robot represented by a point moving in the plane has to explore an unknown terrain with obstacles. Both the terrain and the obstacles are modeled as arbitrary polygons. W...
COMPGEOM
1994
ACM
13 years 9 months ago
1994
ACM
We consider the problem of a robot which has to find a target in an unknown simple polygon, based only on what it has seen so far. A street is a polygon for which the two boundary...
ARCS
2006
Springer
13 years 8 months ago
2006
Springer
An n-node tree has to be explored by a group of k mobile robots deployed initially at the root. Robots traverse the edges of the tree until all nodes are visited. We would like to ...