Letting loose a SPIDER on a network of POMDPs: Generating quality guaranteed policies

Proceedings of the International Conference on Autonomous Agents

Volumn , Issue , 2007, Pages 822-829

  Varakantham, Pradeep ^a   Marecki, Janusz ^a   Yabu, Yuichi ^b   Tambe, Milind ^a   Yokoo, Makoto ^b  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

^b KYUSHU UNIVERSITY   (Japan)

Author keywords

Distributed POMDP; Globally optimal solution; Multi agent systems; Partially observable markov decision process (POMDP)

Indexed keywords

AGENT INTERACTIONS; APPROXIMATE SOLUTIONS; COMPUTATIONAL COSTS; DISTRIBUTED POMDP; GLOBAL OPTIMALITY; GLOBALLY OPTIMAL SOLUTION; KEY FEATURES; NETWORK OF AGENTS; OPTIMAL ALGORITHMS; ORDERS OF MAGNITUDES; PARTIALLY OBSERVABLE MARKOV DECISION PROBLEMS; PARTIALLY OBSERVABLE MARKOV DECISION PROCESS (POMDP); POLICY GENERATIONS; POLICY SEARCHES; QUALITY GUARANTEED; SCALE-UP; SOLUTION QUALITIES;

AGENTS; AUTONOMOUS AGENTS; FUZZY CLUSTERING; OPTIMAL SYSTEMS; OPTIMIZATION; STOCHASTIC CONTROL SYSTEMS;

MULTI AGENT SYSTEMS;

EID: 60349101997     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1329125.1329388     Document Type: Conference Paper

References (13)

1. R. Becker, S. Zilberstein, V. Lesser, and C.V. Goldman. Solving transition independent decentralized Markov decision processes. JAIR, 22:423-455, 2004.
2. D. S. Bernstein, E.A. Hansen, and S. Zilberstein. Bounded policy iteration for decentralized POMDPs. In IJCAI, 2005.
3. D. S. Bernstein, S. Zilberstein, and N. Immerman. The complexity of decentralized control of MDPs. In UAI, 2000.
4. R. Emery-Montemerlo, G. Gordon, J. Schneider, and S. Thrun. Approximate solutions for partially observable stochastic games with common payoffs. In AAMAS, 2004.
5. E. Hansen, D. Bernstein, and S. Zilberstein. Dynamic programming for partially observable stochastic games. In AAAI, 2004.
6. V. Lesser, C. Ortiz, and M. Tambe. Distributed sensor nets: A multiagent perspective. Kluwer, 2003.
7. R. Maheswaran, M. Tambe, E. Bowring, J. Pearce, and P. Varakantham. Taking dcop to the real world : Efficient complete solutions for distributed event, scheduling. In AAMAS, 2004.
8. P. J. Modi, W. Shen, M. Tambe, and M. Yokoo. An asynchronous complete method for distributed constraint optimization. In AAMAS, 2003.
9. R. Nair, D. Pynadath, M. Yokoo, M. Tambe, and S. Marsella. Taming decentralized POMDPs: Towards efficient, policy computation for multiagent settings. In IJCAI, 2003.
10. R. Nair, P. Varakanthatn, M. Tambe, and M. Yokoo. Networked distributed POMDPs: A synthesis of distributed constraint, optimization and POMDPs. In AAAI, 2005.
11. L. Peshkin, N. Meuleau, K.-E. Kim, and L. Kaelbling. Learning to cooperate via policy search. In UAI, 2000.
12. A. Petcu and B. Faltings. A scalable method for multiagent constraint, optimization. In IJCAI, 2005.
13. D. Szer, F. Charpillet, and S. Zilberstein. MAA*: A heuristic search algorithm for solving decentralized POMDPs. In IJCAI, 2005.