Bulk search for optimally solving two variants of anonymous multi-agent pathfinding

DOI10.1613/JAIR.1.19379MaRDI QIDQ7307272zbMATH OpenFDO

Authors Zain Alabedeen Ali, Konstantin Yakovlev

Publication date 31 July 2026

Published in The Journal of Artificial Intelligence Research (JAIR) (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1613/JAIR.1.19379

Mathematics Subject Classification ID

Agent technology and artificial intelligence (68T42) Discrete location and assignment (90B80)

Cites work

• A heuristic search algorithm with modifiable estimate
• A survey for the quadratic assignment problem
• A survey of algorithms for the generalized assignment problem
• A survey on exact algorithms for the maximum flow and minimum‐cost flow problems
• AND/OR graph heuristic search methods
• Assignment problems: a golden anniversary survey
• Conflict-based search for optimal multi-agent pathfinding
• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• Inconsistent heuristics in theory and practice
• Maximal Flow Through a Network
• Minimum-cost flows in unit-capacity networks
• Network flows. Theory, algorithms, and applications.
• On Kuhn's Hungarian Method?A tribute from Hungary
• On some techniques useful for solution of transportation network problems
• On the bottleneck assignment problem
• On the complexity of admissible search algorithms
• Priority inheritance with backtracking for iterative multi-agent path finding
• Subdimensional expansion for multirobot path planning
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

This page was built for publication: Bulk search for optimally solving two variants of anonymous multi-agent pathfinding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7307272)