MAXSAT Heuristics for Cost Optimal Planning

  title={MAXSAT Heuristics for Cost Optimal Planning},
  author={Lei Zhang and Fahiem Bacchus},
The cost of an optimal delete relaxed plan, known as h, is a powerful admissible heuristic but is in general intractable to compute. In this paper we examine the problem of computing hby encoding it as a MAXSAT problem. We develop a new encoding that utilizes constraint generation to support the computation of a sequence of increasing lower bounds on h. We show a close connection between the computations performed by a recent approach for solving MAXSAT and a hitting set approach recently… CONTINUE READING

Similar Papers

Loading similar papers…