mlsanityData to 14 Oct 2026

QD-MAPPER: A Quality Diversity Framework to Automatically Evaluate Multi-Agent Path Finding Algorithms in Diverse Maps

arXiv 2409.06888 ↗First posted 10 Sep 2024cs.MA cs.AIcited by 1

Not on the map. Why?

Abstract (arXiv)

We use the Quality Diversity (QD) algorithm with Neural Cellular Automata (NCA) to automatically evaluate Multi-Agent Path Finding (MAPF) algorithms by generating diverse maps. Previously, researchers typically evaluate MAPF algorithms on a set of specific, human-designed maps at their initial stage of algorithm design. However, such fixed maps may not cover all scenarios, and algorithms may overfit to the small set of maps. To seek further improvements, systematic evaluations on a diverse suite of maps are needed. In this work, we propose Quality-Diversity Multi-Agent Path Finding Performance EvaluatoR (QD-MAPPER), a general framework that takes advantage of the QD algorithm to comprehensively understand the performance of MAPF algorithms by generating maps with patterns, be able to make fair comparisons between two MAPF algorithms, providing further information on the selection between two algorithms and on the design of the algorithms. Empirically, we employ this technique to evaluate and compare the behavior of different types of MAPF algorithms, including search-based, priority-based, rule-based, and learning-based algorithms. Through both single-algorithm experiments and comparisons between algorithms, researchers can identify patterns that each MAPF algorithm excels and detect disparities in runtime or success rates between different algorithms.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 19 of its 48 references that are in the map. First posted on arXiv 10 Sep 2024.

Builds on

19 of 48 references.

References · 19

  1. 2016The CMA Evolution Strategy: A Tutorialcited by 377
  2. 2019Multi-Agent Pathfinding: Definitions, Variants, and Benchmarkscited by 199
  3. 2019Paired Open-Ended Trailblazer (POET): Endlessly Generating Increasingly Complex and Diverse Learning Environments and Their Solutionscited by 192
  4. 2018PRIMAL: Pathfinding via Reinforcement and Imitation Multi-Agent Learningcited by 90
  5. 2018Searching with Consistent Prioritization for Multi-Agent Path Findingcited by 81
  6. 2020EECBS: A Bounded-Suboptimal Search for Multi-Agent Path Findingcited by 68
  7. 2019Priority Inheritance with Backtracking for Iterative Multi-agent Path Findingcited by 57
  8. 2020Illuminating Mario Scenes in the Latent Space of a Generative Adversarial Networkcited by 52
  9. 2022Deep Surrogate Assisted Generation of Environmentscited by 40
  10. 2021On the Importance of Environments in Human-Robot Coordinationcited by 37
  11. 2023SCRIMP: Scalable Communication for Reinforcement- and Imitation-Learning-Based Multi-Agent Pathfindingcited by 37
  12. 2023Learn to Follow: Decentralized Lifelong Multi-agent Pathfinding via Planning and Learningcited by 29
7 more
  1. 2017Feasibility Study: Moving Non-Homogeneous Teams in Congested Video Game Environmentscited by 22
  2. 2023Multi-Robot Coordination and Layout Design for Automated Warehousingcited by 17
  3. 2014MAPP: a Scalable Multi-Agent Path Planning Algorithm with Tractability and Completeness Guaranteescited by 15
  4. 2023Arbitrarily Scalable Environment Generators via Neural Cellular Automatacited by 9
  5. 2023Surrogate Assisted Generation of Human-Robot Interaction Scenarioscited by 8
  6. 2021Coordinated Multi-Agent Pathfinding for Drones and Trucks over Road Networkscited by 6
  7. 2024Accelerating Search-Based Planning for Multi-Robot Manipulation by Leveraging Online-Generated Experiencescited by 4

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.