An Empirical Study of the Usefulness of State-Dependent Action Costs in Planning

The vast majority of work in planning to date has focused on state-independent action costs. However, if a planning task features state-dependent costs, using a cost model with state-independent costs means either introducing a modeling error, or potentially sacrificing compactness of the model. In this paper, we investigate the conflicting priorities of modeling accuracy and compactness empirically, with a particular focus on the extent of the negative impact of reduced modeling accuracy on (a) the quality of the resulting plans, and (b) the search guidance provided by heuristics that are fed with inaccurate cost models. Our empirical results show that the plan suboptimality introduced by ignoring state-dependent costs can range, depending on the domain, from inexistent to several orders of magnitude. Furthermore, our results show that the impact on heuristic guidance additionally depends strongly on the heuristic that is used, the specifics of how exactly the costs are represented, and whether one is interested in heuristic accuracy, node expansions, or overall runtime savings.

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

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

[3]  Thomas Keller,et al.  Delete Relaxations for Planning with State-Dependent Action Costs , 2015, SOCS.

[4]  Patrik Haslum,et al.  Planning with Global State Constraints and State-Dependent Action Costs , 2019, ICAPS.

[5]  Thomas Keller,et al.  Abstractions for Planning with State-Dependent Action Costs , 2016, ICAPS.

[6]  Patrik Haslum,et al.  Domain-Independent Construction of Pattern Database Heuristics for Cost-Optimal Planning , 2007, AAAI.

[7]  Blai Bonet,et al.  Planning as Heuristic Search: New Results , 1999, ECP.

[8]  Gianfranco Ciardo,et al.  Using Edge-Valued Decision Diagrams for Symbolic Generation of Shortest Paths , 2002, FMCAD.

[9]  Malte Helmert,et al.  How Good is Almost Perfect? , 2008, AAAI.

[10]  Robert C. Holte,et al.  The Two-Edged Nature of Diverse Action Costs , 2017, ICAPS.

[11]  Florian Geißer,et al.  On planning with state-dependent action costs , 2018 .

[12]  Patrik Haslum,et al.  Flexible Abstraction Heuristics for Optimal Sequential Planning , 2007, ICAPS.

[13]  Florian Geißer,et al.  Symbolic Planning with Edge-Valued Multi-Valued Decision Diagrams , 2018, ICAPS.

[14]  Judea Pearl,et al.  Heuristics : intelligent search strategies for computer problem solving , 1984 .

[15]  Jendrik Seipp,et al.  State-Dependent Cost Partitionings for Cartesian Abstractions in Classical Planning , 2016, IJCAI.

[16]  Blai Bonet,et al.  A Concise Introduction to Models and Methods for Automated Planning , 2013, A Concise Introduction to Models and Methods for Automated Planning.

[17]  Robert C. Holte,et al.  Additive Merge-and-Shrink Heuristics for Diverse Action Costs , 2017, IJCAI.