Landmark-enhanced abstraction heuristics

DOI10.1016/J.ARTINT.2012.05.003zbMath1251.68200OpenAlexW2035261298MaRDI QIDQ1761301

Xianqiang Yang

Publication date: 15 November 2012

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

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

zbMATH Keywords

heuristic searchlandmarksreformulationabstractionsadmissible heuristicsclassical planning

Mathematics Subject Classification ID

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

Related Items (1)

Optimal Sokoban solving using pattern databases with specific domain knowledge

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal admissible composition of abstraction heuristics
• Branching and pruning: An optimal temporal POCL planner based on constraint programming
• Understanding planning tasks. Domain complexity and heuristic decomposition
• Strengthening Landmark Heuristics via Hitting Sets
• Sound and Complete Landmarks for And/Or Graphs
• Implicit Abstraction Heuristics
• Model Checking Software

This page was built for publication: Landmark-enhanced abstraction heuristics