1. Artificial IntelligenceinOne HourCasidhe Lee`Content adapted from Prof. Kleins CS 188 course at UC Berkeley

2. What is AI? 3. What is Not AI? 4. A.I. is not about copying humans, itsabout building rational agents 5. sin(0.532343) /ln(343) 6. Rational The best sequence of actions towarda goal independent of the thoughtprocessGoals are expressed using utility functions 7. MAXIMIZE YOUREXPECTED UTILITYProf. Dan Klein 8. What Youll Get From thisTalkA high level summary of the fieldNo code, but a bit of mathHow to approach certain problems using AI techniques 9. The Two Big Topics of AI...Search&Learning 10. A Simple Search Problem... 11. ... versus this 12. Off-the-shelf search algorithms take toolong on very large graphs.AI approach: estimate the pathbeforehand 13. A* SearchAssign a path cost p(n) to node n.Assign an estimated cost h(n) to go fromnode n to goal node. This is called aheuristic.Let f(n) = p(n) + h(n) be the cost from currentnode to node n.Perform a search by choosing adjacent noden with smallest f(n) at each step.Return when we hit the goal. 14. DFS BFS A* 15. Why does it work?Admissibilityh(n) < distance(n, goal)Consistencyh(x)