Distribution over beliefs for memory bounded Dec-POMDP planning

Proceedings of the 26th Conference on Uncertainty in Artificial Intelligence, UAI 2010

Volumn , Issue , 2010, Pages 135-142

  Corona, Gabriel ^a   Charpillet, François ^a  

^a LORIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION;

POINT-BASED METHODS; PRIOR PROBABILITY; SOLUTION QUALITY; STATE-OF-THE-ART APPROACH;

ARTIFICIAL INTELLIGENCE;

EID: 80053133840     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (11)

1. [Aras et al., 2007] Aras, R., Dutech, A., and Charpillet, F. (2007). Mixed integer linear programming for exact finite-horizon planning in decentralized POMDPs. In Proceedings of the Thirteenth International Conference on Automated Planning and Scheduling (ICAPS 2007).
2. [Bernstein et al., 2000] Bernstein, D. S., Zilberstein, S., and Immerman, N. (2000). The complexity of decentralized control of markov decision processes. In Mathematics of Operations Research, page 2002.
3. [Carlin and Zilberstein, 2008] Carlin, A. and Zilberstein, S. (2008). Value-based observation compression for DEC-POMDPs. In AAMAS'08: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems, pages 501-508, Richland, SC. International Foundation for Autonomous Agents and Multiagent Systems.
4. [Dibangoye et al., 2009] Dibangoye, J. S., Mouaddib, A.-I., and Chaib-draa, B. (2009). Point-based incremental pruning heuristic for solving finitehorizon dec-pomdps. In AAMAS '09: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems, pages 569-576, Richland, SC. International Foundation for Autonomous Agents and Multiagent Systems.
5. [Hansen et al., 2004] Hansen, E., Bernstein, D., and Zilberstein, S. (2004). Dynamic programming for partially observable stochastic games. In Proceedings of the Nineteenth National Conference on Artificial Intelligence, pages 709-715. AAAI Press.
6. [Nair et al., 2003] Nair, R., Tambe, M., Yokoo, M., Pynadath, D., and Marsella, S. (2003). Taming Decentralized POMDPs: Towards Efficient Policy Computation for Multiagent Settings. In In Proceedings of the Twentieth International Joint Conference on Artificial Intelligences (IJCAI-03), pages 705-711. IJCAI.
7. [Oliehoek et al., 2008] Oliehoek, F. A., Spaan, M. T. J., and Vlassis, N. (2008). Optimal and approximate Q-value functions for decentralized POMDPs. Journal of Artificial Intelligence Research, 32(1):289-353.
8. [Seuken and Zilberstein, 2007a] Seuken, S. and Zilberstein, S. (2007a). Improved Memory-Bounded Dynamic Programming for Decentralized POMDPs. In Proceedings of the Twenty-Third Conference on Uncertainty in Artificial Intelligences (UAI-07), Vancouver, BC, Canada.
9. [Seuken and Zilberstein, 2007b] Seuken, S. and Zilberstein, S. (2007b). Memory-Bounded Dynamic Programming for DEC-POMDPs. In In Proceedings of the Twentieth International Joint Conference on Artificial Intelligences (IJCAI-07). IJCAI.
10. [Szer and Charpillet, 2006] Szer, D. and Charpillet, F. (2006). Point-based dynamic programming for DEC-POMDPs. In Proceedings of the TwentyFirst AAAI National Conference on Artificial Intelligence.
11. [Szer et al., 2005] Szer, D., Charpillet, F., and Zilberstein, S. (2005). MAA*: A Heuristic Search Algorithm for Solving Decentralized POMDPs. In Proceedings of the Twenty-First Conference on Uncertainty in Artificial Intelligence, pages 576-583. AUAI Press.