Trade-offs in sampling-based adversarial planning

ICAPS 2011 - Proceedings of the 21st International Conference on Automated Planning and Scheduling

Volumn , Issue , 2011, Pages 202-209

  Ramanujan, Raghuram ^a   Selman, Bart ^a  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADVERSARIAL PLANNING; COMPARATIVE STUDIES; FIRST DOMAIN; HYBRID APPROACH; KEY COMPONENT; SAMPLING-BASED; SEARCH ALGORITHMS; SEARCH SPACES; TERMINAL NODES; UPPER CONFIDENCE BOUND; VALUE ESTIMATION;

TREES (MATHEMATICS);

ALGORITHMS;

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

References (24)

1. Arneson, B.; Hayward, R. B.; and Henderson, P. 2010. Monte Carlo tree search in hex. Computational Intelligence and AI in Games, IEEE Transactions on 2(4):251-258.
2. Auer, P.; Cesa-Bianchi, N.; and Fischer, P. 2002. Finite-time analysis of the multiarmed bandit problem. Machine Learning 47(2-3):235-256. (Pubitemid 34126111)
3. Balla, R.-K., and Fern, A. 2009. UCT for tactical assault planning in real-time strategy games. In Proceedings of the 21st international joint conference on Artifical intelligence, 40-45. San Francisco, CA, USA: Morgan Kaufmann Publishers Inc.
4. Beal, D. 1980. An analysis of minimax. In M.R.B., C., ed., Advances in Computer Chess 2, 103-109. Edinburgh University Press.
5. Biermann, A. W. 1978. Theoretical issues related to computer game playing programs. Personal Computing 86-88.
6. Campbell, M.; Hoane, Jr., A. J.; and Hsu, F.-h. 2002. Deep Blue. Artif. Intell. 134:57-83. (Pubitemid 34086579)
7. Ciancarini, P., and Favini, G. P. 2009. Monte Carlo tree search techniques in the game of Kriegspiel. In IJCAI-09.
8. Coquelin, P.-A., and Munos, R. 2007. Bandit algorithms for tree search. CoRR abs/cs/0703062.
9. Coulom, R. 2006. Efficient selectivity and backup operators in Monte-Carlo tree search. In Computers and Games, 72-83.
10. Finnsson, H., and Björnsson, Y. 2008. Simulation-based approach to general game playing. In AAAI-08,259-264. AAAI Press.
11. Gansner, E. R., and North, S. C. 2000. An open graph visualization system and its applications to software engineering. Sofiware - Practice and Experience 30(11): 1203-1233.
12. Gelly, S., and Silver, D. 2007. Combining online and offline knowledge in UCT. In 24th ICML, 273-280.
13. Gelly, S., and Silver, D. 2008. Achieving master level play in 9 x 9 computer Go. In 23rd AAAI, 1537-1540.
14. Gifford, C.; Bley, J.; Ajayi, D.; and Thompson, Z. 2008. Searching and game playing: An artificial intelligence approach to Mancala. Technical Report ITTC-FY2009-TR-03050-03, Information Telecommunication and Technology Center, University of Kansas, Lawrence, KS.
15. Irving, G.; Donkers, J.; and Uiterwijk, J. 2000. Solving Kalah. ICGA Journal 23(3): 139-148.
16. Kocsis, L., and Szepesvári, C. 2006. Bandit based Monte-Carlo planning. In 17th ECML, volume 4212 of LNCS, 282-293.
17. Lorentz, R. J. 2008. Amazons discover Monte-Carlo. In Computers and Games, 13-24.
18. Nau, D. S.; Luštrek, M.; Parker, A.; Bratko, I.; and Gams, M. 2010. When is it better not to look ahead? Artif. Intell. 174:1323-1338.
19. Nau, D. S. 1982. An investigation of the causes of pathology in games. Artif. Intell. 19:257-278.
20. Pearl, J. 1983. On the nature of pathology in game searching. Artif. Intell. 20(4):427-453.
21. Ramanujan, R.; Sabharwal, A.; and Selman, B. 2010a. On adversarial search spaces and sampling-based planning. In 20th ICAPS, 242-245.
22. Ramanujan, R.; Sabharwal, A.; and Selman, B. 2010b. Understanding sampling style adversarial search methods. In 26th UAI.
23. Truscott, T. R. 1981. Techniques used in minimax game-playing programs. Master's thesis, Duke University, Durham, NC.
24. Winands, M. H. M., and Björnsson, Y. 2009. Evaluation function based Monte-Carlo LOA. In ACG, 33-44.