Heurstic Search: A* algorithm

b) State the route that you would take and cost of that route

c) Compare the cost of the function in A* search against that of the Uniform Cost Search and Greedy Search

d) What does admissible heuristic mean

e) Is heuristic used above admissible?

1. Heuristic Search Consider the following map (not drawn to scale). 139 159/ 178 178 A 162 130 Use the A* algorithm to find a route from A to M in the map. In the cost function: G(n) = cost of path from A to n based on the distance between towns (shown on map). H(n) = Straight Line Distance between n and M, shown in the table below. Straight Line Distance to M A 223 B 222 C 166 D 192 E 165 F136 G 122 J60 MO H 111 K 32 I 100 L 102 (a) Provide the search tree for your solution, showing the order in which the nodes were expanded and the cost at each node. You should not re-visit the town that you just came from