Set-structured and cost-sharing heuristics for classical planning

DOI10.1007/s10472-009-9170-5zbMath1185.68641MaRDI QIDQ2268919

Vitaly Mirkis, Carmel Domshlak

Publication date: 15 March 2010

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10472-009-9170-5

zbMATH Keywords

probabilistic reasoning

Mathematics Subject Classification ID

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

Uses Software

• Walksat
• Graphplan

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• SAT-based planning in complex domains: Concurrency, constraints and nondeterminism
• Depth-first iterative-deepening: An optimal admissible tree search
• Planning for conjunctive goals
• Using regression-match graphs to control search in planning
• The computational complexity of propositional STRIPS planning
• Fast planning through planning graph analysis
• Conformant planning via heuristic forward search: A new approach
• STRIPS: A new approach to the application of theorem proving to problem solving
• Combining linear programming and satisfiability solving for resource planning
• Learning to think and communicate with diagrams: 14 questions to consider
• Blocks World revisited
• Planning as heuristic search
• On decision-theoretic foundations for defaults
• Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search
• Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP