Search
Skip to Search Results- 8Holte, Robert (Computing Science)
- 1Culberson, Joseph (Computing Science)
- 1Müller, Martin (Computing Science)
- 1Sturtevant, Nathan (Computing Science)
- 1Szafron, Duane (Computing Science)
- 1Zilles, Sandra (Computer Science, University of Regina)
- 3Abstractions
- 3Artificial Intelligence
- 2Heuristic Search
- 2Heuristic search
- 2Planning
- 1Active Stratified Sampling
-
Action Selection for Hammer Shots in Curling: Optimization of Non-convex Continuous Actions With Stochastic Action Outcomes
DownloadSpring 2017
Optimal decision making in the face of uncertainty is an active area of research in artificial intelligence. In this thesis, I present the sport of curling as a novel application domain for research in optimal decision making. I focus on one aspect of the sport, the hammer shot, the last shot...
-
Spring 2011
In this thesis, we study theoretically and empirically the additive abstraction-based heuristics. First we present formal general definitions for abstractions that extend to general additive abstractions. We show that the general definition makes proofs of admissibility, consistency, and...
-
Fall 2014
An agent in an adversarial, imperfect information environment must sometimes decide whether or not to take an action and, if they take the action, must choose a parameter value associated with that action. Examples include choosing to buy or sell some amount of resources or choosing whether or...
-
Fall 2013
Many important problems can be cast as state-space problems. In this dissertation we study a general paradigm for solving state-space problems which we name Cluster-and-Conquer (C&C). Algorithms that follow the C&C paradigm use the concept of equivalent states to reduce the number of states...
-
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 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...
-
Spring 2011
In order to improve a user's query and help the user quickly satisfy his/her information need, most search engines provide query suggestions that are meant to be relevant alternatives to the user's query. This thesis builds on the query suggestion system and evaluation methodology described in...
-
Fall 2011
Multi-agent pathfinding problems involve finding plans for agents that must travel from their start locations to their targets without colliding. Recent work produced a number of algorithms to solve the problem as well as an ample supply of related theory. This work is based on a related work...