Landmark-enhanced abstraction heuristics
type: Item
instance of: scholarly article
title: Landmark-enhanced abstraction heuristics
zbMATH Open document ID: 1251.68200
author: Xianqiang Yang
published in: Artificial Intelligence
publication date: 2012-11-15T00:00:00Z
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 68T42
zbMATH DE Number: 6106693
zbMATH Keywords: classical planning
zbMATH Keywords: heuristic search
zbMATH Keywords: admissible heuristics
zbMATH Keywords: abstractions
zbMATH Keywords: landmarks
zbMATH Keywords: reformulation
MaRDI profile type: Publication
full work available at URL: j.artint.2012.05.003
OpenAlex ID: W2035261298
cites work: Strengthening Landmark Heuristics via Hitting Sets
cites work: Model Checking Software
cites work: Q5715685
cites work: Q3624014
cites work: Understanding planning tasks. Domain complexity and heuristic decomposition
cites work: Q5715683
cites work: Implicit Abstraction Heuristics
cites work: Optimal admissible composition of abstraction heuristics
cites work: Sound and Complete Landmarks for And/Or Graphs
cites work: Branching and pruning: An optimal temporal POCL planner based on constraint programming
cites work: Q3624143
DOI: 10.1016/J.ARTINT.2012.05.003
description: scientific article; zbMATH DE number 6106693