Model-lite planning: Case-based vs. model-based approaches

Abstract 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 the problem of generating robust and accurate plans, when the agent only has access to incomplete domain models, supplanted by a set of successful plan cases. We will develop two classes of approaches – one case-based and the other model-based. ML-CBP is a case-based approach that leverages the incomplete model and the plan cases to solve a new problem directly by affecting case-level transfer. RIM is a model-based approach that uses the incomplete model and the plan cases to first learn a more complete model. This model contains both primitive actions as well as macro-operators that are derived from the plan cases. The learned model is then used in conjunction with an off-the-shelf planner to solve new problems. We present a comprehensive evaluation of the two approaches, both to characterize their relative tradeoffs, and to quantify their advances over existing approaches.

[1]  Jonathan Schaeffer,et al.  Macro-FF: Improving AI Planning with Automatically Learned Macro-Operators , 2005, J. Artif. Intell. Res..

[2]  Hector Muñoz-Avila,et al.  Case‐Base Maintenance By Integrating Case‐Index Revision and Case‐Retention Policies in a Derivational Replay Framework , 2001, Comput. Intell..

[3]  Subbarao Kambhampati,et al.  Model-Lite Case-Based Planning , 2012, AAAI.

[4]  Nicholas Roy,et al.  PUMA: Planning Under Uncertainty with Macro-Actions , 2010, AAAI.

[5]  Ivan Serina,et al.  Identifying and Exploiting Features for Effective Plan Retrieval in Case-Based Planning , 2015, ICAPS.

[6]  Andrew Coles,et al.  Marvin: A Heuristic Search Planner with Online Macro-Action Learning , 2011, J. Artif. Intell. Res..

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

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

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

[10]  Felip Manyà,et al.  New Inference Rules for Max-SAT , 2007, J. Artif. Intell. Res..

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

[12]  Fahiem Bacchus,et al.  A Knowledge-Based Approach to Planning with Incomplete Information and Sensing , 2002, AIPS.

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

[14]  Kevin Leyton-Brown,et al.  Improved Features for Runtime Prediction of Domain-Independent Planners , 2014, ICAPS.

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

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

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

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

[19]  Maria Gini,et al.  Deferred Planning and Sensor Use , 1990 .

[20]  Oren Etzioni,et al.  An Approach to Planning with Incomplete Information , 1992, KR.

[21]  Jon Whittle,et al.  Internal Analogy in Theorem Proving , 1996, CADE.

[22]  Qiang Yang,et al.  Action-model acquisition for planning via transfer learning , 2014, Artif. Intell..

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

[24]  Ralph Bergmann,et al.  Building and Refining Abstract Planning Cases by Change of Representation Language , 1995, J. Artif. Intell. Res..

[25]  Marcelo Oglietti,et al.  Understanding planning with incomplete information and sensing , 2005, Artif. Intell..

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

[27]  Richard Fikes,et al.  Learning and Executing Generalized Robot Plans , 1993, Artif. Intell..

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

[29]  Bernhard Nebel,et al.  The FF Planning System: Fast Plan Generation Through Heuristic Search , 2011, J. Artif. Intell. Res..

[30]  Hankui Zhuo,et al.  Crowdsourced Action-Model Acquisition for Planning , 2015, AAAI.

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

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

[33]  Daniel Bryce,et al.  Evaluating Temporal Plans in Incomplete Domains , 2012, AAAI.

[34]  J. Carbonell,et al.  Learning by Analogy: Formulating and Generalizing Plans from Past Experience , 1983 .

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

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

[37]  Hector Muñoz-Avila,et al.  Learning hierarchical task network domains from partially observed plan traces , 2014, Artif. Intell..

[38]  Ivan Serina,et al.  Progress in Case-Based Planning , 2015, ACM Comput. Surv..

[39]  Blai Bonet,et al.  Planning with Incomplete Information as Heuristic Search in Belief Space , 2000, AIPS.

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

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

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

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

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

[45]  Stephen Cresswell,et al.  Domain Model Acquisition in the Presence of Static Relations in the LOP System , 2015, ICAPS.

[46]  David W. Aha,et al.  HICAP: An Interactive Case-Based Planning Architecture and its Application to Noncombatant Evacuation Operations , 1999, AAAI/IAAI.

[47]  Glenn A. Iba,et al.  A heuristic approach to the discovery of macro-operators , 2004, Machine Learning.

[48]  John Levine,et al.  Learning Macro-Actions for Arbitrary Planners and Domains , 2007, ICAPS.

[49]  J. Hoffmann,et al.  What Makes The Difference Between HSP and FF ? , 2002 .

[50]  Richard E. Korf,et al.  Macro-Operators: A Weak Method for Learning , 1985, Artif. Intell..

[51]  Luca Spalazzi,et al.  A Survey on Case-Based Planning , 2004, Artificial Intelligence Review.

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

[53]  Mathijs de Weerdt,et al.  Plan Repair as an Extension of Planning , 2005, ICAPS.

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

[55]  Craig A. Knoblock,et al.  Web service composition as planning , 2003 .

[56]  Subbarao Kambhampati,et al.  Derivation Replay for Partial-Order Planning , 1994, AAAI.

[57]  Hector Muñoz-Avila,et al.  Case-Based Plan Adaptation: An Analysis and Review , 2008, IEEE Intelligent Systems.

[58]  Ivan Serina,et al.  Fast Plan Adaptation through Planning Graphs: Local and Systematic Search Techniques , 2000, AIPS.

[59]  Dana S. Nau,et al.  On the Complexity of Blocks-World Planning , 1992, Artif. Intell..

[60]  Eva Onaindia,et al.  An approach to multi-agent planning with incomplete information , 2012, ECAI.

[61]  Daniel S. Weld,et al.  A Domain-Independent Algorithm for Plan Adaptation , 1994, J. Artif. Intell. Res..

[62]  Luca Spalzzi,et al.  A Survey on Case-Based Planning , 2001 .