Grant: Discovery Grants Program - Individual
University of Alberta
$17,000.00
""Search, Opponent Modelling, Cooperation, and State Inference in Complex Imperfect Information Domains.""
FY 2012-13
Summary
Artificial intelligence (AI) research applied to games has a long tradition that reaches back at
least 75 years with Alan Turing's work on computer chess. The advantage of studying AI algorithms
in this area is that games are precisely defined, relatively small when compared to real-world
decision domains, and yet sufficiently complex to pose tough research problems whose solutions can
help us create machines of human-level intelligence. AI research has had its successes in games
like chess, backgammon, and checkers - where machines now play on par with or better than the best
human players. However, in more complex domains machines are still trailing behind human
experts. The main differences to the games in which AI research has been very successful are that
game state information is hidden from players or the number of move choices is very large. Both
properties render complete enumeration, which is a cornerstone of many high-performance AI systems,
less effective.
The objective of the research proposed here is to create systems that will reach or surpass the
performance of human experts in real-time decision domains that feature uncertainty, imperfect
information, or complex state and action spaces. The benchmark applications we will be working on
are trick-based card games and real-time strategy video games. Improving the state of the art
requires us to develop new algorithms that can model opponents, infer hidden game states, cooperate
with partners, and look-ahead in abstracted search spaces. In the long term, the results of this
project will increase our understanding of fundamental AI problems that need to be solved in the
process of creating human-level AI systems. In the short term, we anticipate the computer games
industry benefiting from our research, because it is in need of credible computer controlled agents
in the domains we study.
Program
Discovery Grants Program - Individual
Recipient
Location
Alberta, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
261531-2012
Name nom
Buro, Michael
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
2012
Competition year année de concours
2012
Award amount
17000
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
801
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
Computer software
Area of application fr
Logiciel
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
1
Nb partie
5
Application title
""Search, Opponent Modelling, Cooperation, and State Inference in Complex Imperfect Information Domains.""
Keyword
NSERC
Application summary
Artificial intelligence (AI) research applied to games has a long tradition that reaches back at
least 75 years with Alan Turing's work on computer chess. The advantage of studying AI algorithms
in this area is that games are precisely defined, relatively small when compared to real-world
decision domains, and yet sufficiently complex to pose tough research problems whose solutions can
help us create machines of human-level intelligence. AI research has had its successes in games
like chess, backgammon, and checkers - where machines now play on par with or better than the best
human players. However, in more complex domains machines are still trailing behind human
experts. The main differences to the games in which AI research has been very successful are that
game state information is hidden from players or the number of move choices is very large. Both
properties render complete enumeration, which is a cornerstone of many high-performance AI systems,
less effective.
The objective of the research proposed here is to create systems that will reach or surpass the
performance of human experts in real-time decision domains that feature uncertainty, imperfect
information, or complex state and action spaces. The benchmark applications we will be working on
are trick-based card games and real-time strategy video games. Improving the state of the art
requires us to develop new algorithms that can model opponents, infer hidden game states, cooperate
with partners, and look-ahead in abstracted search spaces. In the long term, the results of this
project will increase our understanding of fundamental AI problems that need to be solved in the
process of creating human-level AI systems. In the short term, we anticipate the computer games
industry benefiting from our research, because it is in need of credible computer controlled agents
in the domains we study.