# PS1

Submit material you wish to deliver electronically via:

`submit fredm ps1 zip-or-tar-file`

## Introduction to Probability, Bayes Rule, and Bayes Nets

If you have not recently studied probability, Bayes Rule, and Bayes Networks, you will need to be re-acquainted to it, because Chapter 2 of Probabilistic Robotics simply states the conclusions with the assumption that you have already understood them.

So please start out by working through the mini-lectures from last fall's Stanford AI online class. The lectures include little quizzes which test your understanding. Please do the quizzes along the way, and view the answers too.

Review lectures 1 through 29 of Unit 3, starting at https://www.ai-class.com/course/video/videolecture/36

Including doing problems along the way and viewing the answer lectures, this will take you two to three hours. It's a lot, but this is an essential basis for moving forward in the course.

Important note: Many of Thrun's examples are for a hypothetical case of cancer, given evidence from a cancer-test. To translate this into robotics, consider the “probability of cancer” to be analogous to some state of the robot and its world, e.g., “is the door open?”. Then, the test-for-cancer translates into a sensor reading.

So the question, “Given a positive test, what is the likelihood that I have cancer?” is mathematically equivalent to “Given that my sensor seems to see that the door is open, what is the likelihood that it's really open?”.

Keep this in mind as you work through the Stanford material.

After completing the online material:

• Read pages 3 through 10 of Chapter 1.
• From Chapter 2, “Recursive State Estimation,” read the introduction 2.1 and section 2.2, “Basic Concepts in Probability.”

## Probability Problems

1. Consider the Bayes Net below:

What is the value of P(A | B) ? Show your work.

2. Consider the representation of a robot and its sensor below. The robot is moving one-dimensionally along a wall. The robot's state is represented by the X variable, which may be in one of only two states: at-wall (as shown in the drawing), or at-door. (The position of the robot along the corridor is not being modeled.)

The robot has a sensor which gives a value represented by the Z variable, which is either see-wall or see-door.

Remember that the X variable, representing the robot's “true” state, cannot be known directly. It only can be inferred probabilistically given the Z sensor values. (This is the fundamental modeling assumption of probabilistic robotics.)

This model is represented by the Bayes net on the right of the diagram, where the X state variable has influence on the Z sensor measurements.

The door sensor behaves as follows.

P( Z = see-door | X = at-door ) = 0.95

P( Z = see-wall | X = at-wall ) = 0.9

It is slightly more reliable at seeing a door than seeing a wall. (If you imagine the door sensor as a robot sonar device, this is reasonable because sensing a door opening represents the lack of return ping, whereas sensing a wall requires the ping to be returned. Sometimes pings go out and are lost.)

Given the above, specify the values of:

P( Z = see-wall | X = at-door ) = ?

P( Z = see-door | X = at-wall ) = ?

2.1. Assume a prior probability P ( X = at-door ) = 0.5, and compute the posterior probability X = at-door given a sensor reading of Z = see-door. In other words, what is:

P( X = at-door | Z = see-door) ?