00:01
Hello students, astar algorithm is popularly and widely used as a search algorithm in ai and the computer science.
00:25
So, it's specially designed for finding the shortest path or the least cost path for the starting node to a goal node in a graph.
00:36
So, to find the shortest path.
00:48
So, as astar combines the benefit of two other searches, that is the jidastra's algorithm and greedy best search.
00:57
So, by using a here as a function to guide the search while ensuring the optimization of the solution as what is an astar algorithm in an ai.
01:10
So, the first question with it is what is an astar within ai.
01:14
So, astar algorithm is a search algorithm used to find the shortest path or the least cost path in a graph.
01:53
So, it is widely used in applications such as path finding in a video games, robotics and the routes planning in a map.
02:03
So, astar is taken in account both actual cost to reach the node from the start node and a heuristic estimation of the cost to reach the goal node, guiding the search towards the most promising path.
02:19
The second as the astar steps, it includes as first to initialize the open and close and add the start node to the point, then moving with it while to open the list is not empty.
02:33
If the node of f of x, we are using an f of x is equal to g of x plus h of x...