A local Monte Carlo tree search approach in deterministic planning

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2011, Pages 1832-1833

  Xie, Fan ^a   Nakhost, Hootan ^a   Müller, Martin ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

HIGH QUALITY; LOCAL SEARCH; MONTE CARLO; PLAN QUALITY; PROBLEM COMPLEXITY; QUALITY PLANS; RANDOM WALK; SATISFICING; SCALING BEHAVIOR; STATE OF THE ART; TREE SEARCH;

ARTIFICIAL INTELLIGENCE; MONTE CARLO METHODS; PLANNING; PLANT EXTRACTS; RANDOM PROCESSES;

TREES (MATHEMATICS);

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

References (4)

1. Hoffmann, J., and Nebel, B. 2001. The FF planning system: Fast plan generation through heuristic search. J. Artificial Intelligence Research 14:253-302.
2. Nakhost, H., and Müller, M. 2009. Monte-Carlo exploration for deterministic planning. In Proc. IJCAI 09, 1766-1771.
3. Nakhost, H., and Müller, M. 2010. Action elimination and plan neighborhood graph search: Two algorithms for plan improvement. In Proc. ICAPS-2010, 121-128. Toronto, CA: AAAI Press.
4. Richter, S.; Helmert, M.; and Westphal, M. 2008. Landmarks revisited. In Proc. AAAI-08, 975-982.