Bounded policy iteration for decentralized POMDPs

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2005, Pages 1287-1292

  Bernstein, Daniel S ^a   Hansen, Eric A ^b   Zilberstein, Shlomo ^a  

^a Biologically Inspired Neural and Dynamical Systems Laboratory   (United States)

^b MISSISSIPPI STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FINITE-STATE CONTROLLERS; INFINITE HORIZONS; INITIAL STATE; LOCAL CONTROLLERS; POLICY ITERATION; POLICY ITERATION ALGORITHMS; SINGLE-AGENT;

ALGORITHMS; ARTIFICIAL INTELLIGENCE;

ITERATIVE METHODS;

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

References (16)

1. Robert J. Aumann. Subjectivity and correlation in randomized strategies. Journal of Mathematical Economics, 1:67-96, 1974.
2. Daniel S. Bernstein, Robert Givan, Neil Immerman, and Shlomo Zilberstein. The complexity of decentralized control of Markov decision processes. Mathematics of Operations Research, 27(4):819-840, 2002.
3. Anthony Cassandra, Michael L. Littman, and Nevin L. Zhang. Incremental pruning: A simple, fast, exact method for partially observable Markov decision processes. In Proceedings of UAI, pages 54-61, 1997.
4. Rosemary Emery-Montemerlo, Geoff Gordon, Jeff Schnieder, and Sebastian Thrun. Approximate solutions for partially observable stochastic games with common payoffs. In Proceedings of AAMAS, 2004.
5. Zhengzhu Feng and Shlomo Zilberstein. Region-Based incremental pruning for POMDPs. In Proceedings of UAI, pages 146-153, 2004.
6. Eric A. Hansen, Daniel S. Bernstein, and Shlomo Zilberstein. Dynamic programming for partially observable stochastic games. In Proceedings of AAAI, pages 709-715, 2004.
7. Eric Hansen. Solving POMDPs by searching in policy space. In Proceedings of UAI, pages 211-219, 1998.
8. Nicolas Meuleau, Kee-Eung Kim, Leslie Kaelbling, and Anthony R. Cassandra. Solving POMDPs by searching the space of finite policies. In Proceedings of UAI, pages 417-426, 1999.
9. Ranjit Nair, David Pynadath, Makoto Yokoo, Milind Tambe, and Stacy Marsella. Taming decentralized POMDPs: Towards efficient policy computation for multiagent settings. In Proceedings of IJCAI, 2003.
10. James M. Ooi and Gregory W. Wornell. Decentralized control of a multiple access broadcast channel: Performance bounds. In Proceedings of the 35th Conference on Decision and Control, pages 293-298, 1996.
11. Leonid Peshkin, Kee-Eung Kim, Nicolas Meuleau, and Leslie Pack Kaelbling. Learning to cooperate via policy search. In Proceedings of UAI, pages 489-496, 2000.
12. Loren K. Platzman. A feasible computational approach to infinite-horizon partially-observed Markov decision processes. Technical report, Georgia Institute of Technology, 1980. Reprinted in Working Notes of the 1998 AAAI Fall Symposium on Planning Using Partially Observable Markov Decision Processes.
13. Pascal Poupart and Craig Boutilier. Bounded finite state controllers. In Proceedings of NIPS, 2003.
14. Satinder P. Singh, Tommi Jaakkola, and Michael I. Jordan. Learning without state-estimation in partially observable markovian decision processes. In Proceedings of ICML, 1994.
15. Richard D. Smallwood and Edward J. Sondik. The optimal control of partially observable Markov processes over a finite horizon. Operations Research, 21(5):1071-1088, 1973.
16. Hans S. Witsenhausen. Separation of estimation and control for discrete time systems. Proceedings of the IEEE, 59(11):1557-1566, 1971.