Oversubscription Planning as Classical Planning with Multiple Cost Functions

The aim of classical planning is to minimize the summed cost of operators among those plans that achieve a fixed set of goals. Oversubscription planning (OSP), on the other hand, seeks to maximize the utility of the set of facts achieved by a plan, while keeping the cost of the plan at or below some specified bound. Here, we investigate the use of reformulations that yield planning problems with two separate cost functions, but no utilities, for solving OSP tasks. Such reformulations have also been proposed in the context of netbenefit planning, where the planner tries to maximize the difference between the utility achieved and the cost of the plan. One of our reformulations is adapted directly from that setting, while the other is novel. In both cases, they allow for easy adaptation of existing classical planning heuristics to the OSP problem within a simple branch and bound search. We validate our approach using state of the art admissible heuristics in this framework, and report our results.

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

[2]  Carmel Domshlak,et al.  Deterministic Oversubscription Planning as Heuristic Search: Abstractions and Reformulations , 2015, J. Artif. Intell. Res..

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

[4]  Carmel Domshlak,et al.  Enhanced Symmetry Breaking in Cost-Optimal Planning as Forward Search , 2012, ICAPS.

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

[6]  Malte Helmert,et al.  Landmarks Revisited , 2008, AAAI.

[7]  Carmel Domshlak,et al.  Optimal Additive Composition of Abstraction-based Admissible Heuristics , 2008, ICAPS.

[8]  Carmel Domshlak,et al.  Red-black planning: A new systematic approach to partial delete relaxation , 2015, Artif. Intell..

[9]  Hector Geffner,et al.  Soft Goals Can Be Compiled Away , 2009, J. Artif. Intell. Res..

[10]  Malte Helmert,et al.  Sound and Complete Landmarks for And/Or Graphs , 2010, ECAI.

[11]  S. Edelkamp Planning with Pattern Databases , 2014 .

[12]  Erez Karpas,et al.  Value Driven Landmarks for Oversubscription Planning , 2018, ICAPS.

[13]  Malte Helmert,et al.  A Normal Form for Classical Planning Tasks , 2015, ICAPS.

[14]  David E. Smith Choosing Objectives in Over-Subscription Planning , 2004, ICAPS.

[15]  Carmel Domshlak,et al.  Implicit Abstraction Heuristics , 2010, J. Artif. Intell. Res..

[16]  Carmel Domshlak,et al.  Abstractions for Oversubscription Planning , 2013, ICAPS.

[17]  Vitaly Mirkis,et al.  In Search of Tractability for Partial Satisfaction Planning , 2016, IJCAI.

[18]  Carmel Domshlak,et al.  Optimal admissible composition of abstraction heuristics , 2010, Artif. Intell..

[19]  Hector Geffner,et al.  Heuristics for Planning with Action Costs Revisited , 2008, ECAI.

[20]  Malte Helmert,et al.  A Stubborn Set Algorithm for Optimal Planning , 2012, ECAI.

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

[22]  Subbarao Kambhampati,et al.  Effective Approaches for Partial Satisfaction (Over-Subscription) Planning , 2004, AAAI.

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

[24]  Patrik Haslum,et al.  Admissible Heuristics for Optimal Planning , 2000, AIPS.

[25]  Erez Karpas,et al.  Sensible Agent Technology Improving Coordination and Communication in Biosurveillance Domains , 2009, IJCAI.

[26]  Christer Bäckström,et al.  Planning in polynomial time: the SAS‐PUBS class , 1991, Comput. Intell..

[27]  Patrik Haslum,et al.  Merge-and-Shrink Abstraction , 2014, J. ACM.

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

[29]  Carmel Domshlak,et al.  Landmarks in Oversubscription Planning , 2014, ECAI.

[30]  Malte Helmert,et al.  Generalized Label Reduction for Merge-and-Shrink Heuristics , 2014, AAAI.

[31]  Jonathan Schaeffer,et al.  Pattern Databases , 1998, Comput. Intell..

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