Solving multi-agent path finding on strongly biconnected digraphs

DOI10.1613/JAIR.1.11212MaRDI QIDQ4580265zbMATH OpenOpenAlexFDO

Authors Adi Botea, Davide Bonusi, Pavel Surynek

Publication date 14 August 2018

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

Full work available at URL https://doi.org/10.1613/jair.1.11212

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Agent technology and artificial intelligence (68T42)

Recommendations

• Push and rotate: a complete multi-agent pathfinding algorithm
• Multi-agent pathfinding with \(n\) agents on graphs with \(n\) vertices: combinatorial classification and tight algorithmic bounds
• Conflict-based search for optimal multi-agent pathfinding
• scientific article; zbMATH DE number 5959974
• Pairwise symmetry reasoning for multi-agent path finding search

Cited in

(8)

• Push and rotate: a complete multi-agent pathfinding algorithm
• Multi-agent pathfinding with \(n\) agents on graphs with \(n\) vertices: combinatorial classification and tight algorithmic bounds
• Constrained motion planning and multi-agent path finding on directed graphs
• Continuous optimisation problem and game theory for multi-agent pathfinding
• Path-based depth-first search for strong and biconnected components
• Priority inheritance with backtracking for iterative multi-agent path finding
• The snow team problem (clearing directed subgraphs by mobile agents)
• The computational complexity of multi-agent pathfinding on directed graphs

This page was built for publication: Solving multi-agent path finding on strongly biconnected digraphs

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