Improved memory-bounded dynamic programming for decentralized POMDPs

Proceedings of the 23rd Conference on Uncertainty in Artificial Intelligence, UAI 2007

Volumn , Issue , 2007, Pages 344-351

  Seuken, Sven ^a   Zilberstein, Shlomo ^b  

^a HARVARD UNIVERSITY   (United States)

^b The Manning College of Information and Computer Sciences   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BENCH-MARK PROBLEMS; CONVERGENCE BEHAVIORS; ERROR BOUND; SCALABLE SOLUTION; SOLUTION QUALITY;

ARTIFICIAL INTELLIGENCE; ERROR ANALYSIS;

DYNAMIC PROGRAMMING;

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

References (13)

1. Daniel S. Bernstein, Shlomo Zilberstein, and Neil Immerman. The Complexity of Decentralized Control of Markov Decision Processes. In Proceedings of the Sixteenth Conference on Uncertainty in Artificial Intelligence (UAI), pages 32-37, Stanford, California, June 2000.
2. Rosemary Emery-Montemerlo, Geoff Gordon, Jeff Schneider, and Sebastian Thrun. Approximate Solutions for Partially Observable Stochastic Games with Common Payoffs. In Proceedings of the Third International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), pages 136-143, 2004.
3. Eric A. Hansen, Daniel S. Bernstein, and Shlomo Zilberstein. Dynamic Programming for Partially Observable Stochastic Games. In Proceedings of the Nineteenth National Conference on Artificial Intelligence (AAAI), pages 709-715, San Jose, July 2004.
4. C. R. Kube and H. Zhang. Task Modelling in Collective Robotics. Autonomous Robots, 4:53-72, 1997. (Pubitemid 127508275)
5. Ranjit Nair, David Pynadath, Makoto Yokoo, Milind Tambe, and Stacy Marsella. Taming Decentralized POMDPs: Towards Efficient Policy Computation for Multiagent Settings. In Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence (IJCAI), 2003.
6. Joelle Pineau, Geoff Gordon, and Sebastian Thrun. Point-based value iteration: An anytime algorithm for POMDPs. In Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence (IJCAI), 2003.
7. David V. Pynadath and Milind Tambe. The Communicative Multiagent Team Decision Problem: Anaylzing Teamwork Theories and Models. Journal of Artificial Intelligence Research (JAIR), 16:389-423, June 2002. (Pubitemid 43057178)
8. Zinovi Rabinovich, Claudia V. Goldman, and Jeffrey S. Rosenschein. The Complexity of Multiagent Systems: The Price of Silence. In Proceedings of the Second International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), Melbourne, Australia, 2003.
9. Sven Seuken and Shlomo Zilberstein. Formal Models and Algorithms for Decentralized Control of Multiple Agents. To appear in Journal of Autonomous Agents and Multi-Agent Systems (JAAMAS), 2007.
10. Sven Seuken and Shlomo Zilberstein. Memory-Bounded Dynamic Programming for DEC-POMDPs. In Proceedings of the Twentieth International Joint Conference on Artificial Intelligence (IJCAI), 2007.
11. Trey Smith and Reid Simmons. Point-Based POMDP Algorithms: Improved Analysis and Implementation. In Proceedings of the Twenty-First Conference on Uncertainty in Artificial Intelligence (UAI), 2005.
12. Daniel Szer and Francois Charpillet. Point-based Dynamic Programming for DEC-POMDPs. In Proceedings of the Twenty-First National Conference on Artificial Intelligence (AAAI), Boston, USA, 2006.
13. *: A Heuristic Search Algorithm for Solving Decentralized POMDPs. In Proceedings of the Twenty-First Conference on Uncertainty in Artificial Intelligence (UAI), pages 576-583, Edinburgh, Scotland, July 2005.