If there exists a k-length plan, it will be a subgraph of the
k-length planning graph.
Planning is thus searching for a “valid” subgraph of the planning graph.
Can be cast into any combinatorial substrate
(e.g. CSP, SAT, ILP…)
Planning as Plangraph Solution Extraction
Back to first slide
View graphic version