MAA*: A heuristic search algorithm for solving decentralized POMDPs

Proceedings of the 21st Conference on Uncertainty in Artificial Intelligence, UAI 2005

Volumn , Issue , 2005, Pages 576-583

  Szer, Daniel ^a   Charpillet, Franfiçois ^a   Zilberstein, Shlomo ^b  

^a LORIA   (France)

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

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; HEURISTIC ALGORITHMS; LEARNING ALGORITHMS; MULTI AGENT SYSTEMS; STOCHASTIC SYSTEMS;

COOPERATIVE GROUPS; DISTRIBUTED RESOURCE ALLOCATION; HEURISTIC SEARCH ALGORITHMS; INFINITE HORIZON PROBLEMS; MULTI-ROBOT COORDINATION; PARTIALLY OBSERVABLE MARKOV DECISION PROBLEMS; PLANNING UNDER UNCERTAINTY; STOCHASTIC ENVIRONMENT;

OPTIMIZATION;

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

References (24)

1. Eitan Altman. Applications of markov decision processes in communication networks: A survey. Technical Report RR-3984, INRIA Sophia-Antipolis, 2000.
2. Raphen Becker, Shlomo Zilberstein, Victor Lesser, and Claudia V. Goldman. Solving transition independent decentralized markov decision processes. Journal of Artificial Intelligence Research, 22:423-455, 2004. (Pubitemid 41525892)
3. 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.
4. 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 the 13th Conference on Uncertainty in Artificial Intelligence, 1997.
5. Iadine Chadès, Bruno Scherrer, and Franfiçois Charpillet. A heuristic approach for solving decentralized-pomdp: Assessment on the pursuit problem. In Proceedings of the 2002 ACM Symposium on Applied Computing, 2002.
6. Fangruo Chen. Decentralized supply chains subject to information delays. Management Science, 45:1076-1090, 1999. (Pubitemid 32077675)
7. Rosemary Emery-Montemerlo, Geo Gordon, Je Schneider, and Sebastian Thrun. Approximate solutions for partially observable stochastic games with common payoffs. In Proceedings of the 3rd AAMAS, 2004.
8. Héctor Gefiner and Blai Bonet. Solving large POMDPs by real time dynamic programming. In Working Notes Fall AAAI Symposium on POMDPs, 1998.
9. Claudia V. Goldman and Shlomo Zilberstein. Decentralized control of cooperative systems: Categorization and complexity analysis. Journal of Artificial Intelligence Research, 22:143-174, 2004. (Pubitemid 41525885)
10. Eric A. Hansen. Solving POMDPs by searching in policy space. In Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence, 1998.
11. Eric A. Hansen and Shlomo Zilberstein. Anytime heuristic search. In AAAI Fall Symposium on Flexible Computation in Intelligent Systems, 1996.
12. Eric A. Hansen and Shlomo Zilberstein. LAO*: A heuristic search algorithm that finds solutions with loops. Artificial Intelligence, 129:35-62, 2001. (Pubitemid 32498415)
13. Eric A. Hansen, Daniel S. Bernstein, and Shlomo Zilberstein. Dynamic programming for partially observable stochastic games. In Proceedings of the 19th National Conference on Artificial Intelligence, 2004.
14. Milos Hauskrecht. Value-function approximations for partially observable markov decision processes. Journal of Artificial Intelligence Research, 13:33-94, 2000. (Pubitemid 33682083)
15. Michael L. Littman, Anthony R. Cassandra, and Leslie Pack Kaelbling. Learning policies for partially observable environments: Scaling up. In Proceedings of the 12th International Conference on Machine Learning, 1995.
16. Maja J. Mataric and Gaurav S. Sukhatme. Task-allocation and coordination of multiple robots for planetary exploration. In Proceedings of the 10th International Conference on Advanced Robotics, 2001.
17. Nicolas Meuleau, Kee-Eung Kim, Leslie Pack Kaelbling, and Anthony Cassandra. Solving pomdps by searching the space of finite policies. In Proceedings of the 15th Annual Conference on Uncertainty in Artificial Intelligence, 1999.
18. R. Nair, M. Tambe, M. Yokoo, D. Pynadath, and S. Marsella. Taming decentralized pomdps: Towards eficient policy computation for multiagent settings. In Proceedings of the 18th International Joint Conference on Artificial Intelligence, 2003.
19. Leonid Peshkin, Kee-Eung Kim, Nicolas Meuleau, and Leslie Kaelbling. Learning to cooperate via policy search. In Proceedings of the 16th Conference on Uncertainty in Artificial Intelligence, 2000.
20. I. Pohl. First results on the effect of error in heuristic search. Machine Intelligence, 5:127-140, 1973.
21. Pascal Poupart and Craig Boutilier. Bounded finite state controllers. In Proceedings of the 16th Conference on Neural Information Processing Systems, 2003.
22. David V. Pynadath and Milind Tambe. The communicative multiagent team decision problem: Analyzing teamwork theories and models. Journal of Artificial Intelligence Research, pages 389-423, 2002. (Pubitemid 43057178)
23. Richard Washington. Incremental markov-model planning. In Proceedings of the 8th International Conference on Tools with Artificial Intelligence, 1996.
24. Ping Xuan, Victor Lesser, and Shlomo Zilberstein. Communication decisions in multi-agent cooperation: Model and experiments. In Proceedings of the Fifth International Conference on Autonomous Agents, 2001.