1 / 23

Problem Solving by Searching Search Methods : informed (Heuristic) search

Problem Solving by Searching Search Methods : informed (Heuristic) search. Traditional informed search strategies. Greedy Best first search “Always chooses the successor node with the best f value” where f(n) = h(n)

mandel
Download Presentation

Problem Solving by Searching Search Methods : informed (Heuristic) search

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Problem Solving by SearchingSearch Methods : informed (Heuristic) search

  2. Traditional informed search strategies • Greedy Best first search • “Always chooses the successor node with the best f value” where f(n) = h(n) • We choose the one that is nearest to the final state among all possible choices • A* search • Best first search using an “admissible” heuristic function f that takes into account the current cost g • Always returns the optimal solution path

  3. Informed Search Strategies Best First Search

  4. Informed Search Strategies Greedy Search eval-fn: f(n) = h(n)

  5. G A B D C E F I H Greedy Search Start 75 118 140 111 80 99 97 211 101 f(n) = h (n) = straight-line distance heuristic Goal

  6. G A B D C E F I H Greedy Search Start 75 118 140 111 80 99 97 211 101 f(n) = h (n) = straight-line distance heuristic Goal

  7. G A B D C E F I H Greedy Search Start 75 118 140 111 80 99 97 211 101 f(n) = h (n) = straight-line distance heuristic Goal

  8. G A B D C E F I H Greedy Search Start 75 118 140 111 80 99 97 211 101 f(n) = h (n) = straight-line distance heuristic Goal

  9. G A B D C E F I H Greedy Search Start 75 118 140 111 80 99 97 211 101 f(n) = h (n) = straight-line distance heuristic Goal

  10. G A B D C E F I H Greedy Search Start 75 118 140 111 80 99 97 211 101 f(n) = h (n) = straight-line distance heuristic Goal

  11. G A B D C E F I H Greedy Search Start 75 118 140 111 80 99 97 211 101 f(n) = h (n) = straight-line distance heuristic Goal

  12. G A B D C E F I H Greedy Search Start 75 118 140 111 80 99 97 211 101 f(n) = h (n) = straight-line distance heuristic Goal

  13. G A B D C E F I H Greedy Search Start 75 118 140 111 80 99 97 211 101 f(n) = h (n) = straight-line distance heuristic Goal

  14. H A B D C E F I G Greedy Search dist(A-E-F-I) = 140 + 99 + 211 = 450 Start 75 118 140 111 80 99 97 211 101 f(n) = h (n) = straight-line distance heuristic Goal

  15. A B C E F I E A G Greedy Search: Tree Search Start 75 118 [374] [329] 140 [253] 99 80 [193] [178] [366] 211 [0] [253] Goal Path cost(A-E-F-I) = 253 + 178 + 0 = 431 dist(A-E-F-I) = 140 + 99 + 211 = 450

  16. G A B D C E F I H Greedy Search: Optimal ? Start 75 118 140 111 80 99 97 211 101 f(n) = h (n) = straight-line distance heuristic dist(A-E-G-H-I) =140+80+97+101=418 Goal

  17. G A B D C E F I H Greedy Search: Complete ? Start 75 118 140 111 80 99 97 211 101 f(n) = h (n) = straight-line distance heuristic Goal

  18. G A B D C E F I H Greedy Search: Time and Space Complexity ? Start 75 • Greedy search is not optimal. • Greedy search is incomplete without systematic checking of repeated states. • In the worst case, the Time and Space Complexity of Greedy Search are both O(bm) • Where b is the branching factor and m the maximum path length 118 140 111 80 99 97 211 101 Goal

  19. Informed Search Strategies A* Search eval-fn: f(n)=g(n)+h(n)

  20. A* (A Star) • Greedy Search minimizes a heuristic h(n) which is an estimated cost from a node n to the goal state. However, although greedy search can considerably cut the search time (efficient), it is neither optimal nor complete. • Uniform Cost Search minimizes the cost g(n) from the initial state to n. UCS is optimal and complete but not efficient. • New Strategy: Combine Greedy Search and UCS to get an efficient algorithm which is complete and optimal.

  21. A* (A Star) • A* uses a heuristic function which combines g(n) and h(n): f(n) = g(n) + h(n) • g(n) is the exact cost to reach node n from the initial state. Cost so far up to node n. • h(n) is an estimation of the remaining cost to reach the goal.

  22. n A* (A Star) g(n) f(n) = g(n)+h(n) h(n)

  23. Start I A B D C E F H G 75 118 140 111 80 99 97 211 101 Goal A* Search f(n) = g(n) + h (n) g(n): is the exact cost to reach node n from the initial state.

More Related