Anytime versus Real-Time Heuristic Search for On-Line Planning

Running head: Heuristic Search
Anytime versus Real-Time Heuristic Search for On-Line Planning
Name of Student
Name of the University
Author notes

HEURISTIC SEARCH1
Table of Contents
Introduction................................................................................................................................2
Discussion and findings.............................................................................................................2
Conclusion..................................................................................................................................5
Reference....................................................................................................................................7

HEURISTIC SEARCH2
Cserna, B., Bogochow, M., Chambers, S., Tremblay, M., Katt, S. and Ruml,
W., 2016, June. Anytime versus real-time heuristic search for on-line
planning. In Ninth annual symposium on combinatorial search.
Introduction
In order to get idea about the most suitable measure for designing and collecting
effective feedback in the early stage of the design process, heuristic search is the best possible
way. The concept of Heuristic search can be explained by one efficient searching strategy
that tries to optimize the issue or problem by improving the particular solution iteratively
depending on the given cost measure or a heuristic function [1]. However, the main concept of
Heuristic Search falls into two categories: anytime and real time. The Real-time heuristic
search approach allow to have fine-grained control regarding how much planning is
necessary between the plan executions. Meanwhile, the anytime heuristic search allows to
have a flexible trade-off between the solution quality and the search time[2]. This report is
going to critically review the above mention article and explain the additional facts related to
both the Heuristic Search approaches.
Discussion and findings
As mentioned in the article several AI systems, for example robots, need to be plan
under the time constraints. Moreover, the anytime search method is the most popular search
approach in this case as the algorithm prepared here helps to find the suboptimal plan
quickly, and as the time passes, the algorithm, till the most appropriate plan is captured [3].
The author has discussed about the real time search approach as well. Providing a brief idea,
the author explained that, the real-time search methods handovers hard real-time bounds on