A Machine Learning Approach to Planning in Complex Real-World Domains

Classical planning techniques have some serious problems when employed in real-world domains. In classical planning, it is assumed we know the current state of the world and can project that state through a reasonably well-defined set of actions to yield a future state. However, perfect models of the world and of operators are not possible in most domains. Consequently, discrepancies occur between the projected future state and the observed future state. In these complex domains, the success of the plan can never be guaranteed. Furthermore, an important tradeoff exists between the time spent constructing a plan and its resulting chance of success. Several approaches to these problems have been investigated, including the use of decision-theoretic methods and the incorporation of reactivity into planners. We present a new technique called permissive planning. Explicit approximations are employed in representing the world state and operators. Plans are then constructed efficiently using the approximate theory. In response to plan execution failures, plans are refined so they become less sensitive to the approximate knowledge used in their initial construction. This is achieved by tuning parameters of the plan so as to minimize the expected future deviation.

Name thesis:degree_name

Ph.D.

Level thesis:degree_level

Dissertation

Discipline thesis:degree_discipline

Electrical Engineering

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2014

Author dc:creator

• Bennett, Scott William

Contributors dc:contributor

• DeJong, Gerald F.

• Engineering, Electronics and Electrical
• Artificial Intelligence
• Computer Science

Identifier

(UMI)AAI9314845

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/71989