Computer Science CPSC 322 Lecture 3 AI Applications.

Slides:



Advertisements
Similar presentations
Department of Computer Science Undergraduate Events More
Advertisements

Computer Science CPSC 322 Lecture 25 Top Down Proof Procedure (Ch 5.2.2)
Decision Theory: Sequential Decisions Computer Science cpsc322, Lecture 34 (Textbook Chpt 9.3) Nov, 28, 2012.
CPSC 422, Lecture 11Slide 1 Intelligent Systems (AI-2) Computer Science cpsc422, Lecture 11 Jan, 29, 2014.
Week 1.
Local Search Jim Little UBC CS 322 – CSP October 3, 2014 Textbook §4.8
CPSC 322, Lecture 14Slide 1 Local Search Computer Science cpsc322, Lecture 14 (Textbook Chpt 4.8) Oct, 5, 2012.
CPSC 322, Lecture 5Slide 1 Uninformed Search Computer Science cpsc322, Lecture 5 (Textbook Chpt 3.5) Sept, 14, 2012.
CPSC 322, Lecture 4Slide 1 Search: Intro Computer Science cpsc322, Lecture 4 (Textbook Chpt ) Sept, 11, 2013.
Department of Computer Science Undergraduate Events More
CPSC 322, Lecture 2Slide 1 Representational Dimensions Computer Science cpsc322, Lecture 2 (Textbook Chpt1) Sept, 6, 2013.
CPSC 502, Lecture 11Slide 1 Introduction to Artificial Intelligence (AI) Computer Science cpsc502, Lecture 11 Oct, 18, 2011.
CPSC 322, Lecture 23Slide 1 Logic: TD as search, Datalog (variables) Computer Science cpsc322, Lecture 23 (Textbook Chpt 5.2 & some basic concepts from.
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 4Slide 1 Search: Intro Computer Science cpsc322, Lecture 4 (Textbook Chpt ) January, 12, 2009.
CPSC 322, Lecture 18Slide 1 Planning: Heuristics and CSP Planning Computer Science cpsc322, Lecture 18 (Textbook Chpt 8) February, 12, 2010.
Search: Representation and General Search Procedure CPSC 322 – Search 1 January 12, 2011 Textbook § 3.0 –
CPSC 322, Lecture 30Slide 1 Reasoning Under Uncertainty: Variable elimination Computer Science cpsc322, Lecture 30 (Textbook Chpt 6.4) March, 23, 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.
CPSC 322, Lecture 23Slide 1 Logic: TD as search, Datalog (variables) Computer Science cpsc322, Lecture 23 (Textbook Chpt 5.2 & some basic concepts from.
CPSC 322, Lecture 12Slide 1 CSPs: Search and Arc Consistency Computer Science cpsc322, Lecture 12 (Textbook Chpt ) January, 29, 2010.
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,
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 31Slide 1 Probability and Time: Markov Models Computer Science cpsc322, Lecture 31 (Textbook Chpt 6.5) March, 25, 2009.
CPSC 322, Lecture 22Slide 1 Logic: Domain Modeling /Proofs + Top-Down Proofs Computer Science cpsc322, Lecture 22 (Textbook Chpt 5.2) March, 8, 2010.
CPSC 322, Lecture 32Slide 1 Probability and Time: Hidden Markov Models (HMMs) Computer Science cpsc322, Lecture 32 (Textbook Chpt 6.5) March, 27, 2009.
CPSC 322, Lecture 35Slide 1 Value of Information and Control Computer Science cpsc322, Lecture 35 (Textbook Chpt 9.4) April, 14, 2010.
CPSC 322, Lecture 24Slide 1 Reasoning under Uncertainty: Intro to Probability Computer Science cpsc322, Lecture 24 (Textbook Chpt 6.1, 6.1.1) March, 15,
Slide 1 Logic: Domain Modeling /Proofs + Top-Down Proofs Jim Little UBC CS 322 – CSP October 22, 2014.
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 §
Computer Science CPSC 322 Lecture 26 Uncertainty and Probability (Ch. 6.1, 6.1.1, 6.1.3)
Computer Science CPSC 322 Lecture 4 Search: Intro (textbook Ch: ) 1.
CPSC 322, Lecture 22Slide 1 Logic: Domain Modeling /Proofs + Top-Down Proofs Computer Science cpsc322, Lecture 22 (Textbook Chpt 5.2) Oct, 26, 2010.
Constraint Satisfaction Problems (CSPs) CPSC 322 – CSP 1 Poole & Mackworth textbook: Sections § Lecturer: Alan Mackworth September 28, 2012.
CPSC 322, Lecture 32Slide 1 Probability and Time: Hidden Markov Models (HMMs) Computer Science cpsc322, Lecture 32 (Textbook Chpt 6.5.2) Nov, 25, 2013.
CPSC 322, Lecture 19Slide 1 (finish Planning) Propositional Logic Intro, Syntax Computer Science cpsc322, Lecture 19 (Textbook Chpt – 5.2) Oct,
Computer Science CPSC 322 Lecture 22 Logical Consequences, Proof Procedures (Ch 5.2.2)
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.
Decision Theory: Single & Sequential Decisions. VE for Decision Networks. CPSC 322 – Decision Theory 2 Textbook §9.2 April 1, 2011.
Computer Science CPSC 322 Lecture 2 Representational Dimensions, Search Intro 1.
CPSC 322, Lecture 22Slide 1 Logic: Domain Modeling /Proofs + Top-Down Proofs Computer Science cpsc322, Lecture 22 (Textbook Chpt 5.2) Oct, 30, 2013.
Constraint Satisfaction Problems (CSPs) Introduction
Please Also Complete Teaching Evaluations
Computer Science cpsc322, Lecture 4
Representational Dimensions Computer Science cpsc322, Lecture 2
CSPs: Search and Arc Consistency Computer Science cpsc322, Lecture 12
CSPs: Search and Arc Consistency Computer Science cpsc322, Lecture 12
Constraint Satisfaction Problems (CSPs) Introduction
Reasoning Under Uncertainty: Conditioning, Bayes Rule & Chain Rule
Planning: Representation and Forward Search
Planning Under Uncertainty Computer Science cpsc322, Lecture 11
Decision Theory: Single Stage Decisions
CSPs: Search and Arc Consistency Computer Science cpsc322, Lecture 12
Planning: Representation and Forward Search
Probability and Time: Markov Models
Probability and Time: Markov Models
Decision Theory: Sequential Decisions
Decision Theory: Single Stage Decisions
Probability and Time: Markov Models
Please Also Complete Teaching Evaluations
Logic: Domain Modeling /Proofs + Computer Science cpsc322, Lecture 22
Probability and Time: Markov Models
Domain Splitting CPSC 322 – CSP 4 Textbook §4.6 February 4, 2011.
Planning: Representation and Forward Search
Presentation transcript:

Computer Science CPSC 322 Lecture 3 AI Applications

Today’s Lecture Recap from last lecture Other representational dimensions AI applications

Colored Cards You need to have 4 colored index cards Come and get them from me if you still don’t have them You will use these as voting cards Cheap low tech variant of clickers Please bring them to class every time 3

Intelligent Agents in the World abilities

Representation and Reasoning (R&R) System A representation language to describe The environment Problems (questions/tasks) to be solved Computational reasoning procedures to compute a solution to a problem E.g., an answer, sequence of actions Choice of an appropriate R&R system depends on various dimensions, e.g. properties of the environment, the type of problems, the agent, the computational resources, etc. 5

Course Overview Environment Problem Type Query Planning Deterministic Stochastic Constraint Satisfaction Search Arc Consistency Search Logics STRIPS Vars + Constraints Value Iteration Variable Elimination Belief Nets Decision Nets Markov Processes Static Sequential Representation Reasoning Technique Variable Elimination

Other Representational Dimensions We've already discussed: Problem Types (Static vs. Sequential ) Deterministic versus stochastic domains Some other important dimensions Representation scheme: Explicit state or features or relations Flat or hierarchical representation Knowledge given versus knowledge learned from experience Goals versus complex preferences Single-agent vs. multi-agent

Today’s Lecture Recap from last lecture Other representational dimensions AI applications

Explicit State vs Features How do we model the environment? You can enumerate the states of the world OR A state can be described in terms of features Often a more natural description 30 binary features (also called propositions) can represent

Explicit State vs Features How do we model the environment? You can enumerate the states of the world. A state can be described in terms of features Often a more natural description 30 binary features (also called propositions) can represent 2 30 =1,073,741,824 states

Explicit State vs Features Mars Explorer Example Weather Temperature Longitude Latitude One possible state Number of possible states (mutually exclusive) {S, -30, 320, 210} 2 x 81 x 360 x 180 {S, C} [-40, 40] [0, 359] [0, 179]

Explicit State vs. Features vs. Relations States can also be described in terms of objects and relationships There is a proposition for each relationship on each tuple of objects University Example: Students (S) = {s1, s2, s3, …, s200) Courses (C) = {c1, c2, c3, …, c10} Registered (S, C) Number of Relations: Number of Propositions: *

Explicit State vs. Features vs. Relations States can be described in terms of objects and relationships There is a proposition for each relationship on each tuple of objects University Example: Students (S) = {s1, s2, s3, …, s200) Courses (C) = {c1, c2, c3, …, c10} Registered (S, C) Number of Relations: Number of Propositions: Number of States: *

Explicit State vs. Features vs. Relations States can be described in terms of objects and relationships There is a proposition for each relationship on each tuple of objects University Example: Students (S) = {s1, s2, s3, …, s200) Courses (C) = {c1, c2, c3, …, c10} Registered (S, C) Number of Relations: 1 Number of Propositions: Number of States: *10

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 …. This course: mainly flat representations Hierarchical representations required for scaling up. 15

Knowledge given vs. knowledge learned from experience The agent is provided with a model of the world once and far 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 This course: mostly knowledge given Learning: CPSC 340 and CPSC 422

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 that the agent wants to be in there is some proposition or set of propositions that the agent wants to make true An agent may have preferences 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 This course: goals and simple preferences 17 What beverage to order? The sooner I get one the better Cappuccino better than Espresso, but…

Single-agent vs. Multi-agent 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, how they react to our actions Other agents can be: cooperative, competitive, or a bit of both This course: only single agent scenario 18

Summary Would like most general agents possible, but in this course we need to restrict ourselves to: Flat representations (vs. hierarchical) Knowledge given (vs. knowledge learned) Goals and simple preferences (vs. complex preferences) Single-agent scenarios (vs. multi-agent scenarios) We will look at Deterministic and stochastic domains Static and Sequential problems As see examples of representations using Explicit state or features or relations 19

Today’s Lecture Recap from last lecture Other representational dimensions AI applications

Features vs. States, another example 21 F 11 : student 1 takes course 1 F 12 : student 1 takes course 2 F 21 : student 2 takes course 1 F 22 : student 2 takes course 2 How many possible states?

Intelligent Agents in the World Natural Language Understanding + Computer Vision Speech Recognition + Physiological Sensing Mining of Interaction Logs Knowledge Representation Machine Learning Reasoning + Decision Theory + Robotics + Human Computer /Robot Interaction Natural Language Generation abilities

What does it do Goals prior knowledge needed past experiences that it does (or could) learn Observations needed Actions performed AI technologies used Why is it intelligent? Evaluation?

Representational Dimensions Environment Problem Type Deterministic Stochastic Static Sequential

Bring Colored Cards Read Ch 3 ( ) TODO for next week