Presentation on theme: "Blind Search Russell and Norvig: Chapter 3, Sections 3.4 – 3.6 Slides adapted from: robotics.stanford.edu/~latombe/cs121/2003/home.htm by Prof. Jean-Claude."— Presentation transcript:
Blind Search Russell and Norvig: Chapter 3, Sections 3.4 – 3.6 Slides adapted from: robotics.stanford.edu/~latombe/cs121/2003/home.htm by Prof. Jean-Claude Latombe
Blind Search Depth first search Breadth first search Iterative deepening No matter where the goal is, these algorithms will do the same thing.
Performance Measures of Search Algorithms Completeness Is the algorithm guaranteed to find a solution when there is one? Optimality Is this solution optimal? Time complexity How long does it take? Space complexity How much memory does it require?
Important Parameters Maximum number of successors of any state branching factor b of the search tree Minimal length of a path in the state space between the initial and a goal state depth d of the shallowest goal node in the search tree
Evaluation of Breadth-first Search b: branching factor d: depth of shallowest goal node Complete Optimal if step cost is 1 Number of nodes generated: 1 + b + b 2 + … + b d = (b d+1 -1)/(b-1) = O(b d ) Time and space complexity is O(b d )
Big O Notation g(n) is in O(f(n)) if there exist two positive constants a and N such that: for all n > N, g(n) a f(n)
Evaluation of Depth-first Search b: branching factor d: depth of shallowest goal node m: maximal depth of a leaf node Complete only for finite search tree Not optimal Number of nodes generated: 1 + b + b 2 + … + b m = O(b m ) Time complexity is O(b m ) Space complexity is O(bm) or O(m)
Depth-Limited Strategy Depth-first with depth cutoff k (maximal depth below which nodes are not expanded) Three possible outcomes: Solution Failure (no solution) Cutoff (no solution within cutoff)
Iterative Deepening Strategy Repeat for k = 0, 1, 2, …: Perform depth-first with depth cutoff k Complete Optimal if step cost =1 Space complexity is: O(bd) or O(d) Time complexity is: (d+1)(1) + db + (d-1)b 2 + … + (1) b d = O(b d ) Same as BFS! WHY???
Calculation db + (d-1)b 2 + … + (1) b d = b d + 2b d-1 + 3b d-2 +… + db = b d (1 + 2b -1 + 3b -2 + … + db -d ) b d ( i=1,…, ib (1-i) ) = b d ( b/(b-1) ) 2
Comparison of Strategies Breadth-first is complete and optimal, but has high space complexity Bad when branching factor is high Depth-first is space efficient, but neither complete nor optimal Bad when search depth is infinite Iterative deepening is asymptotically optimal
Uniform-Cost Strategy Each step has some cost > 0. The cost of the path to each fringe node N is g(N) = costs of all steps. The goal is to generate a solution path of minimal cost. The queue FRINGE is sorted in increasing cost. S 0 1 A 5 B 15 C SG A B C 5 1 10 5 5 G 11 G 10
Repeated States 8-queens No assembly planning Few 123 45 678 8-puzzle and robot navigation Many search tree is finitesearch tree is infinite
Avoiding Repeated States Requires comparing state descriptions Breadth-first strategy: Keep track of all generated states If the state of a new node already exists, then discard the node
Avoiding Repeated States Depth-first strategy: Solution 1: Keep track of all states associated with nodes in current path If the state of a new node already exists, then discard the node Avoids loops Solution 2: Keep track of all states generated so far If the state of a new node has already been generated, then discard the node Space complexity of breadth-first
Summary Search strategies: breadth-first, depth- first, and variants Evaluation of strategies: completeness, optimality, time and space complexity Avoiding repeated states