Search
Skip to Search Results
Filter
Subject / Keyword
- 1AI planning
- 1Abstract Games
- 1Artificial Intelligence
- 1Heuristic Search
- 1Monte-Carlo
- 1Plan Improvement
Item type
Supervisors
Author / Creator / Contributor
Year
Collections
Languages
Departments
-
Spring 2010
The Monte-Carlo Tree Search (MCTS) algorithm Upper Confidence bounds applied to Trees (UCT) has become extremely popular in computer games research. Because of the importance of this family of algorithms, a deeper understanding of when and how their different enhancements work is desirable. To...
-
Fall 2013
This thesis introduces random walk (RW) planning as a new search paradigm for satisficing planning by studying its theory, its practical relevance, and applications. We develop a theoretical framework that explains the strengths and weaknesses of random walks as a tool for heuristic search....
1 - 2 of 2