Parallel rollout for online solution of DEC-POMDPS

Proceedings of the 21th International Florida Artificial Intelligence Research Society Conference, FLAIRS-21

Volumn , Issue , 2008, Pages 619-624

  Besse, Camille ^a   Chaib draa, Brahim ^a  

^a UNIVERSITÉ LAVAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; DYNAMIC PROGRAMMING; POLYNOMIAL APPROXIMATION; SYSTEMS ENGINEERING;

APPROXIMATION TECHNIQUES; DYNAMIC PROGRAMMING ALGORITHMS; ESTIMATION TECHNIQUES; FINITE HORIZON PROBLEMS; FINITE HORIZONS; ONLINE ALGORITHMS; RESEARCH CHALLENGES; ROLL-OUTS; ROLLOUT ALGORITHMS;

APPROXIMATION ALGORITHMS;

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

References (20)

1. Amato, C.; Bernstein, D. S.; and Zilberstein, S. 2007. Optimizing Memory-Bounded Controllers for Decentralized POMDPs. In Proc. of Uncertainty in Artificial Intelligence.
2. Bernstein, D. S.; Zilberstein, S.; and Immerman, N. 2000. The Complexity of Decentralized Control of Markov Decision Processes. In Proc. of Uncertainty In Artificial Intelligence, 32-37.
3. Bertsekas, D. P.; Tsitsiklis, J. N.; and Wu, C. 1997. Roll-out Algorithms for Combinatorial Optimization. Journal of Heuristics 3(3):245-262.
4. Chang, H. S.; Givan, R.; and Chong, E. K. P. 2004. Parallel Rollout for Online Solution of POMDPs. Discrete Event Dynamic Systems 14(3):309-341.
5. Emery-Montemerlo, R.; Gordon, G. J.; Schneider, J. G.; and Thrun, S. 2004. Approximate Solutions for Partially Observable Stochastic Games with Common Payoffs. In Proc. of the International Joint Conference on Autonomous Agents and Multi-Agent Systems.
6. Fox, D.; Thrun, S.; Burgard, W.; and Dellaert, F. 2001. Particle Filters for Mobile Robot Localization. Springer, chapter 19.
7. Fox, D. 2001. KLD-Sampling: Adaptive Particle Filters. In Proc. of Advances in Neural Information Processing Systems, 713-720.
8. Hansen, E. A.; Bernstein, D. S.; and Zilberstein, S. 2004. Dynamic Programming for Partially Observable Stochastic Games. In Proc. of Association for the Advancement of Artificial Intelligence, 709-715.
9. Kwok, C., Fox, D.; and Meila, M. 2003. Adaptive Real-Time Particle Filters for Robot Localization. In Proc. of the IEEE International Conference on Robotics & Automation.
10. Nair, R.; Tambe, M.; Yokoo, M.; Pynadath, D. V.; and Marsella, S. 2003. Taming Decentralized POMDPs: Towards Efficient Policy Computation for Multiagent Settings. In Proc. of the International Joint Conference on Artificial Intelligence, 705-711.
11. Peshkin, L.; Kim, K.-E.; Meuleau, N.; and Kaelbling, L. P. 2000. Learning to Cooperate via Policy Search. In Proc. of Uncertainty in Artificial Intelligence, 489-496.
12. Pynadath, D. V., and Tambe, M. 2002. The Communicative Multiagent Team Decision Problem: Analyzing Teamwork Theories and Models. J. Artif. Intell. Res. (JAIR) 16:389-423.
13. Rabinovich, Z.; Goldman, C. V.; and Rosenschein, J. S. 2003. The Complexity of Multiagent Systems: the Price of Silence. In Proc. of the International Joint Conference on Autonomous Agents & Multiagent Systems, 1102-1103.
14. Ross, S., and Chaib-draa, B. 2007. Aems: An anytime online search algorithm for approximate policy refinement in large pomdps. In Proc. of the International Joint Conference on Artificial Intelligence, 2592-2598.
15. Roth, M.; Simmons, R.; and Veloso, M. 2005. Reasoning About Joint Beliefs for Execution-Time Communication Decisions. In Proc. of the International Joint Conference on Autonomous Agents and Multi-Agent Systems.
16. Seuken, S., and Zilberstein, S. 2005. Formal Models and Algorithms for Decentralized Control of Multiple Agents. Technical report, Computer Science Department, University of Massachusetts, Amherst.
17. Seuken, S., and Zilberstein, S. 2007a. Improved Memory-Bounded Dynamic Programming for Dec-POMDPs. In Proc. of Uncertainty in Artificial Intelligence.
18. Seuken, S., and Zilberstein, S. 2007b. Memory-Bounded Dynamic Programming for Dec-POMDPs. In Proc. of the International Joint Conference on Artificial Intelligence, 2009-2015.
19. Szer, D., and Charpillet, F. 2005. An Optimal Best-First Search Algorithm for Solving Infinite Horizon DECPOMDPs. In Proc. of the European Conference on Machine Learning, 389-399.
20. Thrun, S. 1999. Monte Carlo POMDPs. In Proc. of Advances in Neural Information Processing Systems, 1064-1070.