Recent AI Dissertations Decision Theory and the Cost of Planning Leo Hartman Dept. of C o m p u t e r Science University of Rochester Rochester N Y 14627 leo@cs.rochestor.edu The dissertation shows how it is possible for a planner to make decisions that are sensitive to the computational resources that it expends. The approach explored here ignores the distinction between planning and executing a plan and interprets planning procedures as actions with uncertain outcomes. This approach allows a planner to use standard decision theoretic techniques to select which among a set of alternative procedures is a better gamble. The hypotheses that underlie this work are that an autonomous agent must monitor its resource expenditure in order to be successful and that computation is an important and valuable resource. The main points of this thesis are: (1) it is possible for planners to make local inexpensive decisions that account for essentially their entire resource expenditure (2) there are limitations to what a planner is able to infer about optimal strategies (3) it is possible for planners to be sensitive to the statistical properties of their problem solving environments. (available as Technical Report 355, September 1990) Integrating Rules
/lp/association-for-computing-machinery/recent-ai-dissertations-q18oVnYjIy