Implicitly Coordinated Multi-Agent Path Finding under Destination Uncertainty: Success Guarantees and Computational Complexity

DOI10.1613/jair.1.11376zbMath1477.68320OpenAlexW2920403620MaRDI QIDQ3120432

Thorsten Engesser, Thomas Bolander, Robert Mattmüller, Bernhard Nebel

Publication date: 4 March 2019

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

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

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Agent technology and artificial intelligence (68T42)

Related Items (3)

Complexity of planning for connected agents in a partially known environment ⋮ Unnamed Item ⋮ Hybrid-order Network Consensus for Distributed Multi-agent Systems

This page was built for publication: Implicitly Coordinated Multi-Agent Path Finding under Destination Uncertainty: Success Guarantees and Computational Complexity