Computer Science – Computational Geometry
Scientific paper
2010-12-23
Computer Science
Computational Geometry
18 pages, 2 figures, short paper appeared in Proc. 4th Internat. Workshop Efficient Experim. Algorithms
Scientific paper
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. The analysis technique can be applied to different error models.
Kamphans Tom
Langetepe Elmar
No associations
LandOfFree
Optimal competitive online ray search with an error-prone robot does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Optimal competitive online ray search with an error-prone robot, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimal competitive online ray search with an error-prone robot will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-297122