论文信息 - The box mover problem

The box mover problem

We show that the optimization problem is NP-hard for a wide class of motion planning puzzles, including classical SOKOBAN. We investigate a new problem, the Box Mover Problem (BMP), in which the agent is allowed to lift and carry boxes on a rectilinear grid in order to rearrange them. Some classical motion planning puzzles are special cases of BMP. We also identify a natural class of BMP instances, for which optimization is in NP, making the optimization problems from the class NP-complete.

Valentin Polishchuk

[1] Erik D. Demaine,et al. The Nondeterministic Constraint Logic Model of Computation: Reductions and Applications , 2002, ICALP.

[2] Joseph Culberson,et al. Sokoban is PSPACE-complete , 1997 .

[3] Erik D. Demaine,et al. PushPush and Push-1 are NP-hard in 2D , 2000, CCCG.

[4] N. S. Barnett,et al. Private communication , 1969 .

[5] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[6] Uri Zwick,et al. SOKOBAN and other motion planning problems , 1999, Comput. Geom..

[7] Erik D. Demaine,et al. Pushing blocks is hard , 2003, Comput. Geom..

[8] Michael Hoffmann,et al. Pushing blocks is np-complete for noncrossing solution paths , 2001, CCCG.

[9] Michael Hoffmann,et al. Push-2-f is pspace-complete , 2002, CCCG.