Generalized Potential Heuristics for Classical Planning

Generalized planning aims at computing solutions that work for all instances of the same domain. In this paper, we show that several interesting planning domains possess compact generalized heuristics that can guide a greedy search in guaranteed polynomial time to the goal, and which work for any instance of the domain. These heuristics are weighted sums of state features that capture the number of objects satisfying a certain first-order logic property in any given state. These features have a meaningful interpretation and generalize naturally to the whole domain. Additionally, we present an approach based on mixed integer linear programming to compute such heuristics automatically from the observation of small training instances. We develop two variations of the approach that progressively refine the heuristic as new states are encountered. We illustrate the approach empirically on a number of standard domains, where we show that the generated heuristics will correctly generalize to all possible instances.

[1]  Blai Bonet,et al.  Learning Features and Abstract Actions for Computing Generalized Plans , 2018, AAAI.

[2]  Ian Horrocks,et al.  An Introduction to Description Logic , 2017 .

[3]  H. Ector Geener.  Functional Strips: a More Flexible Language for Planning and Problem Solving , 2022 .

[4]  Maria Fox,et al.  Explainable Planning , 2017, ArXiv.

[5]  Hector Geffner,et al.  Learning Generalized Policies from Planning Examples Using Concept Languages , 2004, Applied Intelligence.

[6]  Hector J. Levesque,et al.  Planning with Loops , 2005, IJCAI.

[7]  Giuseppe De Giacomo,et al.  Generalized Planning: Non-Deterministic Abstractions and Trajectory Constraints , 2017, IJCAI.

[8]  Neil Immerman,et al.  Learning Generalized Plans Using Abstract Counting , 2008, AAAI.

[9]  Robert Givan,et al.  Learning Heuristic Functions from Relaxed Plans , 2006, ICAPS.

[10]  Lexing Xie,et al.  Action Schema Networks: Generalised Policies with Deep Learning , 2017, AAAI.

[11]  Jendrik Seipp,et al.  From Non-Negative to General Operator Cost Partitioning , 2015, AAAI.

[12]  Robert Givan,et al.  Learning Control Knowledge for Forward Search Planning , 2008, J. Mach. Learn. Res..

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

[14]  Blai Bonet,et al.  Automatic Derivation of Memoryless Policies and Finite-State Controllers Using Classical Planners , 2009, ICAPS.

[15]  Jendrik Seipp,et al.  Correlation Complexity of Classical Planning Domains , 2016, IJCAI.

[16]  Florian Pommerening,et al.  An Empirical Study of Perfect Potential Heuristics , 2019, ICAPS.

[17]  Blai Bonet,et al.  Features, Projections, and Representation Change for Generalized Planning , 2018, IJCAI.

[18]  Drew McDermott,et al.  The 1998 AI Planning Systems Competition , 2000, AI Mag..

[19]  Robert Givan,et al.  Learning Measures of Progress for Planning Domains , 2005, AAAI.

[20]  Yuxiao Hu,et al.  Generalized Planning: Synthesizing Plans that Work for Multiple Environments , 2011, IJCAI.

[21]  Jendrik Seipp,et al.  New Optimization Functions for Potential Heuristics , 2015, ICAPS.