Surrogate Search As a Way to Combat Harmful Effects of Ill-behaved Evaluation Functions

Recently, several researchers have found that cost-based satisficing search with A* often runs into problems. Although some "work arounds" have been proposed to ameliorate the problem, there has been little concerted effort to pinpoint its origin. In this paper, we argue that the origins of this problem can be traced back to the fact that most planners that try to optimize cost also use cost-based evaluation functions (i.e., f(n) is a cost estimate). We show that cost-based evaluation functions become ill-behaved whenever there is a wide variance in action costs; something that is all too common in planning domains. The general solution to this malady is what we call a surrogatesearch, where a surrogate evaluation function that doesn't directly track the cost objective, and is resistant to cost-variance, is used. We will discuss some compelling choices for surrogate evaluation functions that are based on size rather that cost. Of particular practical interest is a cost-sensitive version of size-based evaluation function -- where the heuristic estimates the size of cheap paths, as it provides attractive quality vs. speed tradeoffs

[1]  Richard E. Korf,et al.  Depth-First Iterative-Deepening: An Optimal Admissible Tree Search , 1985, Artif. Intell..

[2]  Ira Pohl,et al.  Heuristic Search Viewed as Path Finding in a Graph , 1970, Artif. Intell..

[3]  Andrew Coles,et al.  Forward-Chaining Partial-Order Planning , 2010, ICAPS.

[4]  Matthias Scheutz,et al.  Planning for human-robot teaming in open worlds , 2010, TIST.

[5]  Subbarao Kambhampati,et al.  Cost Based Satisficing Search Considered Harmful , 2011, ArXiv.

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

[7]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[8]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[9]  Shlomo Zilberstein,et al.  Satisficing and bounded optimality A position paper , 1998 .

[10]  Wheeler Ruml,et al.  Cost-Based Heuristic Search Is Sensitive to the Ratio of Operator Costs , 2011, SOCS.

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

[12]  Subbarao Kambhampati,et al.  Cost Based Search Considered Harmful , 2010, SOCS.

[13]  Rina Dechter,et al.  Generalized best-first search strategies and the optimality of A* , 1985, JACM.

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

[15]  Subbarao Kambhampati,et al.  G-Value Plateaus: A Challenge for Planning , 2010, ICAPS.

[16]  Andreas Podelski,et al.  Useless Actions Are Useful , 2008, ICAPS.

[17]  Ira Pohl,et al.  The Avoidance of (Relative) Catastrophe, Heuristic Competence, Genuine Dynamic Weighting and Computational Issues in Heuristic Problem Solving , 1973, IJCAI.

[18]  Wheeler Ruml,et al.  Finding Acceptable Solutions Faster Using Inadmissible Information , 2010, SOCS.

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

[20]  Hector Geffner,et al.  Unifying the Causal Graph and Additive Heuristics , 2008, ICAPS.

[21]  Subbarao Kambhampati,et al.  Planning Graph-based Heuristics for Cost-sensitive Temporal Planning , 2002, AIPS.