A Planning Algorithm not based on Directional Search

The initiative in STRIPS planning has recently been taken by work on propositional satisfiability. Best current planners, like Graphplan, and earlier planners originating in the partial-order or refinement planning community have proved in many cases to be inferior to general-purpose satisfiability algorithms in solving planning problems. However, no explanation of the success of programs like Walksat or relsat in planning has been offered. In this paper we discuss a simple planning algorithm that reconstructs the planner in the background of the SAT/CSP approach.

• Type: Conference
• Year: 1998
• Where: KR
• Authors: Jussi Rintanen
• Keywords: Automated Reasoning, General-purpose Satisfiability Algorithms, KR 1998, Planning, Refinement Planning Community