Evacuating Two Robots from Two Unknown Exits on the Perimeter of a Disk with Wireless Communication
Evacuating Two Robots from Two Unknown Exits on the Perimeter of a Disk with Wireless Communication
复制标题
通过无线通信从圆盘周边的两个未知出口疏散两个机器人
DOI：
10.1145/3154273.3154313
复制
发表时间：
2018
期刊：
影响因子：
--
通讯作者：
Stefan Schmid
中科院分区：
文献类型：
--
作者：
D. Pattanayak;H. Ramesh;P. Mandal;Stefan Schmid
移动机器人的疏散是分布式计算中一个有趣的新兴应用。本文考虑如何从单位圆盘中疏散两个机器人的基本问题。最初位于圆盘中心的机器人需要通过位于圆盘周边的两个未知出口离开圆盘，两个出口之间的距离为已知。机器人在探索磁盘时可以使用无线通信进行协调。目标是最小化疏散时间，即最后一个机器人退出磁盘的时间。我们考虑两种不同的模型变体，其中出口可以被标记或不被标记。我们通过模拟来补充我们的分析。
The evacuation of mobile robots is an interesting emerging application in distributed computing. This paper considers the fundamental problem of how to evacuate two robots from a unit disk. The robots, initially located at the center of the disk, need to exit the disk through two unknown exits, at known distance d from each other, located at the perimeter of the disk. The robots can coordinate when exploring the disk, using wireless communication. The objective is to minimize the evacuation time, i.e., the time until the last robot exits the disk. We consider two different model variants, where exits can either be labeled or unlabeled. We complement our analysis with simulations.