Watchman routes under limited visibility
Computational Geometry: Theory and Applications
How to learn an unknown environment. I: the rectilinear case
Journal of the ACM (JACM)
The Polygon Exploration Problem
SIAM Journal on Computing
Competitive on-line coverage of grid environments by a mobile robot
Computational Geometry: Theory and Applications
Developments from a June 1996 seminar on Online algorithms: the state of the art
Developments from a June 1996 seminar on Online algorithms: the state of the art
On the Competitive Complexity of Navigation Tasks
Revised Papers from the International Workshop on Sensor Based Intelligent Robots
An approximation scheme for planar graph TSP
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Hamiltonian Cycles in Solid Grid Graphs
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Polynomial time approximation schemes for Euclidean TSP and other geometric problems
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
An Optimal Competitive Strategy for Walking in Streets
SIAM Journal on Computing
Rapid exploration of unknown areas through dynamic deployment of mobile and stationary sensor nodes
Autonomous Agents and Multi-Agent Systems
Inspecting a Set of Strips Optimally
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Local Voronoi decomposition for multi-agent task allocation
ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
Optimality and competitiveness of exploring polygons by mobile robots
Information and Computation
Exploring and triangulating a region by a swarm of robots
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
An improved strategy for exploring a grid polygon
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Hi-index | 0.00 |
We investigate the online exploration problem of a short-sighted mobile robot moving in an unknown cellular room without obstacles. The robot has a very limited sensor; it can determine only which of the four cells adjacent to its current position are free and which are blocked, i.e., unaccessible for the robot. Therefore, the robot must enter a cell in order to explore it. The robot has to visit each cell and to return to the start. Our interest is in a short exploration tour, i.e., in keeping the number of multiple cell visits small. For abitrary environments without holes we provide a strategy producing tours of length $S \leq C + \frac{1}{2} E -- 3$, where C denotes the number of cells – the area – , and E denotes the number of boundary edges – the perimeter – of the given environment. Further, we show that our strategy is competitive with a factor of $\frac43$, and give a lower bound of $\frac76$ for our problem. This leaves a gap of only $\frac16$ between the lower and the upper bound.