Sciweavers

WEA
2005
Springer

Optimal Competitive Online Ray Search with an Error-Prone Robot

13 years 9 months ago
Optimal Competitive Online Ray Search with an Error-Prone Robot
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 wellknown 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.
Thomas Kamphans, Elmar Langetepe
Added 28 Jun 2010
Updated 28 Jun 2010
Type Conference
Year 2005
Where WEA
Authors Thomas Kamphans, Elmar Langetepe
Comments (0)