[2603.28803] CREST: Constraint-Release Execution for Multi-Robot Warehouse Shelf Rearrangement
About this article
Abstract page for arXiv paper 2603.28803: CREST: Constraint-Release Execution for Multi-Robot Warehouse Shelf Rearrangement
Computer Science > Robotics arXiv:2603.28803 (cs) [Submitted on 27 Mar 2026] Title:CREST: Constraint-Release Execution for Multi-Robot Warehouse Shelf Rearrangement Authors:Jiaqi Tan, Yudong Luo, Sophia Huang, Yifan Yang, Hang Ma View a PDF of the paper titled CREST: Constraint-Release Execution for Multi-Robot Warehouse Shelf Rearrangement, by Jiaqi Tan and 4 other authors View PDF HTML (experimental) Abstract:Double-Deck Multi-Agent Pickup and Delivery (DD-MAPD) models the multi-robot shelf rearrangement problem in automated warehouses. MAPF-DECOMP is a recent framework that first computes collision-free shelf trajectories with a MAPF solver and then assigns agents to execute them. While efficient, it enforces strict trajectory dependencies, often leading to poor execution quality due to idle agents and unnecessary shelf switching. We introduce CREST, a new execution framework that achieves more continuous shelf carrying by proactively releasing trajectory constraints during execution. Experiments on diverse warehouse layouts show that CREST consistently outperforms MAPF-DECOMP, reducing metrics related to agent travel, makespan, and shelf switching by up to 40.5\%, 33.3\%, and 44.4\%, respectively, with even greater benefits under lift/place overhead. These results underscore the importance of execution-aware constraint release for scalable warehouse rearrangement. Code and data are available at this https URL. Subjects: Robotics (cs.RO); Artificial Intelligence (cs.AI)...