Action selection for MDPs: Anytime AO* versus UCT

Proceedings of the National Conference on Artificial Intelligence

Volumn 3, Issue , 2012, Pages 1749-1755

  Bonet, Blai ^a   Geffner, Hector ^b  

^a UNIVERSIDAD SIMÓN BOLÍVAR   (Venezuela)

^b UNIVERSITAT POMPEU FABRA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ACTION SELECTION; AND/OR GRAPHS; DYNAMIC PROGRAMMING ALGORITHM; EXPLICIT GRAPHS; HEURISTIC SEARCH; INFINITE HORIZONS; OPTIMAL ALGORITHM; OPTIMAL POLICIES; OPTIMAL VARIANTS;

HEURISTIC ALGORITHMS; OPTIMIZATION;

ARTIFICIAL INTELLIGENCE;

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

References (24)

1. Auer, P.; Cesa-Bianchi, N.; and Fischer, P. 2002. Finite-time analysis of the multiarmed bandit problem. Machine learning 47(2):235-256.
2. Balla, R., and Fern, A. 2009. UCT for tactical assault planning in real-time strategy games. In Proc. IJCAI-09, 40-45.
3. Barto, A.; Bradtke, S.; and Singh, S. 1995. Learning to act using real-time dynamic programming. Artificial Intelligence 72:81-138.
4. Bertsekas, D.; Tsitsiklis, J.; and Wu, C. 1997. Rollout algorithms for combinatorial optimization. J. of Heuristics 3(3):245-262.
5. Bonet, B., and Geffner, H. 2003. Labeled RTDP: Improving the convergence of real-time dynamic programming. In Proc. ICAPS, 12-31.
6. Chaslot, G.; Winands, M.; Herik, H.; Uiterwijk, J.; and Bouzy, B. 2008. Progressive strategies for monte-carlo tree search. New Math. and Natural Comp. 4(3):343.
7. Eyerich, P.; Keller, T.; and Helmert, M. 2010. High-quality policies for the canadian traveler's problem. In Proc. AAAI.
8. Finnsson, H., and Björnsson, Y. 2008. Simulation-based approach to general game playing. In Proc. AAAI, 259-264.
9. Gelly, S., and Silver, D. 2007. Combining online and offline knowledge in uct. In Proc. ICML, 273-280.
10. Hansen, E., and Zhou, R. 2007. Anytime heuristic search. J. Artif. Intell. Res. 28:267-297.
11. Howard, R. 1971. Dynamic Probabilistic Systems-Volume I: Markov Models. New York: Wiley.
12. Kearns, M.; Mansour, Y.; and Ng, A. 1999. A sparse sampling algorithm for near-optimal planning in large MDPs. In Proc. IJCAI-99, 1324-1331.
13. Kocsis, L., and Szepesvári, C. 2006. Bandit based Monte-Carlo planning. In Proc. ECML-2006, 282-293.
14. Koenig, S., and Sun, X. 2009. Comparing real-time and incremental heuristic search for real-time situated agents. Autonomous Agents and Multi-Agent Systems 18(3):313-341.
15. Likhachev, M.; Gordon, G.; and Thrun, S. 2003. ARA*: Anytime A* with provable bounds on sub-optimality. In Proc. NIPS.
16. Munos, R., and Coquelin, P. 2007. Bandit algorithms for tree search. In Proc. UAI, 67-74.
17. Nilsson, N. 1980. Principles of Artificial Intelligence. Tioga.
18. Papadimitriou, C., and Yannakakis, M. 1991. Shortest paths without a map. Theoretical Comp. Sci. 84(1):127-150.
19. Ramanujan, R.; Sabharwal, A.; and Selman, B. 2010. On adversarial search spaces and sampling-based planning. In Proc. ICAPS, 242-245.
20. Silver, D., and Veness, J. 2010. Monte-carlo planning in large POMDPs. In Proc. NIPS, 2164-2172.
21. Sutton, R., and Barto, A. 1998. Introduction to Reinforcement Learning. MIT Press.
22. Thayer, J., and Ruml, W. 2010. Anytime heuristic search: Frameworks and algorithms. In Proc. SOCS.
23. Walsh, T.; Goschin, S.; and Littman, M. 2010. Integrating sample-based planning and model-based reinforcement learning. In Proc. AAAI.
24. Yan, X.; Diaconis, P.; Rusmevichientong, P.; and Van Roy, B. 2005. Solitaire: Man versus machine. In Proc. NIPS 17.