Token-based Execution Semantics for Multi-Agent Epistemic Planning
暂无分享,去创建一个
[1] Niki Pissinou,et al. A token based distributed k mutual exclusion algorithm , 1992, [1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing.
[2] Erez Karpas,et al. Automated Verification of Social Laws for Continuous Time Multi-Robot Systems , 2019, AAAI.
[3] Hector Geffner,et al. Beliefs In Multiagent Planning: From One Agent to Many , 2015, ICAPS.
[4] Bernhard Nebel,et al. Cooperative Epistemic Multi-Agent Planning for Implicit Coordination , 2017, M4M@ICLA.
[5] Bernhard Nebel,et al. Better Eager Than Lazy? How Agent Types Impact the Successfulness of Implicit Coordination , 2018, KR.
[6] Enrico Pontelli,et al. EFP and PG-EFP: Epistemic Forward Search Planners in Multi-Agent Domains , 2018, ICAPS.
[7] Tim Miller,et al. Implicit Coordination Using FOND Planning , 2020, AAAI.
[8] Bernhard Nebel,et al. Implicitly Coordinated Multi-Agent Path Finding under Destination Uncertainty: Success Guarantees and Computational Complexity , 2019, J. Artif. Intell. Res..
[9] Moshe Tennenholtz,et al. Automated Verification of Social Law Robustness in STRIPS , 2017, ICAPS.
[10] Hai Wan,et al. A General Multi-agent Epistemic Planner Based on Higher-order Belief Change , 2018, IJCAI.
[11] Marco Pistore,et al. Weak, strong, and strong cyclic planning via symbolic model checking , 2003, Artif. Intell..
[12] Sophie Pinchinat,et al. Reachability Games in Dynamic Epistemic Logic , 2019, IJCAI.
[13] Richard Spencer-Smith,et al. Modal Logic , 2007 .
[14] Christian J. Muise,et al. Planning Over Multi-Agent Epistemic States: A Classical Planning Approach , 2015, AAAI.