Recently MeroSpark is lunched with more features and services, now you can ask your question, sell your books, share your notes and many more. Visit now and create your account to take full advantage of MeroSpark.

A* Search : A Better Best-First Strategy | Cognitive Science

Download our Android App from Google Play Store and start reading Reference Notes Offline.

A* SearchA* 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)
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 : Digvijay | Comment RSS | Category : Fourth Semester
Tag :

Post a Comment

Your email is never published nor shared. Required fields are marked *


Wordpress DMCA
Community | Toolbar | Android App | Founder/Developer : Hari Prasad Chaudhary | CSIT Portal Manager : Digvijay Chaudhary