Multi-Agent Path Finding

Also known as MAPF

Overview

Multi-agent path finding studies how to route agents to their goals without collisions, often minimizing travel cost or completion time; in lifelong settings, agents repeatedly receive new tasks. Classical methods include Conflict-Based Search and space-time search for high-quality or optimal plans, while prioritized planning, PIBT, and LaCAM trade some solution quality for scalability. Other approaches use learning, local communication, optimization, or hybrid methods that combine fast planning with conflict repair, and many now address task assignment, congestion, and execution on real robots. A central tension is balancing guarantees and realistic motion or disturbances against the speed and scale needed for dense fleets.

Latest papers

CardsList

100 papers13 papers in the last four weeks, up 44% on the four weeks before. 0.1% of all new papers.

  1. LSRP*: Scalable and Anytime Planning for Multi-Agent Path Finding with Asynchronous Actions

    Nov 7, 2026Dachuan Liu, Shuai Zhou, Shizhe Zhao +1Multi-Agent Path Finding

  2. Travel Cost Calibration for Multi-Agent Target Assignment and Pathfinding

    Nov 6, 2026Yu Kumagai, Ryohei Banno, Keisuke OkumuraMulti-Agent Path FindingMulti-Robot Task Allocation

  3. Local Visibility Roadmaps in Continous Multi-agent Path Finding

    Nov 3, 2026Kristýna Janovská, Pavel SurynekMulti-Agent Path FindingMotion Planning

  4. Late Autumn: LLM Agents Specialize a General Multi-Robot Planner for One Warehouse

    Nov 2, 2026Yimin Tang, Han Zhang, Shao-Hung Chan +3Multi-Robot Motion PlanningLarge Language Model-Guided Optimization

  5. Local Solution Repair for Multi-Agent Pickup and Delivery

    Nov 1, 2026Ethan Schneider, Jingkai Chen, Seth Hutchinson +1Multi-Agent PlanningRobotics

  6. A Hyper-Logical View on Multi-Agent Path Planning

    Oct 25, 2026Hadar Frenkel, Dor AtzmonMulti-Agent Path Finding

  7. Bidirectionality is Necessary in Cellular Machines for Exact-Arrival Multi-Agent Path Finding

    Oct 19, 2026Masashi AonoMulti-Agent Path FindingCellular Automata

  8. A GPU-Resident Pipeline for Multi-Robot 3D Inspection with Limited Perception

    Oct 19, 2026Kryštof Pšenička, Stefan EdelkampRobotic InspectionMulti-Robot Motion Planning

  9. Map-Distribution Mixture-of-Experts for Multi-Agent Pathfinding

    Oct 19, 2026Fumimaro Suzuki, Keisuke OkumuraMulti-Agent Path FindingMixture-of-Experts Models

  10. Policy Search in Code Space for Multi-Agent Pathfinding

    Oct 19, 2026Matthias Eder, Pantelis Emmanouil, Vivek Farias +7Multi-Agent Path FindingProgram Synthesis

  11. CARVS: A Congestion-Aware Algorithm for Online Multi-Agent Pickup-and-Delivery in Human-Collaborative Warehouses

    Oct 17, 2026Chaoran Li, Zeyuan Zhao, Shao ZhangMulti-Agent Path FindingRobotics

  12. The Cost of Classical Multi-Agent Path Finding

    Oct 7, 2026Alvin Combrink, Sabino Francesco Roselli, Martin FabianMulti-Agent Path FindingGraph-Based Planning

  13. Shared-Roadmap Generation and Evaluator for Multi-Agent Path Planning Using Heterogeneous Graph Neural Network

    Oct 6, 2026Brandon Ho, Nikola Rogers, Seung-Kyum ChoiMulti-Agent PlanningMulti-Agent Path Finding

  14. Training-Free Diffusion Planning with Analytical Local Scores

    Oct 1, 2026Michael Y. Fatemi, Jinhao Liang, Ferdinando FiorettoMulti-Robot Motion PlanningConstrained Motion Planning

  15. Belief-Aware Multi-Agent Path Finding under Map Uncertainty

    Sep 30, 2026Viraj Parimi, Shao-Hung Chan, Han Zhang +2Belief-Space PlanningGaussian Belief Propagation

  16. GuardPIBT: Counterfactually Gated Neural Guidance for Ultra-Large-Scale 3D Multi-Agent Path Finding

    Sep 28, 2026Yuan Zhou, Zhenyu Hou, Guangtong Xu +4Graph-Based PlanningMulti-Agent Path Finding

  17. Collision-free Movement on Grids and Beyond

    Sep 25, 2026Hendrik Molter, Meirav ZehaviMulti-Robot Motion PlanningMulti-Agent Path Finding

  18. TRACS: A Geometry-Aware Framework for Scalable Multi-Agent Path Finding in Warehouses

    Sep 19, 2026Siddhant Erande, Anuj TiwariMulti-Agent Path FindingMotion Planning

  19. ITA-LaCAM: A Complete and Scalable TAPF Solver via Assignment-Aware Configuration-Space Search

    Sep 13, 2026Yimin Tang, Han Zhang, Shao-Hung Chan +4Multi-Agent Path FindingMulti-Robot Task Allocation

  20. Hierarchical Belief Modeling for Zero-Shot Opponent Adaptation in Partially Observable Multi-Agent Navigation

    Sep 11, 2026Kowei Shih, Lu Cheng, Zeyu Wang +2Opponent ModelingPartially Observable RL

  21. A traffic management system for large and heterogeneous vehicles in narrow industrial environments

    Sep 9, 2026Alessandro Bonetti, Silvia Proia, Simone Guidetti +1Robot NavigationRobust MAPF

  22. HiRAD: A Flexible Large-Scale AGV Routing System

    Sep 9, 2026Yunjie Huang, Ruizhong Wu, Mengxuan Zhang +3Hierarchical RLVehicle Routing

  23. Graph-Based Safe Reinforcement Learning for Multi-Agent Systems with Time-Varying Topology

    Sep 8, 2026Xiao Sizhe, Dong Lijing, Bai Rui +1Multi-Robot CoordinationSafe RL

  24. Eventually Optimal and Scalable Multi-Agent Planning for Block Cave Mining

    Sep 7, 2026Christopher Leet, Paolo Forte, Uwe Köckemann +2Multi-Agent PlanningMulti-Robot Task Allocation

  25. 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