Implicitly Coordinated Multi-Agent Path Finding under Destination Uncertainty: Success Guarantees and Computational Complexity (Extended Abstract)
Implicitly Coordinated Multi-Agent Path Finding under Destination Uncertainty: Success Guarantees and Computational Complexity (Extended Abstract)
Bernhard Nebel, Thomas Bolander, Thorsten Engesser, Robert Mattmüller
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence
Journal track. Pages 6372-6376.
https://doi.org/10.24963/ijcai.2019/890
In multi-agent path finding, it is usually
assumed that planning is performed centrally and
that the destinations of the agents are common
knowledge. We will drop both assumptions and analyze under which conditions it can be guaranteed
that the agents reach their respective destinations
using implicitly coordinated plans without communication.
Keywords:
Planning and Scheduling: Distributed;Multi-agent Planning
Agent-based and Multi-agent Systems: Coordination and Cooperation
Agent-based and Multi-agent Systems: Multi-agent Planning