Symbolic Planning with Edge-Valued Multi-Valued Decision Diagrams

Symbolic representations have attracted significant attention in optimal planning. Binary Decision Diagrams (BDDs) form the basis for symbolic search algorithms. Closely related are Algebraic Decision Diagrams (ADDs), used to represent heuristic functions. Also, progress was made in dealing with models that take state-dependent action costs into account. Here, costs are represented as Edge-valued Multivalued Decision Diagrams (EVMDDs), which can be exponentially more compact than the corresponding ADD representation. However, they were not yet considered for symbolic planning. In this work, we study EVMDD-based symbolic search for optimal planning. We define EVMDD-based representations of state sets and transition relations, and show how to compute the necessary operations required for EVMDDA. This EVMDD-based version of symbolic A generalizes its BDD variant, and allows to solve planning tasks with state-dependent action costs. We prove theoretically that our approach is sound, complete and optimal. Additionally, we present an empirical analysis comparing EVMDD-A to BDD-A and explicit A search. Our results underscore the usefulness of symbolic approaches and the feasibility of dealing with models that go beyond unit costs.

[1]  Stefan Edelkamp,et al.  Improving Cost-Optimal Domain-Independent Symbolic Planning , 2011, AAAI.

[2]  Edmund M. Clarke,et al.  Symbolic model checking for sequential circuit verification , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

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

[4]  Stefan Edelkamp,et al.  Optimal Symbolic Planning with Action Costs and Preferences , 2009, IJCAI.

[5]  Andrew S. Miner,et al.  Meddly: Multi-terminal and Edge-Valued Decision Diagram LibrarY , 2010, 2010 Seventh International Conference on the Quantitative Evaluation of Systems.

[6]  Enrico Macii,et al.  Algebraic decision diagrams and their applications , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

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

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

[9]  Malte Helmert,et al.  Understanding Planning Tasks: Domain Complexity and Heuristic Decomposition , 2008, Lecture Notes in Computer Science.

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

[11]  Jörg Hoffmann,et al.  Waking Up a Sleeping Rabbit: On Natural-Language Sentence Generation with FF , 2010, ICAPS.

[12]  Álvaro Torralba Arias de Reyna.  Symbolic search and abstraction heuristics for cost-optimal planning in automated planning , 2015 .

[13]  Malte Helmert,et al.  The Scanalyzer Domain: Greenhouse Logistics as a Planning Problem , 2010, ICAPS.

[14]  Claus-Peter Schnorr,et al.  Lattice basis reduction: Improved practical algorithms and solving subset sum problems , 1991, FCT.

[15]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

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

[17]  Pierre Roux,et al.  Model Checking with Edge-valued Decision Diagrams , 2010, NASA Formal Methods.

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

[19]  Lijun Zhang,et al.  A Comparative Study of BDD Packages for Probabilistic Symbolic Model Checking , 2015, SETTA.

[20]  Zhengzhu Feng,et al.  Symbolic Heuristic Search Using Decision Diagrams , 2002, SARA.

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

[22]  Álvaro Torralba,et al.  Abstraction Heuristics for Symbolic Bidirectional Search , 2016, IJCAI.

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

[24]  Malte Helmert,et al.  MIPS: The Model-Checking Integrated Planning System , 2001, AI Mag..

[25]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[26]  Sarma B. K. Vrudhula,et al.  Formal Verification Using Edge-Valued Binary Decision Diagrams , 1996, IEEE Trans. Computers.

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

[28]  Álvaro Torralba,et al.  Symbolic Merge-and-Shrink for Cost-Optimal Planning , 2013, IJCAI.

[29]  Frank Reffel,et al.  OBDDs in Heuristic Search , 1998, KI.

[30]  Fabio Somenzi,et al.  CUDD: CU Decision Diagram Package Release 2.2.0 , 1998 .

[31]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[32]  B. Nebel.  Symbolic Planning with Edge-Valued Multi-Valued Decision Diagrams-Masterthesis , 2019 .

[33]  Wolfram Burgard,et al.  Shakey 2016—How Much Does it Take to Redo Shakey the Robot? , 2017, IEEE Robotics and Automation Letters.

[34]  Lukás Chrpa,et al.  The 2014 International Planning Competition: Progress and Trends , 2015, AI Mag..

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

[36]  Bernhard Nebel,et al.  On the Relationship Between State-Dependent Action Costs and Conditional Effects in Planning , 2018, AAAI.

[37]  Álvaro Torralba,et al.  A Reminder about the Importance of Computing and Exploiting Invariants in Planning , 2015, ICAPS.

[38]  Sérgio Vale Aguiar Campos,et al.  Symbolic Model Checking , 1993, CAV.