Unifying SAT-based and Graph-based Planning

Abstract

The Blackbox planning system unifies the planning as satisfiability framework (Kautz and Selman 1992, 1996) with the plan graph approach to STRIPS planning (Blum and Furst 1995). We show that STRIPS problems can be directly translated into SAT and efficiently solved using new randomized systematic solvers. For certain computationally challenging benchmark problems this unified approach outperforms both SATPLAN and Graphplan alone. We also demonstrate that polynomialtime SAT simplification algorithms applied to the encoded problem instances are a powerful complement to the “mutex” propagation algorithm that works directly on the plan graph.

Extracted Key Phrases

5 Figures and Tables

0204060'00'02'04'06'08'10'12'14'16
Citations per Year

560 Citations

Semantic Scholar estimates that this publication has 560 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Kautz1999UnifyingSA, title={Unifying SAT-based and Graph-based Planning}, author={Henry A. Kautz and Bart Selman}, booktitle={IJCAI}, year={1999} }