Model-Lite Case-Based Planning

There is increasing awareness in the planning community that depending on complete models impedes the applicability of planning technology in many real world domains where the burden of specifying complete domain models is too high. In this paper, we consider a novel solution for this challenge that combines generative planning on incomplete domain models with a library of plan cases that are known to be correct. While this was arguably the original motivation for case-based planning, most existing case-based planners assume (and depend on) from-scratch planners that work on complete domain models. In contrast, our approach views the plan generated with respect to the incomplete model as a "skeletal plan" and augments it with directed mining of plan fragments from library cases. We will present the details of our approach and present an empirical evaluation of our method in comparison to a state-of-the-art case-based planner that depends on complete domain models.

[1]  Eyal Amir,et al.  Learning Partially Observable Deterministic Action Models , 2005, IJCAI.

[2]  Subbarao Kambhampati,et al.  Model-lite Planning for the Web Age Masses: The Challenges of Planning with Incomplete and Evolving Domain Models , 2007, AAAI.

[3]  John B. Shoven,et al.  I , Edinburgh Medical and Surgical Journal.

[4]  Piergiorgio Bertoli,et al.  Web Service Composition as Planning, Revisited: In Between Background Theories and Initial State Uncertainty , 2007, AAAI.

[5]  Qiang Yang,et al.  The Downward Refinement Property , 1991, IJCAI.

[6]  Richard Fikes,et al.  STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.

[7]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[8]  Jianyong Wang,et al.  Mining sequential patterns by pattern-growth: the PrefixSpan approach , 2004, IEEE Transactions on Knowledge and Data Engineering.

[9]  Richard S. Sutton,et al.  Introduction to Reinforcement Learning , 1998 .

[10]  Kristian J. Hammond,et al.  Case-Based Planning: Viewing Planning as a Memory Task , 1989 .

[11]  Subbarao Kambhampati,et al.  Storing and Indexing Plan Derivations through Explanation-based Analysis of Retrieval Failures , 1997, J. Artif. Intell. Res..

[12]  Richard S. Sutton,et al.  Reinforcement Learning: An Introduction , 1998, IEEE Trans. Neural Networks.

[13]  Ivan Serina,et al.  Kernel functions for case-based planning , 2010, Artif. Intell..

[14]  James A. Hendler,et al.  A Validation-Structure-Based Theory of Plan Modification and Reuse , 1992, Artif. Intell..

[15]  Richard Alterman,et al.  An Adaptive Planner , 1986, AAAI.

[16]  T. L. McCluskey,et al.  Acquisition of Object-Centred Domain Models from Planning Examples , 2009, ICAPS.

[17]  Qiang Yang,et al.  Learning action models from plan examples using weighted MAX-SAT , 2007, Artif. Intell..

[18]  Subbarao Kambhampati,et al.  Assessing and Generating Robust Plans with Partial Domain Models , 2010 .

[19]  Mohammed J. Zaki,et al.  SPADE: An Efficient Algorithm for Mining Frequent Sequences , 2004, Machine Learning.

[20]  Qiang Yang,et al.  Learning complex action models with quantifiers and logical implications , 2010, Artif. Intell..

[21]  Subbarao Kambhampati,et al.  Refining Incomplete Planning Domain Models Through Plan Traces , 2013, IJCAI.

[22]  Piergiorgio Bertoli,et al.  Automated composition of Web services via planning in asynchronous domains , 2005, Artif. Intell..

[23]  Eugene Fink,et al.  Integrating planning and learning: the PRODIGY architecture , 1995, J. Exp. Theor. Artif. Intell..

[24]  Daniel Bryce,et al.  Planning and Acting in Incomplete Domains , 2011, ICAPS.

[25]  Yolanda Gil,et al.  Automatically composed workflows for grid environments , 2004, IEEE Intelligent Systems.

[26]  Leslie Pack Kaelbling,et al.  Learning Planning Rules in Noisy Stochastic Worlds , 2005, AAAI.

[27]  Thomas J. Walsh,et al.  Efficient Learning of Action Schemas and Web-Service Descriptions , 2008, AAAI.