Applications of AI Jim Little UBC CS 322 – Intro 3 September 8, 2014 Textbook § 1.5 - 1.6.

Slides:



Advertisements
Similar presentations
Adversarial Search Chapter 6 Sections 1 – 4. Outline Optimal decisions α-β pruning Imperfect, real-time decisions.
Advertisements

Computer Science CPSC 322 Lecture 3 AI Applications.
Decision Theory: Sequential Decisions Computer Science cpsc322, Lecture 34 (Textbook Chpt 9.3) Nov, 28, 2012.
CPSC 322, Lecture 3Slide 1 AI Applications Computer Science cpsc322, Lecture 3 January, 8, 2010.
CPSC 322, Lecture 4Slide 1 Search: Intro Computer Science cpsc322, Lecture 4 (Textbook Chpt ) Sept, 11, 2013.
Perspectives and Final Review CPSC 322 – last class April 6, 2011.
CS 484 – Artificial Intelligence
Slide 1 Planning: Representation and Forward Search Jim Little UBC CS 322 October 10, 2014 Textbook §8.1 (Skip )- 8.2)
Adversarial Search Chapter 5.
Adversarial Search: Game Playing Reading: Chapter next time.
Artificial Intelligence for Games Game playing Patrick Olivier
ECE457 Applied Artificial Intelligence R. Khoury (2007)Page 1 Please pick up a copy of the course syllabus from the front desk.
CPSC 322, Lecture 2Slide 1 Representational Dimensions Computer Science cpsc322, Lecture 2 (Textbook Chpt1) Sept, 6, 2013.
CPSC 322, Lecture 10Slide 1 Finish Search Computer Science cpsc322, Lecture 10 (Textbook Chpt 3.6) January, 28, 2008.
Slide 1 Finish Search Jim Little UBC CS 322 – Search 7 September 24, 2014 Textbook §3.6.
Search: Representation and General Search Procedure Jim Little UBC CS 322 – Search 1 September 10, 2014 Textbook § 3.0 –
CPSC 502, Lecture 11Slide 1 Introduction to Artificial Intelligence (AI) Computer Science cpsc502, Lecture 11 Oct, 18, 2011.
Planning under Uncertainty
CPSC 322, Lecture 19Slide 1 Propositional Logic Intro, Syntax Computer Science cpsc322, Lecture 19 (Textbook Chpt ) February, 23, 2009.
Decision Theory: Single Stage Decisions Computer Science cpsc322, Lecture 33 (Textbook Chpt 9.2) March, 30, 2009.
CPSC 322, Lecture 37Slide 1 Finish Markov Decision Processes Last Class Computer Science cpsc322, Lecture 37 (Textbook Chpt 9.5) April, 8, 2009.
CPSC 322, Lecture 4Slide 1 Search: Intro Computer Science cpsc322, Lecture 4 (Textbook Chpt ) January, 12, 2009.
CPSC 322, Lecture 10Slide 1 Finish Search Computer Science cpsc322, Lecture 10 (Textbook Chpt 3.6) January, 25, 2010.
Search: Representation and General Search Procedure CPSC 322 – Search 1 January 12, 2011 Textbook § 3.0 –
CPSC 322, Lecture 3Slide 1 AI Applications Computer Science cpsc322, Lecture 3 January, 9, 2009.
CPSC 322, Lecture 11Slide 1 Constraint Satisfaction Problems (CSPs) Introduction Computer Science cpsc322, Lecture 11 (Textbook Chpt 4.0 – 4.2) January,
CPSC 322, Lecture 2Slide 1 Representational Dimensions Computer Science cpsc322, Lecture 2 (Textbook Chpt1) January, 6, 2010.
UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering CSCE 580 Artificial Intelligence Ch.6: Adversarial Search Fall 2008 Marco Valtorta.
CPSC 322, Lecture 2Slide 1 Representational Dimensions Computer Science cpsc322, Lecture 2 (Textbook Chpt1) January, 7, 2009.
Representational Dimensions CPSC 322 – Intro 2 January 7, 2011 Textbook §
CPSC 322, Lecture 17Slide 1 Planning: Representation and Forward Search Computer Science cpsc322, Lecture 17 (Textbook Chpt 8.1 (Skip )- 8.2) February,
Applications of AI CPSC 322 – Intro 3 January 10, 2011 Textbook §
CPSC 322, Lecture 17Slide 1 Planning: Representation and Forward Search Computer Science cpsc322, Lecture 17 (Textbook Chpt 8.1 (Skip )- 8.2) February,
CPSC 322, Lecture 35Slide 1 Value of Information and Control Computer Science cpsc322, Lecture 35 (Textbook Chpt 9.4) April, 14, 2010.
Dr Rong Qu Module Introduction.
Semantic Web Technologies Lecture # 2 Faculty of Computer Science, IBA.
CPSC 171 Artificial Intelligence Read Chapter 14.
Department of Computer Science Undergraduate Events More
ARTIFICIAL INTELLIGENCE Introduction: Chapter 1. Outline Course overview What is AI? A brief history The state of the art.
1 AI and Agents CS 171/271 (Chapters 1 and 2) Some text and images in these slides were drawn from Russel & Norvig’s published material.
Artificial Intelligence Dr. Paul Wagner Department of Computer Science University of Wisconsin – Eau Claire.
Introduction: Chapter 1
CSC4444: Artificial Intelligence Fall 2011 Dr. Jianhua Chen Slides adapted from those on the textbook website.
Computer Science CPSC 322 Lecture 3 AI Applications 1.
Slide 1 Constraint Satisfaction Problems (CSPs) Introduction Jim Little UBC CS 322 – CSP 1 September 27, 2014 Textbook §
How R&N define AI Systems that think like humans Systems that think rationally Systems that act like humans Systems that act rationally humanly vs. rationally.
Computer Science CPSC 322 Lecture 4 Search: Intro (textbook Ch: ) 1.
Constraint Satisfaction Problems (CSPs) CPSC 322 – CSP 1 Poole & Mackworth textbook: Sections § Lecturer: Alan Mackworth September 28, 2012.
Adversarial Search Chapter 6 Section 1 – 4. Outline Optimal decisions α-β pruning Imperfect, real-time decisions.
So what is AI?.
Algorithmic, Game-theoretic and Logical Foundations
CPSC 322, Lecture 19Slide 1 (finish Planning) Propositional Logic Intro, Syntax Computer Science cpsc322, Lecture 19 (Textbook Chpt – 5.2) Oct,
What is Artificial Intelligence? What is artificial intelligence? It is the science and engineering of making intelligent machines, especially intelligent.
CPSC 322, Lecture 4Slide 1 Search: Intro Computer Science cpsc322, Lecture 4 (Textbook Chpt ) Sept, 12, 2012.
CPSC 322, Lecture 2Slide 1 Representational Dimensions Computer Science cpsc322, Lecture 2 (Textbook Chpt1) Sept, 7, 2012.
CPSC 322, Lecture 10Slide 1 Finish Search Computer Science cpsc322, Lecture 10 (Textbook Chpt 3.6) Sep, 26, 2010.
Adversarial Search Chapter 5 Sections 1 – 4. AI & Expert Systems© Dr. Khalid Kaabneh, AAU Outline Optimal decisions α-β pruning Imperfect, real-time decisions.
ADVERSARIAL SEARCH Chapter 6 Section 1 – 4. OUTLINE Optimal decisions α-β pruning Imperfect, real-time decisions.
The Hebrew University of Jerusalem School of Engineering and Computer Science Academic Year: 2011/2012 Instructor: Jeff Rosenschein.
Computer Science CPSC 322 Lecture 2 Representational Dimensions, Search Intro 1.
Representational Dimensions Computer Science cpsc322, Lecture 2
Planning: Representation and Forward Search
© James D. Skrentny from notes by C. Dyer, et. al.
Decision Theory: Single Stage Decisions
Planning: Representation and Forward Search
Course Logistics CS533: Intelligent Agents and Decision Making
Announcements Homework 3 due today (grace period through Friday)
Decision Theory: Single Stage Decisions
Adversarial Search Chapter 6 Section 1 – 4.
Planning: Representation and Forward Search
Presentation transcript:

Applications of AI Jim Little UBC CS 322 – Intro 3 September 8, 2014 Textbook §

Today’s Lecture Recap from last lecture Further Representational Dimensions Applications of AI 2

Representation and Reasoning (R&R) System problem representation computation representation solution A representation language that allows description of –The environment and –Problems (questions/tasks) to be solved Computational reasoning procedures to –Compute a solution to a problem –E.g., an answer/sequence of actions How should an agent act given the current state of its environment and its goals? How should the environment be represented in order to help an agent to reason effectively? 3

Main Representational Dimensions Considered Domains can be classified by the following dimensions: 1. Uncertainty –Deterministic vs. stochastic domains 2. How many actions does the agent need to perform? –Static vs. sequential domains An important design choice is: 3. Representation scheme –Explicit states vs. propositions vs. relations 4

Features vs. States, another example T 11 T 12 T 21 T 22 S0S S1S S2S S3S S4S S5S S6S S7S S8S S9S S S S S S S T 11 : student 1 takes course 1 T 12 : student 1 takes course 2 T 21 : student 2 takes course 1 T 22 : student 2 takes course 2 Does student 2 take course 2? Feature-based: Is T 22 true? State-based: are we in one of the red states?

Course overview “find path in known map” 6 Dimen- sions Course Modules Deterministic vs. Stochastic Static vs. Sequential States vs. Features vs. Relations 1. SearchDeterministicStaticStates 2. CSPsDeterministicStaticFeatures 3. PlanningDeterministicSequentialStates or Features 4. LogicDeterministicStaticRelations 5. UncertaintyStochasticStaticFeatures 6. Decision Theory StochasticSequentialFeatures “are deliveries feasible?” “what order to do things in to finish jobs fastest?” “HasCoffee(Person) if InRoom(Person, Room)  DeliveredCoffee(Room)” “probability of slipping” “given that I may slip and the utilities of being late and of crashing, should I take a detour?” Example problems:

Today’s Lecture Recap from last lecture Further Representational Dimensions Applications of AI 7

Further Dimensions of Representational Complexity We’ve already discussed: 1. Deterministic versus stochastic domains 2. Static vs. Sequential domains 3. Explicit state or features or relations Some other important dimensions of complexity: 4. Flat vs. hierarchical representation 5. Knowledge given vs. knowledge learned from experience 6. Goals vs. complex preferences 7. Single-agent vs. multi-agent 8. Perfect rationality vs. bounded rationality 8

4. Flat vs. hierarchical Should we model the whole world on the same level of abstraction? –Single level of abstraction: flat –Multiple levels of abstraction: hierarchical Example: Planning a trip from here to a resort in Cancun Going to the airport Take a cab Call a cab Lookup number Dial number Ride in the cab Pay for the cab Check in …. Delivery robot: Plan on level of cities, districts, buildings, … This course: mainly flat representations –Hierarchical representations required for scaling up 9

5. Knowledge given vs. knowledge learned from experience The agent is provided with a model of the world once and for all OR The agent can learn how the world works based on experience in this case, the agent often still does start out with some prior knowledge (no tabula rasa!) Delivery robot: Known/learned map, prob. of slipping, … This course: mostly knowledge given Learning: CPSC 340 and CPSC

6. Goals vs. (complex) preferences An agent may have a goal that it wants to achieve –E.g., there is some state or set of states of the world that the agent wants to be in –E.g., there is some proposition or set of propositions that the agent wants to make true An agent may have preferences –E.g., a preference/utility function describes how happy the agent is in each state of the world –Agent's task is to reach a state which makes it as happy as possible Preferences can be complex –E.g., Diagnostic assistant faces multi-objective problem Life expectancy, suffering, risk of side effects, costs, … –Delivery robot: “deliver coffee!” vs “mail trumps coffee, but Chris needs coffee quickly, and don’t stand in the way” This course: goals and simple preferences –Some scalar, e.g. linear combination of competing objectives 11

7. Single-agent vs. Multiagent domains Does the environment include other agents? If there are other agents whose actions affect us –It can be useful to explicitly model their goals and beliefs, and how they react to our actions Other agents can be: cooperative, neutral, competitive, or a bit of each Delivery robot: Are there other agents? Should I coordinate with other robots? –Are kids out to trick me? This course: only single agent scenario –Multiagent problems tend to be complex –Exception: deterministic 2-player games can be formalized easily 12

8. Perfect rationality vs. bounded rationality We've defined rationality as an abstract ideal Is the agent able to live up to this ideal? –Perfect rationality: the agent can derive what the best course of action is –Bounded rationality: the agent must make good decisions based on its perceptual, computational and memory limitations Delivery robot: –”Find perfect plan” vs. –“Can’t spend an hour thinking (thereby delaying action) to then deliver packages a minute faster than by some standard route” This course: mostly perfect rationality –But also consider anytime algorithms for optimization problems 13

Today’s Lecture Recap from last lecture Further Representational Dimensions Applications of AI 14

Course Map 15 D imen- sions Course Modules Deterministic vs. Stochastic Static vs. Sequential States vs. Features vs. Relations 1. SearchDeterministicStaticStates 2. CSPsDeterministicStaticFeatures 3. PlanningDeterministicSequentialStates or Features 4. LogicDeterministicStaticRelations 5. UncertaintyStochasticStaticFeatures 6. Decision Theory StochasticSequentialFeatures

Search: Checkers Early learning work in 1950s by Arthur Samuel at IBM Chinook program by Jonathan Schaeffer (UofA) –Search to explore the space of possible moves and their consequences –1994: world champion –2007: declared unbeatable 16

CPSC 322, Lecture 3 Slide 17 Search: Chess In 1997, Gary Kasparov, the chess grandmaster and reigning world champion played against Deep Blue, a program written by researchers at IBM Source: IBM Research

CPSC 322, Lecture 3 Slide 18 Search: Chess Deep Blue won 3 games, lost 2, tied 1 30 CPUs chess processors Searched 126,000,000 nodes per sec Generated 30 billion positions per move reaching depth 14 routinely

Course Map 19 D imen- sions Course Modules Deterministic vs. Stochastic Static vs. Sequential States vs. Features vs. Relations 1. SearchDeterministicStaticStates 2. CSPsDeterministicStaticFeatures 3. PlanningDeterministicSequentialStates or Features 4. LogicDeterministicStaticRelations 5. UncertaintyStochasticStaticFeatures 6. Decision Theory StochasticSequentialFeatures

CSP: Sudoku 20

Constraint optimization problems Optimization under side constraints (similar to CSP) E.g. mixed integer programming (software: IBM CPLEX) –Linear program: max c T x such that Ax ≤ b –Mixed integer program: additional constraints, x i  Z (integers) –NP-hard, widely used in operations research and in industry Transportation/Logistics: Supply chain Production planning SNCF, United Airlines management and optimization: UPS, United States software: Airbus, Dell, Postal Service, … Oracle, SAP,… Thyssen, Toyota,Nissan,... 21

Course Map 22 D imen- sions Course Modules Deterministic vs. Stochastic Static vs. Sequential States vs. Features vs. Relations 1. SearchDeterministicStaticStates 2. CSPsDeterministicStaticFeatures 3. PlanningDeterministicSequentialStates or Features 4. LogicDeterministicStaticRelations 5. UncertaintyStochasticStaticFeatures 6. Decision Theory StochasticSequentialFeatures

Planning: Spacecraft Control NASA: Deep Space One spacecraft operated autonomously for two days in May, 1999: –determined its precise position using stars and asteroids despite a malfunctioning ultraviolet detector –planned the necessary course adjustment –fired the ion propulsion system to make this adjustment 23 Source: NASA

Course Map 24 D imen- sions Course Modules Deterministic vs. Stochastic Static vs. Sequential States vs. Features vs. Relations 1. SearchDeterministicStaticStates 2. CSPsDeterministicStaticFeatures 3. PlanningDeterministicSequentialStates or Features 4. LogicDeterministicStaticRelations 5. UncertaintyStochasticStaticFeatures 6. Decision Theory StochasticSequentialFeatures

CPSC 322, Lecture 3 Planning & Scheduling: Logistics Dynamic Analysis and Replanning Tool (Cross & Walker) –logistics planning and scheduling for military transport –used in the 1991 Gulf War by the US –problems had 50,000 entities (e.g., vehicles); different starting points and destinations Source: DARPA Same techniques can be used for non-military applications: e.g., Emergency Evacuation

Logic: Cyc AI project that started 1984 with the objective –to codify, in machine-usable form, millions of pieces of knowledge that comprise human common sense Logic reasoning procedures, e.g. –Every tree is a plant –Plants die eventually –Therefore, every tree dies eventually Criticisms include –Difficulty of adding knowledge manually –Non-scalability –Empirical evaluation – no benchmarks 26

Logic: Cyc 27

Slide Logic: CycSecure “scans a computer network to build a formal representation of the network, based on Cyc’s pre-existing ontology of networking, security, and computing concepts: This formal representation also allows users to interact directly with the model of the network, allowing testing of proposed changes.” Excerpted from: Shepard et al., 2005 Knowledge Representation Web Mining & Semantic Web !

CSP/logic: formal verification 29 Hardware verification Software verification (e.g. IBM, Intel) (small to medium programs) Most progress in the last 10 years based on encodings into propositional satisfiability (SAT)

Course Map 30 D imen- sions Course Modules Deterministic vs. Stochastic Static vs. Sequential States vs. Features vs. Relations 1. SearchDeterministicStaticStates 2. CSPsDeterministicStaticFeatures 3. PlanningDeterministicSequentialStates or Features 4. LogicDeterministicStaticRelations 5. UncertaintyStochasticStaticFeatures 6. Decision Theory StochasticSequentialFeatures

Reasoning under Uncertainty Sample application: Microsoft Kinect –Sensor: IR camera for depth perception sensing projected pattern –Noise: no fixed reference points; movements in the background 31 Source: Microsoft & YouTube

Uncertainty/Decision Theory: Diagnosis 32

Watson : analyzes natural language questions and content well enough and fast enough to compete and win against champion players at Jeopardy!Jeopardy! CPSC 322, Lecture 1 Slide 33 Source: IBM “This Drug has been shown to relieve the symptoms of ADD with relatively few side effects." 1000s of algorithms and KBs, 3 secs

Zite: a personalized magazine … that gets smarter as you use it CPSC 322, Lecture 1 Slide 34

Course Map 35 D imen- sions Course Modules Deterministic vs. Stochastic Static vs. Sequential States vs. Features vs. Relations 1. SearchDeterministicStaticStates 2. CSPsDeterministicStaticFeatures 3. PlanningDeterministicSequentialStates or Features 4. LogicDeterministicStaticRelations 5. UncertaintyStochasticStaticFeatures 6. Decision Theory StochasticSequentialFeatures

Decision Theory: Decision Support Systems E.g., Computational Sustainability New interdisciplinary field, AI is a key component –Models and methods for decision making concerning the management and allocation of resources –to solve most challenging problems related to sustainability Often constraint optimization problems. E.g. –Energy: when and where to produce green energy most economically? –Which parcels of land to purchase to protect endangered species? –Urban planning: how to use budget for best development in 30 years? 36 Source:

Planning Under Uncertainty Source: Andrew Ng Helicopter control: MDP, reinforcement learning

Planning Under Uncertainty Autonomous driving: DARPA Urban Challenge – Stanford’s JuniorDARPA Urban Challenge – Stanford’s Junior Source: Sebastian Thrun

Planning Under Uncertainty Autonomous driving: Dickmanns (1986), Google, Audi, Toyota, Mercedes-Benz, … Self-driving cars are now street legal in Florida, California and Nevada. Image source: geek.com

40 Military applications: ethical issues Robot soldiers –Existing: robot dog carrying heavy materials for soldiers in the field –The technology is there Unmanned airplanes Missile tracking Surveillance … Image Source: Boston Dynamics

CPSC 322, Lecture 3 Slide 41 Decision Network in Finance for venture capital decision Source: R.E. Neapolitan, 2007

Planning Under Uncertainty Source: Jesse Hoey UofT 2007 Learning and Using PO MDP models of Patient-Caregiver Interactions During Activities of Daily Living Goal: Help Older adults living with cognitive disabilities (such as Alzheimer's) when they: forget the proper sequence of tasks that need to be completed they lose track of the steps that they have already completed.

AI Applications CPSC 322 Lecture 3, Slide 43 Multiagent Systems: Robot Soccer Source: RoboCup web site

RoboCup

The Dynamites: Two on Two World’s First Soccer Playing Robots (UBC, 1993)

Robot Soccer: Humanoids 46 Source: Darmstadt Dribbling Dackels

Summary(1) We would like most general agents possible, but to start with we need to restrict scope: 4. Flat representations (vs. hierarchical) 5. Knowledge given (vs. knowledge learned) 6. Goals and simple preferences (vs. complex preferences) 7. Single-agent scenarios (vs. multi-agent scenarios) 8. Perfect rationality (vs. bounded rationality) Extensions we will cover: 1. Deterministic versus stochastic domains 2. Static vs. Sequential domains 3. Representation: Explicit state or features or relations 47

Summary(2) Huge diversity of applications More than I could possibly show here We shall focus on their common foundations 48

Coming up … We’ll start the search module: read Sections