1 shanghai jiao tong university informed search and exploration
TRANSCRIPT
![Page 1: 1 Shanghai Jiao Tong University Informed Search and Exploration](https://reader036.vdocuments.mx/reader036/viewer/2022070410/56649ef65503460f94c099f1/html5/thumbnails/1.jpg)
1
Shanghai Jiao Tong UniversityShanghai Jiao Tong University
Informed Search and Informed Search and ExplorationExploration
![Page 2: 1 Shanghai Jiao Tong University Informed Search and Exploration](https://reader036.vdocuments.mx/reader036/viewer/2022070410/56649ef65503460f94c099f1/html5/thumbnails/2.jpg)
2
OutlineOutline
• Best-first search• Greedy best-first search• A* search• Heuristics• Local search algorithms• Hill-climbing search• Simulated annealing search• Local beam search• Genetic algorithms
![Page 3: 1 Shanghai Jiao Tong University Informed Search and Exploration](https://reader036.vdocuments.mx/reader036/viewer/2022070410/56649ef65503460f94c099f1/html5/thumbnails/3.jpg)
3
Review: Tree searchReview: Tree search
• \input{\file{algorithms}{tree-search-short-algorithm}}
• A search strategy is defined by picking the order of node expansion
•
•
![Page 4: 1 Shanghai Jiao Tong University Informed Search and Exploration](https://reader036.vdocuments.mx/reader036/viewer/2022070410/56649ef65503460f94c099f1/html5/thumbnails/4.jpg)
4
Best-first searchBest-first search• Idea: use an evaluation function f(n) for each node
– estimate of "desirability"Expand most desirable unexpanded node
• Implementation:Order the nodes in fringe in decreasing order of desirability
• Special cases:– greedy best-first search– A* search
–
•–
–
![Page 5: 1 Shanghai Jiao Tong University Informed Search and Exploration](https://reader036.vdocuments.mx/reader036/viewer/2022070410/56649ef65503460f94c099f1/html5/thumbnails/5.jpg)
5
Romania with step costs in kmRomania with step costs in km
![Page 6: 1 Shanghai Jiao Tong University Informed Search and Exploration](https://reader036.vdocuments.mx/reader036/viewer/2022070410/56649ef65503460f94c099f1/html5/thumbnails/6.jpg)
6
Greedy best-first searchGreedy best-first search• Evaluation function
f(n) = h(n) (heuristic)
= estimate of cost from n to goal• Greedy best-first search expands the node that appears
to be closest to goal
e.g., hSLD(n) = straight-line distance from n to Bucharest
![Page 7: 1 Shanghai Jiao Tong University Informed Search and Exploration](https://reader036.vdocuments.mx/reader036/viewer/2022070410/56649ef65503460f94c099f1/html5/thumbnails/7.jpg)
7
Properties of greedy best-first searchProperties of greedy best-first search
• Complete? No – can get stuck in loops, e.g., Iasi Neamt Iasi Neamt
• Time? O(bm), but a good heuristic can give dramatic improvement
• Space? O(bm) -- keeps all nodes in memory• Optimal? No
•
•
•
•
![Page 8: 1 Shanghai Jiao Tong University Informed Search and Exploration](https://reader036.vdocuments.mx/reader036/viewer/2022070410/56649ef65503460f94c099f1/html5/thumbnails/8.jpg)
8
AA** search search• Idea: avoid expanding paths that are expensive
• Evaluation function f(n) = g(n) + h(n)
• g(n) = cost so far to reach n• h(n) = estimated cost from n to goal• f(n) = estimated total cost of path through n to goal
![Page 9: 1 Shanghai Jiao Tong University Informed Search and Exploration](https://reader036.vdocuments.mx/reader036/viewer/2022070410/56649ef65503460f94c099f1/html5/thumbnails/9.jpg)
9
AA** search example search example
![Page 10: 1 Shanghai Jiao Tong University Informed Search and Exploration](https://reader036.vdocuments.mx/reader036/viewer/2022070410/56649ef65503460f94c099f1/html5/thumbnails/10.jpg)
10
Admissible heuristicsAdmissible heuristics• A 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 11: 1 Shanghai Jiao Tong University Informed Search and Exploration](https://reader036.vdocuments.mx/reader036/viewer/2022070410/56649ef65503460f94c099f1/html5/thumbnails/11.jpg)
11
Optimality of AOptimality of A** (proof) (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 12: 1 Shanghai Jiao Tong University Informed Search and Exploration](https://reader036.vdocuments.mx/reader036/viewer/2022070410/56649ef65503460f94c099f1/html5/thumbnails/12.jpg)
12
Optimality of AOptimality of A** (proof) (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 13: 1 Shanghai Jiao Tong University Informed Search and Exploration](https://reader036.vdocuments.mx/reader036/viewer/2022070410/56649ef65503460f94c099f1/html5/thumbnails/13.jpg)
13
Consistent HeuristicsConsistent Heuristics• A heuristic is consistent if for every node n, every successor n' of
n generated by any action a, then
h(n) ≤ c(n,a,n') + h(n')• If 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)
• Theorem: If h(n) is consistent, A* using GRAPH-SEARCH is optimal
i.e., f(n) is non-decreasing along any path.•
![Page 14: 1 Shanghai Jiao Tong University Informed Search and Exploration](https://reader036.vdocuments.mx/reader036/viewer/2022070410/56649ef65503460f94c099f1/html5/thumbnails/14.jpg)
14
Optimality of AOptimality 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 15: 1 Shanghai Jiao Tong University Informed Search and Exploration](https://reader036.vdocuments.mx/reader036/viewer/2022070410/56649ef65503460f94c099f1/html5/thumbnails/15.jpg)
15
Properties of A*Properties of A*
• Complete? Yes (unless there are infinitely many nodes with f ≤ f(G) )
• Time? Exponential
• Space? Keeps all nodes in memory
• Optimal? Yes
![Page 16: 1 Shanghai Jiao Tong University Informed Search and Exploration](https://reader036.vdocuments.mx/reader036/viewer/2022070410/56649ef65503460f94c099f1/html5/thumbnails/16.jpg)
16
Heuristic FunctionHeuristic FunctionAdmissible heuristicsAdmissible heuristics
E.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 17: 1 Shanghai Jiao Tong University Informed Search and Exploration](https://reader036.vdocuments.mx/reader036/viewer/2022070410/56649ef65503460f94c099f1/html5/thumbnails/17.jpg)
17
Admissible heuristicsAdmissible 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) = ? 8• h2(S) = ? 3+1+2+2+2+3+3+2 = 18
•
•
![Page 18: 1 Shanghai Jiao Tong University Informed Search and Exploration](https://reader036.vdocuments.mx/reader036/viewer/2022070410/56649ef65503460f94c099f1/html5/thumbnails/18.jpg)
18
DominanceDominance• If h2(n) ≥ h1(n) for all n (both admissible)• then h2 dominates h1
====== 》 》 hh22 is better for searchis better for search
• Typical search costs (average number of nodes expanded):
• d=12 IDS = 3,644,035 nodes (ITERATIVE-DEEPENING-SEARCH) A*(h1) = 227 nodes A*(h2) = 73 nodes
• d=24 IDS = too many nodes A*(h1) = 39,135 nodes A*(h2) = 1,641 nodes
![Page 19: 1 Shanghai Jiao Tong University Informed Search and Exploration](https://reader036.vdocuments.mx/reader036/viewer/2022070410/56649ef65503460f94c099f1/html5/thumbnails/19.jpg)
19
Relaxed ProblemsRelaxed Problems• A problem with fewer restrictions on the actions is called a
relaxed problem
• The 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 20: 1 Shanghai Jiao Tong University Informed Search and Exploration](https://reader036.vdocuments.mx/reader036/viewer/2022070410/56649ef65503460f94c099f1/html5/thumbnails/20.jpg)
20
Solution cost of a subproblemSolution cost of a subproblem
![Page 21: 1 Shanghai Jiao Tong University Informed Search and Exploration](https://reader036.vdocuments.mx/reader036/viewer/2022070410/56649ef65503460f94c099f1/html5/thumbnails/21.jpg)
21
Local search algorithmsLocal 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" configurations• Find configuration satisfying constraints, e.g., n-queens
• In such cases, we can use local search algorithms• keep a single "current" state, try to improve it
![Page 22: 1 Shanghai Jiao Tong University Informed Search and Exploration](https://reader036.vdocuments.mx/reader036/viewer/2022070410/56649ef65503460f94c099f1/html5/thumbnails/22.jpg)
22
Example: Example: nn-queens-queens
• Put n queens on an n × n board with no two queens on the same row, column, or diagonal
•
![Page 23: 1 Shanghai Jiao Tong University Informed Search and Exploration](https://reader036.vdocuments.mx/reader036/viewer/2022070410/56649ef65503460f94c099f1/html5/thumbnails/23.jpg)
23
Hill-climbing searchHill-climbing search
• "Like climbing Everest in thick fog with amnesia"
![Page 24: 1 Shanghai Jiao Tong University Informed Search and Exploration](https://reader036.vdocuments.mx/reader036/viewer/2022070410/56649ef65503460f94c099f1/html5/thumbnails/24.jpg)
24
Hill-climbing searchHill-climbing search
• Problem: depending on initial state, can get stuck in local maxima
•
![Page 25: 1 Shanghai Jiao Tong University Informed Search and Exploration](https://reader036.vdocuments.mx/reader036/viewer/2022070410/56649ef65503460f94c099f1/html5/thumbnails/25.jpg)
25
Hill-climbing search: 8-queens problemHill-climbing search: 8-queens problem
• hh = number of pairs of queens that are attacking each other, either directly or = number of pairs of queens that are attacking each other, either directly or indirectly indirectly
• h = 17h = 17 for the above state for the above state
![Page 26: 1 Shanghai Jiao Tong University Informed Search and Exploration](https://reader036.vdocuments.mx/reader036/viewer/2022070410/56649ef65503460f94c099f1/html5/thumbnails/26.jpg)
26
Hill-climbing search: 8-queens problemHill-climbing search: 8-queens problem
• A local minimum with h = 1•
![Page 27: 1 Shanghai Jiao Tong University Informed Search and Exploration](https://reader036.vdocuments.mx/reader036/viewer/2022070410/56649ef65503460f94c099f1/html5/thumbnails/27.jpg)
27
Simulated annealing searchSimulated annealing search• Idea: escape local maxima by allowing some "bad"
moves but gradually decrease their frequency
![Page 28: 1 Shanghai Jiao Tong University Informed Search and Exploration](https://reader036.vdocuments.mx/reader036/viewer/2022070410/56649ef65503460f94c099f1/html5/thumbnails/28.jpg)
28
Properties of simulated Properties of simulated annealing searchannealing search
• One 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 29: 1 Shanghai Jiao Tong University Informed Search and Exploration](https://reader036.vdocuments.mx/reader036/viewer/2022070410/56649ef65503460f94c099f1/html5/thumbnails/29.jpg)
29
Local beam searchLocal beam search• Keep 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 30: 1 Shanghai Jiao Tong University Informed Search and Exploration](https://reader036.vdocuments.mx/reader036/viewer/2022070410/56649ef65503460f94c099f1/html5/thumbnails/30.jpg)
30
Genetic algorithmsGenetic algorithms• Genetic Algorithm
![Page 31: 1 Shanghai Jiao Tong University Informed Search and Exploration](https://reader036.vdocuments.mx/reader036/viewer/2022070410/56649ef65503460f94c099f1/html5/thumbnails/31.jpg)
31
Genetic algorithmsGenetic algorithms
![Page 32: 1 Shanghai Jiao Tong University Informed Search and Exploration](https://reader036.vdocuments.mx/reader036/viewer/2022070410/56649ef65503460f94c099f1/html5/thumbnails/32.jpg)
32
Local Search in Continuous SpacesLocal Search in Continuous Spaces
![Page 33: 1 Shanghai Jiao Tong University Informed Search and Exploration](https://reader036.vdocuments.mx/reader036/viewer/2022070410/56649ef65503460f94c099f1/html5/thumbnails/33.jpg)
33
First Project: 8-queens ProblemFirst Project: 8-queens Problem
• To formulate 8-queens problem into the search problem in a state space
• To define a heuristic function
• To implement A*A* Algorithm to find solutions
• To write a report on the simulation result.
![Page 34: 1 Shanghai Jiao Tong University Informed Search and Exploration](https://reader036.vdocuments.mx/reader036/viewer/2022070410/56649ef65503460f94c099f1/html5/thumbnails/34.jpg)
34
Questions?Questions?
• What further problems will we meet?– Constraints– Multi-agents– Uncertainty
![Page 35: 1 Shanghai Jiao Tong University Informed Search and Exploration](https://reader036.vdocuments.mx/reader036/viewer/2022070410/56649ef65503460f94c099f1/html5/thumbnails/35.jpg)
35
The Go Text Protocol(GTP)The Go Text Protocol(GTP)
• http://www.lysator.liu.se/~gunnar/gtp/
• http://sourceforge.net/projects/gogui/
![Page 36: 1 Shanghai Jiao Tong University Informed Search and Exploration](https://reader036.vdocuments.mx/reader036/viewer/2022070410/56649ef65503460f94c099f1/html5/thumbnails/36.jpg)
36
End of the TalkEnd of the Talk