Chapter 10 (part 3): Using Uncertain Knowledge

Slides:



Advertisements
Similar presentations
Decision Theory: Sequential Decisions Computer Science cpsc322, Lecture 34 (Textbook Chpt 9.3) Nov, 28, 2012.
Advertisements

Making Simple Decisions Chapter 16 Some material borrowed from Jean-Claude Latombe and Daphne Koller by way of Marie desJadines,
Making Simple Decisions
Knowledge Representation and Reasoning University "Politehnica" of Bucharest Department of Computer Science Fall 2010 Adina Magda Florea
Introduction to Artificial Intelligence
Department of Computer Science Undergraduate Events More
PROBABILITY. Uncertainty  Let action A t = leave for airport t minutes before flight from Logan Airport  Will A t get me there on time ? Problems :
Managerial Decision Modeling with Spreadsheets
THE HONG KONG UNIVERSITY OF SCIENCE & TECHNOLOGY CSIT 5220: Reasoning and Decision under Uncertainty L09: Graphical Models for Decision Problems Nevin.
CPSC 322, Lecture 2Slide 1 Representational Dimensions Computer Science cpsc322, Lecture 2 (Textbook Chpt1) Sept, 6, 2013.
1 Slides for the book: Probabilistic Robotics Authors: Sebastian Thrun Wolfram Burgard Dieter Fox Publisher: MIT Press, Web site for the book & more.
A camper awakens to the growl of a hungry bear and sees his friend putting on a pair of running shoes, “You can’t outrun a bear,” scoffs the camper. His.
Decision Making Under Uncertainty Jim Little Decision 1 Nov
CPSC 502, Lecture 11Slide 1 Introduction to Artificial Intelligence (AI) Computer Science cpsc502, Lecture 11 Oct, 18, 2011.
UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering CSCE 580 Artificial Intelligence Ch.6 [P]: Reasoning Under Uncertainty Section.
Decision Theory: Single Stage Decisions Computer Science cpsc322, Lecture 33 (Textbook Chpt 9.2) March, 30, 2009.
Decision Theory: Sequential Decisions Computer Science cpsc322, Lecture 34 (Textbook Chpt 9.3) April, 1, 2009.
UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering CSCE 580 Artificial Intelligence Ch.5 [P]: Propositions and Inference Sections.
CS 547: Sensing and Planning in Robotics Gaurav S. Sukhatme Computer Science Robotic Embedded Systems Laboratory University of Southern California
Making Simple Decisions Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 16.
UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering CSCE 580 Artificial Intelligence Ch.6: Adversarial Search Fall 2008 Marco Valtorta.
UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering CSCE 580 Artificial Intelligence Ch.6 [P]: Reasoning Under Uncertainty Sections.
Decision Theory: Sequential Decisions Computer Science cpsc322, Lecture 34 (Textbook Chpt 9.3) April, 12, 2010.
Probabilistic Robotics Introduction Probabilities Bayes rule Bayes filters.
UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering CSCE 580 Artificial Intelligence Ch.2 [P]: Agent Architectures and Hierarchical.
“ The one word that makes a good manager – decisiveness.”
An Introduction to Artificial Intelligence Chapter 13 & : Uncertainty & Bayesian Networks Ramin Halavati
1 Reasoning Under Uncertainty Artificial Intelligence Chapter 9.
DECISION MAKING TOOLS 1. Elements of Decision Problems 2.
1 Chapter 17 2 nd Part Making Complex Decisions --- Decision-theoretic Agent Design Xin Lu 11/04/2002.
CPSC 322, Lecture 2Slide 1 Representational Dimensions Computer Science cpsc322, Lecture 2 (Textbook Chpt1) Sept, 7, 2012.
Probabilistic Robotics Introduction Probabilities Bayes rule Bayes filters.
Decision Theory: Single & Sequential Decisions. VE for Decision Networks. CPSC 322 – Decision Theory 2 Textbook §9.2 April 1, 2011.
Chapter 16 March 25, Probability Theory: What an agent should believe based on the evidence Utility Theory: What the agent wants Decision Theory:
Probabilistic Robotics Probability Theory Basics Error Propagation Slides from Autonomous Robots (Siegwart and Nourbaksh), Chapter 5 Probabilistic Robotics.
Decision Making ECE457 Applied Artificial Intelligence Spring 2007 Lecture #10.
Example: Localization for “Pushed around” Robot
Nevin L. Zhang Room 3504, phone: ,
Chapter 5: Representing Knowledge
Business Modeling Lecturer: Ing. Martina Hanová, PhD.
Making Simple Decisions
Chapter 10: Using Uncertain Knowledge
ECE457 Applied Artificial Intelligence Fall 2007 Lecture #10
CSCE 580 Artificial Intelligence Ch
ECE457 Applied Artificial Intelligence Spring 2008 Lecture #10
Chapter 11: Learning Introduction
Chapter 7: Beyond Definite Knowledge
Expectimax Lirong Xia. Expectimax Lirong Xia Project 2 MAX player: Pacman Question 1-3: Multiple MIN players: ghosts Extend classical minimax search.
Planning Under Uncertainty Computer Science cpsc322, Lecture 11
CS 4/527: Artificial Intelligence
Decision Theory: Single Stage Decisions
Markov Decision Processes
Markov Decision Processes
Rational Decisions and
Decision Theory: Single & Sequential Decisions.
Decision Theory: Sequential Decisions
CS 188: Artificial Intelligence Fall 2008
Decision Theory: Single Stage Decisions
CS 188: Artificial Intelligence Fall 2007
13. Acting under Uncertainty Wolfram Burgard and Bernhard Nebel
VE for Decision Networks,
QUANTITATIVE METHODS 1 SAMIR K. SRIVASTAVA.
Expectimax Lirong Xia.
Making Simple Decisions
Chapter 12: Building Situated Robots
Chapter 1: Computational Intelligence and Knowledge
Representations & Reasoning Systems (RRS) (2.2)
Decision Making.
Making Simple Decisions
Sets, Combinatorics, Probability, and Number Theory
Presentation transcript:

Chapter 10 (part 3): Using Uncertain Knowledge Making Decisions Under Uncertainty D. Poole, A. Mackworth, and R. Goebel, Computational Intelligence: A Logical Approach, Oxford University Press, January 1998

Making Decisions Under Uncertainty What an agent should do depends on: What the agent believes. You may be tempted to say “what is true in the world”, but when an agent does not know what is true in the world, it acts only on its beliefs. Sensing the world updates the agent’s beliefs by conditioning on what is sensed. The agent’s goals. When an agent has to reason under uncertainty, it has to consider not only what will “most likely” happen but everything that “may” happen (role of expectations). Decision theory specifies how to trade off the desirability (reducing good outcomes but reducing disastrous outcomes) and probabilities of the possible outcomes for competing actions. Dr. Djamel Bouchaffra CS 426 Artificial Intelligence, Ch10 (part 3): Using Uncertain Knowledge

Decision Variables Decision variables are like random variables (without pdf) that an agent gets to choose the value of. A possible world (outcome) specifies the value for each decision variable and each random variable. The probability of a proposition (or outcome) is undefined unless you condition on the values of all decision variables. Dr. Djamel Bouchaffra CS 426 Artificial Intelligence, Ch10 (part 3): Using Uncertain Knowledge

Decision Tree for Delivery Robot The robot can choose to “wear pads” to protect itself or not. The robot can choose go the “short way” past the stairs or a “long way” that reduces the chance of an accident. There is one random variable of whether there is an accident. Dr. Djamel Bouchaffra CS 426 Artificial Intelligence, Ch10 (part 3): Using Uncertain Knowledge

Expected Values The expected value of a numerical random variable is its average value, weighting possible worlds by their probabilities. Suppose V is a numerical random variable and w is a possible world. Let  (V, w) be the value x such that w V = x. The expected value of V is The conditional expected value of V given e is Probability of the outcome w Value of V in the outcome w Probability of outcome w given the evidence e Dr. Djamel Bouchaffra CS 426 Artificial Intelligence, Ch10 (part 3): Using Uncertain Knowledge

Utility Utility (real random variable) is a measure of desirability of worlds to an agent (the world that results from the decision!). Utility = 1/cost Let U be a real-valued random variable such that (U, w) represents how good the world (or outcome) is to an agent. Simple goals can be specified by: worlds that satisfy the goal have utility 1: other worlds have utility 0. Often utilities are more complicated: for example, made up from the amount of damage to a robot, how much energy it has used up, what goals are achieved, and how much time it has taken. Dr. Djamel Bouchaffra CS 426 Artificial Intelligence, Ch10 (part 3): Using Uncertain Knowledge

Single Decisions In a single decision, the agent chooses a value for each decision variable. Let the compound decision variable d be the tuple of all original decision variables. The agent can choose d = di for any di  dom(d). The expected utility of decision d = di is E(U|d = di). An optimal single decision is the decision d = dmax whose expected utility is maximal: Stock-Market Prediction: is it time to sell, to buy, or to hold shares in order to maximize the profit (utility) ? Dr. Djamel Bouchaffra CS 426 Artificial Intelligence, Ch10 (part 3): Using Uncertain Knowledge

Example Delivery Robot: a single decision: <pads, which_way> The single decision is the complex decision variable: a single decision: <pads, which_way> a possible world = <wear_pads,short,accident> E(U | pads = wear_pads  which_way = short) = P(accident | wear_pads  which_way=short) . Utility(w0) + (1-P(accident | wear_pads  which_way = short)) . Utility(w1). Utility(w0), Utility(w1) are known by the decision maker Conditional probabilities are provided as well. We can then compute the optimal decision amongst the 4 possible decisions. Dr. Djamel Bouchaffra CS 426 Artificial Intelligence, Ch10 (part 3): Using Uncertain Knowledge

Sequential Decisions An intelligent agent doesn’t make a multi-step decision and carry it out without considering revising it based on future information. A more typical scenario is where the agent: observes, acts, observes, acts, … Subsequent actions can depend on what is observed. What is observed depends on previous actions. Often the sole reason for carrying out an action is to provide information for future actions. For example: diagnostic tests, spying. Dr. Djamel Bouchaffra CS 426 Artificial Intelligence, Ch10 (part 3): Using Uncertain Knowledge

Decision Networks A decision network is a graphical representation of a finite sequential decision problem. Decision networks extend belief networks to include decision variables and utility. A decision network is a DAG with three types of nodes: Chance nodes (ellipses) as in belief networks. Decision nodes (rectangles) labeled with decision variables. Arcs into decision nodes show the information that will be available when the decision is made. A value node (diamond) represents the utility. Arcs into the value node show the variables the utility depends on. Dr. Djamel Bouchaffra CS 426 Artificial Intelligence, Ch10 (part 3): Using Uncertain Knowledge

Decision Network for the Delivery Robot Problem This shows explicitly which nodes affect whether there is an accident. Dr. Djamel Bouchaffra CS 426 Artificial Intelligence, Ch10 (part 3): Using Uncertain Knowledge

Decision Network for the Alarm Problem Dr. Djamel Bouchaffra CS 426 Artificial Intelligence, Ch10 (part 3): Using Uncertain Knowledge