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

Authors

38

  1. RC
    Robert C. Holte

    University of Alberta, Canada

    5 publications · 189 citations

    5

    h-index

  2. NS
    Nathan Sturtevant

    University of Alberta, Canada

    5 publications · 207 citations

    5

    h-index

  3. VN
    Venkatraman Narayanan

    Carnegie Mellon University, United States

    3 publications · 169 citations

    3

    h-index

  4. SS
    Siddharth Swaminathan

    Carnegie Mellon University, United States

    3 publications · 169 citations

    3

    h-index

  5. ML
    Maxim Likhachev

    Carnegie Mellon University, United States

    3 publications · 169 citations

    3

    h-index

1–5 of 38

Venues

  1. Proceedings of the AAAI Conference on Artificial Intelligence

    Conference · 3 publications · 72 citations

    3

    h-index

  2. 2

    h-index

  3. Artificial Intelligence

    2 publications · 209 citations

    2

    h-index

  4. Annual Symposium on Combinatorial Search

    Conference · 1 publications · 13 citations

    1

    h-index

  5. ANU Open Research (Australian National University)

    Repository · 1 publications · 209 citations

    1

    h-index

1–5