For all my future people, if you struggle with A* Algorithm : It is an extension of Djikstra Algorithm and the nodes are expanded according to their combined sum function which is their hueristic function(consider it to be the straight flight distance from a to b or the net displacement) and the real cost of that path. The algorithm works in the same way as Djikstra but here in the expansion, both costs are used as a sum. For more clarity : th-cam.com/video/ySN5Wnu88nE/w-d-xo.html And best of luck for your exams/projects!
For A* search algorithm at the end of the lecture, based on the heuristic she added E before C to the fringe giving a path of [A,B,E,C,F,G,H]=55 but based on her answer she added the path [A,B,C,F,G,H]=39 which is not consistent with the function f(n)=g(n)+h(n).... I feel cheated by her.
Late, but h(n) is the huerestic function which is the underestimate, it is actually the displacement from node n to goal node. h*(n) is the actual cheapest distance path that the algortihm can take.
For all my future people, if you struggle with A* Algorithm : It is an extension of Djikstra Algorithm and the nodes are expanded according to their combined sum function which is their hueristic function(consider it to be the straight flight distance from a to b or the net displacement) and the real cost of that path. The algorithm works in the same way as Djikstra but here in the expansion, both costs are used as a sum.
For more clarity : th-cam.com/video/ySN5Wnu88nE/w-d-xo.html
And best of luck for your exams/projects!
Great slides and lecture.
How is she calculating the values of h(n) for the nodes? 58:00
what is the difference between best fit and uniform search
:) thanks for all DRs
For A* search algorithm at the end of the lecture, based on the heuristic she added E before C to the fringe giving a path of [A,B,E,C,F,G,H]=55 but based on her answer she added the path [A,B,C,F,G,H]=39 which is not consistent with the function f(n)=g(n)+h(n).... I feel cheated by her.
Great
what in the hell is underestimate and what is h(n) and h*(n)
Late, but h(n) is the huerestic function which is the underestimate, it is actually the displacement from node n to goal node. h*(n) is the actual cheapest distance path that the algortihm can take.
She is just reading from the presentation... how is this "teaching" ? :|
did you watch the lecture? she does more than that. very informative
@Peanut0891 is insane :P
Well she made the presentation by herself, the points in the presentation are not copied from books or somewhere else.
just reading the slides :( rest of the lectures were good but this 1 was not good