On the Plan-Library Maintenance Problem in a Case-Based Planner

Case-based planning is an approach to planning where previous planning experience stored in a case base provides guidance to solving new problems. Such a guidance can be extremely useful when the new problem is very hard to solve, or the stored previous experience is highly valuable (because, e.g., it was provided and/or validated by human experts) and the system should try to reuse it as much as possible. However, as known in general case-based reasoning, the case base needs to be maintained at a manageable size, in order to avoid that the computational cost of querying it excessively grows, making the entire approach ineffective. We formally define the problem of case base maintenance for planning, discuss which criteria should drive a successful policy to maintain the case base, introduce some policies optimizing different criteria, and experimentally analyze their behavior by evaluating their effectiveness and performance.

[1]  Barry Smyth,et al.  Case-Base Maintenance , 1998, IEA/AIE.

[2]  Steven Minton,et al.  Quantitative Results Concerning the Utility of Explanation-based Learning , 1988, Artif. Intell..

[3]  Ivan Serina,et al.  Plan Stability: Replanning versus Plan Repair , 2006, ICAPS.

[4]  David C. Wilson,et al.  Remembering Why to Remember: Performance-Guided Case-Base Maintenance , 2000, EWCBR.

[5]  Yue Chen,et al.  The Complexity of Planning Revisited - A Parameterized Analysis , 2012, AAAI.

[6]  Fahiem Bacchus,et al.  Using temporal logics to express search control knowledge for planning , 2000, Artif. Intell..

[7]  Ivan Serina,et al.  Case-based Planning for Problems with Real-valued Fluents: Kernel Functions for Effective Plan Retrieval , 2012, ECAI.

[8]  Barry Smyth,et al.  Footprint-Based Retrieval , 1999, ICCBR.

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

[10]  Subbarao Kambhampati,et al.  Domain Independent Approaches for Finding Diverse Plans , 2007, IJCAI.

[11]  Luc Lamontagne,et al.  Case-Based Reasoning Research and Development , 1997, Lecture Notes in Computer Science.

[12]  Alan Fern,et al.  The first learning track of the international planning competition , 2011, Machine Learning.

[13]  Agnar Aamodt,et al.  Case-Based Reasoning: Foundational Issues, Methodological Variations, and System Approaches , 1994, AI Commun..

[14]  David C. Wilson,et al.  Categorizing Case-Base Maintenance: Dimensions and Directions , 1998, EWCBR.

[15]  Silvia Richter,et al.  The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarks , 2010, J. Artif. Intell. Res..

[16]  Paolo Traverso,et al.  Automated planning - theory and practice , 2004 .

[17]  Ivan Serina,et al.  Planning Through Stochastic Local Search and Temporal Action Graphs in LPG , 2003, J. Artif. Intell. Res..

[18]  Qiang Yang,et al.  Remembering to Add: Competence-preserving Case-Addition Policies for Case Base Maintenance , 1999, IJCAI.

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

[20]  Barry Smyth,et al.  Advances in Case-Based Reasoning , 1996, Lecture Notes in Computer Science.

[21]  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..

[22]  Shaul Markovitch,et al.  Information Filtering: Selection Mechanisms in Learning Systems , 1993, Machine Learning.

[23]  Angel P. del Pobil,et al.  Tasks and Methods in Applied Artificial Intelligence , 1998, Lecture Notes in Computer Science.

[24]  Barry Smyth,et al.  Adaptation-Guided Retrieval: Questioning the Similarity Assumption in Reasoning , 1998, Artif. Intell..

[25]  Paolo Traverso,et al.  Time for Planning , 2004 .

[26]  Bernhard Nebel,et al.  COMPLEXITY RESULTS FOR SAS+ PLANNING , 1995, Comput. Intell..