1. Vilalta&Eick:Uninformed Search Problem Solving By Searching Introduction Solutions and Performance Uninformed Search Strategies Avoiding Repeated States/Looping Partial Information Summary

2. Vilalta&Eick:Uninformed Search Introduction Let’s review a goal-based agent called a “problem-solving agent” They have two characteristics: 1.Find sequences of actions to reach a goal. 2.They are uninformed.

3. Vilalta&Eick:Uninformed Search Preliminaries We need to define two things: Goal Formulation Define objectives Problem Formulation Define actions and states

4. Vilalta&Eick:Uninformed Search Problem Formulation Four components: 1.The initial state 2.Actions (successor function) 3.Goal test 4.Path Cost

5. Vilalta&Eick:Uninformed Search Example

6. Vilalta&Eick:Uninformed Search Other Examples Toy Problems: Vacuum World 8-puzzle 8-queens problem

7. Vilalta&Eick:Uninformed Search Figure 3.3

8. Vilalta&Eick:Uninformed Search Figure 3.5

9. Vilalta&Eick:Uninformed Search Other Examples Real Problems Route-Finding Problem Robot Navigation Automatic Assembly Sequencing Protein Design Internet Searching

10. Vilalta&Eick:Uninformed Search Problem Solving By Searching Introduction Solutions and Performance Uninformed Search Strategies Avoiding Repeated States Partial Information Summary

11. Vilalta&Eick:Uninformed Search Solutions We search through a search tree We expand new nodes to grow the tree There are different search strategies Nodes contain the following: state parent node action path cost depth

12. Vilalta&Eick:Uninformed Search Search Tree Initial state Expanded nodes

13. Vilalta&Eick:Uninformed Search Performance Four elements of performance: Completeness (guaranteed to find solution) Optimality (optimal solution?) Time Complexity Space Complexity

14. Vilalta&Eick:Uninformed Search Performance Complexity requires three elements: a.Branching factor b b.Depth of the shallowest node d c.Maximum length of any path m

15. Vilalta&Eick:Uninformed Search Problem Solving By Searching Introduction Solutions and Performance Uninformed Search Strategies Avoiding Repeated States Partial Information Summary

16. Vilalta&Eick:Uninformed Search Breadth-First Search Root is expanded first Then all successors at level 2. Then all successors at level 3, etc. Properties:  Complete (if b and d are finite)  Optimal (if path cost increases with depth)  Cost is O(b d+1 )

17. Vilalta&Eick:Uninformed Search Search

18. Vilalta&Eick:Uninformed Search Uniform-Cost Search Like breadth-first search Expand node with lowest path cost. Properties:  Complete (if b and d are finite)  Optimal (if path cost increases with depth)  Cost is O(b c*/e )  Could be worse than breadth first search

19. Vilalta&Eick:Uninformed Search Search

20. Vilalta&Eick:Uninformed Search Depth-First Search Expand the deepest node at the bottom of the tree. Properties:  Incomplete  suboptimal  Space complexity is only O(bm) Only store the nodes on the current path including their unexpanded sibling nodes Backtracking even does better spacewise: O(m)

21. Vilalta&Eick:Uninformed Search Search

22. Vilalta&Eick:Uninformed Search Depth-Limited Like depth-first search but with depth limit L. Properties:  Incomplete (if L < d)  nonoptimal (if L > d)  Time complexity is O(b L )  Space complexity is O(bL)

23. Vilalta&Eick:Uninformed Search Iterative Deepening A combination of depth and breadth-first search. Gradually increases the limit L Properties:  Complete (if b and d are finite)  Optimal if path cost increases with depth  Time complexity is O(b d )

24. Vilalta&Eick:Uninformed Search Search

25. Vilalta&Eick:Uninformed Search Bidirectional Search Run two searches – one from the initial state and one backward from the goal. We stop when the two searches meet. Motivation:  Time complexity: (b d/2 + b d/2 ) < b d Searching backwards not easy.

26. Vilalta&Eick:Uninformed Search Figure 3.16

27. Vilalta&Eick:Uninformed Search Problem Solving By Searching Introduction Solutions and Performance Uninformed Search Strategies Avoiding Repeated States/Looping Partial Information Summary

28. Vilalta&Eick:Uninformed Search Avoiding Looping & Repeated States Use a list of expanded states; non-expanded states (open and close list) Use domain specific knowledge Use sophisticated data structures to find already visited states more quickly. Checking for repeated states can be quite expensive and slow down the search alg.

29. Vilalta&Eick:Uninformed Search Problem Solving By Searching Introduction Solutions and Performance Uninformed Search Strategies Avoiding Repeated States Partial Information Summary

30. Vilalta&Eick:Uninformed Search Partial Information Knowledge of states or actions is incomplete. a.Sensorless problems b.Contingency Problems c.Exploration Problems

31. Vilalta&Eick:Uninformed Search

32. Figure 3.21 Goal State

33. Vilalta&Eick:Uninformed Search Problem Solving By Searching Introduction Solutions and Performance Uninformed Search Strategies Avoiding Repeated States Partial Information Summary

34. Vilalta&Eick:Uninformed Search Summary To search we need goal and problem formulation. A problem has initial state, actions, goal test, and path function. Performance measures: completeness, optimality, time and space complexity.

35. Vilalta&Eick:Uninformed Search Summary Uninformed search has no additional knowledge of states: breadth and depth-first search, depth-limited, iterative deepening, bidirectional search. In partially observable environments, one must deal with uncertainty and incomplete knowledge.