PSPACE-completeness of Pulling Blocks to Reach a Goal
Name
2006.04337.pdf
Description
Accepted version
Size
617.45 KB
Format
Adobe PDF
Checksum (MD5)
189ec7adec1c2c0d4e3cfe7f19bba3c4
Author(s)
Ani, Joshua
Asif, Sualeh
Demaine, Erik D
Diomidov, Yevhenii
Hendrickson, Dylan
Lynch, Jayson
Scheffler, Sarah
Suhl, Adam
Date Issued
2020
Journal
Journal of Information Processing
Publisher
Information Processing Society of Japan
Citation
Ani, Joshua, Asif, Sualeh, Demaine, Erik D, Diomidov, Yevhenii, Hendrickson, Dylan et al. 2020. "PSPACE-completeness of Pulling Blocks to Reach a Goal." Journal of Information Processing, 28 (0).
Version
Author's final manuscript
Abstract
© 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).
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.2197/IPSJJIP.28.929
