Deep Learning for Cost-Optimal Planning: Task-Dependent Planner Selection

As classical planning is known to be computationally hard, no single planner is expected to work well across many planning domains. One solution to this problem is to use online portfolio planners that select a planner for a given task. These portfolios perform a classification task, a well-known and wellresearched task in the field of machine learning. The classification is usually performed using a representation of planning tasks with a collection of hand-crafted statistical features. Recent techniques in machine learning that are based on automatic extraction of features have not been employed yet due to the lack of suitable representations of planning tasks.In this work, we alleviate this barrier. We suggest representing planning tasks by images, allowing to exploit arguably one of the most commonly used and best developed techniques in deep learning. We explore some of the questions that inevitably rise when applying such a technique, and present various ways of building practically useful online portfoliobased planners. An evidence of the usefulness of our proposed technique is a planner that won the cost-optimal track of the International Planning Competition 2018.

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

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

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

[4]  J. Hoffmann,et al.  DecStar – STAR-topology DECoupled Search at its best , 2018 .

[5]  Shirin Sohrabi,et al.  Delfi: Online Planner Selection for Cost-Optimal Planning , 2018 .

[6]  Malte Helmert,et al.  Heuristics and Symmetries in Classical Planning , 2015, AAAI.

[7]  Alan Fern,et al.  Training Deep Reactive Policies for Probabilistic Planning Problems , 2018, ICAPS.

[8]  Mauro Vallati,et al.  A Guide to Portfolio-Based Planning , 2012, MIWAI.

[9]  Stefan Edelkamp,et al.  Efficient symbolic search for cost-optimal planning , 2017, Artif. Intell..

[10]  Reuven Y. Rubinstein,et al.  Optimization of computer simulation models with rare events , 1997 .

[11]  Patrik Haslum,et al.  Computing Genome Edit Distances using Domain-Independent Planning , 2011, ICAPS 2011.

[12]  Jeffrey S. Rosenschein,et al.  Exploiting Problem Symmetries in State-Based Planners , 2011, AAAI.

[13]  Hector Geffner,et al.  Compiling Uncertainty Away in Conformant Planning Problems with Bounded Width , 2009, J. Artif. Intell. Res..

[14]  Tom Bylander,et al.  The Computational Complexity of Propositional STRIPS Planning , 1994, Artif. Intell..

[15]  Fernando Fernández,et al.  The IBaCoP Planning System: Instance-Based Configured Portfolios , 2016, J. Artif. Intell. Res..

[16]  Jendrik Seipp,et al.  Automatic Configuration of Sequential Planning Portfolios , 2015, AAAI.

[17]  Jörg Hoffmann,et al.  Fast Downward Stone Soup , 2011 .

[18]  Jendrik Seipp,et al.  Fast Downward SMAC , 2014 .

[19]  Jendrik Seipp,et al.  Learning Portfolios of Automatically Tuned Planners , 2012, ICAPS.

[20]  Guigang Zhang,et al.  Deep Learning , 2016, Int. J. Semantic Comput..

[21]  Jimmy Ba,et al.  Adam: A Method for Stochastic Optimization , 2014, ICLR.

[22]  Bernhard Nebel,et al.  In Defense of PDDL Axioms , 2003, IJCAI.

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

[24]  Silvan Sievers Fast Downward Cedalion , 2014 .

[25]  Achille Fokoue,et al.  An effective algorithm for hyperparameter optimization of neural networks , 2017, IBM J. Res. Dev..

[26]  Silvan Sievers,et al.  Structural Symmetries of the Lifted Representation of Classical Planning Tasks , 2017 .

[27]  Jie Chen,et al.  Adaptive Planner Scheduling with Graph Neural Networks , 2018, ArXiv.

[28]  Jana Koehler Handling of Conditional Effects and Negative Goals in IPP , 1999 .

[29]  Silvan Sievers Fast Downward Merge-and-Shrink , 2018 .

[30]  Florian Geißer,et al.  SYMPLE : Symbolic Planning based on EVMDDs , 2018 .

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

[32]  Yuri Malitsky,et al.  Deep Learning for Algorithm Portfolios , 2016, AAAI.

[33]  Fernando Fernández,et al.  Learning Predictive Models to Configure Planning Portfolios , 2013 .