Representational Dimensions CPSC 322 – Intro 2 January 7, 2011 Textbook § 1.4 - 1.5.

Slides:



Advertisements
Similar presentations
Computer Science CPSC 322 Lecture 3 AI Applications.
Advertisements

Decision Theory: Sequential Decisions Computer Science cpsc322, Lecture 34 (Textbook Chpt 9.3) Nov, 28, 2012.
IEOR 4004: Introduction to Operations Research Deterministic Models January 22, 2014.
CPSC 322, Lecture 4Slide 1 Search: Intro Computer Science cpsc322, Lecture 4 (Textbook Chpt ) Sept, 11, 2013.
Introduction to Artificial Intelligence
Intelligent Agents Russell and Norvig: 2
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.
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 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.
CSE 471/598, CBS 598 Intelligent Agents TIP We’re intelligent agents, aren’t we? Fall 2004.
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 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 531 Artificial Intelligence Ch.1 [P]: Artificial Intelligence and Agents.
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.
What is Artificial Intelligence? CPSC Intro 1 January 5, 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,
1 Chapter 19 Intelligent Agents. 2 Chapter 19 Contents (1) l Intelligence l Autonomy l Ability to Learn l Other Agent Properties l Reactive Agents l Utility-Based.
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,
Applications of AI Jim Little UBC CS 322 – Intro 3 September 8, 2014 Textbook §
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 §
Artificial Intelligence
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.
Agents CPSC 386 Artificial Intelligence Ellen Walker Hiram College.
Adversarial Search Chapter Games vs. search problems "Unpredictable" opponent  specifying a move for every possible opponent reply Time limits.
Algorithmic, Game-theoretic and Logical Foundations
Rational Agency CSMC Introduction to Artificial Intelligence January 8, 2007.
Rational Agency CSMC Introduction to Artificial Intelligence January 8, 2004.
CPSC 322, Lecture 4Slide 1 Search: Intro Computer Science cpsc322, Lecture 4 (Textbook Chpt ) Sept, 12, 2012.
1 Intro to Artificial Intelligence COURSE # CSC384H1F Fall 2008 Sonya Allin Note: many slides drawn from/inspired by Andrew Moore’s lectures at CMU and.
CSE 471/598 Intelligent Agents TIP We’re intelligent agents, aren’t we?
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.
Introduction: What is AI? CMSC Introduction to Artificial Intelligence January 3, 2002.
CS382 Introduction to Artificial Intelligence Lecture 1: The Foundations of AI and Intelligent Agents 24 January 2012 Instructor: Kostas Bekris Computer.
Decision Theory: Single & Sequential Decisions. VE for Decision Networks. CPSC 322 – Decision Theory 2 Textbook §9.2 April 1, 2011.
Introduction: What is AI? CMSC Introduction to Artificial Intelligence January 7, 2003.
Intelligent Agents Chapter 2. How do you design an intelligent agent? Definition: An intelligent agent perceives its environment via sensors and acts.
Computer Science CPSC 322 Lecture 2 Representational Dimensions, Search Intro 1.
ECE457 Applied Artificial Intelligence R. Khoury (2007)Page 1 Please pick up a copy of the course syllabus from the front desk.
Constraint Satisfaction Problems (CSPs) Introduction
Computer Science cpsc322, Lecture 4
Representational Dimensions Computer Science cpsc322, Lecture 2
Understanding Agent Knowledge through Conversation
Planning: Forward Planning and CSP Planning
Constraint Satisfaction Problems (CSPs) Introduction
Planning: Representation and Forward Search
Artificial Intelligence Lecture No. 5
Intelligent Agents Chapter 2.
© James D. Skrentny from notes by C. Dyer, et. al.
Decision Theory: Single Stage Decisions
Planning: Representation and Forward Search
Decision Theory: Sequential Decisions
Decision Theory: Single Stage Decisions
Artificial Intelligence: Logic agents
Domain Splitting CPSC 322 – CSP 4 Textbook §4.6 February 4, 2011.
Chapter 1: Computational Intelligence and Knowledge
Planning: Representation and Forward Search
Presentation transcript:

Representational Dimensions CPSC 322 – Intro 2 January 7, 2011 Textbook §

Colored Cards Please come to the front and pick up –4 index cards –2 Post-it per colour (Blue, Yellow, Green, Pink) Use this material to make 4 “voting cards” as below –Low budget variant of clickers Please bring them to class every time 2

Today’s Lecture Recap from last lecture Representation and Reasoning An Overview of This Course Further Representational Dimensions 3

Teaching team & office hours Instructor –Frank Hutter Beta lab, ICICS Monday, Wednesday, Friday, 4-4:30pm in ICICS X530 TAs –All office hours in the Demco Learning Center: ICICS X150 (behind Reboot Cafe) –Simona Radu Monday, 11am-12pm. –Vasanth Rajendran Thursday, 3pm-4pm –Mike Chiang Wed 1- 2pm 4

Website: Main Textbook –Artificial Intelligence: Foundations of Computational Agents. By Poole and Mackworth. (P&M) –Available electronically (free) –We will cover Chapters: 1, 3, 4, 5, 6, 8, 9 WebCT –Assignments posted there –Practice exercises (ungraded) –Learning goals –Discussion board –Check it often Course Essentials 5

What is Artificial Intelligence? We use the following definition Systems that think like humans Systems that think rationally Systems that act rationally Systems that act like humans 6

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 7

Today’s Lecture Recap from last lecture Representation and Reasoning An Overview of This Course Further Representational Dimensions 8

Representation and Reasoning To use these inputs an agent needs to represent them  knowledge One of AI goals: specify how a system can Acquire and represent knowledge about a domain (representation) Use the knowledge to solve problems in that domain (reasoning)

Representation and Reasoning (R&R) System Problem representation computation A representation language that allows to describe –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 Choice of an appropriate R&R system depends on –Various properties of the environment, the agent, the computational resources, the type of problems, etc 10

What do we want from a representation? We want a representation to be: –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 of accuracy and computation time 11

We want a representation for a problem to be… 12 … as general as possible … as close to the problem as possible

Today’s Lecture Recap from last lecture Representation and Reasoning An Overview of This Course Further Representational Dimensions 13

High-level overview of this course This course will emphasize two main themes: Reasoning –How should an agent act given the current state of its environment and its goals? Representation –How should the environment be represented in order to help an agent to reason effectively? 14

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 15

1. Deterministic vs. Stochastic Domains Historically, AI has been divided into two camps: –those who prefer representations based on logic –those who prefer probability Is the agent's knowledge certain or uncertain? –Poker vs. chess Is the environment deterministic or stochastic? –Is the outcome of an action certain? E.g. slippage in a robot Some of the most exciting current research in AI is actually building bridges between these camps 16

2. Static vs. Sequential Domains How many actions does the agent need to select? The agent needs to take a single action –solve a Sudoku –diagnose a patient with a disease The agent needs to take a sequence of actions –navigate through an environment to reach a goal state –bid in online auctions to purchase a desired good –decide sequence of tests to enable a better diagnosis of the patient Caveat: Distinction between the two can be a bit artificial –In deterministic domains, we can redefine actions (e.g., fill in individual numbers in the Sudoku vs. solving the whole thing) –Not in stochastic domains 17

3. Explicit State vs. Features How do we model the environment? You can enumerate the possible states of the world A state can be described in terms of features –Often the more natural description –30 binary features can represent 2 30 =1,073,741,824 states 18

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

3. 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: *

3. 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: 200*10 = 2000 –Number of States: *

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

Example reasoning tasks for delivery robot “find path in known map” 23 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?”

Today’s Lecture Recap from last lecture Representation and Reasoning An Overview of This Course Further Representational Dimensions 24

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 25

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, Mexico Delivery robot: Plan on level of cities, districts, buildings, … This course: only flat representations –Hieararchical representations pose mainly engineering problems 26

5. 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 Delivery robot: Known/learned map, prob. of slipping, … This course: mostly knowledge given Learning: CPSC 340

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 28

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, competitive, or a bit of both 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 29

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 30

Summary(1) Would like most general agents possible, but to start we need to restrict ourselves to: 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 31

Summary (2) Right representation: Rich enough but close to the problem Course Map: 32 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

TODOs For Monday: carefully read Section 1.6 –Prototypical applications For Wednesday: Assignment 0 –Available on WebCT –This class should have covered all you need to know for the assignment –Section 1.5 & 1.6 in the textbook will also be particularly helpful 33