Greedy Best First Search-Artificial Intelligence-Unit - 1 -Problem Solving -Informed Searching

Unit - 1 - Problem Solving
Informed Searching Strategies - Greedy Best First Search
Greedy best-first search algorithm always selects the path which appears best at that moment.
It is the combination of depth-first search and breadth-first search algorithms.
It uses the heuristic function and search.
With the help of best-first search, at each step, we can choose the most promising node.
In the best first search algorithm, we expand the node which is closest to the goal node and the minimum cost is estimated by heuristic function
The evaluation function is f(n) = h(n)
Were, h(n)= estimated cost from node n to the goal.
Greedy search ignores the cost of the path that has already been traversed to reach n
Therefore, the solution given is not necessarily optimal
Greedy best-first search can start down an infinite path and never return to try other possibilities, it is incomplete
Because of its greediness the search makes choices that can lead to a dead end; then one backs up in the search tree to the deepest unexpanded node
Greedy best-first search resembles depth-first search in the way it prefers to follow a single path all the way to the goal, but will back up when it hits a dead end
The quality of the heuristic function determines the practical usability of greedy search
Greedy search is not optimal
Greedy search is incomplete without systematic checking of repeated states.
In the worst case, the Time and Space Complexity of Greedy Search are both O( b m ),
Where
b is the branching factor and
m the maximum path length
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.blogspot.com/
Facebook Page : profile.php?...
Instagram : / dsumathiphd

[@karthikr5161]

shouldn't we include A's h(n) values why summing up at end?

[@rashidpathan6998]

you should have made tree first

[@Mexton-qs5td]

personally i have really enjoyed this class, u made it so easy for me to understand,thank you

[@WinningCSE]

You're very welcome!

[@balachandar375]

how to find the cost between start A to B,C,E,asking about the values 118,140,75 how did it came??

[@franky_sagan]

That was already given in the question itself. It is basically cost between each node. If you calculate that you will get the total cost and if you calculate the heuristic value you will get the total distance so we are finding the optimal solution with help of either characteristic value or cost value. Anyhow, this algorithm is not optimal and it is prone to getting struck.

[@Lee-uw6lr]

Why will GBFS back up if it meets a dead end? Then how will GBFS get stuck in a loop then? I hope you can answer my question

[@Jai1M]

bro it will back up only when we use Depth first search (DFS) in greedy best first search.

[@ArtsphereQuote]

Very Nice

[@WinningCSE]

Thanks for sharing!!

[@melihekinci7758]

Thanks

[@WinningCSE]

You are welcome Melih Ekinci

[@bikashyadav1421]

thank u very much man u r the best

[@WinningCSE]

Thank you Nikash Yadav.

[@senthilkumarsadhasivam6984]

Good work, well explained, keep doing

[@WinningCSE]

Thank you, I will

[@WinningCSE]

Thanks, will do!

[@LectureofIslam-lb3iw]

I need this slide please send me

[@Neeharika_Sompalli_]

good but
better to explain the calculation of h(n)

[@WinningCSE]

Thank you

[@WinningCSE]

Sorry for that

[@5it.005]

thank yo

[@WinningCSE]

You are welcome, keep watching...

[@5it.005]

@@WinningCSE where can i find branch and bound lecture ☹

[@WinningCSE]

@@5it.005 Branch and bound. Ok

[@WinningCSE]

I will try to do this. Which university you are

[@5it.005]

@@WinningCSE first thank so much ☹❤❤ i rlly value it cuz i get ur explaining v well 💕

[@037edattabhavani4]

is best first search and greedy search is same or different?

[@WinningCSE]

Both are different

[@lutwetweshadrackduncan7384]

What happens if two nodes have the same heuristic value?

[@WinningCSE]

While implementing this, we found that it takes the first one.

[@lutwetweshadrackduncan7384]

@@WinningCSE How can I get in contact with you, I would like your assistance on some AI questions (Informed search and uninformed search).

[@khan7423]

Madam Is This Table Will Give In Exam Section??

[@WinningCSE]

If it is problem then surely they will give, otherwise if you asked to explain the topic with your own example, then you have to draw the table.

[@Mrk63222]

You make things complicated

[@WinningCSE]

Is it so

[@dhyanjoshi9638]

caste ki baat mat kr aunty

[@satheeshk6861]

Talk louder your voice is not audible

[@WinningCSE]

Ok next time

[@jtdatacomparisons]

you dont got volume button ?

[@rashidpathan6998]

worst example of the life

[@WinningCSE]

Thank you

[@rashidpathan6998]

i do not recommend you

[@WinningCSE]

Thank you 🙏