Landmark-enhanced abstraction heuristics
From MaRDI portal
Publication:1761301
DOI10.1016/j.artint.2012.05.003zbMath1251.68200MaRDI QIDQ1761301
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
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
68T42: Agent technology and artificial intelligence
Related Items
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