PSPACE-completeness of Pulling Blocks to Reach a Goal

PSPACE-completeness of Pulling Blocks to Reach a Goal

© 2020 Information Processing Society of Japan. 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...

Full description

Bibliographic Details
Main Authors: Ani, Joshua, Asif, Sualeh, Demaine, Erik D, Diomidov, Yevhenii, Hendrickson, Dylan, Lynch, Jayson, Scheffler, Sarah, Suhl, Adam
Other Authors: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Format: Article
Language:English
Published: Information Processing Society of Japan 2022
Online Access:https://hdl.handle.net/1721.1/143957
Description
Summary:© 2020 Information Processing Society of Japan. 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).

Similar Items