Problem Solving by Searching Search Methods : informed (Heuristic) search.
4 Informed Searching
-
Upload
shatria-kaniputra -
Category
Documents
-
view
214 -
download
1
Transcript of 4 Informed Searching
![Page 1: 4 Informed Searching](https://reader036.fdocuments.in/reader036/viewer/2022062905/577ccf321a28ab9e788f1ed4/html5/thumbnails/1.jpg)
Informed search algorithms
Chapter 4
Team Teaching AI (created by Dewi Liliana) PTIIK 2012
![Page 2: 4 Informed Searching](https://reader036.fdocuments.in/reader036/viewer/2022062905/577ccf321a28ab9e788f1ed4/html5/thumbnails/2.jpg)
OutlineBest-first searchGreedy best-first searchA* searchHeuristicsLocal search algorithmsHill-climbing searchSimulated annealing searchLocal beam searchGenetic algorithms
![Page 3: 4 Informed Searching](https://reader036.fdocuments.in/reader036/viewer/2022062905/577ccf321a28ab9e788f1ed4/html5/thumbnails/3.jpg)
Best-first search Idea: use an evaluation function f(n) for each node
estimate of "desirability"Expand most desirable unexpanded node
The principle is expand node in fringe with the lower f(n)
Why estimate? Because it is a search…. Implementation:
Order the nodes in fringe in decreasing order of desirabilityfringe is a priority queue, nodes are sorted by f(n)
Special cases:greedy best-first searchA* search
![Page 4: 4 Informed Searching](https://reader036.fdocuments.in/reader036/viewer/2022062905/577ccf321a28ab9e788f1ed4/html5/thumbnails/4.jpg)
![Page 5: 4 Informed Searching](https://reader036.fdocuments.in/reader036/viewer/2022062905/577ccf321a28ab9e788f1ed4/html5/thumbnails/5.jpg)
Greedy best-first searchPrinciple: expand node in a fringe with a
lowest f(n)Evaluation function f(n) = h(n) (heuristic)= estimate of cost from n to goale.g., hSLD(n) = straight-line distance from n
to BucharestGreedy best-first search expands the node
that appears to be closest to goal
![Page 6: 4 Informed Searching](https://reader036.fdocuments.in/reader036/viewer/2022062905/577ccf321a28ab9e788f1ed4/html5/thumbnails/6.jpg)
Romania with step costs in km
![Page 7: 4 Informed Searching](https://reader036.fdocuments.in/reader036/viewer/2022062905/577ccf321a28ab9e788f1ed4/html5/thumbnails/7.jpg)
Greedy best-first search example
![Page 8: 4 Informed Searching](https://reader036.fdocuments.in/reader036/viewer/2022062905/577ccf321a28ab9e788f1ed4/html5/thumbnails/8.jpg)
Greedy best-first search example
![Page 9: 4 Informed Searching](https://reader036.fdocuments.in/reader036/viewer/2022062905/577ccf321a28ab9e788f1ed4/html5/thumbnails/9.jpg)
Greedy best-first search example
![Page 10: 4 Informed Searching](https://reader036.fdocuments.in/reader036/viewer/2022062905/577ccf321a28ab9e788f1ed4/html5/thumbnails/10.jpg)
Greedy best-first search example
![Page 11: 4 Informed Searching](https://reader036.fdocuments.in/reader036/viewer/2022062905/577ccf321a28ab9e788f1ed4/html5/thumbnails/11.jpg)
Properties of greedy best-first searchComplete? No – can get stuck in loops, e.g.,
Iasi Neamt Iasi Neamt Time? O(bm), but a good heuristic can give
dramatic improvementSpace? O(bm) -- keeps all nodes in memoryOptimal? No
(expand the minimal path cost but cant be not optimal)
![Page 12: 4 Informed Searching](https://reader036.fdocuments.in/reader036/viewer/2022062905/577ccf321a28ab9e788f1ed4/html5/thumbnails/12.jpg)
A* searchIdea: avoid expanding paths that are
already expensiveEvaluation function f(n) = g(n) + h(n)g(n) = cost so far to reach nh(n) = estimated cost from n to goalf(n) = estimated total cost of path through
n to goal
![Page 13: 4 Informed Searching](https://reader036.fdocuments.in/reader036/viewer/2022062905/577ccf321a28ab9e788f1ed4/html5/thumbnails/13.jpg)
A* search example
![Page 14: 4 Informed Searching](https://reader036.fdocuments.in/reader036/viewer/2022062905/577ccf321a28ab9e788f1ed4/html5/thumbnails/14.jpg)
A* search example
![Page 15: 4 Informed Searching](https://reader036.fdocuments.in/reader036/viewer/2022062905/577ccf321a28ab9e788f1ed4/html5/thumbnails/15.jpg)
A* search example
![Page 16: 4 Informed Searching](https://reader036.fdocuments.in/reader036/viewer/2022062905/577ccf321a28ab9e788f1ed4/html5/thumbnails/16.jpg)
A* search example
![Page 17: 4 Informed Searching](https://reader036.fdocuments.in/reader036/viewer/2022062905/577ccf321a28ab9e788f1ed4/html5/thumbnails/17.jpg)
A* search example
![Page 18: 4 Informed Searching](https://reader036.fdocuments.in/reader036/viewer/2022062905/577ccf321a28ab9e788f1ed4/html5/thumbnails/18.jpg)
A* search example
![Page 19: 4 Informed Searching](https://reader036.fdocuments.in/reader036/viewer/2022062905/577ccf321a28ab9e788f1ed4/html5/thumbnails/19.jpg)
Admissible heuristicsA heuristic h(n) is admissible if for every node n,
h(n) ≤ h*(n), where h*(n) is the true cost to reach the goal state from n.
An admissible heuristic never overestimates the cost to reach the goal, i.e., it is optimistic
Example: hSLD(n) (never overestimates the actual road distance)
Theorem: If h(n) is admissible, A* using TREE-SEARCH is optimal
![Page 20: 4 Informed Searching](https://reader036.fdocuments.in/reader036/viewer/2022062905/577ccf321a28ab9e788f1ed4/html5/thumbnails/20.jpg)
Optimality of A* (proof) Suppose some suboptimal goal G2 has been generated and is in
the fringe. Let n be an unexpanded node in the fringe such that n is on a shortest path to an optimal goal G.
f(G2) = g(G2) since h(G2) = 0 g(G2) > g(G) since G2 is suboptimal f(G) = g(G) since h(G) = 0 f(G2) > f(G) from above
![Page 21: 4 Informed Searching](https://reader036.fdocuments.in/reader036/viewer/2022062905/577ccf321a28ab9e788f1ed4/html5/thumbnails/21.jpg)
Optimality of A* (proof) Suppose some suboptimal goal G2 has been generated and is in the
fringe. Let n be an unexpanded node in the fringe such that n is on a shortest path to an optimal goal G.
f(G2) > f(G) from above h(n) ≤ h*(n) since h is admissible g(n) + h(n) ≤ g(n) + h*(n) f(n) ≤ f(G)Hence f(G2) > f(n), and A* will never select G2 for expansion
![Page 22: 4 Informed Searching](https://reader036.fdocuments.in/reader036/viewer/2022062905/577ccf321a28ab9e788f1ed4/html5/thumbnails/22.jpg)
Consistent heuristics A heuristic is consistent if for every node n, every successor n' of n
generated by any action a,
h(n) ≤ c(n,a,n') + h(n')
f h is consistent, we have f(n') = g(n') + h(n') = g(n) + c(n,a,n') + h(n') ≥ g(n) + h(n) ≥ f(n) i.e., f(n) is non-decreasing along any path. (monotonic) Theorem: If h(n) is consistent, A* using GRAPH-SEARCH is optimal
![Page 23: 4 Informed Searching](https://reader036.fdocuments.in/reader036/viewer/2022062905/577ccf321a28ab9e788f1ed4/html5/thumbnails/23.jpg)
Optimality of A* A* expands nodes in order of increasing f value
Gradually adds "f-contours" of nodes Contour i has all nodes with f=fi, where fi < fi+1
![Page 24: 4 Informed Searching](https://reader036.fdocuments.in/reader036/viewer/2022062905/577ccf321a28ab9e788f1ed4/html5/thumbnails/24.jpg)
Properties of A*Complete? Yes (unless there are infinitely
many nodes with f ≤ f(G) )Time? ExponentialSpace? Keeps all nodes in memoryOptimal? Yes
![Page 25: 4 Informed Searching](https://reader036.fdocuments.in/reader036/viewer/2022062905/577ccf321a28ab9e788f1ed4/html5/thumbnails/25.jpg)
Admissible heuristicsE.g., for the 8-puzzle: h1(n) = number of misplaced tiles h2(n) = total Manhattan distance(i.e., no. of squares from desired location of each tile)
h1(S) = ? h2(S) = ?
![Page 26: 4 Informed Searching](https://reader036.fdocuments.in/reader036/viewer/2022062905/577ccf321a28ab9e788f1ed4/html5/thumbnails/26.jpg)
Admissible heuristicsE.g., for the 8-puzzle: h1(n) = number of misplaced tiles h2(n) = total Manhattan distance(i.e., no. of squares from desired location of each tile)
h1(S) = ? 8h2(S) = ? 3+1+2+2+2+3+3+2 = 18
![Page 27: 4 Informed Searching](https://reader036.fdocuments.in/reader036/viewer/2022062905/577ccf321a28ab9e788f1ed4/html5/thumbnails/27.jpg)
Dominance If h2(n) ≥ h1(n) for all n (both admissible) then h2 dominates h1 h2 is better for search
Typical search costs (average number of nodes expanded):
d=12 IDS = 3,644,035 nodesA*(h1) = 227 nodes A*(h2) = 73 nodes
d=24 IDS = too many nodesA*(h1) = 39,135 nodes A*(h2) = 1,641 nodes
![Page 28: 4 Informed Searching](https://reader036.fdocuments.in/reader036/viewer/2022062905/577ccf321a28ab9e788f1ed4/html5/thumbnails/28.jpg)
Relaxed problemsA problem with fewer restrictions on the actions is
called a relaxed problemThe cost of an optimal solution to a relaxed problem
is an admissible heuristic for the original problem If the rules of the 8-puzzle are relaxed so that a tile
can move anywhere, then h1(n) gives the shortest solution
If the rules are relaxed so that a tile can move to any adjacent square, then h2(n) gives the shortest solution
![Page 29: 4 Informed Searching](https://reader036.fdocuments.in/reader036/viewer/2022062905/577ccf321a28ab9e788f1ed4/html5/thumbnails/29.jpg)
Local search algorithms In many optimization problems, the path to the goal
is irrelevant; the goal state itself is the solution
State space = set of "complete" configurationsFind configuration satisfying constraints, e.g., n-
queens
In such cases, we can use local search algorithmskeep a single "current" state, try to improve it
![Page 30: 4 Informed Searching](https://reader036.fdocuments.in/reader036/viewer/2022062905/577ccf321a28ab9e788f1ed4/html5/thumbnails/30.jpg)
Example: n-queensPut n queens on an n × n board with no two
queens on the same row, column, or diagonal
![Page 31: 4 Informed Searching](https://reader036.fdocuments.in/reader036/viewer/2022062905/577ccf321a28ab9e788f1ed4/html5/thumbnails/31.jpg)
Hill-climbing search"Like climbing Everest in thick fog with
amnesia"
![Page 32: 4 Informed Searching](https://reader036.fdocuments.in/reader036/viewer/2022062905/577ccf321a28ab9e788f1ed4/html5/thumbnails/32.jpg)
Hill-climbing searchProblem: depending on initial state, can get
stuck in local maxima
![Page 33: 4 Informed Searching](https://reader036.fdocuments.in/reader036/viewer/2022062905/577ccf321a28ab9e788f1ed4/html5/thumbnails/33.jpg)
Hill-climbing search: 8-queens problem
h = number of pairs of queens that are attacking each other, either directly or indirectly
h = 17 for the above state
![Page 34: 4 Informed Searching](https://reader036.fdocuments.in/reader036/viewer/2022062905/577ccf321a28ab9e788f1ed4/html5/thumbnails/34.jpg)
Hill-climbing search: 8-queens problem
A local minimum with h = 1
![Page 35: 4 Informed Searching](https://reader036.fdocuments.in/reader036/viewer/2022062905/577ccf321a28ab9e788f1ed4/html5/thumbnails/35.jpg)
Simulated annealing search Idea: escape local maxima by allowing some "bad"
moves but gradually decrease their frequency
![Page 36: 4 Informed Searching](https://reader036.fdocuments.in/reader036/viewer/2022062905/577ccf321a28ab9e788f1ed4/html5/thumbnails/36.jpg)
Properties of simulated annealing searchOne can prove: If T decreases slowly enough, then
simulated annealing search will find a global optimum with probability approaching 1
Widely used in VLSI layout, airline scheduling, etc
![Page 37: 4 Informed Searching](https://reader036.fdocuments.in/reader036/viewer/2022062905/577ccf321a28ab9e788f1ed4/html5/thumbnails/37.jpg)
Local beam searchKeep track of k states rather than just one
Start with k randomly generated states
At each iteration, all the successors of all k states are generated
If any one is a goal state, stop; else select the k best successors from the complete list and repeat.
![Page 38: 4 Informed Searching](https://reader036.fdocuments.in/reader036/viewer/2022062905/577ccf321a28ab9e788f1ed4/html5/thumbnails/38.jpg)
Genetic algorithms A successor state is generated by combining two parent
states
Start with k randomly generated states (population)
A state is represented as a string over a finite alphabet (often a string of 0s and 1s)
Evaluation function (fitness function). Higher values for better states.
Produce the next generation of states by selection, crossover, and mutation
![Page 39: 4 Informed Searching](https://reader036.fdocuments.in/reader036/viewer/2022062905/577ccf321a28ab9e788f1ed4/html5/thumbnails/39.jpg)
Genetic algorithms
Fitness function: number of non-attacking pairs of queens (min = 0, max = 8 × 7/2 = 28)
24/(24+23+20+11) = 31%
23/(24+23+20+11) = 29% etc
![Page 40: 4 Informed Searching](https://reader036.fdocuments.in/reader036/viewer/2022062905/577ccf321a28ab9e788f1ed4/html5/thumbnails/40.jpg)
Genetic algorithms
![Page 41: 4 Informed Searching](https://reader036.fdocuments.in/reader036/viewer/2022062905/577ccf321a28ab9e788f1ed4/html5/thumbnails/41.jpg)
Ringkasan