Probability: Review. Pieter Abbeel UC Berkeley EECS. Many slides adapted from Thrun, Burgard and Fox, Probabilistic Robotics

Similar documents
Introduction to Mobile Robotics Probabilistic Robotics

Uncertainty Chapter 13. Mausam (Based on slides by UW-AI faculty)

Probabilistic Robotics. Slides from Autonomous Robots (Siegwart and Nourbaksh), Chapter 5 Probabilistic Robotics (S. Thurn et al.

Modeling and state estimation Examples State estimation Probabilities Bayes filter Particle filter. Modeling. CSC752 Autonomous Robotic Systems

Markov localization uses an explicit, discrete representation for the probability of all position in the state space.

Probabilistic Robotics Sebastian Thrun-- Stanford

Probabilistic Robotics

Review of Probability

Particle Filters. Pieter Abbeel UC Berkeley EECS. Many slides adapted from Thrun, Burgard and Fox, Probabilistic Robotics

Review of Elementary Probability Lecture I Hamid R. Rabiee

3.0 PROBABILITY, RANDOM VARIABLES AND RANDOM PROCESSES

V-0. Review of Probability

CS491/691: Introduction to Aerial Robotics

Mobile Robotics II: Simultaneous localization and mapping

Introduction to Mobile Robotics Probabilistic Sensor Models

INF Anne Solberg One of the most challenging topics in image analysis is recognizing a specific object in an image.

INF Introduction to classifiction Anne Solberg Based on Chapter 2 ( ) in Duda and Hart: Pattern Classification

CS188 Outline. CS 188: Artificial Intelligence. Today. Inference in Ghostbusters. Probability. We re done with Part I: Search and Planning!

Maximum Likelihood (ML), Expectation Maximization (EM) Pieter Abbeel UC Berkeley EECS

Math 180B Problem Set 3

Sensors Fusion for Mobile Robotics localization. M. De Cecco - Robotics Perception and Action

Markov Models and Hidden Markov Models

Introduction to Mobile Robotics Bayes Filter Particle Filter and Monte Carlo Localization

Introduction to Stochastic Processes

INF Introduction to classifiction Anne Solberg

Week 3: Wheeled Kinematics AMR - Autonomous Mobile Robots

Fault Detection and Diagnosis Using Information Measures

Manipulators. Robotics. Outline. Non-holonomic robots. Sensors. Mobile Robots

L03. PROBABILITY REVIEW II COVARIANCE PROJECTION. NA568 Mobile Robotics: Methods & Algorithms

Summary of lecture 8. FIR Wiener filter: computed by solving a finite number of Wiener-Hopf equations, h(i)r yy (k i) = R sy (k); k = 0; : : : ; m

Robots Autónomos. Depto. CCIA. 2. Bayesian Estimation and sensor models. Domingo Gallardo

CS 188: Artificial Intelligence Spring Announcements

Localization. Howie Choset Adapted from slides by Humphrey Hu, Trevor Decker, and Brad Neuman

Dept. of Linguistics, Indiana University Fall 2015

EKF, UKF. Pieter Abbeel UC Berkeley EECS. Many slides adapted from Thrun, Burgard and Fox, Probabilistic Robotics

EKF, UKF. Pieter Abbeel UC Berkeley EECS. Many slides adapted from Thrun, Burgard and Fox, Probabilistic Robotics

CSE 473: Artificial Intelligence Probability Review à Markov Models. Outline

Mobile Robot Localization

COIN TOSS MODELING RĂZVAN C. STEFAN, TIBERIUS O. CHECHE

Reinforcement Learning Wrap-up

Monte Carlo integration

Autonomous Mobile Robot Design

CS 4649/7649 Robot Intelligence: Planning

CS 361: Probability & Statistics

CS 343: Artificial Intelligence

Summary of Random Variable Concepts March 17, 2000

Mobile Robot Localization

Partially Observable Markov Decision Processes (POMDPs) Pieter Abbeel UC Berkeley EECS

Recursive Bayes Filtering

Robotics. Mobile Robotics. Marc Toussaint U Stuttgart

CS 188: Artificial Intelligence

Robot Localisation. Henrik I. Christensen. January 12, 2007

Mathematical Formulation of Our Example

Ling 289 Contingency Table Statistics

Probabilistic Robotics

Conservation of Linear Momentum for a Differential Control Volume

CSE 473: Artificial Intelligence

MAE 493G, CpE 493M, Mobile Robotics. 6. Basic Probability

Notes on Probability

CS 343: Artificial Intelligence

Probability Theory. Introduction to Probability Theory. Principles of Counting Examples. Principles of Counting. Probability spaces.

CS188 Outline. We re done with Part I: Search and Planning! Part II: Probabilistic Reasoning. Part III: Machine Learning

EE565:Mobile Robotics Lecture 6

Basics on Probability. Jingrui He 09/11/2007

Rao-Blackwellized Particle Filtering for 6-DOF Estimation of Attitude and Position via GPS and Inertial Sensors

CS491/691: Introduction to Aerial Robotics

Our Status. We re done with Part I Search and Planning!

Announcements. CS 188: Artificial Intelligence Fall Causality? Example: Traffic. Topology Limits Distributions. Example: Reverse Traffic

Bayes Filter Reminder. Kalman Filter Localization. Properties of Gaussians. Gaussians. Prediction. Correction. σ 2. Univariate. 1 2πσ e.

Probabilistic Fundamentals in Robotics. DAUIN Politecnico di Torino July 2010

Bayesian Methods / G.D. Hager S. Leonard

CS 343: Artificial Intelligence

Mobile Robots Localization

1.1 The Equations of Motion

CS 343: Artificial Intelligence

1 Kalman Filter Introduction

ME 597: AUTONOMOUS MOBILE ROBOTICS SECTION 2 PROBABILITY. Prof. Steven Waslander

ROBOTICS 01PEEQW. Basilio Bona DAUIN Politecnico di Torino

CS 188: Artificial Intelligence. Our Status in CS188

Properties of Probability

Covariance and Correlation Class 7, Jeremy Orloff and Jonathan Bloom

Some Basic Concepts of Probability and Information Theory: Pt. 2

CS 343: Artificial Intelligence

Probability Review Lecturer: Ji Liu Thank Jerry Zhu for sharing his slides

Introduction to Mobile Robotics Probabilistic Motion Models

Six State Kalman Filtering for LEO Microsatellite Attitude Determination

Lecture 2: Repetition of probability theory and statistics

ELEC4631 s Lecture 2: Dynamic Control Systems 7 March Overview of dynamic control systems

Electron cloud and ion effects

Review of Probability Mark Craven and David Page Computer Sciences 760.

Parameterized Joint Densities with Gaussian and Gaussian Mixture Marginals

UC Berkeley Department of Electrical Engineering and Computer Science Department of Statistics. EECS 281A / STAT 241A Statistical Learning Theory

5.1 Angles and Their Measurements

Gaussians. Pieter Abbeel UC Berkeley EECS. Many slides adapted from Thrun, Burgard and Fox, Probabilistic Robotics

1036: Probability & Statistics

CSE 473: Ar+ficial Intelligence. Example. Par+cle Filters for HMMs. An HMM is defined by: Ini+al distribu+on: Transi+ons: Emissions:

Approximate Inference

System identification and sensor fusion in dynamical systems. Thomas Schön Division of Systems and Control, Uppsala University, Sweden.

3 Polynomial and Rational Functions

Partially Observable Markov Decision Processes (POMDPs)

Transcription:

robabilit: Review ieter Abbeel UC Berkele EECS Man slides adapted from Thrun Burgard and Fo robabilistic Robotics

Wh probabilit in robotics? Often state of robot and state of its environment are unknown and onl nois sensors available robabilit provides a framework to fuse sensor information à Result: probabilit distribution over possible states of robot and environment Dnamics is often stochastic hence can t optimie for a particular outcome but onl optimie to obtain a good distribution over outcomes robabilit provides a framework to reason in this setting à Result: abilit to find good control policies for stochastic dnamics and environments

Eample : Helicopter State: position orientation velocit angular rate Sensors: GS : nois estimate of position sometimes also velocit Inertial sensing unit: nois measurements from i 3-ais gro [angular rate sensor] ii 3-ais accelerometer [measures acceleration + gravit; e.g. measures 000 in free-fall] iii 3-ais magnetometer Dnamics: Noise from: wind unmodeled dnamics in engine servos blades

Eample 2: Mobile robot inside building State: position and heading Sensors: Odometr sensing motion of actuators: e.g. wheel encoders Laser range finder: Measures time of flight of a laser beam between departure and return Return is tpicall happening when hitting a surface that reflects the beam back to where it came from Dnamics: Noise from: wheel slippage unmodeled variation in floor

Aioms of robabilit Theor 0 r A r! r! 0 ra! B ra+ rb" ra# B ra denotes probabilit that the outcome ω is an element of the set of possible outcomes A. A is often called an event. Same for B. Ω is the set of all possible outcomes. ϕ is the empt set. 5

A Closer Look at Aiom 3 ra! B ra+ rb" ra# B! A A! B B 6

Using the Aioms ra!" \ A ra+ r" \ A# ra$" \ A r" ra+ r" \ A# r! ra+ r" \ A# 0 r" \ A # ra 7

Discrete Random Variables X denotes a random variable.! 2 4 3 X can take on a countable number of values in { 2 n }. X i or i is the probabilit that the random variable X takes on value i.. is called probabilit mass function. E.g. X models the outcome of a coin flip head 2 tail 0.5 2 0.5 8

Continuous Random Variables X takes on values in the continuum. px or p is a probabilit densit function. r a b p d b a E.g. p 9

Joint and Conditional robabilit X and Y If X and Y are independent then is the probabilit of given / If X and Y are independent then Same for probabilit densities just à p 0

Law of Total robabilit Marginals Discrete case Continuous case p d p p d p p p d

2 Baes Formula evidence prior likelihood

3 Normaliation η η au : au : au η η Algorithm:

4 Conditioning Law of total probabilit: d d d

Baes Rule with Background Knowledge 5

Conditional Independence equivalent to and 6

Simple Eample of State Estimation Suppose a robot obtains measurement What is open? 7

Causal vs. Diagnostic Reasoning open is diagnostic. open is causal. Often causal knowledge is easier to obtain. Baes rule allows us to use causal count knowledge: frequencies! open open open 8

Eample open 0.6 open 0.3 open open 0.5 open openopen open open open open p open + open p open open 0.6 0.5 0.6 0.5 + 0.3 0.5 2 3 0.67 raises the probabilit that the door is open. 9

Combining Evidence Suppose our robot obtains another observation 2. How can we integrate this new information? More generall how can we estimate... n? 20

2 Recursive Baesian Updating n n n n n n Markov assumption: n is independent of... n- if we know. n n n! n n!! n n!!...n i i...n " # $ % & '

22 Eample: Second Measurement 2 open 0.5 2 open 0.6 open 2/3 0.625 8 5 3 5 3 3 2 2 3 2 2 2 2 2 2 + + open open open open open open open 2 lowers the probabilit that the door is open.

A Tpical itfall Two possible locations and 2 0.99 2 0.09 0.07 0.9 p2 d p d 0.8 0.7 0.6 p d 0.5 0.4 0.3 0.2 0. 0 5 0 5 20 25 30 35 40 45 50 Number of integrations 23