Generalized point based value iteration for interactive POMDPs

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2008, Pages 63-68

  Doshi, Prashant ^a   Perez, Dennis ^b  

^a University of Georgia ^*  (United States)

^b UNIVERSITY OF GEORGIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MULTIAGENT SETTINGS; POINT BASED; VALUE FUNCTIONS; VALUE ITERATIONS;

ARTIFICIAL INTELLIGENCE; VECTORS;

BIONICS;

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

References (11)

1. Doshi, P., and Gmytrasiewicz, P. J. 2005. A particle filtering based approach to approximating interactive pomdps. In AAAI, 969-974.
2. Doshi, P., and Gmytrasiewicz, P. J. 2006. On the difficulty of achieving equilibrium in interactive pomdps. In AAAI, 1131-1136.
3. Gmytrasiewicz, P., and Doshi, P. 2005. A framework for sequential planning in multiagent settings. JAIR 24:49-79.
4. James, M.; Samples, M.; and Dolgov, D. 2007. Improving anytime PBVI using principled point selections. In IJCAI, 865-870.
5. Kaelbling, L.; Littman, M.; and Cassandra, A. 1998. Planning and acting in partially observable stochastic domains. AI Journal 2.
6. Nair, R.; Tambe, M.; Yokoo, M.; Pynadath, D.; and Marsella, S. 2003. Taming decentralized pomdps : Towards efficient policy computation for multiagent settings. In IJCAI, 705-711.
7. Pineau, J.; Gordon, G.; and Thrun, S. 2006. Anytime point-based approximations for pomdps. JAIR 27:335-380.
8. Seuken, S., and Zilberstein, S. 2007. Improved memory bounded dynamic programming for decentralized pomdps. In UAI.
9. Smallwood, R., and Sondik, E. 1973. The optimal control of POMDPs over a finite horizon. OR 21:1071-1088.
10. Spaan, M., and Vlassis, N. 2005. Perseus: Randomized point-based value iteration for pomdps. JAIR 24:195-220.
11. Szer, D., and Charpillet, F. 2006. Point based dynamic programming for dec-pomdps. In AAAI, 1233-1238.