arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1806.03539cs.CCcs.RO
收藏

基于简单小工具的机器人运动规划的计算复杂性

Computational Complexity of Motion Planning of a Robot through Simple Gadgets

Carnegie Mellon University(卡内基梅隆大学);Google Inc.(谷歌公司)

Erik D. Demaine, Isaac Grosof, Jayson Lynch, Mikhail Rudoy

摘要:

我们发起了一个一般的理论分析的复杂性运动规划的一个机器人通过一个图形的“小工具”,每个有自己的状态,一组位置,并允许遍历的位置之间,可以依赖于和改变的状态。这种类型的设置是常见的许多机器人运动规划硬度证明。我们描述了一个自然简单的情况下的复杂性:每个小工具连接到四个位置在一个完美的匹配(但每个方向可以遍历或不在当前状态),有一个或两个状态,每个小工具遍历是立即撤消,小工具的位置连接的总是遍历的森林,可能限制,以避免在平面上的交叉。具体来说,我们表明,任何一个非平凡的四个位置的两个状态的小工具类型是足够的运动规划成为PSPACE完整的,而任何一组简单的小工具(有效地两个位置或一个状态)有一个多项式时间的运动规划算法。作为一个示例应用程序,我们的结果表明,运动规划游戏与“纺纱”是PSPACE完整的,建立一个新的硬方面塞尔达:甲骨文的季节。

英文摘要:

We initiate a general theory for analyzing the complexity of motion planning of a single robot through a graph of "gadgets", each with their own state, set of locations, and allowed traversals between locations that can depend on and change the state. This type of setup is common to many robot motion planning hardness proofs. We characterize the complexity for a natural simple case: each gadget connects up to four locations in a perfect matching (but each direction can be traversable or not in the current state), has one or two states, every gadget traversal is immediately undoable, and that gadget locations are connected by an always-traversable forest, possibly restricted to avoid crossings in the plane. Specifically, we show that any single nontrivial four-location two-state gadget type is enough for motion planning to become PSPACE-complete, while any set of simpler gadgets (effectively two-location or one-state) has a polynomial-time motion planning algorithm. As a sample application, our results show that motion planning games with "spinners" are PSPACE-complete, establishing a new hard aspect of Zelda: Oracle of Seasons.

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

↑