Least commitment in Graphplan
From MaRDI portal
Recommendations
- Fast planning through planning graph analysis
- A weighted CSP approach to cost-optimal planning
- scientific article; zbMATH DE number 1448981
- Planning as propositional CSP: From Walksat to local search techniques for action graphs
- Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search
Cites work
- Analysis on the p-adic superspace. I. Generalized functions: Gaussian distribution
- Fast planning through planning graph analysis
- scientific article; zbMATH DE number 3887060 (Why is no real title available?)
- scientific article; zbMATH DE number 1216125 (Why is no real title available?)
- scientific article; zbMATH DE number 1249653 (Why is no real title available?)
- scientific article; zbMATH DE number 1285155 (Why is no real title available?)
- scientific article; zbMATH DE number 1448981 (Why is no real title available?)
Cited in
(6)- Fast planning through planning graph analysis
- Planning as satisfiability: parallel plans and algorithms for plan search
- scientific article; zbMATH DE number 1285155 (Why is no real title available?)
- scientific article; zbMATH DE number 2243389 (Why is no real title available?)
- scientific article; zbMATH DE number 2243415 (Why is no real title available?)
- Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search
This page was built for publication: Least commitment in Graphplan
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5958108)