Graphplan
Create level 0 in planning graph
Loop
- If goal ? contents of highest level (nonmutex)
- Then search graph for solution
- If find a solution then return and terminate
- Else Extend graph one more level
A kind of double search: forward direction checks necessary
(but insufficient) conditions for a solution, ...
Backward search verifies...