论文信息 - Some Thoughts on Forward Induction in Multi-Agent-Path Finding Under Destination Uncertainty

Some Thoughts on Forward Induction in Multi-Agent-Path Finding Under Destination Uncertainty

While the notion of implicit coordination helps to design frameworks in which agents can cooperatively act with only minimal communication, it so far lacks exploiting observations made while executing a plan. In this note, we have a look at what can be done in order to overcome this shortcoming, at least in a specialized setting.

Bernhard Nebel

[1] Hector Geffner,et al. Plan Recognition as Planning , 2009, IJCAI.

[2] Manfred K. Warmuth,et al. Finding a Shortest Solution for the N × N Extension of the 15-PUZZLE Is Intractable , 1986, AAAI.

[3] N. S. Sridharan,et al. The Plan Recognition Problem: An Intersection of Psychology and Artificial Intelligence , 1978, Artif. Intell..

[4] Pierpaolo Battigalli,et al. Strong Belief and Forward Induction Reasoning , 2002, J. Econ. Theory.

[5] Bernhard Nebel,et al. Cooperative Epistemic Multi-Agent Planning for Implicit Coordination , 2017, M4M@ICLA.

[6] Bernhard Nebel,et al. Implicitly Coordinated Multi-Agent Path Finding under Destination Uncertainty: Success Guarantees and Computational Complexity , 2019, J. Artif. Intell. Res..

[7] Paul G. Spirakis,et al. Coordinating Pebble Motion on Graphs, the Diameter of Permutation Groups, and Applications , 2015, FOCS.

[8] Bernhard Nebel,et al. Better Eager Than Lazy? How Agent Types Impact the Successfulness of Implicit Coordination , 2018, KR.