Effective plan retrieval in case-based planning for metric-temporal problems

Case-based planning (CBP) 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. In this work, we address CBP in PDDL domains with real-valued fluents, action durations and timed-initial literals, which are essential to model real-world planning problems involving continuous resources and temporal constraints. We propose some new heuristic techniques for retrieving a plan from a library of existing plans that is promising for solving a new planning problem encountered by the CBP system, i.e. that can be efficiently adapted to solve the new problem. The effectiveness of these techniques, which derive much of their power from the proposed use of the numerical/temporal information in the planning problem specification and in the library plans, is evaluated through an experimental analysis.

[1]  Leonidas J. Guibas,et al.  A metric for distributions with applications to image databases , 1998, Sixth International Conference on Computer Vision (IEEE Cat. No.98CH36271).

[2]  Ian D. Watson,et al.  Applying case-based reasoning - techniques for the enterprise systems , 1997 .

[3]  Stefan Edelkamp,et al.  Automated Planning: Theory and Practice , 2007, Künstliche Intell..

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

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

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

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

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

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

[10]  Ivan Serina,et al.  Offline and Online Plan Library Maintenance in Case-Based Planning , 2013, AI*IA.

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

[12]  Hector Muñoz-Avila,et al.  Case-based planning , 2005, The Knowledge Engineering Review.

[13]  Harold W. Kuhn,et al.  The Hungarian method for the assignment problem , 1955, 50 Years of Integer Programming.

[14]  Ivan Serina,et al.  Fast Planning through Greedy Action Graphs , 1999, AAAI/IAAI.

[15]  Andreas Zell,et al.  Optimal assignment kernels for attributed molecular graphs , 2005, ICML.

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

[17]  Mobyen Uddin Ahmed,et al.  Case-Based Reasoning Systems in the Health Sciences: A Survey of Recent Trends and Developments , 2011, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).

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

[19]  S. Edelkamp,et al.  The Deterministic Part of IPC-4: An Overview , 2005, J. Artif. Intell. Res..

[20]  Kristian J. Hammond,et al.  Case-Based Planning: A Framework for Planning from Experience , 1990, Cogn. Sci..

[21]  Ujjwal Maulik,et al.  Computational Intelligence and Pattern Analysis in Biological Informatics: Maulik/Computational Intelligence , 2010 .

[22]  Mehmet H. Göker.  Designing Industrial Case-Based Reasoning Applications , 2004, ECCBR.

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

[24]  Sean Breen,et al.  Developing Industrial Case-Based Reasoning Applications: The INRECA Methodology , 1999 .

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

[26]  Bernhard Nebel,et al.  Plan Reuse Versus Plan Generation: A Theoretical and Empirical Analysis , 1995, Artif. Intell..

[27]  Yaxin Bi,et al.  Combining rough decisions for intelligent text mining using Dempster’s rule , 2006, Artificial Intelligence Review.

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

[29]  David C. Wilson,et al.  Acquiring Case Adaptation Knowledge: A Hybrid Approach , 1996, AAAI/IAAI, Vol. 1.

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

[31]  M. Fox,et al.  The 3rd International Planning Competition: Results and Analysis , 2003, J. Artif. Intell. Res..

[32]  Eyke Hüllermeier,et al.  Preference-Based CBR: First Steps toward a Methodological Framework , 2011, ICCBR.

[33]  Hector Muñoz-Avila,et al.  Case-Based Planning: Selected Methods and Systems , 1996, AI Commun..

[34]  Robert Mattmüller,et al.  Using the Context-enhanced Additive Heuristic for Temporal and Numeric Planning , 2009, ICAPS.

[35]  Yixin Chen,et al.  Temporal Planning using Subgoal Partitioning and Resolution in SGPlan , 2006, J. Artif. Intell. Res..

[36]  Ivan Serina,et al.  Efficient Plan Adaptation through Replanning Windows and Heuristic Goals , 2010, RCRA.

[37]  Ivan Serina,et al.  An approach to efficient planning with numerical fluents and multi-criteria plan quality , 2008, Artif. Intell..

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

[39]  Kristian J. Hammond,et al.  Case-based planning: A framework for planning from experience ☆ , 1990 .

[40]  Dong Xu,et al.  Visual Event Recognition in News Video using Kernel Methods with Multi-Level Temporal Alignment , 2007, 2007 IEEE Conference on Computer Vision and Pattern Recognition.

[41]  Ujjwal Maulik,et al.  Computational Intelligence and Pattern Analysis in Biology Informatics , 2010 .

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

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

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

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

[46]  Blai Bonet,et al.  Planning as heuristic search , 2001, Artif. Intell..

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

[48]  Andrew Coles,et al.  LPRPG-P: Relaxed Plan Heuristics for Planning with Preferences , 2011, ICAPS.

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

[50]  Susan Craw,et al.  Case-Based Reasoning , 2010, Encyclopedia of Machine Learning.

[51]  Malte Helmert,et al.  The Fast Downward Planning System , 2006, J. Artif. Intell. Res..

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

[53]  Tom Bylander,et al.  Complexity Results for Planning , 1991, IJCAI.

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

[55]  J. Hoffmann,et al.  Where 'Ignoring Delete Lists' Works: Local Search Topology in Planning Benchmarks , 2005, J. Artif. Intell. Res..

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

[57]  David W. Aha,et al.  The omnipresence of case-based reasoning in science and application , 1998, Knowl. Based Syst..

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