Revisiting Regression in Planning

Heuristic search with reachability-based heuristics is arguably the most successful paradigm in Automated Planning to date. In its earlier stages of development, heuristic search was proposed as both forward and backward search. Due to the disadvantages of backward search, in the last decade researchers focused mainly on forward search, and backward search was abandoned for the most part as a valid alternative. In the last years, important advancements regarding both the theoretical understanding and the performance of heuristic search have been achieved, applied mainly to forward search planners. In this work we revisit regression in planning with reachability-based heuristics, trying to extrapolate to backward search current lines of research that were not as well understood as they are now.

[1]  Ilche Georgievski,et al.  International Conference on Automated Planning and Scheduling , 2013 .

[2]  P. Haslum.  h m ( P ) = k 1 ( P m ): alternative characterisations of the generalisation from h max to h m , 2009, ICAPS 2009.

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

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

[5]  Jörg Hoffmann,et al.  Enhancing the Context-Enhanced Additive Heuristic with Precedence Constraints , 2009, ICAPS.

[6]  Patrik Haslum,et al.  Semi-Relaxed Plan Heuristics , 2012, ICAPS.

[7]  Malte Helmert,et al.  Preferred Operators and Deferred Evaluation in Satisficing Planning , 2009, ICAPS.

[8]  Barton C. Massey,et al.  Directions in planning: understanding the flow of time in planning , 1999 .

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

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

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

[12]  Jörg Hoffmann,et al.  Ordered Landmarks in Planning , 2004, J. Artif. Intell. Res..

[13]  Jussi Rintanen,et al.  Heuristics for Planning with SAT , 2010, CP.

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

[15]  Patrik Haslum.  hm(P) = h1(Pm): Alternative Characterisations of the Generalisation From hmax To hm , 2009, ICAPS.

[16]  Subbarao Kambhampati,et al.  Reviving Partial Order Planning , 2001, IJCAI.

[17]  Nils J. Nilsson,et al.  Artificial Intelligence , 1974, IFIP Congress.

[18]  Charles L. Forgy,et al.  Rete: a fast algorithm for the many pattern/many object pattern match problem , 1991 .

[19]  Malte Helmert,et al.  The More, the Merrier: Combining Heuristic Estimators for Satisficing Planning , 2010, ICAPS.

[20]  Carmel Domshlak,et al.  Landmarks, Critical Paths and Abstractions: What's the Difference Anyway? , 2009, ICAPS.

[21]  Ivan Serina,et al.  LPG: A Planner Based on Local Search for Planning Graphs with Action Costs , 2002, AIPS.

[22]  Bo Pang,et al.  State-Set Search , 2011, SOCS.

[23]  Hector Geffner,et al.  Solving Simple Planning Problems with More Inference and No Search , 2005, CP.

[24]  Maxim Likhachev,et al.  The Symposium on Combinatorial Search , 2012, AI Commun..

[25]  Hector Geffner,et al.  Trees of shortest paths vs. Steiner trees: understanding and improving delete relaxation heuristics , 2009, IJCAI 2009.

[26]  Bart Selman,et al.  Unifying SAT-based and Graph-based Planning , 1999, IJCAI.

[27]  Jörg Hoffmann,et al.  On Reasonable and Forced Goal Orderings and their Use in an Agenda-Driven Planning Algorithm , 2000, J. Artif. Intell. Res..