A* Searching Algorithm-Artificial Intelligence-15A05606-Unit-1-Problem Solving-Informed Searching

Unit – 1 – Problem Solving
Informed Searching Strategies -A* Search
Greedy Best First Search minimizes a heuristic h(n) which is an estimated cost from a current state n to the goal state.
Greedy Best First Search is efficient but it is not optimal and not complete.
Uniform Cost Search minimizes the cost g(n) from the initial state to current state n.
Uniform Cost Search is optimal and complete but not efficient.
A* Search: Combine Greedy Best First Search and Uniform Cost Search to get an efficient algorithm which is complete and optimal.

A* search evaluates nodes by combining g(n), the cost to reach the node and h(n), the cost to get from the node to the goal.
f(n) = g(n) + h(n)
f(n) is the evaluation function which gives the cheapest solution cost
g(n) is the exact cost to reach node n from the initial state.
h(n) is an estimation of the assumed cost from current state (n) to reach the goal.

A* with f() not Admissible when h() overestimates the cost to reach the goal state

Subscribe this channel, comment and share with your friends.
For Syllabus, Text Books, Materials and Previous University Question Papers and important questions
Follow me on
Blog : https://dsumathi.blogspot.com/
Facebook Page : https://www.facebook.com/profile.php?...
Instagram :   / dsumathiphd