Grant: Discovery Grants Program - Individual
University of Alberta
$34,000.00
Search and simulation in games and planning
EF 2013-14
Résumé
These are exciting times for research in heuristic search. Research goals that seemed completely out of reach just three years ago have been achieved through huge improvements in search techniques, and new applications have become possible. ""Search and Simulation in Games and Planning"" proposes research in the fast developing field of simulation-enhanced search methods. Statistical ""Monte-Carlo"" methods, which explore a search space by repeated random sampling, have proven to be a very powerful, dynamic technique that overcomes the limitations of more static previous approaches. These techniques have lead to rapid progress in applications as diverse as the ancient game of Go, game-independent General Game Playing, and even classical domain-independent planning.While very powerful, these new approaches are still relatively poorly understood, and there remain important applications where these techniques either cannot be applied, or fail to scale up to more complex problem instances. The aim of this proposed research is to study and further improve simulation-enhanced search methods, both in theory and in practice. One focus of our research will be on hybrid systems that can combine the strong points of previous approaches and the new Monte-Carlo search methods.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Alberta, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data
Tel que publié
Application id
238753-2010
Name nom
Müller, Martin
Department département
Computing Science
Organization id
9
Institution établissement
University of Alberta
Province en
Alberta
Province fr
Alberta
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2013
Competition year année de concours
2010
Award amount
34000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
1507
Committee name en
Computer Science
Committee name fr
Sciences informatiques
Area of application code
802
Area of application group en
Information and communication services
Area of application group fr
Services d'information et de télécommunications
Area of application en
Information systems and technology
Area of application fr
Systèmes d'information et technologie de l'information
Research subject code
2800
Research subject group en
Artificial intelligence
Research subject group fr
Intelligence artificielle
Research subject en
Artificial intelligence (computer vision, use2603)
Research subject fr
Intelligence artificielle (vision artificielle, utiliser 2603)
Partie
4
Nb partie
5
Application title
Search and simulation in games and planning
Keyword
NSERC
Application summary
These are exciting times for research in heuristic search. Research goals that seemed completely out of reach just three years ago have been achieved through huge improvements in search techniques, and new applications have become possible. ""Search and Simulation in Games and Planning"" proposes research in the fast developing field of simulation-enhanced search methods. Statistical ""Monte-Carlo"" methods, which explore a search space by repeated random sampling, have proven to be a very powerful, dynamic technique that overcomes the limitations of more static previous approaches. These techniques have lead to rapid progress in applications as diverse as the ancient game of Go, game-independent General Game Playing, and even classical domain-independent planning.While very powerful, these new approaches are still relatively poorly understood, and there remain important applications where these techniques either cannot be applied, or fail to scale up to more complex problem instances. The aim of this proposed research is to study and further improve simulation-enhanced search methods, both in theory and in practice. One focus of our research will be on hybrid systems that can combine the strong points of previous approaches and the new Monte-Carlo search methods.