Abstract
dc:description.abstractThe Markov Decision Problem (MDP) is a widely applied mathematical model useful for describing a wide array of real world decision problems ranging from navigation to scheduling to robotics. Existing methods for solving MDPs scale poorly when applied to large domains where there are many components and factors to consider. In this dissertation, I study the use of non-tabular representations and human input as scaling techniques. I will show that the joint approach has desirable optimality and convergence guarantees, and demonstrates several orders of magnitude speedup over conventional tabular methods. Empirical studies of speedup were performed using several domains including a clone of the classic video game, Super Mario Bros. In the course of this work, I will address several issues including: how approximate representations can be used without losing convergence and optimality properties, how human input can be solicited to maximize speedup and user engagement, and how that input should be used so as to insulate against possible errors.
Degree
thesis:*- Department dc:contributor.department
- Computing
- Grantor dc:publisher
- Georgia Institute of Technology
- Year dc:date.issued
- 2011
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Zang, Peng
- Advisor dc:contributor.advisor
-
- Isbell, Charles L.
- Committee members dc:contributor.committeemember
-
- Gray, Alexander
- Thomaz, Andrea L.
- Littman, Michael
- Stilman, Mike
Subjects
dc:subject × 8Identifiers
dc:identifier.*- Handle dc:identifier.uri
- http://hdl.handle.net/1853/42906