A, h=4 E, h=1 C, h=4 2 S, h=6 1 G, h=0 F, h=1 B, h=4 D, h=3.5 3. 3. 3.
Suppose we want to use UCS and the A*
Perform A*, UCS, and BFS on this graph.
Indicate the f, g, and h values of each node for the A*. e.g., S = 0 + 6 = 6 (i.e. S = g(S) + h(S) = f(S)). Additionally, show how the priority queue changes with time.
Show the order in which the nodes are visited for BFS and UCS.
Show the path found by the A*, UCS, and BFS algorithms on the graph above.
Make this example inadmissible by changing the heuristic value at one of the nodes. What node do you choose and what heuristic value do you assign? What would be the A* algorithm solution then.
Trending now
This is a popular solution!
Step by step
Solved in 4 steps
