Optimal admissible composition of abstraction heuristics

DOI10.1016/j.artint.2010.04.021zbMath1205.68376OpenAlexW2081726708MaRDI QIDQ991018

J. Martínez

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

zbMATH Keywords

planningheuristic searchabstractionsadmissible heuristicsadditive heuristics

Mathematics Subject Classification ID

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

Related Items (4)

Symbolic perimeter abstraction heuristics for cost-optimal planning ⋮ Landmark-enhanced abstraction heuristics ⋮ Backdoors to planning ⋮ Online Relaxation Refinement for Satisficing Planning: On Partial Delete Relaxation, Complete Hill-Climbing, and Novelty Pruning

Uses Software

• Mosek

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

This page was built for publication: Optimal admissible composition of abstraction heuristics