The Complexity of Decentralized Control of Markov Decision Processes
暂无分享,去创建一个
Neil Immerman | Shlomo Zilberstein | Daniel S Bernstein | S. Zilberstein | D. Bernstein | N. Immerman
[1] Harry R. Lewis. Complexity of solvable cases of the decision problem for the predicate calculus , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).
[2] John H. Reif,et al. Multiple-person alternation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).
[3] S. Marcus,et al. Decentralized control of finite state Markov processes , 1980, 1980 19th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.
[4] John N. Tsitsiklis,et al. On the Complexity of Designing Distributed Protocols , 1982, Inf. Control..
[5] Christos Papadimitriou,et al. Intractable problems in control theory , 1985, 1985 24th IEEE Conference on Decision and Control.
[6] John N. Tsitsiklis,et al. The Complexity of Markov Decision Processes , 1987, Math. Oper. Res..
[7] M. Aicardi,et al. Decentralized optimal control of Markov chains with a common past information set , 1987 .
[8] Nondeterministic exponential time has two-prover interactive protocols , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[9] Martin L. Puterman,et al. Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .
[10] Michael I. Jordan,et al. Reinforcement Learning Algorithm for Partially Observable Markov Decision Problems , 1994, NIPS.
[11] G. W. Wornell,et al. Decentralized control of a multiple access broadcast channel: performance bounds , 1996, Proceedings of 35th IEEE Conference on Decision and Control.
[12] Sarit Kraus,et al. Collaborative Plans for Complex Group Action , 1996, Artif. Intell..
[13] Gregory W. Wornell,et al. A separation theorem for periodic sharing information patterns in decentralized control , 1997 .
[14] Michael L. Littman,et al. Incremental Pruning: A Simple, Fast, Exact Method for Partially Observable Markov Decision Processes , 1997, UAI.
[15] Leslie Pack Kaelbling,et al. Planning and Acting in Partially Observable Stochastic Domains , 1998, Artif. Intell..
[16] Maja J. Mataric,et al. Using communication to reduce locality in distributed multiagent learning , 1997, J. Exp. Theor. Artif. Intell..
[17] Eric A. Hansen,et al. Solving POMDPs by Searching in Policy Space , 1998, UAI.
[18] Anne Condon,et al. On the Undecidability of Probabilistic Planning and Infinite-Horizon Partially Observable Markov Decision Problems , 1999, AAAI/IAAI.
[19] Tong Li,et al. My Brain is Full: When More Memory Helps , 1999, UAI.
[20] Kee-Eung Kim,et al. Solving POMDPs by Searching the Space of Finite Policies , 1999, UAI.
[21] Alexander G. Gray,et al. An Integrated System for Multi-Rover Scientific Exploration , 1999, AAAI/IAAI.
[22] Edmund H. Durfee,et al. A Survey of Research in Distributed, Continual Planning , 1999, AI Mag..
[23] Craig Boutilier. Multiagent Systems: Challenges and Opportunities for Decision-Theoretic Planning , 1999, AI Mag..
[24] Andrew W. Moore,et al. Distributed Value Functions , 1999, ICML.
[25] Manuela M. Veloso,et al. Task Decomposition, Dynamic Role Assignment, and Low-Bandwidth Communication for Real-Time Strategic Teamwork , 1999, Artif. Intell..
[26] Kee-Eung Kim,et al. Learning to Cooperate via Policy Search , 2000, UAI.
[27] John N. Tsitsiklis,et al. A survey of computational complexity results in systems and control , 2000, Autom..
[28] Minoru Asada,et al. Overview of RoboCup-99 , 2000, AI Mag..
[29] Eric Allender,et al. Complexity of finite-horizon Markov decision process problems , 2000, JACM.
[30] N. Zhang,et al. Algorithms for partially observable markov decision processes , 2001 .
[31] Edmund H. Durfee,et al. Distributed Problem Solving and Planning , 2001, EASSS.
[32] K. Khalil. On the Complexity of Decentralized Decision Making and Detection Problems , 2022 .