通过无线通信实现双机器人磁盘快速疏散
Fast Two-Robot Disk Evacuation with Wireless Communication
摘要:
在快速疏散问题中,我们研究了两个机器人的路径规划问题,他们希望最小化单位圆盘上的最坏情况下的疏散时间。机器人最初被放置在圆盘的中心。为了撤离,他们需要到达磁盘边界上的一个未知点,即出口。一旦其中一个机器人找到出口,它就会立即通知另一个智能体,后者将直接到达出口。该问题已针对具有相同速度的机器人进行了研究~ \cite{s1}。我们研究一个更一般的情况下,一个机器人的速度$1$和其他速度$s \geq 1$。通过给出最坏情况下疏散时间的匹配上、下界,给出了$s \geq c_{2.75} \approx 2.75$情形下的最优疏散策略。对于$1\leq s < c_{2.75}$,我们显示(非匹配)的比例小于$1.22$的疏散时间的上限和下限。此外,我们证明了我们提出的任何$s \geq c_{1.71} \approx 1.71$的策略优于~ \cite{s1}的两个机器人搜索策略的泛化。
英文摘要:
In the fast evacuation problem, we study the path planning problem for two robots who want to minimize the worst-case evacuation time on the unit disk. The robots are initially placed at the center of the disk. In order to evacuate, they need to reach an unknown point, the exit, on the boundary of the disk. Once one of the robots finds the exit, it will instantaneously notify the other agent, who will make a beeline to it. The problem has been studied for robots with the same speed~\cite{s1}. We study a more general case where one robot has speed $1$ and the other has speed $s \geq 1$. We provide optimal evacuation strategies in the case that $s \geq c_{2.75} \approx 2.75$ by showing matching upper and lower bounds on the worst-case evacuation time. For $1\leq s < c_{2.75}$, we show (non-matching) upper and lower bounds on the evacuation time with a ratio less than $1.22$. Moreover, we demonstrate that a generalization of the two-robot search strategy from~\cite{s1} is outperformed by our proposed strategies for any $s \geq c_{1.71} \approx 1.71$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。