Nested rollout policy adaptation for Monte Carlo tree search

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2011, Pages 649-654

  Rosin, Christopher D ^a  

^a Parity Computing Inc   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DETERMINISTIC OPTIMIZATION PROBLEMS; DOMAIN-SPECIFIC POLICIES; MONTE CARLO TREE SEARCH (MCTS); MONTE-CARLO TREE SEARCHES; NESTED MONTE-CARLO; NESTED ROLLOUT POLICY ADAPTATIONS; RANDOMIZED DECISIONS; SEARCH EFFICIENCY;

ARTIFICIAL INTELLIGENCE; OPTIMIZATION;

FORESTRY;

FORESTRY; OPTIMIZATION; PROBLEM SOLVING;

EID: 84881043243     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.5591/978-1-57735-516-8/IJCAI11-115     Document Type: Conference Paper

References (30)

1. H. Akiyama et al. Nested MonteCarlo search with AMAF heuristic. In TAAI, 2010.
2. D. Bertsekas. Differential training of roll-out policies. In Allerton Conf., 1997.
3. R. Bjarnason et al. Searching solitaire in real time. ICGA J., 2007.
4. C. Boyer. Science & Vie, page 144, Nov. 2010.
5. C. Boyer. http://morpionsolitaire.com, 2011.
6. C.-H. Bruneau. Science & Vie, April 1976.
7. T. Cazenave. Reflexive Monte-Carlo search. In CGW, 2007.
8. T. Cazenave. Nested Monte-Carlo search. In IJCAI, 2009.
9. T. Cazenave et al. Monte-Carlo bus regulation. In ITSC, 2009.
10. R. Coulom. Computing Elo ratings of move patterns in the game of Go. In CGW, 2007.
11. GAMES Magazine, page 76, August 2006.
12. Winning solution: page 93, December 2006.
13. GAMES Magazine, page 8, June 1994.
14. Winning solution: page 67, October 1994.
15. F. de Mesmay et al. Bandit-based optimization for library performance tuning. ICML, 2009.
16. E. D. Demaine et al. Morpion Solitaire. Theory Comput. Syst., 2006.
17. A. Fern et al. Approximate policy iteration with a policy language bias. In NIPS, 2003.
18. H. Finnsson et al. Learning simulation control in GGP agents. In AAAI, 2010.
19. M. Garey and D. Johnson. Computers and Intractability. 1979.
20. S. Gelly et al. Combining online and offline knowledge in UCT. In ICML, 2007.
21. M. Ginsberg et al. Search lessons learned from crossword puzzles. In AAAI, 1990.
22. P. Larranaga et al. Estimation of Distribution Algorithms. Kluwer, 2002.
23. J. Méhat et al. Combining UCT and NMCS for single-player GGP. IEEE TCIAIG, 2010.
24. H. Nakhost et al. Monte-Carlo exploration for deterministic planning. IJCAI, 2009.
25. A. Rimmel et al. Optimization of the Nested Monte-Carlo Algorithm on the Traveling Salesman Problem with Time Windows. In Evostar, 2011.
26. A. Saffidine et al. UCD: Upper confidence bound for directed acyclic graphs. In TAAI, 2010.
27. D. Silver et al. Monte-Carlo simulation balancing. In ICML, 2009.
28. D. Silver et al. Monte-Carlo planning in large POMDPs. In NIPS, 2010.
29. G. Tesauro et al. On-line policy improvement using Monte-Carlo search. In NIPS, 1996.
30. J. Veness et al. A Monte-Carlo AIXI approximation. JAIR, 2011.