On efficient approaches to the utility problem in adaptive problem solving
Gratch, Jonathan Matthew
This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.
Permalink
https://hdl.handle.net/2142/22285
Description
Title
On efficient approaches to the utility problem in adaptive problem solving
Author(s)
Gratch, Jonathan Matthew
Issue Date
1995
Doctoral Committee Chair(s)
DeJong, Gerald F.
Department of Study
Computer Science
Discipline
Computer Science
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Operations Research
Artificial Intelligence
Computer Science
Language
eng
Abstract
Domain independent general purpose problem solving techniques are desirable from the standpoints of software engineering and human computer interaction. They employ declarative and modular knowledge representations and present a constant homogeneous interface to the user, untainted by the peculiarities of the specific domain of interest. Unfortunately, this very insulation from domain details often precludes effective problem solving behavior. General approaches have proven successful in complex real world situations only after a tedious cycle of manual experimentation and modification. Machine learning offers the prospect of automating this adaptation cycle, reducing the burden of domain-specific tuning and reconciling the conflicting needs of generality and efficacy. To date, however, the utility problem--the realization that adaptive strategies that were intended to improve problem solving performance would actually degrade performance under difficult to predict circumstances--has impeded the development of adaptive problem solving techniques. Even systems designed to address the utility problem can seriously impair problem solving behavior, as they have incompletely accounted for the subtleties of the problem. In order to develop a more rigorous approach to adaptive problem solving, this thesis details a formal framework that highlights these prior shortcomings, and presents a statistically rigorous solution to the utility problem. Based on clearly articulated and well-motivated assumptions, this statistical method is applied successfully to learning heuristics for several artificial and a real-world problem solving applications. Although the focus of this work is on adaptive planning and scheduling, the results of this research have wider implications for operations research, software simulation, and decision-tree learning.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
