arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1408.2260cs.ROcs.CCcs.CG
收藏

无标号多机器人运动规划的困难性

On the hardness of unlabeled multi-robot motion planning

Tel Aviv University(特拉维夫大学)

Kiril Solovey, Dan Halperin

摘要:

在无标号多机器人运动规划中,多个可互换的机器人在同一个工作空间内工作。目标是将机器人移动到一组目标位置,使得每个位置都将被某个机器人占据。在本文中,我们研究这个问题的具体情况下,单位正方形机器人移动多边形障碍物,并表明它是PSPACE硬。我们还考虑了这个问题的三个其他变体,并证明它们也都是PSPACE硬的。据我们所知,这是第一个硬度证明的无标签的情况下。此外,我们的证明可以用来表明,标记的变体(其中每个机器人都被分配了一个特定的目标位置),同样,对于单位正方形机器人,也是PSPACE硬的,这设置了另一个优先级,因为以前的硬度结果要求机器人具有不同的形状。

英文摘要:

In unlabeled multi-robot motion planning several interchangeable robots operate in a common workspace. The goal is to move the robots to a set of target positions such that each position will be occupied by some robot. In this paper, we study this problem for the specific case of unit-square robots moving amidst polygonal obstacles and show that it is PSPACE-hard. We also consider three additional variants of this problem and show that they are all PSPACE-hard as well. To the best of our knowledge, this is the first hardness proof for the unlabeled case. Furthermore, our proofs can be used to show that the labeled variant (where each robot is assigned with a specific target position), again, for unit-square robots, is PSPACE-hard as well, which sets another precedence, as previous hardness results require the robots to be of different shapes.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑