Using Cases Utility for Heuristic Planning Improvement

Current efficient planners employ an informed search guided by a heuristic function that is quite expensive to compute. Thus, ordering nodes in the search tree becomes a key issue, in order to select efficiently nodes to evaluate from the successors of the current search node. In a previous work, we successfully applied a CBR approach to order nodes for evaluation, thus reducing the number of calls to the heuristic function. However, once cases were learned, they were not modified according to their utility on solving planning problems. We present in this work a scheme for learning case quality based on its utility during a validation phase. The qualities obtained determine the way in which these cases are preferred in the retrieval and replay processes. Then, the paper shows some experimental results for several benchmarks taken from the International Planning Competition (IPC). These results show the planning performance improvement when case utilities are used.

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

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

[3]  Amílcar Cardoso,et al.  Case-Based, Decision-Theoretic, HTN Planning , 2004, ECCBR.

[4]  Stefan Wess,et al.  Controlling Nonlinear Hierarchical Planning by Case Replay , 1999 .

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

[6]  Maria Fox,et al.  The Automatic Inference of State Invariants in TIM , 1998, J. Artif. Intell. Res..

[7]  Replaying Type Sequences in Forward Heuristic Planning , 2006 .

[8]  Daniel Borrajo,et al.  Case-Based Recommendation of Node Ordering in Planning , 2007, FLAIRS Conference.

[9]  Yixin Chen,et al.  SGPlan: Subgoal Partitioning and Resolution in Planning , 2004 .

[10]  Ralph Bergmann,et al.  PARIS: Flexible Plan Adaptation by Abstraction and Refinement , 1996 .

[11]  Vincent Vidal,et al.  A Lookahead Strategy for Heuristic Search Planning , 2004, ICAPS.

[12]  Flavio Tonidandel,et al.  An Accurate Adaptation-Guided Similarity Metric for Case-Based Planning , 2001, ICCBR.

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

[14]  Marco Dorigo,et al.  AntNet: Distributed Stigmergetic Control for Communications Networks , 1998, J. Artif. Intell. Res..