Point-based dynamic programming for DEC-POMDPs

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2006, Pages 1233-1238

  Szer, Daniel ^a   Charpillet, François ^a  

^a LORIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; MARKOV PROCESSES; MULTI AGENT SYSTEMS; PROBLEM SOLVING; STRATEGIC PLANNING;

MARKOV DECISION PROCESSES; PLANNING STRATEGIES; POINT BASED APPROXIMATIONS; POINT BASED DYNAMIC PROGRAMMING;

DYNAMIC PROGRAMMING;

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

References (16)

1. Altaian, E. 2000. Applications of markov decision processes in communication networks: A survey. Technical Report RR-3984, INRIA Sophia-Antipolis.
2. Becker, R.; Zilberstein, S.; Lesser, V.; and Goldman, C. V. 2004. Solving transition independent decentralized markov decision processes. Journal of Artificial Intelligence Research 22:423-455.
3. Bernstein, D. S.; Givan, R.; Immerman, N.; and Zilberstein, S. 2002. The complexity of decentralized control of markov decision processes. Mathematics of Operations Research 21 (4):819-840.
4. Bernstein, D. S.; Hansen, E. A.; and Zilberstein, S. 2005. Bounded policy iteration for decentralized POMDPs. In Proceedings of the 24th International Joint Conference on Artificial Intelligence.
5. Claus, C., and Boutilier, C. 1998. The dynamics of reinforcement learning in cooperative multiagent systems. In AAAI/IAAI, 746-752.
6. Emery-Montemerlo, R.; Gordon, G.; Schneider, J.; and Thrun, S. 2004. Approximate solutions for partially observable stochastic games with common payoffs. In Proceedings of the 3rd AAMAS.
7. Gmytrasiewicz, P. J., and Doshi, P. 2005. A framework for sequential planning in multi-agent settings. Journal of Artificial Intelligence Research 24:49-79.
8. Hansen, E. A.; Bernstein, D. S.; and Zilberstein, S. 2004. Dynamic programming for partially observable stochastic games. In Proceedings of the 19th National Conference on Artificial Intelligence.
9. Lovejoy, W. S. 1991. Computationally feasible bounds for partially observed markov decision processes. Operations Research 39(1): 162-175.
10. Nair, R.; Tambe, M.; Yokoo, M.; Pynadath, D.; and Marsella, S. 2003. Taming decentralized pomdps: Towards efficient policy computation for multiagent settings. In Proceedings of the 18th International Joint Conference on Artificial Intelligence.
11. Peshkin, L.; Kim, K.-E.; Meuleau, N.; and Kaelbling, L. 2000. Learning to cooperate via policy search. In Proceedings of the 16th Conference on Uncertainty in Artificial Intelligence.
12. Pineau, J.; Gordon, G.; and Thrun, S. 2003. Point-based value iteration: An anytime algorithm for pomdps. In Proceedings of the 18th International Joint Conference on Artificial Intelligence.
13. Shirai, Y.; Osgood, A. J.; Zhao, Y.; Kelly, K. F.; and Tour, J. M. 2005. Directional control in thermally driven singlemolecule nanocars. Nano Letters 5(11).
14. Szer, D., and Charpillet, F. 2005. An optimal best-first search algorithm for solving infinite horizon dec-pomdps. In Proceedings of the 16st European Conference on Machine Learning.
15. Szer, D.; Charpillet, F.; and Zilberstein, S. 2005. MAA*: A heuristic search algorithm for solving decentralized POMDPs. In Proceedings of the 21st Conference on Uncertainty in Artificial Intelligence.
16. Varakantham, P.; Nair, R.; Tambe, M.; and Yokoo, M. 2006. Winning back the cup for distributed pomdps: Planning over continuous belief spaces. In Proceedings of the 5th International Joint Conference on Autonomous Agents and Multiagent Systems.