SOKOBAN and other motion planning problems

DOI10.1016/S0925-7721(99)00017-6zbMath0948.68205WikidataQ60299175 ScholiaQ60299175MaRDI QIDQ1818116

Dorit Dor, Uri Zwick

Publication date: 4 January 2000

Published in: Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

motion planning problems

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10)

Related Items (10)

\textsc{Pull} and \textsc{PushPull} are PSPACE-complete ⋮ Push-Pull Block Puzzles are Hard ⋮ Assembling molecules in ATOMIX is hard ⋮ Pushing blocks is hard. ⋮ Particle computation: complexity, algorithms, and logic ⋮ A genetic algorithm for the zen puzzle garden game ⋮ Sokoban: Enhancing general single-agent search methods using domain knowledge ⋮ On reachability in graphs with obstacles ⋮ Sokoban: Improving the search with relevance cuts ⋮ LaserTank is NP-Complete

This page was built for publication: SOKOBAN and other motion planning problems