Recursive Best-first Search

Recursive Best-First Search is a heuristic search algorithm that belongs to the class of best-first search methods, distinguished by its use of recursive depth-first traversal with limited memory to expand nodes based on the lowest heuristic cost while backtracking to reconsider alternative paths when necessary.

23

Publications

1.2K

Citations

55

Authors

35

Institutions

Publications per year

2017–2026

6

Variants

Rbfs

Authors

55

  1. GD
    Gerard de Haan

    Eindhoven University of Technology, Netherlands

    2 publications · 100 citations

    2

    h-index

  2. PB
    P.W.A.C. Biezen

    Philips (Netherlands), Netherlands

    2 publications · 100 citations

    2

    h-index

  3. WZ
    Weixiong Zhang

    Washington University in St. Louis, United States

    2 publications · 75 citations

    2

    h-index

  4. AA
    Ahmed Alsaedi

    King Abdulaziz University, Saudi Arabia

    1 publications · 11 citations

    1

    h-index

  5. CM
    Carlos M. Costa

    Universidade do Porto, Portugal

    1 publications · 17 citations

    1

    h-index

1–5 of 55

Venues

  1. 1

    h-index

  2. Uncertainty in Artificial Intelligence

    Conference · 1 publications · 10 citations

    1

    h-index

  3. ISA Transactions

    1 publications · 102 citations

    1

    h-index

  4. Journal of Artificial Intelligence Research

    JAIR · 1 publications · 258 citations

    1

    h-index

  5. Journal of the Franklin Institute

    1 publications · 11 citations

    1

    h-index

1–5