Identifying and Exploiting Features for Effective Plan Retrieval in Case-Based Planning

Case-Based planning can fruitfully exploit knowledge gained by solving a large number of problems, storing the corresponding solutions in a plan library and reusing them for solving similar planning problems in the future. Case-based planning is extremely effective when similar reuse candidates can be efficiently chosen. In this paper, we study an innovative technique based on planning problem features for efficiently retrieving solved planning problems (and relative plans) from large plan libraries. Since existing planning features are not always able to effectively distinguish between problems within the same planning domain, we introduce a new class of features. Our experimental analysis shows that the proposed features-based retrieval approach can significantly improve the performance of a state-of-the-art case-based planning system.

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

[2]  Santiago Ontañón,et al.  Least Common Subsumer Trees for Plan Retrieval , 2014, ICCBR.

[3]  Malte Helmert,et al.  Lama 2008 and 2011 , 2011 .

[4]  M. Johnson,et al.  Relating metrics, lines and variables defined on graphs to problems in medicinal chemistry , 1985 .

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

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

[7]  J. Ho,et al.  The Metric FF Planning System Translating Ignoring Delete Lists to Numeric State Variables , 2003 .

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

[9]  Barry O'Sullivan,et al.  Evolving Instance Specific Algorithm Configuration , 2021, SOCS.

[10]  Jendrik Seipp,et al.  Learning Portfolios of Automatically Tuned Planners , 2012, ICAPS.

[11]  Frank Ruskey,et al.  Alley CATs in search of good homesFrank , 1994 .

[12]  Isabel Cenamor,et al.  Mining IPC-2011 Results , 2011 .

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

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

[15]  Marie desJardins,et al.  What Makes Planners Predictable? , 2008, ICAPS.

[16]  Massimiliano Giacomin,et al.  Algorithm Selection for Preferred Extensions Enumeration , 2014, COMMA.

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

[18]  Jörg Hoffmann.  Analyzing Search Topology Without Running Any Search: On the Connection Between Causal Graphs and h+ , 2011, J. Artif. Intell. Res..

[19]  Peter Willett,et al.  RASCAL: Calculation of Graph Similarity using Maximum Common Edge Subgraphs , 2002, Comput. J..

[20]  Ivan Serina,et al.  Effective plan retrieval in case-based planning for metric-temporal problems , 2015, J. Exp. Theor. Artif. Intell..

[21]  Manuela M. Veloso,et al.  Planning and Learning by Analogical Reasoning , 1994, Lecture Notes in Computer Science.

[22]  Jörg Hoffmann.  Where Ignoring Delete Lists Works, Part II: Causal Graphs , 2011, ICAPS.

[23]  Alfonso Gerevini,et al.  Exploiting Macro-actions and Predicting Plan Length in Planning as Satisfiability , 2011, AI*IA.

[24]  A. Ortony,et al.  Similarity and Analogical Reasoning , 1991 .

[25]  Kevin Leyton-Brown,et al.  Algorithm runtime prediction: Methods & evaluation , 2012, Artif. Intell..

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

[27]  Subbarao Kambhampati,et al.  Generating diverse plans to handle unknown and partially known user preferences , 2012, Artif. Intell..

[28]  Maria Fox,et al.  PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains , 2003, J. Artif. Intell. Res..

[29]  Flavio Tonidandel,et al.  The FAR-OFF System: A Heuristic Search Case-Based Planning , 2002, AIPS.

[30]  Kevin Leyton-Brown,et al.  Sequential Model-Based Optimization for General Algorithm Configuration , 2011, LION.

[31]  Paolo Liberatore,et al.  On the complexity of case-based planning , 2004, J. Exp. Theor. Artif. Intell..

[32]  Tom Bylander,et al.  The Computational Complexity of Propositional STRIPS Planning , 1994, Artif. Intell..

[33]  Chih-Wei Hsu.  The SGPlan Planning System in IPC-6 , 2008 .

[34]  Jendrik Seipp,et al.  Automatic Configuration of Sequential Planning Portfolios , 2015, AAAI.

[35]  Ivan Serina,et al.  An Approach to Temporal Planning and Scheduling in Domains with Predictable Exogenous Events , 2011, J. Artif. Intell. Res..

[36]  Patrik Haslum,et al.  Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners , 2009, Artif. Intell..

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

[38]  Yannis Manolopoulos,et al.  Structure-based similarity search with graph histograms , 1999, Proceedings. Tenth International Workshop on Database and Expert Systems Applications. DEXA 99.

[39]  Fernando Fernández,et al.  Learning Predictive Models to Configure Planning Portfolios , 2013 .

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

[41]  Adele E. Howe,et al.  Learning from planner performance , 2009, Artif. Intell..

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

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

[44]  Béla Bollobás,et al.  Modern Graph Theory , 2002, Graduate Texts in Mathematics.

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

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

[47]  Adele E. Howe,et al.  Exploiting Competitive Planner Performance , 1999, ECP.

[48]  Jana Koehler,et al.  Planning from Second Principles , 1996, Artif. Intell..

[49]  Dedre Gentner,et al.  Mechanisms of Analogical Learning. , 1987 .