论文标题
k色盘的多机器人运动计划是pspace-hard
Multi-robot motion planning of k-colored discs is PSPACE-hard
论文作者
论文摘要
在多机器人运动计划的问题中，一组放置在具有障碍物的多边形域中的机器人必须从其起始位置移动到一组目标位置。我们考虑了两种不同尺寸的未标记碟片机器人的特定情况。也就是说，在一类机器人中，该类别由机器人的大小给出，任何机器人都可以移动到任何相应的目标位置。我们证明，是否存在将机器人转移到目标位置的时间表的决策问题是Pspace-Hard。
In the problem of multi-robot motion planning, a group of robots, placed in a polygonal domain with obstacles, must be moved from their starting positions to a set of target positions. We consider the specific case of unlabeled disc robots of two different sizes. That is, within one class of robots, where a class is given by the robots' size, any robot can be moved to any of the corresponding target positions. We prove that the decision problem of whether there exists a schedule moving the robots to the target positions is PSPACE-hard.
