使用移动机器人的磁盘优先疏散
Priority Evacuation from a Disk Using Mobile Robots
摘要:
我们介绍并研究了一个新的搜索型问题($n+1$)-机器人在磁盘上。搜索器(机器人)都从磁盘的中心开始,具有单位速度,并且可以无线通信。目标是让一个杰出的机器人(女王)在尽可能短的时间内到达并从隐藏在磁盘周边的出口撤离。剩下的$n$机器人(仆人)在那里帮助女王的目标,并不需要到达隐藏的出口。我们提供了从单位盘中疏散皇后所需时间的上限和下限。也就是说,我们提出了一种算法,指定的轨迹的机器人,保证撤离的女王在时间总是优于$2 + 4(\sqrt{2}-1) \fracπ{n}$为$n \geq 4$仆人。我们还证明,$n \geq 4$仆人女王不能撤离的时间少于$2+\fracπ{n}+\frac{2}{n^2}$。
英文摘要:
We introduce and study a new search-type problem with ($n+1$)-robots on a disk. The searchers (robots) all start from the center of the disk, have unit speed, and can communicate wirelessly. The goal is for a distinguished robot (the queen) to reach and evacuate from an exit that is hidden on the perimeter of the disk in as little time as possible. The remaining $n$ robots (servants) are there to facilitate the queen's objective and are not required to reach the hidden exit. We provide upper and lower bounds for the time required to evacuate the queen from a unit disk. Namely, we propose an algorithm specifying the trajectories of the robots which guarantees evacuation of the queen in time always better than $2 + 4(\sqrt{2}-1) \fracπ{n}$ for $n \geq 4$ servants. We also demonstrate that for $n \geq 4$ servants the queen cannot be evacuated in time less than $2+\fracπ{n}+\frac{2}{n^2}$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。