Winning back the CUP for distributed POMDPs: Planning over continuous belief spaces

Proceedings of the International Conference on Autonomous Agents

Volumn 2006, Issue , 2006, Pages 289-296

  Varakantham, Pradeep ^a   Nair, Ranjit ^b   Tambe, Milind ^a   Yokoo, Makoto ^c  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

^b HONEYWELL TECHNOLOGY CENTER   (United States)

^c KYUSHU UNIVERSITY   (Japan)

Author keywords

Continuous initial beliefs; Distributed POMDP; Multi agent systems; Partially observable markov decision process (POMDP)

Indexed keywords

CONTINUOUS INITIAL BELIEFS; DISTRIBUTED POMDP; PARTIALLY OBSERVABLE MARKOV DECISION PROCESS (POMDP);

ALGORITHMS; DISTRIBUTED COMPUTER SYSTEMS; FINITE AUTOMATA; HEURISTIC METHODS; MARKOV PROCESSES; PROBLEM SOLVING;

MULTI AGENT SYSTEMS;

EID: 34247187490     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1160633.1160683     Document Type: Conference Paper

References (18)

1. M. L. Littman A. R. Cassandra and N. L. Zhang. Incremental pruning: A simple, fast, exact method for partially observable markov decision processes. In UAI, 1997.
2. R. Becker, S. Zilberstein, V. Lesser, and C. V. Goldman. Transition-independent decentralized Markov decision processes. In AAMAS, 2003.
3. D. S. Bernstein, S. Zilberstein, and N. Immerman. The complexity of decentralized control of MDPs. In UAI, 2000.
4. I. Chadès, B. Scherrer, and F. Charpillet. A heuristic approach for solving decentralized-pomdp: Assessment on the pursuit problem. In SAC, 2002.
5. Z. Feng and S. Zilberstein. Region based incremental pruning for POMDPs. In UAI, 2004.
6. Claudia V. Goldman and Shlomo Zilberstein. Optimizing information exchange in cooperative multi-agent systems. In AAMAS, 2003.
7. D. Bernstein; E. Hansen; and S. Zilberstein. Bounded policy iteration for decentralized pomdps. In IJCAI, 2005.
8. Eric A. Hansen, Daniel S. Bernstein, and Shlomo Zilberstein. Dynamic programming for partially observable stochastic games. In AAAI, 2004.
9. L. Kaelbling, M. Littman, and A. Cassandra. Planning and acting in partially observable stochastic domains. AIJ, 101(2), 1998.
10. R.E. Montemerlo, G. Gordon, J. Schneider, and S. Thrun. Approximate solutions for partially observable stochastic games with common payoffs. In AAMAS, 2004.
11. R. Nair, D. Pynadath, M. Yokoo, M. Tambe, and S. Marsella. Taming decentralized POMDPs: Towards efficient policy computation for multiagent settings. In IJCAI, 2003.
12. R. Nair, M. Roth, M. Yokoo, and M. Tambe. Communication for improving policy computation in distributed pomdps. In AAMAS, 2004.
13. R. Nair, M. Tambe, and S. Marsella. Role allocation and reallocation in multiagent teams: Towards a practical analysis. In AAMAS, 2003.
14. R. Nair, P. Varakantham, M. Tambe, and M. Yokoo. Networked distributed POMDPs: A synthesis of distributed constraint optimization and POMDPs. In AAAI, 2005.
15. M. Tambe P. Varakantham, R. Maheswaran. Exploiting belief bounds: Practical pomdps for personal assistant agents. In AAMAS, 2005.
16. L. Peshkin, N. Meuleau, K.-E. Kim, and L. Kaelbling. Learning to cooperate via policy search. In UAI, 2000.
17. D. V. Pynadath and M. Tambe. The communicative multiagent team decision problem: Analyzing teamwork theories and models. JAIR, 16:389-423, 2002.
18. P. Xuan, V. Lesser, and S. Zilberstein. Communication decisions in multiagent cooperation. In Agents, 2001.