mlsanityData to 7 Oct 2026

Lifelong Scalable Multi-Agent Realistic Testbed and A Comprehensive Study on Design Choices in Lifelong AGV Fleet Management Systems

arXiv 2602.15721 ↗First posted 17 Feb 2026cs.RO cs.AIcited by 1

Not on the map. Why?

Abstract (arXiv)

We present Lifelong Scalable Multi-Agent Realistic Testbed (LSMART), an open-source simulator to evaluate any Multi-Agent Path Finding (MAPF) algorithm in a Fleet Management System (FMS) with Automated Guided Vehicles (AGVs). MAPF aims to move a group of agents from their corresponding starting locations to their goals. Lifelong MAPF (LMAPF) is a variant of MAPF that continuously assigns new goals for agents to reach. LMAPF applications, such as autonomous warehouses, often require a centralized, lifelong system to coordinate the movement of a fleet of robots, typically AGVs. However, existing works on MAPF and LMAPF often assume simplified kinodynamic models, such as pebble motion, as well as perfect execution and communication for AGVs. Prior work has presented SMART, a software capable of evaluating any MAPF algorithms while considering agent kinodynamics, communication delays, and execution uncertainties. However, SMART is designed for MAPF, not LMAPF. Generalizing SMART to an FMS requires many more design choices. First, an FMS parallelizes planning and execution, raising the question of when to plan. Second, given planners with varying optimality and differing agent-model assumptions, one must decide how to plan. Third, when the planner fails to return valid solutions, the system must determine how to recover. In this paper, we first present LSMART, an open-source simulator that incorporates all these considerations to evaluate any MAPF algorithms in an FMS. We then provide experiment results based on state-of-the-art methods for each design choice, offering guidance on how to effectively design centralized lifelong AGV Fleet Management Systems. LSMART is available at https://smart-mapf.github.io/lifelong-smart.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 12 of its 25 references that are in the map. First posted on arXiv 17 Feb 2026.

Builds on

12 of 25 references.

References · 12

  1. 2019Multi-Agent Pathfinding: Definitions, Variants, and Benchmarkscited by 197
  2. 2018Searching with Consistent Prioritization for Multi-Agent Path Findingcited by 80
  3. 2019Priority Inheritance with Backtracking for Iterative Multi-agent Path Findingcited by 55
  4. 2023Multi-Robot Coordination and Layout Design for Automated Warehousingcited by 17
  5. 2023Traffic Flow Optimisation for Lifelong Multi-Agent Path Findingcited by 14
  6. 2019Idle Time Optimization for Target Assignment and Path Finding in Sortation Centerscited by 13
  7. 2024Multi-Agent Motion Planning For Differential Drive Robots Through Stationary State Searchcited by 8
  8. 2023Bidirectional Temporal Plan Graph: Enabling Switchable Passing Orders for More Efficient Multi-Agent Path Finding Plan Executioncited by 6
  9. 2024Speedup Techniques for Switchable Temporal Plan Graph Optimizationcited by 6
  10. 2025Advancing MAPF Toward the Real World: A Scalable Multi-Agent Realistic Testbed (SMART)cited by 5
  11. 2024A Real-Time Rescheduling Algorithm for Multi-robot Plan Executioncited by 4
  12. 2025Destination-to-Chutes Task Mapping Optimization for Multi-Robot Coordination in Robotic Sorting Systemscited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.