CPSC 322, Lecture 2Slide 1 Representational Dimensions Computer Science cpsc322, Lecture 2 (Textbook Chpt1) January, 7, 2009.

Slides:



Advertisements
Similar presentations
Computer Science CPSC 322 Lecture 25 Top Down Proof Procedure (Ch 5.2.2)
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 4Slide 1 Search: Intro Computer Science cpsc322, Lecture 4 (Textbook Chpt ) Sept, 11, 2013.
Department of Computer Science Undergraduate Events More
Slide 1 Planning: Representation and Forward Search Jim Little UBC CS 322 October 10, 2014 Textbook §8.1 (Skip )- 8.2)
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.
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.
CPSC 322, Lecture 16Slide 1 Stochastic Local Search Variants Computer Science cpsc322, Lecture 16 (Textbook Chpt 4.8) February, 9, 2009.
CPSC 322, Lecture 26Slide 1 Reasoning Under Uncertainty: Belief Networks Computer Science cpsc322, Lecture 27 (Textbook Chpt 6.3) March, 16, 2009.
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 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 18Slide 1 Planning: Heuristics and CSP Planning Computer Science cpsc322, Lecture 18 (Textbook Chpt 8) February, 12, 2010.
CPSC 322, Lecture 10Slide 1 Finish Search Computer Science cpsc322, Lecture 10 (Textbook Chpt 3.6) January, 25, 2010.
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 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.
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.
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 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 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.
Department of Computer Science Undergraduate Events More
Constraint Satisfaction Problems (CSPs) CPSC 322 – CSP 1 Poole & Mackworth textbook: Sections § Lecturer: Alan Mackworth September 28, 2012.
Reasoning Under Uncertainty: Conditioning, Bayes Rule & the Chain Rule Jim Little Uncertainty 2 Nov 3, 2014 Textbook §6.1.3.
CPSC 322, Lecture 19Slide 1 (finish Planning) Propositional Logic Intro, Syntax Computer Science cpsc322, Lecture 19 (Textbook Chpt – 5.2) Oct,
Arc Consistency CPSC 322 – CSP 3 Textbook § 4.5 February 2, 2011.
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.
Domain Splitting, Local Search CPSC 322 – CSP 4 Textbook §4.6, §4.8 February 4, 2011.
Decision Theory: Single & Sequential Decisions. VE for Decision Networks. CPSC 322 – Decision Theory 2 Textbook §9.2 April 1, 2011.
CPSC 322, Lecture 10Slide 1 Finish Search Computer Science cpsc322, Lecture 10 (Textbook Chpt 3.6) Sep, 26, 2010.
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
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
Planning: Forward Planning and CSP Planning
Constraint Satisfaction Problems (CSPs) Introduction
Reasoning Under Uncertainty: Conditioning, Bayes Rule & Chain Rule
Planning: Representation and Forward Search
Decision Theory: Single Stage Decisions
Planning: Heuristics and CSP Planning
Planning: Heuristics and CSP Planning
CSPs: Search and Arc Consistency Computer Science cpsc322, Lecture 12
Planning: Representation and Forward Search
Planning: Heuristics and CSP Planning
Decision Theory: Sequential Decisions
Decision Theory: Single Stage Decisions
Probability and Time: Markov Models
Logic: Domain Modeling /Proofs + Computer Science cpsc322, Lecture 22
Domain Splitting CPSC 322 – CSP 4 Textbook §4.6 February 4, 2011.
Planning: Representation and Forward Search
Presentation transcript:

CPSC 322, Lecture 2Slide 1 Representational Dimensions Computer Science cpsc322, Lecture 2 (Textbook Chpt1) January, 7, 2009

CPSC 322, Lecture 2Slide 2 Announcement (1) : Need to talk at the end of lecture (missing prereqs for 322)

Announcement (2): Industry Panel Date: Thursday, Jan 15, 5:30-7:30 Time: 5:30 – 6:30 pm : Panel Discussion 6:30 – 7:30 pm : Networking Session Place: DMP 110 : Panel Discussion X-wing Student Lounge : Networking Session Theme: How to Prepare Yourself to be Leaders in IT Speakers: David Fracchia, VP Technology, Radical Entertainment David Hunter, VP Operations and Academic Research Centre, SAP Gail Murphy, COO, Tasktop Technologies, Prof., UBC CS Dept. Sheri Plewes, VP Planning & Engineering, Translink Tim Richards, Manager, IS Operations, TELUS Food and beverages will be provided! CPSC 322, Lecture 2Slide 3

CPSC 322, Lecture 2Slide 4 Lecture Overview Recap from last lecture Representation and Reasoning An Overview of This Course Further Dimensions of Representational Complexity

CPSC 322, Lecture 2Slide 5 Course Essentials Course web-page : CHECK IT OFTEN! Textbook: Available on WebCT (wait to print all Chps… they may change a little!) We will cover at least Chapters: 1, 3, 4, 5, 6, 8, 9 WebCT: used for textbook, discussion board…. AIspace : online tools for learning Artificial Intelligence Lecture slides… Midterm exam, Wed, Mar 4 (1.5 hours, regular room)

CPSC 322, Lecture 2Slide 6 Agents acting in an environment Representation & Reasoning

CPSC 322, Lecture 2Slide 7 Lecture Overview Recap from last lecture Representation and Reasoning An Overview of This Course Further Dimensions of Representational Complexity

CPSC 322, Lecture 2Slide 8 What do we need to represent ? The environment /world : What different configurations (states / possible worlds) can the world be in, and how do we denote them? Chessboard, Info about a patient, Robot Location How the world works (we will focus on) Constraints: sum of current into a node = 0 Causal: what are the causes and the effects of brain disorders? Actions preconditions and effects: when can I press this button? What happens if I press it?

CPSC 322, Lecture 2Slide 9 Corresponding Reasoning Tasks / Problems Constraint Satisfaction – Find state that satisfies set of constraints. E.g., What is a feasible schedule for final exams? Inference – Is a given proposition true/likely given what is known? E.g., Does this patient suffers from viral hepatitis? Planning – Find sequence of actions to reach a goal state. E.g., Navigate through and environment to reach a particular location

CPSC 322, Lecture 2Slide 10 Representation and Reasoning System A (representation) language in which the environment and how it works can be described Computational (reasoning) procedures to compute a solution to a problem in that environment (an answer, a sequence of actions) But the choice of an appropriate R&R system depends on a key property of the environment and of the agent’s knowledge

CPSC 322, Lecture 2Slide 11 Deterministic vs. Stochastic Domains Is the environment deterministic or stochastic? Is the agent's knowledge certain or uncertain? A. Does the agent knows for sure what the effects of its actions are? B. Can the agent fully observe the current state of the world? Chess Poker Factory Floor Doctor Diagnosis Doctor Treatment

CPSC 322, Lecture 2Slide 12 Deterministic vs. Stochastic Domains Historically, AI has been divided into two camps: those who prefer representations based on logic and those who prefer probability. A few years ago, CPSC 322 covered logic, while CPSC 422 introduced probability: now we introduce both representational families in 322, and 422 goes into more depth this should give you a better idea of what's included in AI Note: Some of the most exciting current research in AI is actually building bridges between these camps.

CPSC 322, Lecture 2Slide 13 Lecture Overview Recap from last lecture Representation and Reasoning An Overview of This Course Further Dimensions of Representational Complexity

CPSC 322, Lecture 2Slide 14 Modules we'll cover in this course: R&Rsys Environment Problem Inference Planning Deterministic Stochastic Search Arc Consistency Search Value Iteration Var. Elimination Constraint Satisfaction Logics STRIPS Belief Nets Vars + Constraints Decision Nets Markov Processes Var. Elimination Static Sequential Representation Reasoning Technique

CPSC 322, Lecture 2Slide 15 Lecture Overview Recap from last lecture Representation An Overview of This Course Further Dimensions of Representational Complexity

CPSC 322, Lecture 2Slide 16 Dimensions of Representational Complexity We've already discussed: Reasoning tasks (Static vs. Sequential ) Deterministic versus stochastic domains Some other important dimensions of complexity: Explicit state or propositions or relations Flat or hierarchical Knowledge given versus knowledge learned from experience Goals versus complex preferences Single-agent vs. multi-agent

CPSC 322, Lecture 2Slide 17 Explicit State or propositions How do we model the environment? You can enumerate the states of the world. A state can be described in terms of features Often it is more natural to describe states in terms of assignments of values to variables (features). 30 binary features (also called propositions) can represent 2 30 = 1,073,741,824 states. Mars Explorer Example Weather Temperature LocX LocY

CPSC 322, Lecture 2Slide 18 Explicit State or propositions or relations Features can be described in terms of objects and relationships. There is a proposition for each relationship on each “possible” tuple of individuals. Textbook example: One binary relation and 10 individuals can represents 10 2 =100 propositions and states! University Example Registred(S,C) Students (S) = { } Courses (C) = { }

CPSC 322, Lecture 2Slide 19 Flat or hierarchical Is it useful to model the whole world at the same level of abstraction? You can model the world at one level of abstraction: flat You can model the world at multiple levels of abstraction: hierarchical Example: Planning a trip from here to a resort in Cancun, Mexico

CPSC 322, Lecture 2Slide 20 Knowledge given vs. knowledge learned from experience The agent is provided with a model of the world once and far all 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

CPSC 322, Lecture 2Slide 21 Goals versus complex preferences An agent may have complex preferences e.g., there is some preference function that describes how happy the agent is in each state of the world; the agent's task is to put the world into a state which makes it as happy as possible 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 What beverage to order? The sooner I get one the better Cappuccino better than Espresso

CPSC 322, Lecture 2Slide 22 Single-agent vs. Multiagent domains Does the environment include other agents? Everything we've said so far presumes that there is only one agent in the environment. If there are other agents whose actions affect us, it can be useful to explicitly model their goals and beliefs rather than considering them to be part of the environment Other Agents can be: cooperative, competitive, or a bit of both

CPSC 322, Lecture 2Slide 23 Dimensions of Representational Complexity in CPSC322 Reasoning tasks (Constraint Satisfaction / Logic&Probabilistic Inference / Planning) Deterministic versus stochastic domains Some other important dimensions of complexity: Explicit state or propositions or relations Flat or hierarchical Knowledge given versus knowledge learned from experience Goals versus complex preferences Single-agent vs. multi-agent

CPSC 322, Lecture 2Slide 24 Next class Assignment 0 due: submit electronically and you can't use late days Come to class ready to discuss the two examples of fielded AI agents you found I'll show some pictures of cool applications in that class Read carefully Section 1.6 on textbook: “Example Applications” The Tutoring System The trading agent The autonomous delivery robot The diagnostic assistant

CPSC 322, Lecture 2Slide 25

CPSC 322, Lecture 2Slide 26 Perfect rationality versus 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 /answer is. Bounded rationality: the agent must make good decisions based on its perceptual, computational and memory limitations.

CPSC 322, Lecture 2Slide 27 What do we want from a representation? rich enough to express the knowledge needed to solve the problem. as close to the problem as possible: compact, natural and maintainable. amenable to efficient computation; able to express features of the problem we can exploit for computational gain. learnable from data and past experiences. able to trade off accuracy and computation time.

CPSC 322, Lecture 2Slide 28 Static vs. Sequential Domains: Caveat Important caveat: in deterministic domains, the distinction between static and sequential settings may seem somewhat artificial we can redefine actions (e.g., fill in individual numbers in the Sudoku vs. solving the whole thing) indeed, some of the same techniques work in both settings the same cannot be said about stochastic domains

CPSC 322, Lecture 2Slide 29 Representation and Reasoning System ) A (representation) language in which a problem in an environment can be described symbolically Computational (reasoning) procedures to compute a solution to the problem (an answer, a sequence of actions)

CPSC 322, Lecture 2Slide 30 Overview of this course This course will emphasize two main themes: Representation How should the problem be represented in order to help an agent to reason effectively Reasoning How should an agent select an answer/sequence of actions that solve the problem (that achieves its goals)

CPSC 322, Lecture 2Slide 31 Example RRSs Programming Language: Python, Java,.. Natural Language We want something between these extremes!

CPSC 322, Lecture 2Slide 32 Two Key Representations considered in this course Problems Constraint Satisfaction – Find state that satisfies set of constraints? Inference – Is a given proposition true given what is known? What is its probability Planning – Find sequence of actions to reach a goal state Domain/Environment: Deterministic vs. stochastic