Conformant planning via heuristic forward search: A new approach

DOI10.1016/j.artint.2006.01.003zbMath1131.68525MaRDI QIDQ2457623

Ronen I. Brafman, Jörg Hoffmann

Publication date: 23 October 2007

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2006.01.003

zbMATH Keywords

planning under uncertainty; heuristic search planning; relaxed plan heuristic

Mathematics Subject Classification ID

68T37: Reasoning under uncertainty in the context of artificial intelligence

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

Related Items

On the completeness of pruning techniques for planning with conditional effects, State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning, Conformant planning via symbolic model checking and heuristic search, Task decomposition on abstract states, for planning under nondeterminism, Conformant plans and beyond: principles and complexity, Set-structured and cost-sharing heuristics for classical planning, Semantics for possibilistic answer set programs: uncertain rules versus rules with uncertain conclusions, Sequential Monte Carlo in reachability heuristics for probabilistic planning, Strong planning under partial observability, Directing the Search in the Fast Forward Planning

Uses Software

• Chaff
• Graphplan

Cites Work

• A logic programming approach to knowledge-state planning. II: The DLV\(^\mathcal K\) system
• Conformant planning via symbolic model checking and heuristic search
• The computational complexity of propositional STRIPS planning
• Fast planning through planning graph analysis
• A Computing Procedure for Quantification Theory
• A machine program for theorem-proving
• Blocks World revisited
• Planning as heuristic search
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item