Value-based observation compression for DEC-POMDPs

Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS

Volumn 1, Issue , 2008, Pages 494-501

  Carlin, Alan ^a   Zilberstein, Shlomo ^a  

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

Author keywords

Artificial intelligence; Decentralized POMDPs; Observation compression; Planning under uncertainty

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; AUTONOMOUS AGENTS; MULTI AGENT SYSTEMS;

COMPRESSION TECHNIQUES; DECENTRALIZED POMDPS; ERROR BOUND; MULTI-AGENT PLANNING; PLANNING UNDER UNCERTAINTY; PRUNING STRATEGY; PRUNING TECHNIQUES; VALUE-BASED;

FORESTRY;

EID: 70350497651     PISSN: 15488403     EISSN: 15582914     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. C. Amato, A. Carlin, and S. Zilberstein. Bounded dynamic programming for decentralized POMDPs. In AAMAS 2007 Workshop on Multi-Agent Sequential Decision Making in Uncertain Domains, Honolulu, Hawaii, 2007.
2. D.S. Bernstein, R. Givan, N. Immerman, and S. Zilberstein. The complexity of decentralized control of Markov decision processes. Mathematics of Operations Research, 27(4):819-840, 2002.
3. D.S. Bernstein, E. Hansen, and S. Zilberstein. Bounded policy iteration for decentralized POMDPs. In Proc. of the Nineteenth International Joint Conf. on Artificial Intelligence, Edinburgh, Scotland, 2005.
4. P. Gmytrasiewicz and P. Doshi. A framework for sequential planning in multiagent settings. Journal of Artificial Intelligence Research, 24:49-79, 2005.
5. E. A. Hansen, D. S. Bernstein, and S. Zilberstein. Dynamic programming for partially observable stochastic games. In Proc. of the Nineteenth National Conf. on Artificial Intelligence, San Jose, CA, 2004.
6. J. Hoey and P. Poupart. Solving POMDPs with continuous or large discrete observation spaces. In Proc. of the Nineteenth International Joint Conf. on Artificial Intelligence, 1332-1338, Edinburgh, Scotland, 2005.
7. C. R. Kube and H. Zhang. Task modelling in collective robotics. Autonomous Robots, 4(1):53-72, 1997.
8. J. Pineau, G. Gordon, and S. Thrun. Point-based value iteration: An anytime algorithm for POMDPs. In Proc. of the Eighteenth International Joint Conf. on Artificial Intelligence, 1025-1032, Acapulco, Mexico, 2003.
9. P. Poupart and C. Boutilier. Value-directed compression of POMDPs. In Advances in Neural Information Processing Systems, 15, 1547-1554, Vancouver, BC, 2002.
10. S. Seuken and S. Zilberstein. Formal Models and Algorithms for Decentralized Control of Multiple Agents. Technical Report 05-68, Department of Computer Science, University of Massachusetts Amherst, 2005.
11. S. Seuken and S. Zilberstein. Improved memory-bounded dynamic programming for decentralized POMDPs. In Proc. of the Twenty-Third Conf. on Uncertainty in Artificial Intelligence, Vancouver, BC, 2007.
12. T. Smith and R. Simmons. Heuristic search value iteration for POMDPs, In Proc. of the Twentieth Conf. on Uncertainty in Artificial Intelligence, 520-527, Banff, Canada, 2004.
13. M. Spaan and N. Vlassis. Perseus: Randomized point-based value iteration for POMDPs. Journal of Artificial Intelligence Research, 24:195-200, 2005.
14. D. Szer, F. Charpillet, and S. Zilberstein. MAA*: A heuristic search algorithm for solving decentralized POMDPs. In Proc. of the Twenty-First Conf. on Uncertainty in Artificial Intelligence, Edinburgh, Scotland, 2005.
15. Y. Virin, G. Shani, S. E. Shimony, and R. I. Brafman. Scaling up: Solving POMDPs through value based clustering. In Proc. of the Twenty-Second Conference on Artificial Intelligence, 19KM911, Vancouver, BC, 2007.