Monday, 12 September 2016

Heuristic Search in Artificial Intelligence

Heuristic Search :- In the previous algorithm which are totally rude in nature because they do not have any domain specific knowledge.
Brute force search is commonly used to search procedure which explore all the alternatives during search process. They do not have any domain specific knowledge, All they need are the initial, final states and a set of legal operators. Heuristic search approximation used to minimize the searching process. Generally two categories of problems use heuristic.

  1. Problem for which no exact algorithm are known and one needs to find an approximation and satisfaction solution.                                                                                                                       Example :- speech recognation, pattern recognation, natural language undestanding, computer vision.
  2. Problem for which exact solution are known but computational inflexible                                    Example :- chess, rubix cube

No comments:

Post a Comment