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
Parents
23
Eric A. Hansen, Rong Zhou · Journal of Artificial Intelligence Research · 2007 · 258 citations · Full text
The B∗ tree search algorithm: A best-first proof procedure
Hans Berliner · Artificial Intelligence · 1979 · 189 citations
A. Joshuva, V. Sugumaran · ISA Transactions · 2017 · 102 citations
Engineering, Mechanical Engineering, Systems Engineering +17
Ruicheng Zhong, Guoliang Li, Kian‐Lee Tan et al. · 2013 · 93 citations
1–5 of 23
55
2
h-index
2
h-index
2
h-index
1
h-index
1
h-index
1–5 of 55
35
Philips (Netherlands)
Amsterdam, The Netherlands
2 h-index
4 publications
200 citations

Korea Electrotechnology Research Institute
Changwon, South Korea
1 h-index
3 publications
69 citations
Al-Balqa Applied University
Salt, Jordan
1 h-index
1 publications
20 citations

Universidade do Porto
Porto, Portugal
1 h-index
6 publications
102 citations
University of Jordan
Amman, Jordan
1 h-index
2 publications
40 citations
Vellore Institute of Technology University
Vellore, India
1 h-index
2 publications
204 citations

University of Maribor
Maribor, Slovenia
1 h-index
2 publications
26 citations

Indian Institute of Management Calcutta
Kolkata, India
1 h-index
2 publications
144 citations
1–8 of 35
1 publications · 10 citations
1
h-index
Conference · 1 publications · 10 citations
1
h-index
1 publications · 102 citations
1
h-index
JAIR · 1 publications · 258 citations
1
h-index
1 publications · 11 citations
1
h-index
1–5