# Overview: Generalizations of Multi-Agent Path Finding to Real-World Scenarios

arXiv: https://arxiv.org/abs/1702.05515 · HTML: https://mlsanity.com/paper/1702.05515/

## Key facts

- Cited by 11 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 17 Feb 2017.

## Built on by (most cited first, 11 of 11)

- [Cooperative Multi-Agent Path Finding: Beyond Path Planning and Collision Avoidance](https://mlsanity.com/paper/2105.10993/) (2021)
- [Graph-Based Multi-Robot Path Finding and Planning](https://mlsanity.com/paper/2206.11319/) (2022)
- [Standby-Based Deadlock Avoidance Method for Multi-Agent Pickup and Delivery Tasks](https://mlsanity.com/paper/2201.06014/) (2022)
- [The Multi-Agent Pickup and Delivery Problem: MAPF, MARL and Its Warehouse Applications](https://mlsanity.com/paper/2203.07092/) (2022)
- [DPLL(MAPF): an Integration of Multi-Agent Path Finding and SAT Solving Technologies](https://mlsanity.com/paper/2111.06494/) (2021)
- [Decentralised Approach for Multi Agent Path Finding](https://mlsanity.com/paper/2106.05188/) (2021)
- [An Efficient Approach to the Online Multi-Agent Path Finding Problem by Using Sustainable Information](https://mlsanity.com/paper/2301.04446/) (2023)
- [Counterexample Guided Abstraction Refinement with Non-Refined Abstractions for Multi-Agent Path Finding](https://mlsanity.com/paper/2301.08687/) (2023)
- [MASP: Scalable GNN-based Planning for Multi-Agent Navigation](https://mlsanity.com/paper/2312.02522/) (2023)
- [Unassigned Agents in Compilation-based Multi-agent Path Finding](https://mlsanity.com/paper/2606.15797/) (2026)
- [Pivot-and-Station Multi-Agent Path Finding: Solvability, Complexity, and Algorithms](https://mlsanity.com/paper/2608.24585/) (2026)

## Abstract (arXiv)

Multi-agent path finding (MAPF) is well-studied in artificial intelligence, robotics, theoretical computer science and operations research. We discuss issues that arise when generalizing MAPF methods to real-world scenarios and four research directions that address them. We emphasize the importance of addressing these issues as opposed to developing faster methods for the standard formulation of the MAPF problem.