从磁盘驾驶坠毁的机器人
Chauffeuring a Crashed Robot from a Disk
摘要：
最近，机器人从磁盘中的疏散得到了很多关注。我们从容错的角度来看待这个问题。我们考虑两个机器人试图通过一个隐藏的出口从磁盘周边的磁盘撤离。机器人之间是无线通信的。机器人容易发生碰撞故障，之后它们停止移动和通信。我们设计的算法容忍一个错误。目的是最大限度地减少最坏情况下从磁盘中撤离两个机器人所需的时间。当没有故障的机器人驾驶坠毁的机器人时，它需要$α\geq 1$的时间量来行驶单位距离。在此基础上，我们还提供了疏散时间的下限。此外，我们评估了最坏情况下的算法的不同值的$α$和崩溃时间。
英文摘要：
Evacuation of robots from a disk has attained a lot of attention recently. We visit the problem from the perspective of fault-tolerance. We consider two robots trying to evacuate from a disk via a single hidden exit on the perimeter of the disk. The robots communicate wirelessly. The robots are susceptible to crash faults after which they stop moving and communicating. We design the algorithms for tolerating one fault. The objective is to minimize the worst-case time required to evacuate both the robots from the disk. When the non-faulty robot chauffeurs the crashed robot, it takes $α\geq 1$ amount of time to travel unit distance. With this, we also provide a lower bound for the evacuation time. Further, we evaluate the worst-case of the algorithms for different values of $α$ and the crash time.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
