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

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.

Authors

• Bernhard Nebel University of Freiburg
• Thomas Bolander
• Thorsten Engesser IRIT, Toulouse, France
• Robert Mattmüller

Keywords

• Agent-based and Multi-agent Systems: Coordination and Cooperation
• Agent-based and Multi-agent Systems: Multi-agent Planning
• Planning and Scheduling: Distributed; Multi-agent Planning