New Multi-Robot Algorithm for High-Density Puzzle-Based Storage

A recent study published on arXiv (2608.07734) presents a multi-robot strategy for tackling the ordered storage and retrieval challenge in puzzle-based storage (PBS) systems at maximum capacity. These automated warehouses enhance storage efficiency by removing aisles, yet coordinating robots in such dense environments poses significant computational difficulties, particularly with the risk of deadlocks. The research emphasizes rectangular grids accessible from one edge, where items are stored to capacity before being retrieved in a predetermined sequence. A notable innovation is an online, prioritized multi-agent path-finding algorithm that utilizes the advantages of relocation-free setups to connect geometric feasibility with execution efficiency. This research effectively addresses the critical balance between storage density and retrieval speed, providing a robust and scalable solution for automated warehouses.