Presentation is loading. Please wait.

Presentation is loading. Please wait.

Informed (Heuristic) Search Algorithms. Homework #1 assigned due 10/4 before Exam 1 2.

Similar presentations


Presentation on theme: "Informed (Heuristic) Search Algorithms. Homework #1 assigned due 10/4 before Exam 1 2."— Presentation transcript:

1 Informed (Heuristic) Search Algorithms

2 Homework #1 assigned due 10/4 before Exam 1 2

3 A B C D G Evaluating heuristic functions No:A (0+7) N1:B(.1+8.6)N2:G(9+0) N3:C(.2+8.7)N4:D(.3+25) No:A (0) N1:B( )N2:G(9+0) Is pink-h admissible? Is green-h admissible? nodeABCDG h1(n) h2(n)

4 or h2 is more informed than h1

5 5 UCS A* Uniform-cost and A*

6 h* h1 h4 h5 Admissibility/Informedness h2 h3 Max(h2,h3) Seach Nodes Heuristic Value

7 7

8 8

9 9

10 10

11 11

12 12

13 13 Not required for HW and exam purposes Consistency  admissibility Admissibility  consistency Consistency

14 14 UCS g(n) Greedy h(n) A* f(n) = g(n) + h(n)

15 15

16 16

17 17

18 18

19 19

20 IDA* Basicaly IDDFS, except instead of the iterations being defined in terms of depth, we define it in terms of f-value –Start with the f cutoff equal to the f-value of the root node –Loop Generate and search all nodes whose f-values are less than or equal to current cutoff. –Use depth-first search to search the trees in the individual iterations –Keep track of the node N’ which has the smallest f-value that is still larger than the current cutoff. Let this f-value be next- largest-f-value -- If the search finds a goal node, terminate. If not, set cutoff = next-largest-f-value and go back to Loop Properties: Linear memory. #Iterations in the worst case? = b d  (Happens when all nodes have distinct f-values.)

21 Who will give you admissible h(n)? 21

22 Relaxed problems Obtain heuristic from relaxed problems The more relaxed, the easier to compute heuristic, but the less accurate it is For 8-puzzle problem? Assume ability to move the tile directly to the place distance= # misplaced tiles Assume ability to move only one position at a time distance = Sum of Manhattan distances. A problem with fewer restrictions on the actions is called a relaxed problem.

23 23

24 24

25 Different levels of abstraction for shortest path problems on the plane I G I G “circular abstraction” I G “Polygonal abstraction” I G “disappearing-act abstraction” hDhD hChC hPhP h* The obstacles in the shortest path problem canbe abstracted in a variety of ways. --The more the abstraction, the cheaper it is to solve the problem in abstract space --The less the abstraction, the more “informed” the heuristic cost (i.e., the closer the abstract path length to actual path length) Actual Why are we inscribing the obstacles rather than circumscribing them?

26 hDhD hChC hPhP h*h* h0h0 Cost of computing the heuristic Cost of searching with the heuristic Total cost incurred in search Not always clear where the total minimum occurs Old wisdom was that the global min was closer to cheaper heuristics Current insights are that it may well be far from the cheaper heuristics for many problems How informed should the heuristic be? Reduced level of abstraction (i.e. more and more concrete)

27


Download ppt "Informed (Heuristic) Search Algorithms. Homework #1 assigned due 10/4 before Exam 1 2."

Similar presentations


Ads by Google