Search Summary Search Summary Some material from: D Lin, J You, JC - - PowerPoint PPT Presentation
RN, Chapter 25 Search Summary Search Summary Some material from: D Lin, J You, JC Latombe 1 Search Summary # 1 Problem Solving as Search Blind Search Techniques Breadth-first (uniform cost) Depth-first Iterative
1
Some material from: D Lin, J You, JC Latombe
2
Problem Solving as Search Blind Search Techniques
Breadth-first (uniform cost) Depth-first “Iterative Deepening” Bi-Directional Time/ Space Complexity:
3
Heuristic Search Techniques
Best-First A* : provably optimal!
Heuristic Functions
4
Constraint Satisfaction Problems
Intro CSP (Def’n, Types, Examples) Complexity Tricks for “Grow” approach
(arc) consistency + probagation Backward checking (DFS) Forward Checking Variable / Value ordering
Constraint Optimization Problems
5
Iterative Algorithms
Framework, Examples Hill-climbing / Gradient Descent Problem / Issues GSAT, WalkSat Other approaches
Simulated Annealing, Tabu, Random Restarts,
6
Adversary Saerch / Game Playing
Minimax
Alpha-beta Pruning
7
wrt Search
Iterative BROADENING Memory Bounded Search – SMA* Beam Search Island Hopping – abstraction …
wrt CSPs
Backjump Dynamic Orderings Special cases (eg, when arc-consistency is
8
Many applications of search:
Good news:
QUALITATIVE DIFFERENCE from only a few