Approximate solutions for factored Dec-POMDPs with many agents

12th International Conference on Autonomous Agents and Multiagent Systems 2013, AAMAS 2013

Volumn 1, Issue , 2013, Pages 563-570

  Oliehoek, Frans A ^a   Whiteson, Shimon ^b   Spaan, Matthijs T J ^c  

^a MAASTRICHT UNIVERSITY   (Netherlands)

^b UNIVERSITY OF AMSTERDAM   (Netherlands)

^c DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Factored decentralized partially observable Markov decision processes; Multi agent planning

Indexed keywords

AUTONOMOUS AGENTS; MULTI AGENT SYSTEMS; SCALABILITY;

APPROXIMATE INFERENCE; APPROXIMATE SOLUTION; COMPUTATION METHODS; COUPLED STRUCTURES; EMPIRICAL EVALUATIONS; INTERACTION STRUCTURES; MULTI-AGENT PLANNING; PARTIALLY OBSERVABLE MARKOV DECISION PROCESS;

HEURISTIC METHODS;

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

References (34)

1. R. Becker, S. Zilberstein, V. Lesser, and C. V. Goldman. Transition-independent decentralized Markov decision processes. In AAMAS, 2003.
2. D. S. Bernstein, R. Givan, N. Immerman, and S. Zilberstein. The complexity of decentralized control of Markov decision processes. Math, of OR, 27(4): 819-840, 2002.
3. C. Boutilier, T. Dean, and S. Hanks. Decision-theoretic planning: Structural assumptions and computational leverage. J AIR, 11: 1-94, 1999.
4. X. Boyen and D. Koller. Tractable inference for complex stochastic processes. In UAI, 1998.
5. R. Emery-Montemerlo, G. Gordon, J. Schneider, and S. Thrun. Approximate solutions for partially observable stochastic games with common payoffs. In AAMAS, 2004.
6. R. Emery-Montemerlo, G. Gordon, J. Schneider, and S. Thrun. Game theoretic control for robot teams. In Proc. of the IEEE Int. Conf. on Robotics and Automation, 2005.
7. A. Farinelli, A. Rogers, A. Petcu, and N. R. Jennings. Decentralised coordination of low-power embedded devices using the max-sum algorithm. In AAMAS, 2008.
8. C. Guestrin, D. Koller, R. Parr, and S. Venkataraman. Efficient solution algorithms for factored MDPs. JAIR, 19: 399-468, 2003.
9. Y. Kim, M. Krainin, and V. Lesser. Application of max-sum algorithm to radar coordination and scheduling. In Workshop on Distributed Constraint Reasoning, 2010.
10. J. R. Kok and N. Vlassis. Collaborative multiagent reinforcement learning by payoff propagation. JMLR, 7: 1789-1828, 2006.
11. D. Koller and R. Parr. Computing factored value functions for policies in structured MDPs. In IJCAI, 1999.
12. A. Kumar and S. Zilberstein. Constraint-based dynamic programming for decentralized POMDPs with structured interactions. In AAMAS, 2009.
13. A. Kumar, S. Zilberstein, and M. Toussaint. Scalable multiagent planning using probabilistic inference. In IJCAI, 2011.
14. J. Marecki, T. Gupta, P. Varakantham, M. Tambe, and M. Yokoo. Not all agents are equal: scaling up distributed POMDPs for agent networks. In AAMAS, 2008.
15. K. P. Murphy and Y. Weiss. The factored frontier algorithm for approximate inference in DBNs. In UAI, 2001.
16. R. Nair, P. Varakantham, M. Tambe, and M. Yokoo. Networked distributed POMDPs: A synthesis of distributed constraint optimization and POMDPs. In AAAI, 2005.
17. F. A. Oliehoek. Value-Based Planning for Teams of Agents in Stochastic Partially Observable Environments. PhD thesis, Informatics Institute, Univ. of Amsterdam, 2010.
18. F. A. Oliehoek. Decentralized POMDPs. In M. Wiering and M. van Otterlo, editors, Reinforcement Learning: State of the Art. Springer Berlin Heidelberg, 2012.
19. F. A. Oliehoek, J. F. Kooi, and N. Vlassis. The cross-entropy method for policy search in decentralized POMDPs. Informatica, 32: 341-357, 2008.
20. F. A. Oliehoek, M. T. J. Spaan, and N. Vlassis. Optimal and approximate Q-value functions for decentralized POMDPs. JAIR, 32: 289-353, 2008.
21. F. A. Oliehoek, M. T. J. Spaan, S. Whiteson, and N. Vlassis. Exploiting locality of interaction in factored Dec-POMDPs. In AAMAS, 2008.
22. F. A. Oliehoek, S. Whiteson, and M. T. J. Spaan. Exploiting structure in cooperative Bayesian games. In UAI, 2012.
23. J. Pajarinen and J. Peltonen. Efficient planning for factored infinite-horizon DEC-POMDPs. In IJCAI, 2011.
24. Z. Rabinovich, C. V. Goldman, and J. S. Rosenschein. The complexity of multiagent systems: the price of silence. In AAMAS, 2003.
25. A. Rogers, A. Farinelli, R. Stranders, and N. Jennings. Bounded approximate decentralised coordination via the max-sum algorithm. Artif Intel., 175(2): 730-759, 2011.
26. S. Seuken and S. Zilberstein. Formal models and algorithms for decentralized decision making under uncertainty. Autonomous Agents and Multi-Agent Systems, 17(2): 190-250, 2008.
27. M. T. J. Spaan, F. A. Oliehoek, and C. Amato. Scaling up optimal heuristic search in Dec-POMDPs via incremental expansion. In IJCAI, 2011.
28. *: A heuristic search algorithm for solving decentralized POMDPs. In UAI, 2005.
29. M. E. Taylor and P. Stone. Transfer learning for reinforcement learning domains: A survey. JMLR, 10: 1633-1685, 2009.
30. P. Varakantham, J. Kwak, M. E. Taylor, J. Marecki, P. Scerri, and M. Tambe. Exploiting coordination locales in distributed POMDPs via social model shaping. In ICAPS, 2009.
31. P. Varakantham, J. Marecki, Y. Yabu, M. Tambe, and M. Yokoo. Letting loose a SPIDER on a network of POMDPs: Generating quality guaranteed policies. In AAMAS, 2007.
32. P. Velagapudi, P. Varakantham, P. Scerri, and K. Sycara. Distributed model shaping for scaling to decentralized POMDPs with hundreds of agents. In AAMAS, 2011.
33. S. J. Witwicki and E. H. Durfee. Influence-based policy abstraction for weakly-coupled Dec-POMDPs. In ICAPS, 2010.
34. F. Wu, S. Zilberstein, and X. Chen. Rollout sampling policy iteration for decentralized POMDPs. In UAI, 2010.