A* Search : A Better Best-First Strategy | Cognitive Science A* Search : A Better Best-First Strategy Fourth Semester | Second Year | Tribhuvan University (TU) Subject: Cognitive Science | BSc.CSIT

A* Search: A better best-first strategy
–> combines the two by minimizing f(n) = g(n) + h(n);
–> is informed and, under reasonable assumptions, optimal and complete.

Idea: avoid expanding paths that are already expensive.

It finds a minimal cost-path joining the start node and a goal node for node n.

Evaluation function: f(n) = g(n) + h(n)
Where,
g(n) = cost so far to reach n from root
h(n) = estimated cost to goal from n
f(n) = estimated total cost of path through n to goal

For example: Given following graph of cities, starting at Arad city, problem is to reach to the Bucharest. Solution using A* search can be as below:  (Visited 260 times, 1 visits today)

Posted By : | Comment RSS | Category : Fourth Semester
Community | Toolbar | Android App | Founder/Developer : Hari Prasad Chaudhary | CSIT Portal Manager : Digvijay Chaudhary