Search
Skip to Search Results- 13Heuristic Search
- 11Abstractions
- 6Artificial Intelligence
- 4Planning
- 3Heuristic search
- 3Machine Learning
- 17Graduate and Postdoctoral Studies (GPS), Faculty of
- 17Graduate and Postdoctoral Studies (GPS), Faculty of/Theses and Dissertations
- 4Computing Science, Department of
- 4Computing Science, Department of/Technical Reports (Computing Science)
- 2Art and Design, Department of
- 2Art and Design, Department of/Master's Theses (Art & Design)
-
Spring 2016
This thesis proposes, analyzes and tests different exploration-based techniques in Greedy Best-First Search (GBFS) for satisficing planning. First, we show the potential of exploration-based techniques by combining GBFS and random walk exploration locally. We then conduct deep analysis on how...
-
Fall 2017
Modern board, card, and video games are challenging domains for AI research due to their complex game mechanics and large state and action spaces. For instance, in Hearthstone — a popular collectible card (CC) (video) game developed by Blizzard Entertainment — two players first construct their...
-
2017-01-16
My work is about the exploration of everyday-life, colour and the imagination. Making paintings is my way of understanding the dynamic and ever-changing sociological, cultural, and digital fabric of North American society. My practice involves creating a poetic network of images that utilize a...
-
Fall 2022
Monte Carlo Tree Search (MCTS) is a popular tree search framework for choos- ing actions in decision-making problems. MCTS is traditionally applied to applications in which a perfect simulation model is available. However, when the model is imperfect, the performance of MCTS drops heavily. In...
-
Fall 2012
This thesis consists of two parts. First, we invented an abstraction framework called multimapping which allows multiple admissible heuristic values to be extracted from one abstract space. The key idea of this technique is to design a multimapping function which maps one state in the original...
-
2014
Burch, Neil, Holte, Robert, Arneson, Broderick
This manual describes PSVN, a language for describing state space search problems using multi-valued variables that lends itself to efficient calculation of state's successors and predecessors without having to fully ground the operators. It also describes the PSVN compiler, psvn2c, which accepts...
-
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....
-
Fall 2017
Real-time strategy (RTS) games are war simulation video games in which the players perform several simultaneous tasks like gathering and spending resources, building a base, and controlling units in combat against an enemy force. RTS games have recently drawn the interest of the game AI research...
-
Fall 2021
Traffic congestion is a severe problem in many cities. One way to reduce it is by optimizing traffic signal timings. Experts spend a lot of time analyzing traffic patterns to produce good handcrafted timing schedules. However, these timing schedules can be less responsive when there is a sudden...