Offline and Online Plan Library Maintenance in Case-Based Planning

One of the ways to address the high computational complexity of planning is reusing previously found solutions whenever they are applicable to the new problem with limited adaptation. To do so, a reuse planning system needs to store found solutions in a library of plans, also called a case base. The quality of such a library critically influences the performance of the planner, and therefore it needs to be carefully designed and created. For this reason, it may be also important to update the library during the lifetime of the system, as the type of problems being addressed may evolve or differ from the ones the case base was originally designed for. In our ongoing research, we address the problem of maintaining the library of plans in a recent case-based planner called OAKplan. After having developed offline techniques to reduce an oversized library, we introduce here a complementary online approach that attempts to limit the growth of the library, and we consider the combination of offline and online techniques to ensure the best performance of the case-based planner. The different investigated approaches and techniques are then experimentally evaluated and compared.

[1]  Paolo Traverso,et al.  Automated Planning: Theory & Practice , 2004 .

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

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

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

[5]  Malik Ghallab,et al.  Chapter 14 – Temporal Planning , 2004 .

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

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

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

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

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

[11]  Jing Wu,et al.  Keep It Simple: A Case-Base Maintenance Policy Based on Clustering and Information Theory , 2000, Canadian Conference on AI.

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

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

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

[15]  Jaime G. Carbonell,et al.  Derivational Analogy in PRODIGY: Automating Case Acquisition, Storage, and Utilization , 1993, Machine Learning.

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

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

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

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

[20]  Xizhao Wang,et al.  Transferring Case Knowledge To Adaptation Knowledge: An Approach for Case‐Base Maintenance , 2001, Comput. Intell..

[21]  David B. Leake Case-based reasoning , 1994, The Knowledge Engineering Review.

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

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

[24]  Thomas Roth-Berghofer,et al.  On Quality Measures for Case Base Maintenance , 2000, EWCBR.

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

[26]  Ivan Serina,et al.  On the Plan-Library Maintenance Problem in a Case-Based Planner , 2013, ICCBR.