A Unifying View
Refinement Planning
Disjunctive Refinement Planning
Conjunctive Refinement Planning
CSP
ILP
BDD
What are Plans?
Refinements?
How are sets of plans
represented compactly?
How are they refined?
How are they searched?
Graph-based
SAT
SEARCH
CONTROL
Heuristics/Optimizations
Domain-customization
HTN Schemas TL Formulas Cutting Planes
Case-based Abstraction-based Failure-based Domain Analysis*
FSS, BSS, PS
Conjunctive, Disjunctive
Hand-coded
Learned
Reachability Relevance
Relax Subgoal interactions
Directed Partial Consistency enforcement
PART 2
PART 3
PART I
Previous slide
Next slide
Back to first slide
View graphic version