Optimal admissible composition of abstraction heuristics
From MaRDI portal
Publication:991018
DOI10.1016/j.artint.2010.04.021zbMath1205.68376MaRDI QIDQ991018
Publication date: 2 September 2010
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2010.04.021
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The computational complexity of propositional STRIPS planning
- An interior-point approach for primal block-angular problems
- Implicit Abstraction Heuristics
- An LP-Based Heuristic for Optimal Planning
- Friends or Foes? On Planning as Satisfiability and Abstract CNF Encodings
- Automated Creation of Pattern Database Search Heuristics
- Model Checking Software
- Planning as heuristic search