Cost-Optimal Planning using Weighted MaxSAT

We consider the problem of computing optimal plans for propositional planning problems with action costs. In the spirit of leveraging advances in general-purpose automated reasoning for that setting, we develop an approach that operates by solving a sequence of partial weighted MaxSAT problems, each of which corresponds to a step-bounded variant of the problem at hand. Our approach is the first SAT-based system in which a proof of cost optimality is obtained using a MaxSAT procedure. It is also the first system of this kind to incorporate an admissible planning heuristic. We perform a detailed empirical evaluation of our work using benchmarks from a number of International Planning Competitions.

[1]  Josep Argelich,et al.  The First and Second Max-SAT Evaluations , 2008, J. Satisf. Boolean Model. Comput..

[2]  Stephen F. Smith,et al.  Using Decision Procedures Efficiently for Optimization , 2007, ICAPS.

[3]  Jinbo Huang,et al.  The Effect of Restarts on the Efficiency of Clause Learning , 2007, IJCAI.

[4]  Joao Marques-Silva,et al.  GRASP-A new search algorithm for satisfiability , 1996, Proceedings of International Conference on Computer Aided Design.

[5]  Adnan Darwiche,et al.  RSat 2.0: SAT Solver Description , 2006 .

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

[7]  Abdul Sattar,et al.  SAT-Based Parallel Planning Using a Split Representation of Actions , 2009, ICAPS.

[8]  Bart Selman,et al.  Encoding Plans in Propositional Logic , 1996, KR.

[9]  Henry A. Kautz.  Deconstructing Planning as Satisfiability , 2006, AAAI.

[10]  Karem A. Sakallah,et al.  GRASP—a new search algorithm for satisfiability , 1996, ICCAD 1996.

[11]  Bart Selman,et al.  Unifying SAT-based and Graph-based Planning , 1999, IJCAI.

[12]  Jesse Hoey,et al.  SPUDD: Stochastic Planning using Decision Diagrams , 1999, UAI.

[13]  Michael D. Ernst,et al.  Automatic SAT-Compilation of Planning Problems , 1997, IJCAI.

[14]  Ji-Ae Shin,et al.  Processes and continuous change in a SAT-based planner , 2005, Artif. Intell..

[15]  Bart Selman,et al.  Planning as Satisfiability , 1992, ECAI.

[16]  Avrim Blum,et al.  Fast Planning Through Planning Graph Analysis , 1995, IJCAI.

[17]  Charles Gretton,et al.  CO-PLAN : Combining SAT-Based Planning with Forward-Search , 2008 .

[18]  Sharad Malik,et al.  On Solving the Partial MAX-SAT Problem , 2006, SAT.

[19]  Enrico Giunchiglia,et al.  Planning as Satisfiability with Preferences , 2007, AAAI.

[20]  Jussi Rintanen,et al.  Satisfiability Planning with Constraints on the Number of Actions , 2005, ICAPS.

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

[22]  Sharad Malik,et al.  Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[23]  Richard Anthony Russell,et al.  Handling Goal Utility Dependencies in a Satisfiability Framework , 2010, ICAPS.

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

[25]  Jussi Rintanen.  Planning Graphs and Propositional Clause-Learning , 2008, KR.

[26]  Jörg Hoffmann,et al.  SAT Encodings of State-Space Reachability Problems in Numeric Domains , 2007, IJCAI.

[27]  Daniel S. Weld,et al.  The LPSAT System and its Application to Resource Planning , 1999, International Joint Conference on Artificial Intelligence.

[28]  Jussi Rintanen.  Evaluation Strategies for Planning as Satisfiability , 2004, ECAI.