带返回的冻结标签问题
Freeze-Tag with Return
AI总结:
研究带返回的冻结标签问题(FTRP),要求机器人最终返回起点,证明其最优完工时间与标准FTP相差不超过1.959,并给出上下界及单指数算法。
摘要:
在标准的冻结标签问题(FTP)中,一个初始唤醒的机器人(源)负责通过移动来唤醒一群休眠的机器人,假设所有唤醒的机器人都可以参与唤醒过程。目标是最小化唤醒所有机器人的完工时间,假设它们以单位速度移动。在本文中,我们引入了带返回的冻结标签问题(FTRP)变体,其中机器人最终必须返回其初始位置。在欧几里得平面中,有$n$个休眠机器人位于以源初始位置为中心的单位圆盘上,我们通过证明两个问题的最优完工时间之差不超过$1.959$,且在最坏情况下至少为$1.732$,展示了FTP和FTRP之间的非平凡关系。我们还给出了最优完工时间的若干上界和下界。特别地,我们证明如果休眠机器人处于凸位置,则最优完工时间至多为$2 + 2\sqrt{2}$,并且某些实例达到了该上界。从算法角度来看,我们针对一般距离函数提出了单指数算法。在度量空间中,这些算法在ETH下是渐近最优的,我们通过在无权重图上的NP-hardness归约证明了这一点。
英文摘要:
In the standard Freeze-Tag Problem (FTP), an initially awake robot (the source) is in charge of waking up a swarm of sleeping robots by moving towards them, given that all the awake robots can participate in the awakening process. The goal is to minimize the makespan to wake up all robots assuming they move at unit speed. In this paper we introduce the Freeze-Tag-with-Return Problem (FTRP) variant, where the robots must eventually return to their initial positions. In the Euclidean plane with $n$ sleeping robots lying on the unit disk centered at the initial position of the source, we show a non-trivial relationship between FTP and FTRP by proving that the difference between the optimal makespan of both problems never exceeds $1.959$, and is at least $1.732$ in the worst-case. We also present several upper and lower bounds on the optimal makespan. In particular, we show that if the sleeping robots are in convex positions, then the optimal makespan is at most $2 + 2\sqrt{2}$, which is achieved by some instances. From an algorithmic point-of-view, we present single-exponential algorithms for general distance functions. In metric spaces, these algorithms are asymptotically optimal under the ETH, which we show via an NP-hardness reduction on unweighted graphs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。