Optimal competitive online ray search with an error-prone robot

Authors:
Tom Kamphans;Elmar Langetepe
Affiliations:
Institute of Computer Science I, University of Bonn, Bonn, Germany;Institute of Computer Science I, University of Bonn, Bonn, Germany
Venue:
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Year:
2005

Citing 8
Cited 2

Shortest paths without a map

Theoretical Computer Science
Searching in the plane

Information and Computation
Searching in an unknown environment: an optimal randomized algorithm for the cow-path problem

Information and Computation
How to find a point on a line within a fixed distance

Discrete Applied Mathematics - Special issue on the 13th European workshop on computational geometry CG '97
The ultimate strategy to search on m rays?

Theoretical Computer Science
On the Competitive Complexity of Navigation Tasks

Revised Papers from the International Workshop on Sensor Based Intelligent Robots
Online searching with turn cost

Theoretical Computer Science - Approximation and online algorithms
Parallel searching on m rays

Computational Geometry: Theory and Applications

Searching for an axis-parallel shoreline

COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
Searching for an axis-parallel shoreline

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of finding a door along a wall with a blind robot that neither knows the distance to the door nor the direction towards of the door. This problem can be solved with the well-known doubling strategy yielding an optimal competitive factor of 9 with the assumption that the robot does not make any errors during its movements. We study the case that the robot's movement is erroneous. In this case the doubling strategy is no longer optimal. We present optimal competitive strategies that take the error assumption into account.