Comparative Study of RBFS & ARBFS Algorithm
Disha Sharma Disha Sharma · IOSR Journal of Computer Engineering · 2013
RBFS is a best-first search that runs in space that is linear with respect to the maximum search depth, regardless of the cost function used.This algorithm allows the use of all available memory.One major flaw of this algorithm is that it can visit the same node several times.This makes the computational cost may be unaffordable for some accuracy.This problem can be much solved by using various extension of Heuristic Search.By using anytime approach in our simple RBFS will improve solution by saving the current solution & continues the search.Anytime RBFS algorithm will optimize the memory & time resources and are considered best for RBFS algorithm.When the time available to solve a search problem is limited or uncertain, this creates an anytime heuristic search algorithm that allows a flexible substitution between search time and solution quality.Some applications like Real Time Strategy (RTS) games have applied these algorithms to find a fast solution that will help the algorithm prune some paths during the subsequent computation.