Rollout sampling policy iteration for decentralized POMDPs

Proceedings of the 26th Conference on Uncertainty in Artificial Intelligence, UAI 2010

Volumn , Issue , 2010, Pages 666-673

  Wu, Feng ^a   Zilberstein, Shlomo ^b   Chen, Xiaoping ^a  

^a UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA   (China)

^b University of Massachusetts Amherst   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MONTE CARLO METHODS; MULTI AGENT SYSTEMS; SCALABILITY; SOFTWARE AGENTS;

BOUNDED MEMORY; DECISION PROBLEMS; EXPLICIT MODELING; LINEAR TIME COMPLEXITY; MULTI AGENT; PLANNING ALGORITHMS; POLICY ITERATION; SOLUTION QUALITY;

ITERATIVE METHODS;

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

References (20)

1. Chistopher Amato, Jilles S. Dibangoye, and Shlomo Zilberstein. Incremental policy generation for finite-horizon DECPOMDPs. In Proc. of the 19th Int'l Conf. on Automated Planning and Scheduling, pages 2-9, 2009.
2. Daniel S. Bernstein, Shlomo Zilberstein, and Neil Immerman. The complexity of decentralized control of Markov decision processes. In Proc. of the 16th Conf. on Uncertainty in Artificial Intelligence, pages 32-37, 2000.
3. Daniel S. Bernstein, Eric A. Hansen, and Shlomo Zilberstein. Bounded policy iteration for decentralized POMDPs. In Proc. of the 19th Int'l Joint Conf. on Artificial Intelligence, pages 1287-1292, 2005.
4. Dimitri P. Bertsekas, John N. Tsitsiklis, and Cynara Wu. Rollout algorithms for combinatorial optimization. Journal of Heuristics, 3(3):245-262, 1997. (Pubitemid 127509041)
5. Camille Besse and Brahim Chaib-draa. Parallel rollout for online solution of Dec-POMDPs. In Proc. of the 21st Int'l FLAIRS Conf., pages 619-624, 2008.
6. Lucian Busoniu, Robert Babuska, and Bart D. Schutter. A comprehensive survey of multiagent reinforcement learning. IEEE Trans. on SMC, Part C, 38(2):156-172, 2008. (Pubitemid 351404112)
7. Hyeong Soo Chang, Robert Givan, and Edwin K. P. Chong. Parallel rollout for online solution of partially observable Markov decision processes. Discrete Event Dynamic Systems, 14(3):309-341, 2004.
8. Jilles S. Dibangoye, Abdel-Illah Mouaddib, and Brahim Chaib-draa. Point-based incremental pruning heuristic for solving finite-horizon DEC-POMDPs. In Proc. of the 8th Int'l Joint Conf. on Autonomous Agents and Multi-Agent Systems, pages 569-576, 2009.
9. Christos Dimitrakakis and Michail G. Lagoudakis. Rollout sampling approximate policy iteration. Machine Learning, 72(3):157-171, 2008.
10. Alan Fern, Sung Wook Yoon, and Robert Givan. Approximate policy iteration with a policy language bias. In Proc. of the 17th Conf. on Neural Info. Processing Systems, pages 847-854, 2003.
11. Eric A. Hansen, Daniel S. Bernstein, and Shlomo Zilberstein. Dynamic programming for partially observable stochastic games. In Proc. of the 19th National Conf. on Artificial Intelligence, pages 709-715, 2004.
12. Michail G. Lagoudakis and Ronald Parr. Reinforcement learning as classification: Leveraging modern classifiers. In Proc. of the 20th Int'l Conf. on Machine Learning, pages 424-431, 2003.
13. Francisco S. Melo. Exploiting locality of interactions using a policy-gradient approach in multiagent learning. In Proc. of the 18th European Conf. on Artificial Intelligence, volume 178, pages 157-161, 2008.
14. Ranjit Nair, Milind Tambe, Makoto Yokoo, David V. Pynadath, and Stacy Marsella. Taming decentralized POMDPs: Towards efficient policy computation for multiagent settings. In Proc. of the 18th Int'l Joint Conf. on Artificial Intelligence, pages 705-711, 2003.
15. Leonid Peshkin, Kee-Eung Kim, Nicolas Meuleau, and Leslie Pack Kaelbling. Learning to cooperate via policy search. In Proc. of the 16th Conf. on Uncertainty in Artificial Intelligence, pages 489-496, 2000.
16. Pascal Poupart and Craig Boutilier. Bounded finite state controllers. In Proc. of the 17th Annual Conference on Neural Information Processing Systems, pages 823-830, 2003.
17. Sven Seuken and Shlomo Zilberstein. Improved memorybounded dynamic programming for decentralized POMDPs. In Proc. of the 23rd Conf. on Uncertainty in Artificial Intelligence, pages 344-351, 2007.
18. Sven Seuken and Shlomo Zilberstein. Memory-bounded dynamic programming for DEC-POMDPs. In Proc. of the 20th Int'll Joint Conf. on Artificial Intelligence, pages 2009- 2015, 2007.
19. Richard Sutton and Andrew Barto. Reinforcement Learning: An Introduction. MIT Press, Cambridge, MA, 1998.
20. Xinhua Zhang, Douglas Aberdeen, and S. V. N. Vishwanathan. Conditional random fields for multi-agent reinforcement learning. In Proc. of the 24th Int'l Conf. on Machine Learning, volume 227, pages 1143-1150, 2007.