Solving Multi-agent Path Finding on Strongly Biconnected Digraphs

DOI10.1613/jair.1.11212zbMath1451.68199OpenAlexW2884751904MaRDI QIDQ4580265

Pavel Surynek, Davide Bonusi, Adi Botea

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

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

Related Items (1)

Priority inheritance with backtracking for iterative multi-agent path finding

This page was built for publication: Solving Multi-agent Path Finding on Strongly Biconnected Digraphs