Lossless clustering of histories in decentralized POMDPs

Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS

Volumn 1, Issue , 2009, Pages 404-411

  Oliehoek, Frans A ^a   Whiteson, Shimon ^a   Spaan, Matthijs T J ^b  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

^b INSTITUTO SUPERIOR TÉCNICO   (Portugal)

Author keywords

Cooperative multiagent systems; Decentralized POMDPs; Planning under uncertainty

Indexed keywords

AUTONOMOUS AGENTS; OPTIMAL SYSTEMS;

COOPERATIVE MULTIAGENT SYSTEMS; DECENTRALIZED POMDPS; DISTRIBUTED ARTIFICIAL INTELLIGENCE; EMPIRICAL ANALYSIS; LOCAL OBSERVATIONS; MULTI-AGENT PLANNING; PARTIALLY OBSERVABLE MARKOV DECISION PROCESS; PLANNING UNDER UNCERTAINTY;

MULTI AGENT SYSTEMS;

EID: 84899811776     PISSN: 15488403     EISSN: 15582914     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. C. Amato, D. S. Bernstein, and S. Zilberstein. Optimal fixed-size controllers for decentralized POMDPs. In Multi-Agent Sequential Decision Making in Uncertain Domains (AAMAS Workshop), May 2006.
2. C. Amato, D. S. Bernstein, and S. Zilberstein. Optimizing memory-bounded controllers for decentralized POMDPs. In Proc. of Uncertainty in Artificial Intelligence, July 2007.
3. R. Aras, A. Dutech, and F. Charpillet. Mixed integer linear programming for exact finite-horizon planning in decentralized POMDPs. In Int. Conf. on Automated Planning and Scheduling, 2007.
4. D. S. Bernstein, R. Givan, N. Immerman, and S. Zilberstein. The complexity of decentralized control of Markov decision processes. Mathematics of Operations Research, 27(4), 2002.
5. A. Boularias and B. Chaib-draa. Exact dynamic programming for decentralized POMDPs with lossless policy compression. In Int. Conf. on Automated Planning and Scheduling, 2008.
6. A. Carlin and S. Zilberstein. Value-based observation compression for DEC-POMDPs. In AAMAS, 2008.
7. R. Emery-Montemerlo, G. Gordon, J. Schneider, and S. Thrun. Approximate solutions for partially observable stochastic games with common payoffs. In AAMAS, 2004.
8. R. Emery-Montemerlo, G. Gordon, J. Schneider, and S. Thrun. Game theoretic control for robot teams. In IEEE Int. Conf. on Robotics and Automation, 2005.
9. C. V. Goldman and S. Zilberstein. Decentralized control of cooperative systems: Categorization and complexity analysis. Journal of Artificial Intelligence Research, 22, 2004.
10. E. A. Hansen, D. S. Bernstein, and S. Zilberstein. Dynamic programming for partially observable stochastic games. In AAAI, 2004.
11. R. Nair, M. Tambe, M. Yokoo, D. V. Pynadath, and S. Marsella. Taming decentralized POMDPs: Towards efficient policy computation for multiagent settings. In IJCAI, 2003.
12. F. A. Oliehoek, M. T. J. Spaan, and N. Vlassis. Optimal and approximate Q-value functions for decentralized POMDPs. Journal of Artificial Intelligence Research, 32, 2008.
13. M. J. Osborne and A. Rubinstein. A Course in Game Theory. The MIT Press, July 1994.
14. D. V. Pynadath and M. Tambe. Multiagent teamwork: Analyzing the optimality and complexity of key theories and models. In AAMAS, 2002.
15. S. Seuken and S. Zilberstein. Improved memory-bounded dynamic programming for decentralized POMDPs. In Proc. of Uncertainty in Artificial Intelligence, July 2007.
16. M. T. J. Spaan and F. S. Melo. Interaction-driven Markov games for decentralized multiagent planning under uncertainty. In AAMAS, 2008.
17. D. Szer, F. Charpillet, and S. Zilberstein. MAA*: A heuristic search algorithm for solving decentralized POMDPs. In Proc. of Uncertainty in Artificial Intelligence, 2005.