Solution Extraction in Disjunctive Plans
Even after refinement, a k-length disjunctive plan contains too many potential k-length plans.
Looking for a solution plan in the disjunctive structure is a combinatorial problem
- Direct methods: Can be solved using special techniques customized to the disjunctive structure
- Graphplan backward search; Graphplan local search
- Compilation: Can be polynomially compiled to any canonical combinatorial problems, including
- Constraint Satisfaction Problem (CSP)
- Boolean Satisfiability Problem (SAT)
- Integer Linear Programming (ILP)