Abstract
In multi-agent path finding (MAPF), 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.
Cite
CITATION STYLE
Nebel, B., Bolander, T., Engesser, T., & Mattmüller, R. (2019). Implicitly coordinated multi-agent path finding under destination uncertainty: Success guarantees and computational complexity (extended abstract). In IJCAI International Joint Conference on Artificial Intelligence (Vol. 2019-August, pp. 6372–6376). International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2019/890
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
