A Reminder about the Importance of Computing and Exploiting Invariants in Planning

Throughout the years, extensive work has pointed out how important computing and exploiting invariants is in planning. However, no recent studies about their empirical impact regarding their ability to simplify and/or complete the model have been done. In particular, an analysis about the impact of invariants computed in regression from the goals is severely lacking, despite the existence of previous attempts to use this kind of invariants in different planning settings. In this work we focus on the ability of invariants to simplify the planning task in a preprocessing step. Our results show that this simplification significantly improves the performance of different optimal and satisficing planners.

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

[2]  Jussi Rintanen,et al.  An Iterative Algorithm for Synthesizing Invariants , 2000, AAAI/IAAI.

[3]  Jussi Rintanen,et al.  Regression for Classical and Nondeterministic Planning , 2008, ECAI.

[4]  Avrim Blum,et al.  Fast Planning Through Planning Graph Analysis , 1995, IJCAI.

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

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

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

[8]  Ulrich Scholz,et al.  Reducing planning problems by path reduction , 2004 .

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

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

[11]  Patrik Haslum,et al.  Safe, Strong, and Tractable Relevance Analysis for Planning , 2013, ICAPS.

[12]  P. Haslum.  Reducing Accidental Complexity in Planning Problems , 2007, IJCAI.

[13]  Raquel Fuentetaja,et al.  Revisiting Regression in Planning , 2013, IJCAI.

[14]  Mats Petter Pettersson.  Reversed planning graphs for relevance heuristics in AI planning , 2005 .

[15]  Yixin Chen,et al.  Long-Distance Mutual Exclusion for Propositional Planning , 2007, IJCAI.

[16]  Lenhart K. Schubert,et al.  Inferring State Constraints for Domain-Independent Planning , 1998, AAAI/IAAI.

[17]  Martin Suda.  Duality in STRIPS planning , 2013, ArXiv.

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

[19]  Malte Helmert,et al.  Exhibiting Knowledge in Planning Problems to Minimize State Encoding Length , 1999, ECP.

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

[21]  Blai Bonet,et al.  LP-Based Heuristics for Cost-Optimal Planning , 2014, ICAPS.

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

[23]  Yixin Chen,et al.  SAS+ Planning as Satisfiability , 2012, J. Artif. Intell. Res..

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

[25]  Daniel S. Weld,et al.  UCPOP: A Sound, Complete, Partial Order Planner for ADL , 1992, KR.

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

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

[28]  Malte Helmert,et al.  Concise finite-domain representations for PDDL planning tasks , 2009, Artif. Intell..