论文标题
Pspace的拉动块完全完整达到目标
PSPACE-completeness of Pulling Blocks to Reach a Goal
论文作者
论文摘要
我们证明了除一个问题外，除了一个问题的pspace完整性，在大量拉动障碍问题中，目标是代理到达目标目的地的目标。通过拉动是可选的，可以同时拉动的块数，是否有固定的块还是薄壁，以及是否有重力来解决问题。我们显示剩余问题的NP硬度，拉动？-1fg（可选拉动，强度1，固定块，带有重力）。
We prove PSPACE-completeness of all but one problem in a large space of pulling-block problems where the goal is for the agent to reach a target destination. The problems are parameterized by whether pulling is optional, the number of blocks which can be pulled simultaneously, whether there are fixed blocks or thin walls, and whether there is gravity. We show NP-hardness for the remaining problem, Pull?-1FG (optional pulling, strength 1, fixed blocks, with gravity).
