Lecture 10: Discrete Probability and State Estimation

author: Dennis Freeman, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, MIT
recorded by: Massachusetts Institute of Technology, MIT
published: Feb. 4, 2013,   recorded: March 2011,   views: 2551
released under terms of: Creative Commons Attribution Non-Commercial Share Alike (CC-BY-NC-SA)

Related Open Educational Resources

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.


We've been talking about how to analyze and design systems, but we haven't talked about how to make systems robust under uncertainty. In fact, we haven't even talked about how to model uncertainty.

In this unit, we'll address the problem that systems we design may have to operate under uncertainty, and that we may want those systems to be able to search the world for possible solutions to problems. We'll introduce the basics of probability and search in this session, and apply those concepts to our design challenges.

The overview handout provides a more detailed introduction, including the big ideas of the session, key vocabulary, what you should understand (theory) and be able to do (practice) after completing this session, and additional resources.

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: