Comparative Study of RBFS & ARBFS Algorithm

Journal Title: IOSR Journals (IOSR Journal of Computer Engineering) - Year 2013, Vol 10, Issue 5

Abstract

 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.

Authors and Affiliations

Disha Sharma

Keywords

Related Articles

 Genetic Approach to Parallel Scheduling

 Task Scheduling is Essential part for proper functioning of parallel processing system. Several approaches have been applied to solve this problem. Genetic algorithms have received much awareness as they are ro...

 A Novel Methodology of Fuzzy Logic Controller for ADynamically Interconnected Electric Power System

 Abstract: This paper presents a novel methodology for designing a fuzzy controller for a dynamicallyinterconnected electric power system. One controller with constant gains for different operating points may notbe...

Video Segmentation Using Global Motion Estimation and Compensation

Abstract : Video has to be segmented into objects for content-based processing. A number of video object segmentation algorithms have been proposed such as semiautomatic and automatic. Semiautomatic methods adds burden t...

 Energy Optimization in Wireless Sensor Network Using Sleep Mode Transceiver

 Energy efficiency is a central challenge in sensor networks, and the radio is a major contributor to overall energy node consumption. These Wireless Sensor Networks have severe resource constrains and energy cons...

 Multi-Resolution Pruning Based Co-Location Identification In Spatial Data

A co-location spatial pattern is a pattern of multiple groups which co-relates spatial features or events that are frequently located in same zone. Co-location pattern mining emphasizes overall analysis bymanipulating th...

Download PDF file
  • EP ID EP161866
  • DOI -
  • Views 102
  • Downloads 0

How To Cite

Disha Sharma (2013).  Comparative Study of RBFS & ARBFS Algorithm. IOSR Journals (IOSR Journal of Computer Engineering), 10(5), 105-110. https://europub.co.uk/articles/-A-161866