cs.RONov 1, 2026

Local Solution Repair for Multi-Agent Pickup and Delivery

Authors: Ethan Schneider, Jingkai Chen, Seth Hutchinson, Sonia Chernova

Organizations: Institute of Robotics and Intelligent Machines, Georgia Institute of Technology, Atlanta, GA 30332, USA · Symbotic Inc., Wilmington, MA 01887, USA · Northeastern University, Boston, MA 02115, USA

Abstract

Multi-robot systems in automated warehouses must efficiently attend to a constant stream of pickup-and-delivery tasks while avoiding collisions. Existing Multi-Agent Pickup-and-Delivery (MAPD) solutions generate plans that are globally feasible but often locally inefficient. In large-scale, long-horizon deployments, these inefficiencies, such as robots backtracking from target goal locations and idling in congested areas, accumulate over time and degrade performance. This paper contributes Local Solution Repair (LSR), a goal replanning approach that detects suboptimal behaviors at run-time and locally improves plans to reduce conflict between agents. We demonstrate the utility of our approach by repairing solutions generated by state-of-the-art MAPD baselines, M2M and LNS-PBS. Our results in long-horizon warehouse simulations over three environments show upwards of 5.9% improvement in task throughput over current state-of-the-art methods by reducing the number of suboptimal instances by ~36k or by 14.6% with minor additional computation time.

Figures & tables

Explore similar work

CardsList
  1. Many-to-Many Multi-Agent Pickup and Delivery

    May 8, 2026Ethan Schneider, Jingkai Chen, Tianyi Gu +3Multi-Agent System OptimizationMulti-Robot Task Allocation

  2. Dynamic Multi-Agent Pickup and Delivery in Robotic Cellular Warehousing Systems

    Jun 4, 2026Cheng Ren, Ming Li, Xinping Guan +1Multi-Agent CoordinationRobotics

  3. Dynamic Haven Selection for Multi-Agent Pickup and Delivery in Constrained Warehouses

    Aug 27, 2026Taisei Hirayama, Kohei Yoshida, Hiroki Sakaji +1Multi-Agent PlanningMulti-Agent Path Finding