Anytime heuristic search for partial satisfaction planning

DOI10.1016/J.ARTINT.2008.11.010MaRDI QIDQ835822zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

heuristicsplanningsearchpartial satisfaction

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Anytime heuristic search
• Planning as heuristic search
• Planning as propositional CSP: From Walksat to local search techniques for action graphs
• Planning as satisfiability with IPC simple preferences and action costs
• Heuristic search when time matters

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)

• Selecting goals in oversubscription planning using relaxed plans
• Anticipation of goals in automated planning
• FROM PLANNING TO SEARCHING FOR THE SHORTEST PLAN: AN OPTIMAL TRANSITION
• Heuristic search when time matters

Describes a project that uses

Uses Software

• Yochan
• SAPA

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)