| dc.contributor.author | Ani, Joshua | |
| dc.contributor.author | Asif, Sualeh | |
| dc.contributor.author | Demaine, Erik D | |
| dc.contributor.author | Diomidov, Yevhenii | |
| dc.contributor.author | Hendrickson, Dylan | |
| dc.contributor.author | Lynch, Jayson | |
| dc.contributor.author | Scheffler, Sarah | |
| dc.contributor.author | Suhl, Adam | |
| dc.date.accessioned | 2022-07-22T14:14:50Z | |
| dc.date.available | 2022-07-22T14:14:50Z | |
| dc.date.issued | 2020 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/143957 | |
| dc.description.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). | en_US |
| dc.language.iso | en | |
| dc.publisher | Information Processing Society of Japan | en_US |
| dc.relation.isversionof | 10.2197/IPSJJIP.28.929 | en_US |
| dc.rights | Creative Commons Attribution-Noncommercial-Share Alike | en_US |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/4.0/ | en_US |
| dc.source | arXiv | en_US |
| dc.title | PSPACE-completeness of Pulling Blocks to Reach a Goal | en_US |
| dc.type | Article | en_US |
| dc.identifier.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). | |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | |
| dc.contributor.department | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory | |
| dc.relation.journal | Journal of Information Processing | en_US |
| dc.eprint.version | Author's final manuscript | en_US |
| dc.type.uri | http://purl.org/eprint/type/JournalArticle | en_US |
| eprint.status | http://purl.org/eprint/status/PeerReviewed | en_US |
| dc.date.updated | 2022-07-22T14:09:50Z | |
| dspace.orderedauthors | Ani, J; Asif, S; Demaine, ED; Diomidov, Y; Hendrickson, D; Lynch, J; Scheffler, S; Suhl, A | en_US |
| dspace.date.submission | 2022-07-22T14:09:52Z | |
| mit.journal.volume | 28 | en_US |
| mit.journal.issue | 0 | en_US |
| mit.license | OPEN_ACCESS_POLICY | |
| mit.metadata.status | Authority Work and Publication Information Needed | en_US |
