Unifying SAT-based and Graph-based Planning

DMCA

Unifying SAT-based and Graph-based Planning (1999)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Henry Kautz , Bart Selman

Venue:	In IJCAI
Citations:	292 - 14 self

BibTeX

@INPROCEEDINGS{Kautz99unifyingsat-based,
    author = {Henry Kautz and Bart Selman},
    title = {Unifying SAT-based and Graph-based Planning},
    booktitle = {In IJCAI},
    year = {1999},
    pages = {318--325}
}

OpenURL

Abstract

The Blackbox planning system unifies the plan-ning as satisfiability framework (Kautz and Sel-man 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 random-ized systematic solvers. For certain computation-ally challenging benchmark problems this unified approach outperforms both SATPLAN and Graph-plan alone. We also demonstrate that polynomial-time SAT simplification algorithms applied to the encoded problem instances are a powerful com-plement to the “mutex ” propagation algorithm that works directly on the plan graph. 1

DMCA