Anytime heuristic search for partial satisfaction planning
From MaRDI portal
Publication:835822
DOI10.1016/J.ARTINT.2008.11.010zbMATH Open1192.68635OpenAlexW2050635891MaRDI QIDQ835822FDOQ835822
Authors: N. E. Zubov
Publication date: 31 August 2009
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2008.11.010
Recommendations
Cites Work
- Title not available (Why is that?)
- Anytime heuristic search
- Title not available (Why is that?)
- The fast downward planning system
- The FF planning system: Fast plan generation through heuristic search
- Title not available (Why is that?)
- An LP-Based Heuristic for Optimal Planning
- Title not available (Why is that?)
- Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search
- Introducing preferences in planning as satisfiability
- Planning with preferences using logic programming
- Title not available (Why is that?)
- Heuristics for planning with penalties and rewards formulated in logic and computed through circuits
Cited In (4)
Uses Software
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)