Puzzle‐based storage systems

Abstract : We introduce and develop models for a physical goods storage system based on the 15-puzzle, a classic children's game in which 15 numbered tiles slide within a 4 x 4 grid. The objective of the game is to arrange the tiles in numerical sequence, starting from a random arrangement. For our purposes, the tiles represent totes, pallets, or even containers that must be stored very densely, and the objective is to maneuver items to an input-output point for retrieval or processing. We develop analytical results for storage configurations having a single empty location (as in the game) and experimental results for configurations with multiple empty locations. Designs with many empty locations can be made to form aisles, allowing us to compare puzzle-based designs with traditional aisle-based designs found in warehousing systems.

[1]  J. Schwartz,et al.  On the Complexity of Motion Planning for Multiple Independent Objects; PSPACE- Hardness of the "Warehouseman's Problem" , 1984 .

[2]  Patric R. J. Östergård,et al.  On sliding block puzzles , 2000 .

[3]  Jerry Slocum,et al.  The 15 Puzzle , 2006 .

[4]  John Tromp,et al.  Limits of Rush Hour Logic Complexity , 2005, ArXiv.

[5]  Tait.  2. Note on the Theory of the “15 Puzzle”. , 1880 .

[6]  Alexander Reinefeld,et al.  Complete Solution of the Eight-Puzzle and the Benefit of Node Ordering in IDA , 1993, IJCAI.

[7]  Manfred K. Warmuth,et al.  NxN Puzzle and Related Relocation Problem , 1990, J. Symb. Comput..

[8]  Kevin R. Gue,et al.  Very high density storage systems , 2006 .

[9]  Erik D. Demaine,et al.  PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation , 2002, Theor. Comput. Sci..

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

[11]  Gary William Flake,et al.  Rush Hour is PSPACE-complete, or "Why you should generously tip parking lot attendants" , 2002, Theoretical Computer Science.

[12]  Samuel Loyd,et al.  Mathematical Puzzles of Sam Loyd , 1959 .

[13]  Ralph Udo Gasser,et al.  Harnessing computational resources for efficient exhaustive search , 1995 .

[14]  Ian Parberry.  A Real-Time Algorithm for the (n²-1)-Puzzle , 1995, Inf. Process. Lett..

[15]  W. W. Johnson,et al.  Notes on the "15" Puzzle , 1879 .

[16]  Manfred K. Warmuth,et al.  Finding a Shortest Solution for the N × N Extension of the 15-PUZZLE Is Intractable , 1986, AAAI.