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 : dsumathi.blogs...
Facebook Page : www.facebook.c...
Instagram : / dsumathiphd

[@prasanthkumar6393]

Your videos are very helpful mam
Day after tomorrow we have ai exam
Your channel is life saviour for ai subject.

[@WinningCSE]

All the best

[@heybuddy_JAI_SHREE_RAM]

Best videos for AI

[@WinningCSE]

Thank you

[@udaykiranrh]

Mam for in greedy best first search you took total of h(n) values as path cost ,in this you took original path cost,is it like that only??

[@WinningCSE]

To search the goal state, initially we take some assumed cost h(n), I.e. cost from current state to goal state, after exploring we calculated the original cost g(n), I.e. initial state to current state.
Hence h(n) is not original path cost but used to find next state to explore.

[@udaykiranrh]

@@WinningCSE Thank you Mam.

[@udaykiranrh]

@@WinningCSEMam should we take Sum of Heuristic values for Greedy Best First search problems?

[@WinningCSE]

@@udaykiranrh welcome

[@asikhossain7191]

this realy helpfull

[@WinningCSE]

Thank you Asik Hossain

[@aaronelectronik4762]

Thank you for this great video.
But could you explain aigin how do you find the red values between different nodes?? for example 75 between A and B, 140 between A and E und 118 between A and C
Thank you in advance

[@WinningCSE]

Great suggestion!

[@aaronelectronik4762]

@@WinningCSE may you explain it here in the commentar please??

[@SadafIndi]

🫶👍

[@WinningCSE]

Thank you

[@mkalyan2698]

good explanation madam thank you madam. gv me u r mail id madam

[@WinningCSE]

Thank you Mr. Kalyan. Are you a staff or student

[@mkalyan2698]

@@WinningCSE Mtech student madam from NIT silchar

[@WinningCSE]

@@mkalyan2698 that's great. My mailid is [e-mail]

[@hemajoshi7438]

Your videos are very helpful for making notes thanks a tons mam ❤🫶

[@WinningCSE]

Thanks for your comments, keep watching, all the best.