Heuristic Function Design
Heuristic Function Design is the systematic development of domain-specific estimation functions that guide search algorithms by approximating the cost to reach a goal, distinguishing it from general search strategies through its focus on constructing problem-informed metrics to prioritize exploration.
97
Publications
4.9K
Citations
258
Authors
139
Institutions
Publications per year
2017–2026
39
Parents
97
Finding optimal solutions to Rubik's cube using pattern databases
Richard E. Korf · 1997 · 255 citations
A robust and fast action selection mechanism for planning
Blai Bonet, Gábor Loerincs, Héctor Geffner · 1997 · 215 citations
1–5 of 97
258
5
h-index
3
h-index
Indraprastha Institute of Information Technology Delhi, India
3 publications · 169 citations
3
h-index
3
h-index
3
h-index
1–5 of 258
139
Carnegie Mellon University
Pittsburgh, United States
5 h-index
16 publications
910 citations

Indraprastha Institute of Information Technology Delhi
Delhi, India
3 h-index
3 publications
169 citations
University of California, Los Angeles
Los Angeles, United States
3 h-index
5 publications
463 citations
Jilin University
Changchun, China
3 h-index
9 publications
397 citations
National University of Computer and Emerging Sciences
Islamabad, Pakistan
2 h-index
4 publications
54 citations
Arizona State University
Tempe, United States
2 h-index
3 publications
85 citations

University of Alberta
Edmonton, Canada
2 h-index
4 publications
262 citations

Carleton University
Ottawa, Canada
2 h-index
2 publications
46 citations
1–8 of 139
IJRR · 3 publications · 270 citations
3
h-index
Conference · 2 publications · 34 citations
2
h-index
ARS · 2 publications · 324 citations
2
h-index
2 publications · 99 citations
2
h-index
2 publications · 50 citations
2
h-index
1–5