Q-value functions for decentralized POMDPs

Proceedings of the International Conference on Autonomous Agents

Volumn , Issue , 2007, Pages 838-845

  Oliehoek, Frans A ^a   Vlassis, Nikos ^a  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

Cooperative multiagent systems; Decentralized POMDPs; Planning under uncertainty

Indexed keywords

BAYESIAN GAMES; COOPERATIVE MULTIAGENT SYSTEMS; DECENTRALIZED POMDPS; EFFICIENT COMPUTATIONS; PLANNING UNDER UNCERTAINTY; POLICY SEARCHES; Q VALUES; SINGLE AGENTS; VALUE FUNCTIONS;

AGENTS; AUTONOMOUS AGENTS; DYNAMIC PROGRAMMING; FUZZY CLUSTERING; MULTI AGENT SYSTEMS; SYSTEMS ENGINEERING;

RECURSIVE FUNCTIONS;

EID: 60349096407     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1329125.1329390     Document Type: Conference Paper

References (18)

1. R. Becker, S. Zilberstein, V. Lesser, and C. V. Goldman. Solving transition independent decentralized Markov decision processes. Journal of Artificial Intelligence Research (JAIR), 22:423-455, December 2004.
2. D. S. Bernstein, R. Givan, N. Immerman, and S. Zilberstein. The complexity of decentralized control of Markov decision processes. Math. Oper. Res., 27(4):819-840, 2002.
3. C. Boutilier. Planning, learning and coordination in multiagent decision processes. In TARK '96: Proceedings of the 6th conference on Theoretical aspects of rationality and knowledge, pages 195-210, 1996.
4. R. Emery-Montemerlo, G. Gordon, J. Schneider, and S. Thrun. Approximate solutions for partially observable stochastic games with common payoffs. In Proc. of Int. Joint Conference on Autonomous Agents and Multi Agent Systems, pages 136-143, 2004.
5. C. Guestrin, D. Koller, and R. Parr. Multiagent planning with factored MDPs. In Advances in Neural Information Processing Systems 14, pages 1523-1530, 2002.
6. E. A. Hansen, D. S. Bernstein, and S. Zilberstein. Dynamic programming for partially observable stochastic games. In Proceedings of the Nineteenth National Conference on Artificial Intelligence, pages 709-715, 2004.
7. L. P. Kaelbling, M. L. Littman, and A. R. Cassandra. Planning and acting in partially observable stochastic domains. Artif. Intell., 101(1-2):99-134, 1998.
8. J. R. Kok and N. Vlassis. Collaborative multiagent reinforcement learning by payoff propagation. Journal of Machine Learning Research, 7:1789-1828, 2006.
9. M. Littman, A. Cassandra, and L. Kaelbling. Learning policies for partially observable environments: Scaling up. In International Conference on Machine Learning, pages 362-370, 1995.
10. R. Nair, M. Tambe, M. Yokoo, D. V. Pynadath, and S. Marsella. Taming decentralized POMDPs: Towards efficient policy computation for multiagent settings. In Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, pages 705-711, 2003.
11. M. J. Osborne and A. Rubinstein. A Course in Game Theory. The MIT Press, July 1994.
12. C. H. Papadimitriou and J. N. Tsitsiklis. The complexity of Markov decision processes. Mathematics of Operations Research, 12(3):441-451, 1987.
13. M. L. Puterman. Markov Decision Processes-Discrete Stochastic Dynamic Programming. John Wiley & Sons, Inc., New York, NY, 1994.
14. M. Roth, R. Simmons, and M. Veloso. Reasoning about joint beliefs for execution-time communication decisions. In Proc. of Int. Joint Conference on Autonomous Agents and Multi Agent Systems, pages 786-793, 2005.
15. P. Stone and M. Veloso. Multiagent systems: a survey from a machine learning perspective. Autonomous Robots, 8(3), 2000.
16. D. Szer, F. Charpillet, and S. Zilberstein. MAA*: A heuristic search algorithm for solving decentralized POMDPs. In Proc. of the Twenty First Conference on Uncertainty in Artificial Intelligence, 2005.
17. N. Vlassis. A concise introduction to multiagent systems and distributed AI. Informatics Institute, University of Amsterdam, Sept. 2003.
18. G. Weiss, editor. Multiagent Systems: a Modern Approach to Distributed Artificial Intelligence. MIT Press, 1999.