Analyzing Planner Design Trade-offs for MAPF under ADG-based Realistic Execution
Not on the map. Why?
Abstract (arXiv)
Multi-Agent Path Finding (MAPF) algorithms are increasingly deployed in industrial warehouses and automated manufacturing facilities, where robots must operate reliably under real-world physical constraints. However, existing MAPF evaluation frameworks typically rely on simplified robot models, leaving a substantial gap between algorithmic benchmarks and practical performance. Recent frameworks such as SMART combine kinodynamic modeling with execution based on the Action Dependency Graph (ADG), enabling realistic, large-scale MAPF evaluation. Building on this capability, this work investigates how key planner design choices influence performance under realistic execution settings. We systematically study three fundamental factors: (1) the relationship between solution optimality and execution performance, (2) the sensitivity of system performance to inaccuracies in kinodynamic modeling, and (3) the tradeoff between model accuracy and plan optimality. Empirically, we examine these factors to understand how these design choices affect performance in realistic scenarios. We highlight open challenges and research directions to steer the community toward practical, real-world deployment.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 11 of its 24 references that are in the map. First posted on arXiv 10 Dec 2025.
Builds on
11 of 24 references.
References · 11
- 2019Multi-Agent Pathfinding: Definitions, Variants, and Benchmarkscited by 197
- 2018Searching with Consistent Prioritization for Multi-Agent Path Findingcited by 80
- 2020EECBS: A Bounded-Suboptimal Search for Multi-Agent Path Findingcited by 67
- 2017Feasibility Study: Moving Non-Homogeneous Teams in Congested Video Game Environmentscited by 21
- 2021Pairwise Symmetry Reasoning for Multi-Agent Path Finding Searchcited by 21
- 2024Multi-Agent Motion Planning For Differential Drive Robots Through Stationary State Searchcited by 8
- 2023Multi-Agent Motion Planning with B'ezier Curve Optimization under Kinodynamic Constraintscited by 7
- 2023Bidirectional Temporal Plan Graph: Enabling Switchable Passing Orders for More Efficient Multi-Agent Path Finding Plan Executioncited by 6
- 2024Speedup Techniques for Switchable Temporal Plan Graph Optimizationcited by 6
- 2023Receding Horizon Re-ordering of Multi-Agent Execution Schedulescited by 5
- 2025Advancing MAPF Toward the Real World: A Scalable Multi-Agent Realistic Testbed (SMART)cited by 5
Built on by
Not cited yet.