Landmark Heuristics
Landmark Heuristics is a heuristic function in heuristic search that estimates the cost to reach a goal by leveraging precomputed distances to a set of critical states, known as landmarks, which capture global structural properties of the search space.
19
Publications
1.7K
Citations
29
Authors
10
Institutions
Publications per year
2017–2026
7
Parents
19
The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarks
2010 · 519 citations
Cost-optimal planning with landmarks
Erez Karpas, Carmel Domshlak · 2009 · 144 citations
1–5 of 19
29
6
h-index
5
h-index
3
h-index
3
h-index
Pontifícia Universidade Católica do Rio Grande do Sul, Brazil
2 publications · 91 citations
3
h-index
1–5 of 29
10
Technion – Israel Institute of Technology
Haifa, Israel
5 h-index
10 publications
805 citations

Pontifícia Universidade Católica do Rio Grande do Sul
Porto Alegre, Brazil
3 h-index
4 publications
182 citations

University of Freiburg
Freiburg im Breisgau, Germany
2 h-index
2 publications
475 citations

University of Aberdeen
Aberdeen, United Kingdom
2 h-index
1 publications
79 citations

Australian National University
Canberra, Australia
2 h-index
7 publications
178 citations

University of Basel
Basel, Switzerland
2 h-index
5 publications
120 citations

Data61
Sydney, Australia
1 h-index
3 publications
66 citations
Universidade Federal do Rio Grande do Sul
Porto Alegre, Brazil
1 h-index
1 publications
12 citations
1–8 of 10
9 publications · 550 citations
9
h-index
Conference · 2 publications · 112 citations
2
h-index
JAIR · 1 publications · 198 citations
1
h-index
1 publications · 76 citations
1
h-index
Repository · 1 publications · 16 citations
1
h-index
1–5