具有易错机器人的最优竞争在线射线搜索
Optimal competitive online ray search with an error-prone robot
摘要：
我们考虑的问题，找到一个门沿着墙壁与盲人机器人，既不知道门的距离，也不朝向门的方向。这个问题可以用众所周知的加倍策略来解决，假设机器人在其运动过程中不会犯任何错误，则最佳竞争因子为9。我们研究的情况下，机器人的运动是错误的。在这种情况下，加倍策略不再是最优的。我们提出了最优的竞争策略，考虑到错误的假设。该分析技术可适用于不同的误差模型。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
