Anytime heuristic search for partial satisfaction planning
From MaRDI portal
(Redirected from Publication:835822)
Recommendations
Cites work
- scientific article; zbMATH DE number 5547917 (Why is no real title available?)
- scientific article; zbMATH DE number 1315585 (Why is no real title available?)
- scientific article; zbMATH DE number 2038899 (Why is no real title available?)
- scientific article; zbMATH DE number 2038900 (Why is no real title available?)
- scientific article; zbMATH DE number 2038901 (Why is no real title available?)
- An LP-Based Heuristic for Optimal Planning
- Anytime heuristic search
- Heuristics for planning with penalties and rewards formulated in logic and computed through circuits
- Introducing preferences in planning as satisfiability
- Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search
- Planning with preferences using logic programming
- The FF planning system: Fast plan generation through heuristic search
- The fast downward planning system
Cited in
(4)
This page was built for publication: Anytime heuristic search for partial satisfaction planning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q835822)