1 / 55

Open only for Humans; Droids and Robots should go for CSE 462 next door ;-)

Open only for Humans; Droids and Robots should go for CSE 462 next door ;-) . CSE 471/598. Intro to AI. General Information. Instructor: Subbarao Kambhampati ( Rao ) Office hours :, T/ Th 1-2pm By 560 TA(s): Will Cushing (office hours TBD) Kartik Talamadupula Tuan Nguyen

iona
Télécharger la présentation

Open only for Humans; Droids and Robots should go for CSE 462 next door ;-)

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Open only for Humans; Droids and Robots should go for CSE 462 next door ;-) CSE 471/598 Intro to AI

  2. General Information • Instructor: SubbaraoKambhampati (Rao) • Office hours:, T/Th1-2pm By 560 • TA(s): • Will Cushing (office hours TBD) • KartikTalamadupula • Tuan Nguyen • All Ph.D. students in AI; first two ASU undergrads • Textbook: Russell & Norvig 3rd edition • You won’t be terribly disadvantaged if you get a used second edition instead. • Course Homepage: http://rakaposhi.eas.asu.edu/cse471

  3. Subject to (minor) Changes Grading etc. • Projects/Homeworks/Participation (~55%) • Projects • Approximately 4 • First project already up! Due 1/17 • Expected background • Competence in Lisp programming • Why lisp? (Because!) • Homeworks • Homeworks will be assigned piecemeal.. (Socket system) • Participation • Attendance to and attentiveness in classes is mandatory • Participation on class blog is highly encouraged. • Do ask questions • Midterm & final (~45%)

  4. Lisp Programming • Use Lisp-in-a-box (link from the class page) • Easy to install and use. Take the clisp version • There are links to 2 lisp refresher lectures by me • Also links to free lisp books • You are allowed to use other languages such as Java/Python/C etc.—but the partial code snippets will only be provided for Lisp • If you plan to take this option, please do talk to the instructor

  5. It has not been the path for the faint-hearted, for those who prefer leisure over work, or seek only the pleasures of riches and fame. -Obama inadvertently talking about CSE471 in his inaugural address  Course demands.. • ..your undivided attention • Attendance mandatory; if you have to miss a class, you should let me know before hand • Has been repeatedly seen as a 4-5 credit course • (while the instructor just thinks your other courses are 1-2 credit ones  ) • No apologies made for setting high-expectations

  6. Grade Anxiety • All letter grades will be awarded • A+,A,B+,B,B-,C+,C,D etc. • No pre-set grade thresholds • CSE471 and CSE598 students will have the same assignments/tests etc. During letter grade assignment however, they will be compared to their own group. • The class is currently ~30 CSE471 and ~15 CSE598 (grad) students

  7. Honor Code • Unless explicitly stated otherwise, all assignments are: • Strictly individual effort • You are forbidden from trawling the web for answers/code etc • Any infraction will be dealt with in severest terms allowed.

  8. Life with a homepage.. • I will not be giving any handouts • All class related material will be accessible from the web-page • Home works may be specified incrementally • (one problem at a time) • The slides used in the lecture will be available on the class page (along with Audio of the lecture) • I reserve the right to modify slides right up to the time of the class • When printing slides avoid printing the hidden slides

  9. 1946: ENIAC heralds the dawn of Computing

  10. 1950: Turing asks the question…. I propose to consider the question: “Can machines think?” --Alan Turing, 1950

  11. 1956: A new field is born • We propose that a 2 month, 10 man study of artificial intelligence be carried out during the summer of 1956 at Dartmouth College in Hanover, New Hampshire. • - Dartmouth AI Project Proposal; J. McCarthy et al.; Aug. 31, 1955.

  12. 1996: EQP proves that Robbin’s Algebras are all boolean [An Argonne lab program] has come up with a major mathematical proof that would have been called creative if a human had thought of it. -New York Times, December, 1996

  13. 1997: HAL 9000 becomes operational in fictional Urbana, Illinois …by now, every intelligent person knew that H-A-L is derived from Heuristic ALgorithmic -Dr. Chandra, 2010: Odyssey Two

  14. 1997: Deep Blue ends Human Supremacy in Chess vs. I could feel human-level intelligence across the room -Gary Kasparov, World Chess Champion (human) In a few years, even a single victory in a long series of games would be the triumph of human genius.

  15. For two days in May, 1999, an AI Program called Remote Agent autonomouslyran Deep Space 1 (some 60,000,000 miles from earth) 1999: Remote Agent takes Deep Space 1 on a galactic ride

  16. 2002: Computers start passing Advanced Placement Tests … a project funded by (Microsoft Co-founder) Paul Allen attempts to design a “Digital Aristotle”. Its first results involve programs that can pass High School Advanced Placement Exam in Chemistry…

  17. 2005: Cars Drive Themselves • Stanley and three other cars drive themselves over a 132 mile mountain road

  18. 2005: Robots play soccer (without headbutting!) • 2005 Robot Soccer: Humanoid league

  19. 2006: AI Celebrates its Golden Jubilee…

  20. 2007: Robots Drive on Urban Roads • 11 cars drove themselves on urban streets (for DARPA Urban Challenge)

  21. 2010: Watson defeats Puny Humans in Jeopardy! And Ken Jennings pledges obeisance to the new Computer Overlords..

  22. 2012: Robots (instead of them foreigners) Threaten to Take all your jobs ..and thankfully You step in to thwart them by taking CSE 471 Welcome to the Holy War!

  23. Course Overview • What is AI • Intelligent Agents • Search (Problem Solving Agents) • Single agent search [Project 1] • Markov Decision Processes • Constraint Satisfaction Problems • Adversarial (multi-agent) search • Logical Reasoning [Project 2] • Reasoning with uncertainity • Planning [Project 3] • Learning [Project 4]

  24. Although we will see that all four views have motivations..

  25. Do we want a machine that beats humans in chess or a machine that thinks like humans while beating humans in chess? DeepBlue supposedly DOESN’T think like humans.. (But what if the machine is trying to “tutor” humans about how to do things?) (Bi-directional flow between thinking humanly and thinking rationally)

  26. What if we are writing intelligent agents that interact with humans? The COG project The Robotic care givers Mechanical flight became possible only when people decided to stop emulating birds…

  27. Playing an (entertaining) game of Soccer Solving NYT crossword puzzles at close to expert level Navigating in deep space Learning patterns in databases (datamining…) Supporting supply-chain management decisions at fortune-500 companies Learning common sense from the web Navigating desert roads Navigating urban roads Bluffing humans in Poker Beating them in Jeopardy…

  28. What AI can do is as important as what it can’t yet do.. • Captcha project

  29. digression Arms race to defeat Captchas…(using unwitting masses) • Start opening an email account at Yahoo.. • Clip the captcha test • Show it to a human trying to get into another site • Usually a site that has pretty pictures of the persons of apposite* sex • Transfer their answer to the Yahoo Much more interesting idea: ESP Game Note: Apposite—not opposite. This course is nothing if not open minded 

  30. 1/10 Lisp Recitation Lecture? How many of you installed Lisp-in-a-box? TA office hours will be sent by email Register for blog! Thinking Cap to be released today

  31. It can be argued that all the faculties needed to pass Turing test are also needed to act rationally to improve success ratio…

  32. Architectures for Intelligent Agents Wherein we discuss why do we need representation, reasoning and learning

  33. Environment The $$$$$$ Question What action next?

  34. and prior knowledge Rational != Intentionally avoiding sensing “history” = {s0,s1,s2……sn….} Performance = f(history) Expected Performance= E(f(history))

  35. Partial contents of sources as found by Get Get,Post,Buy,.. Cheapest price on specific goods Internet, congestion, traffic, multiple sources Qn: How do these affect the complexity of the problem the rational agent faces? Lack of percepts makes performance harder Lack of actions makes performance harder… Complex goals make performance harder How about the environment?

  36. (Static vs. Dynamic) (Observable vs. Partially Observable) Environment (perfect vs. Imperfect) perception (Full vs. Partial satisfaction) (Instantaneous vs. Durative) action Goals (Deterministic vs. Stochastic) The $$$$$$ Question What action next?

  37. Yes Yes No Yes Yes #1 No No No No No >1 #Agents Accessible: The agent can “sense” its environment best: Fully accessible worst: inaccessible typical: Partially accessible Deterministic: The actions have predictable effects best: deterministic worst: non-deterministic typical: Stochastic Static: The world evolves only because of agents’ actions best: static worst: dynamic typical: quasi-static Episodic: The performance of the agent is determined episodically best: episodic worst: non-episodic Discrete: The environment evolves through a discrete set of states best: discrete worst: continuous typical: hybrid Agents: # of agents in the environment; are they competing or cooperating?

  38. Ways to handle: Assume that the environment is more benign than it really is (and hope to recover from the inevitable failures…) Assume determinism when it is stochastic; Assume static even though it is dynamic; Bite the bullet and model the complexity

  39. (Model-based reflex agents) How do we write agent programs for these?

  40. Even basic survival needs state information.. This one already assumes that the “sensorsfeatures” mapping has been done!

  41. (aka Model-based Reflex Agents) State Estimation EXPLICIT MODELS OF THE ENVIRONMENT --Blackbox models --Factored models Logical models Probabilistic models

More Related