Exact solutions of interactive POMDPs using behavioral equivalence

Proceedings of the International Conference on Autonomous Agents

Volumn 2006, Issue , 2006, Pages 1025-1032

  Rathnasabapathy, Bharanee ^a   Doshi, Prashant ^b   Gmytrasiewicz, Piotr ^a  

^a University of Illinois at Chicago   (United States)

^b University of Georgia ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BEHAVIORAL EQUIVALENCE; INTERACTIVE POMDP; INTERACTIVE STATE SPACE; OPTIMAL SOLUTIONS;

AUTONOMOUS AGENTS; COMPUTATION THEORY; DECISION MAKING; EQUIVALENCE CLASSES; ITERATIVE METHODS; MATHEMATICAL MODELS; MULTI AGENT SYSTEMS;

INTERACTIVE DEVICES;

EID: 34247264418     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1160633.1160816     Document Type: Conference Paper

References (17)

1. R. Becker, S. Zilberstein, and V. Lesser. Decentralized markov decision processes with event-driven interactions. In Proceedings of the Third International Joint Conference on Autonomous Agents and Multi Agent Systems (AAMAS-04), 2004.
2. D. S. Bernstein, R. Givan, N. Immerman, and S. Zilberstein. The complexity of decentralized control of markov decision processes. In. Mathematics of Operations Research, volume 27, No. 4, pages 819-840, 2002.
3. D. S. Bernstein, E. A. Hansen, and S. Zilberstein. Bounded policy iteration for decentralized pomdps. In Proceedings of the The Nineteenth International Joint Conference on Artificial Intelligence (IJCAI-05), 2005.
4. A. R. Cassandra, M. L. Littman, and N. L. Zhang. Incremental pruning: A simple, fast, exact method for partially observable markov decision processes. In Uncertainty in Artificial Intelligence, Rhode Island, Providence, 1997.
5. P. Doshi and P. Gmytrasiewicz. Approximating state estimation in multiagent settings using particle filters. In Proceedings of the Fourth International Conference on Autonomous Agents and Multi Agent Systems (AAMAS-05), 2005.
6. P. Doshi and P. Gmytrasiewicz. A particle filtering based approach to approximating interactive pomdps. In Proceedings of the The Twentieth National Conference on Artificial Intelligence (AAAI-05), 2005.
7. R. Givan, T. Dean, and M. Greig. Equivalence notions and model minimization in markov decision processes. In Artificial Intelligence Journal, 2003.
8. P. J. Gmytrasiewicz and P. Doshi. A framework for sequential planning in multi-agent settings. In Journal of AI Research, 2005.
9. E. A. Hansen, D. S. Bernstein, and S. Zilberstein. Dynamic programming for partially observable stochastic games. In Proceedings of the 19th National Conference on Artificial Intelligence (AAAI-04), 2004.
10. J. C. Harsanyi. Games with incomplete information played by 'bayesian' players. In Management Science, pages 14(3): 159-182, Nov 2005.
11. L. Kaelbling, M. Littman, and A. Cassandra. Planning and acting in partially observable stochastic domains. Artificial Intelligence, 2, 1998.
12. R. Nair, M. Tambe, M. Yokoo, D. Pynadath, and S. Marsella. Taming decentralized pomdps: Towards efficient policy computation for multiagent settings. In Proceedings of International Joint Conference in Artificial Intelligence (IJCAI), 2003.
13. J. M. Porta, M. T. Spaan, and N. Vlassis. Value iteration for continuous-state pomdps. In IAS Technical report IAS-UVA-04-04, 2004.
14. P. Poupart and C. Boutilier. Value directed compression of pomdps. In Seventeenth Annual Conference on Neural Information Processing Systems, 2003.
15. D. V. Pynadath and M. Tambe. Multiagent teamwork: Analyzing the optimality and complexity of key theories and models. In Joint Conference on Autonomous Agents and Multi-Agent Systems, 2002.
16. R. Smallwood and E. Sondik. The optimal control of partially observable markov decision processes over a finite horizon. Operations Research, 21:1071-1088, 1973.
17. S. Thrun. Monte carlo POMDPs. In S. Solla, T. Leen, and K.-R. Müller, editors, Advances in Neural Information Processing Systems 12, pages 1064-1070. MIT Press, 2000.