Consistent Heuristics
Consistent Heuristics is a heuristic function in heuristic search that satisfies the condition that the estimated cost from any node to the goal is no greater than the step cost to a neighboring node plus the estimated cost from that neighbor to the goal, thereby guaranteeing monotonicity along solution paths.
18
Publications
1.4K
Citations
38
Authors
24
Institutions
Publications per year
2017–2026
3
Variants
Monotonic Heuristics
Parents
18
Sandip Aine, Siddharth Swaminathan, Venkatraman Narayanan et al. · The International Journal of Robotics Research · 2015 · 139 citations
Multiobjective A <sup>*</sup> search with consistent heuristics
Lawrence Mandow · Journal of the ACM · 2008 · 94 citations
1–5 of 18
38
5
h-index
5
h-index
3
h-index
3
h-index
3
h-index
1–5 of 38
24

University of Alberta
Edmonton, Canada
7 h-index
12 publications
506 citations
Carnegie Mellon University
Pittsburgh, United States
4 h-index
14 publications
738 citations
University of Denver
Denver, United States
3 h-index
5 publications
193 citations

Indraprastha Institute of Information Technology Delhi
Delhi, India
3 h-index
3 publications
169 citations

University of Regina
Regina, Canada
2 h-index
2 publications
78 citations
Ben-Gurion University of the Negev
Beersheba, Israel
2 h-index
2 publications
92 citations

Bar-Ilan University
Ramat Gan, Israel
2 h-index
2 publications
92 citations

University of New Hampshire
Durham, United States
1 h-index
3 publications
54 citations
1–8 of 24
Conference · 3 publications · 72 citations
3
h-index
2 publications · 69 citations
2
h-index
2 publications · 209 citations
2
h-index
Conference · 1 publications · 13 citations
1
h-index
Repository · 1 publications · 209 citations
1
h-index
1–5