Anytime heuristic search for partial satisfaction planning

DOI10.1016/J.ARTINT.2008.11.010zbMath1192.68635OpenAlexW2050635891MaRDI QIDQ835822

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)

Related Items (2)

Anticipation of goals in automated planning ⋮ Selecting goals in oversubscription planning using relaxed plans

Uses Software

• SAPA
• Yochan

Cites Work

• Heuristics for planning with penalties and rewards formulated in logic and computed through circuits
• Introducing Preferences in Planning as Satisfiability
• An LP-Based Heuristic for Optimal Planning
• Planning with preferences using logic programming
• Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Anytime heuristic search for partial satisfaction planning