1. Course Overview What is AI? What are the Major Challenges? What are the Main Techniques? Where are we failing, and why? Step back and look at the Science Step back and look at the History of AI What are the Major Schools of Thought? What of the Future? Done

2. Course Overview What is AI? What are the Major Challenges? What are the Main Techniques? (How do we do it?) Where are we failing, and why? Step back and look at the Science Step back and look at the History of AI What are the Major Schools of Thought? What of the Future?

3. Course Overview What is AI? What are the Major Challenges? What are the Main Techniques? (How do we do it?) Where are we failing, and why? Step back and look at the Science Step back and look at the History of AI What are the Major Schools of Thought? What of the Future? Search Logics (knowledge representation and reasoning) Planning and acting Bayesian belief networks Neural networks Evolutionary computation Reinforcement learning Language parsing and speech techniques Statistical methods (language, learning)

4. Course Overview What is AI? What are the Major Challenges? What are the Main Techniques? (How do we do it?) Where are we failing, and why? Step back and look at the Science Step back and look at the History of AI What are the Major Schools of Thought? What of the Future? Search Logics (knowledge representation and reasoning) Planning and acting Bayesian belief networks Neural networks Evolutionary computation Reinforcement learning Language parsing and speech techniques Statistical methods (language, learning)

5. Use Search for Pathfinding FactorySchool Library Hospital Park Newsagent University church Example from Alison Cawseys book

6. Use Search for Pathfinding FactorySchool Library Hospital Park Newsagent University church Example from Alison Cawseys book start finish

7. Use Search for Pathfinding library school hospital factory park newsagent universitychurch

8. Breadth First Search library school hospital factory park newsagent universitychurch

9. Breadth First Search library school hospital factory park newsagent universitychurch

10. Breadth First Search library school hospital factory park newsagent universitychurch Put things on the back of the list to visit later

11. Depth First Search library school hospital factory park newsagent universitychurch

12. Depth First Search library school hospital factory park newsagent universitychurch

13. Depth First Search library school hospital factory park newsagent universitychurch Put things on the front of the list to visit later

14. Breadth vs. Depth Which is better?

15. library school hospital factory park newsagent university church stadium grocers marketbridge fountain

16. Breadth vs. Depth Which is better? library school hospital factory park newsagent market church stadium grocers bridge university

17. Breadth vs. Depth Which is better? Depends on problem Breadth usually needs a lot more memory Remember all the bits you need to expand next Breadth could be good if There are many long dead ends, But one very short successful path Depth could be good if There are many successful paths But all are quite long Can also combine – set a depth limit

18. What about a big open space? See demo… http://www.csd.abdn.ac.uk/~fguerin/teaching/CS1013/abdn.only/AStar.zip Break it up into squares Each node has 8 children (Be careful about looping) Thats an awfully big tree! Need some clever tricks… How would a human do it? Heuristics Search we did before is called blind or brute force (not clever) Heuristic is a clever rule of thumb

19. Hill-climbing with Heuristic FactorySchool Library Hospital Park Newsagent University church start finish Heuristic: how close to goal

20. Hill-climbing with Heuristic Library 9 School 7 Hospital 5 Factory 5 Park 6 Newsagent 0 University 3Church 4 finish Heuristic: how close to goal

21. Hill-climbing with Heuristic FactorySchool Library Hospital Park Newsagent University church start finish Heuristic: how close to goal

22. Hill-climbing with Heuristic Library 9 School 7 Hospital 5 Factory 5 Park 2 Newsagent 4 University 0Church 4 finish Heuristic: how close to goal

23. Hill-climbing with Heuristic Heuristic: how close to goal from Russell and Norvigs book

24. Best first Search Library 9 School 7 Hospital 5 Factory 5 Park 2 Newsagent 4 University 0Church 4 finish Heuristic: how close to goal Order the list of nodes to visit later Do best first But try others later Very good, e.g. in open space Doesnt consider how far weve come though A* - more in practical

25. Search is an abstract technique…

26. Remember: General Problem Solving

27. Problem formulation Initial situation Goal situation Actions that can be done +cost of action Constraints Task: Find the best sequence of permissible actions that can transform the initial situation into the goal situation. 617 34 582

28. Search is an abstract technique… Jugs problem Two jugs, 4 litre and 3 litre Want to get 2 litres in 4 litre jug Formulate problem Can represent state as (0,0) or (4,0) or (4,2)… Actions: Fill 4 litre ( _, _ ) ( 4, _ ) Fill 3 litre ( _, _ ) ( _, 3 ) Empty 4 litre ( _, _ ) ( 0, _ ) Empty 3 litre ( _, _ ) ( _, 0 ) What else?

29. Search for games: Minimax

31. Alpha-Beta pruning example

32. Alpha value I get at least this

33. Alpha-Beta pruning example Alpha value I get at least this Beta value I get at most this (if I go here)

34. Alpha-Beta pruning example Beta value I get at most this (if I go here)

35. Alpha-Beta pruning example

37. No question about 3 now

38. What about real (hard) games? So far we searched all the way to the end of the game Not feasible in chess, branching factor 35 So far we didnt use heuristics Do a limited lookahead Distance to goal? Evaluate the board state Requires intelligence: pieces, their positions, and stage in game How much lookahead? Modern computer? Alpha beta can give about double 4 moves human novice 8 moves human master 12 moves Deep Blue, Kasparov Deep Blue had extra tricks to look further on interesting paths Go Branching factor 300… forget it! Use databases of patterns

39. What is search good for? Pretty much everything! Pathfinding, puzzles, general problem solver, games Scheduling deliveries Arranging the CS1013 timetable Diagnostic systems find a set of malfunctions that explain the symptoms Speech recognition find the right sequence of words Finding templates/models to match a visual scene Learning is search for a hypothesis Planning systems Find a sequence of actions that achieves a given goal We will look at this next week

40. Defence A big user of AI. "... the deployment of a single logistics support aid called DART during the Desert Shield/Storm Campaign paid back all US government investment in AI/KBS research over a 30 year period." Tate A. Smart Planning. ARPI Proc. 1996.

41. Search is an abstract technique… What are we really doing here? What is the science of abstraction? Mathematics Look at problems abstractly See that theyre the same Use one technique for many problems

42. Note on Heuristics Hard to come up with a good heuristic Often use human intelligence Is the chess computer smart? What about TD-Backgammon Try the Missionaries and Cannibals http://www.learn4good.com/games/puzzle/boat.htm Interesting because human heuristics go awry Computer is not confused Remember the first law 617 34 582 123 45 678

43. Recap: What have you learned about Search Blind or brute force techniques Breadth first Depth first Heuristic techniques Hill-climbing Best first A* - more in practical General problem solving Game playing Minimax Alpha-Beta pruning Search can apply to many diverse problems Makes some tasks simple for computers Heuristics need some intelligence Musings… Computer: Some simple tricks can go a long way Power of computer to store so much and go so fast Just like life – simple blocks

44. Course Overview What is AI? What are the Major Challenges? What are the Main Techniques? (How do we do it?) Where are we failing, and why? Step back and look at the Science Step back and look at the History of AI What are the Major Schools of Thought? What of the Future? Search Logics (knowledge representation and reasoning) Planning and acting Bayesian belief networks Neural networks Evolutionary computation Reinforcement learning Language parsing and speech techniques Statistical methods (language, learning)