Taming Decentralized POMDPs: Towards Efficient Policy Computation for Multiagent Settings
暂无分享,去创建一个
[1] Leslie Pack Kaelbling,et al. Planning and Acting in Partially Observable Stochastic Domains , 1998, Artif. Intell..
[2] Edward J. Sondik,et al. The optimal control of par-tially observable Markov processes , 1971 .
[3] Craig Boutilier,et al. Planning, Learning and Coordination in Multiagent Decision Processes , 1996, TARK.
[4] Kee-Eung Kim,et al. Learning to Cooperate via Policy Search , 2000, UAI.
[5] Milind Tambe,et al. The Communicative Multiagent Team Decision Problem: Analyzing Teamwork Theories and Models , 2011, J. Artif. Intell. Res..
[6] Michael L. Littman,et al. Incremental Pruning: A Simple, Fast, Exact Method for Partially Observable Markov Decision Processes , 1997, UAI.
[7] John N. Tsitsiklis,et al. The Complexity of Markov Decision Processes , 1987, Math. Oper. Res..
[8] Victor R. Lesser,et al. Communication decisions in multi-agent cooperation: model and experiments , 2001, AGENTS '01.
[9] François Charpillet,et al. A heuristic approach for solving decentralized-POMDP: assessment on the pursuit problem , 2002, SAC '02.
[10] Neil Immerman,et al. The Complexity of Decentralized Control of Markov Decision Processes , 2000, UAI.