- Exercise 1 Exercise 2 S H 7 2 A H 4 Bh 5 C Admissible Monotone Admissible Monotone G H 1 H A 4 H C 1 H G 0 1 (25.59 KiB) Viewed 49 times
- Exercise 1 Exercise 2 S H 7 2 A H 4 Bh 5 C Admissible Monotone Admissible Monotone G H 1 H A 4 H C 1 H G 0 2 (82.94 KiB) Viewed 49 times
- Exercise 1 Exercise 2 S H 7 2 A H 4 Bh 5 C Admissible Monotone Admissible Monotone G H 1 H A 4 H C 1 H G 0 3 (34.95 KiB) Viewed 49 times
Exercise 1 Exercise 2 S h=7 2 A h=4 Bh-5 C Admissible? Monotone? Admissible? Monotone? G h=1 H(A) = 4 H(C) = 1 H(G) = 0 h=0 G
3. Consider the search graph drawn below. The initial state is "A", and goal states are represented by double circles. Values on the arcs represent the actual cost, whereas the values side the states represent the heuristic function's value). For each of the search strategies listed below, list, in order, the states expanded until a goal state is reached (if any) AND the path found only. Assume that the successor function returns a state's successors in the alphabetic order. 11 F 20 9 B 99 M Ţ G 17 18 ↓ U 56 1. Uniform Cost Search 2. Greedy Search 3. A* 2 11 V ļ A 21 1 15 i D 20 8 J 76 X 38 3 28 n y R Y Key The estimated cost (h') from this node to the nearest goal node is x. The actual cost of traversing this are is y. 12 7
1. Assume that the values on the arcs represent the real cost and the values next to the vertices are the heuristic function's values. Is the heuristic function admissible? 18 B 12 A 10 5 13 C E 6 6 6 1 6 6 D F 4 6 H G 3 0