Abstract
Coordination in multi-agent systems with partial and non-uniform observability is a practically challenging problem. We use Monte-Carlo tree search as the basis of an implicitly coordinated epistemic planning algorithm which is capable of using the knowledge distributed among the agents to find solutions in problems even with a large branching factor. We use Dynamic Epistemic Logic to represent the knowledge and the actual situation as a state of the Monte-Carlo tree search, and epistemic planning to formalize the goals and actions of a problem. Further, we describe the required modifications of the Monte-Carlo tree search when searching over epistemic states, and make use of the cooperative card game Hanabi to test our planner on larger problems. We find that the approach scales to games with up to eight cards while maintaining high playing strength.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Bard, N., et al.: The Hanabi challenge: a new frontier for AI research. CoRR abs/1902.00506 (2019)
Bolander, T., Andersen, M.B.: Epistemic planning for single and multi-agent systems. J. Appl. Non-classical Logics 21(1), 9–34 (2011)
Bolander, T., Engesser, T., Mattmüller, R., Nebel, B.: Better eager than lazy? How agent types impact the successfulness of implicit coordination. In: Proceedings of the Sixteenth International Conference on Principles of Knowledge Representation and Reasoning (KR), pp. 445–453 (2018)
Chaslot, G.M.J.B., Winands, M.H.M., van den Herik, H.J., Uiterwijk, J.W.H.M., Bouzy, B.: Progressive strategies for Monte-Carlo tree search. New Math. Nat. Comput. 4(3), 343–357 (2008)
Coulom, R.: Efficient selectivity and backup operators in Monte-Carlo tree search. In: van den Herik, H.J., Ciancarini, P., Donkers, H.H.L.M.J. (eds.) CG 2006. LNCS, vol. 4630, pp. 72–83. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-75538-8_7
van Ditmarsch, H., van der Hoek, W., Kooi, B.: Dynamic Epistemic Logic. SYLI, vol. 337. Springer, Berlin (2008). Synthese Library
Engesser, T., Bolander, T., Mattmüller, R., Nebel, B.: Cooperative epistemic multi-agent planning with implicit coordination. In: Proceedings of the Ninth Workshop on Methods for Modalities (M4M) (2017)
Kocsis, L., Szepesvári, C.: Bandit based Monte-Carlo planning. In: Fürnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS (LNAI), vol. 4212, pp. 282–293. Springer, Heidelberg (2006). https://doi.org/10.1007/11871842_29
Kooi, B.: Probabilistic dynamic epistemic logic. J. Logic Lang. Inf. 12(4), 381–408 (2003)
Osawa, H.: Solving Hanabi: estimating hands by opponent’s actions in cooperative game with incomplete information. In: Computer Poker and Imperfect Information: Papers from the 2015 AAAI Workshop (2015)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Reifsteck, D., Engesser, T., Mattmüller, R., Nebel, B. (2019). Epistemic Multi-agent Planning Using Monte-Carlo Tree Search. In: Benzmüller, C., Stuckenschmidt, H. (eds) KI 2019: Advances in Artificial Intelligence. KI 2019. Lecture Notes in Computer Science(), vol 11793. Springer, Cham. https://doi.org/10.1007/978-3-030-30179-8_24
Download citation
DOI: https://doi.org/10.1007/978-3-030-30179-8_24
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-30178-1
Online ISBN: 978-3-030-30179-8
eBook Packages: Computer ScienceComputer Science (R0)