Efficient planning for factored infinite-horizon DEC-POMDPs

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2011, Pages 325-331

  Pajarinen, Joni ^a   Peltonen, Jaakko ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION BETWEEN AGENTS; EFFICIENT PLANNING; EXPECTATION - MAXIMIZATIONS; INFINITE HORIZONS; OPTIMIZATION ALGORITHMS; OPTIMIZING POLICIES; PARTIALLY OBSERVABLE MARKOV DECISION PROCESS; WORST-CASE COMPLEXITY;

ALGORITHMS; OPTIMIZATION;

PROBLEM SOLVING;

EID: 84860644195     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.5591/978-1-57735-516-8/IJCAI11-064     Document Type: Conference Paper

References (13)

1. M. Allen and S. Zilberstein. Complexity of decentralized control: Special cases. In Advances in Neural Information Processing Systems 22, pages 19-27, 2009.
2. C. Amato, D. Bernstein, and S. Zilberstein. Optimizing Memory-Bounded Controllers for Decentralized POMDPs. In Proc. of 23rd UAI, pages 1-8. AUAI Press, 2007.
3. D.S. Bernstein, E.A. Hansen, and S. Zilberstein. Bounded policy iteration for decentralized POMDPs. In Proc. of 19th IJCAI, pages 1287-1292. Morgan Kaufmann, 2005.
4. X. Boyen and D. Koller. Tractable Inference for Complex Stochastic Processes. In Proc. of 14th UAI, volume 98, pages 33-42. Morgan Kaufmann, 1998.
5. X. Boyen and D. Koller. Exploiting the architecture of dynamic systems. In Proc. of 16th Nat. Conf. on AI, pages 313-320. The AAAI Press, 1999.
6. A. Kumar and S. Zilberstein. Anytime Planning for Decentralized POMDPs using Expectation Maximization. In Proc. of 26th UAI, 2010.
7. A. Kumar and S. Zilberstein. Point-Based Backup for Decentralized POMDPs: Complexity and New Algorithms. In Proc. of 9th AAMAS, pages 1315-1322. IFAAMAS, 2010.
8. Kevin Murphy. Dynamic Bayesian Networks: Representation, Inference and Learning. PhD thesis, University of California, Berkeley, 2002.
9. F.A. Oliehoek, M.T.J. Spaan, S. Whiteson, and N. Vlassis. Exploiting locality of interaction in factored DEC-POMDPs. In Proc. of 7th AAMAS, volume 1, pages 517-524. IFAAMAS, 2008.
10. Frans A. Oliehoek. Value-Based Planning for Teams of Agents in Stochastic Partially Observable Environments. PhD thesis, Informatics Institute, University of Amsterdam, February 2010.
11. J. Pajarinen, J. Peltonen, A. Hottinen, and M. Uusitalo. Efficient Planning in Large POMDPs through Policy Graph Based Factorized Approximations. In Proc. of ECMLPKDD 2010, volume 6323, pages 1-16. Springer, 2010.
12. D. Szer and F. Charpillet. An optimal best-first search algorithm for solving infinite horizon DEC-POMDPs. Proc. of 16th ECML, pages 389-399, 2005.
13. M. Toussaint, S. Harmeling, and A. Storkey. Probabilistic inference for solving (PO)MDPs. Technical report, University of Edinburgh, 2006.