Refinement-Based Planning as Satisfiability

A classical planning problem is the problem of computing a sequence of actions that transforms one state of the world into the desired. Traditional planners cast planning as a "split & prune" type search. These are called "refinement planners" since they start with a null plan and refine it by adding constraints. It has been shown recently that planning… CONTINUE READING