Save this video free

Princeton Intro to Robotics (Fall 2026) | Lecture 13: Occupancy-Grid SLAM

Introduction to Robotics @ Princeton · 1:12:00 · Watch on YouTube

Part of Princeton University ROB 345. See all 15 lectures and search them

These notes were made with YouTube Collector. Paste any YouTube link and get the same: a summary, chapters and a searchable transcript.

Overview

The lecture develops occupancy-grid mapping from Bayesian filtering, first assuming a known robot pose and then relaxing that assumption to introduce Grid-based FastSLAM. Its central techniques are independent per-cell occupancy estimates, sensor likelihood updates, and particles that jointly represent robot pose and map, enabling loop closure when a robot revisits a location.

Key takeaways

Chapters

0:00 Kalman Filters, Particle Filters, and Robot Localization
4:57 Rangefinder Sensor Models for Localization
13:00 SLAM and the Main Families of Robot Maps
18:47 Occupancy Grids as Binary Map Variables
22:59 Naive Bayes Makes Occupancy Mapping Tractable
29:50 Turn Range Measurements into Cell-Level Evidence
35:15 Bayesian Occupancy Updates and the Pose Assumption
41:00 Marginalizing Over Maps in the Bayesian Derivation
45:15 Efficient Occupancy Updates with Probability Ratios
52:06 From Mapping with a Known Pose to Joint SLAM
55:42 Grid-Based FastSLAM Particles Represent Pose and Map
59:26 Loop Closure Corrects Accumulated Map Drift
1:05:18 Visual Feature Correspondence for Loop Closure
1:07:05 3D Drone SLAM, Exploration, and Classical Robotics Tradeoffs
1:09:00 Why Robotics Still Uses Classical SLAM Pipelines

Keep these chapters and the full searchable transcript in your own library.

Transcript excerpt

0:10 All right, I think we'll uh go ahead and get started. So, as a reminder uh in the in the last lecture, we discussed two applications of the the base filter. Uh so the base filter is this kind of basic really fundamental uh method uh for filtering, for state estimation, any kind of like probabilistic inference. uh and in the last lecture we saw two applications. So the first one is what's known as the calman filter uh which is an exact implementation of the base filter. Exact in the sense that there's no approximation. Uh but it comes at a cost which is that you need to make some really strong assumptions on the dynamics model uh and on the the sensor model. So the dynamics model needs to be linear plus Gaussian. The sensor model also needs to be linear and Gaussian. And the initial belief that you start

0:57 off with also needs to be a Gaussian. Uh and then yeah I guess under those assumptions the main result behind the common filter is that when you apply the base filter under these assumptions the belief that you end up with at every time step remains a Gaussian. Uh and then the second application that we discussed the second instantiation of the maze filter is what's known as the the particle filter where we don't make these restrictive assumptions. So we don't assume linear Gaussian uh dynamics model or sensor model. Uh but it comes at the cost of approximation error. So we don't get to represent the full kind of multimodal belief distribution that you might have. uh we approximate that with a finite set of particles that get updated at every time step based on the

1:45 probabilistic knowledge of the dynamics uh and the probabilistic sensor model as

This is the start of the transcript. Save this video free for the whole transcript, searchable and time-coded.

In this course

Related notes

Summary, takeaways, and chapters were generated by AI from the video's transcript and may contain errors. The video belongs to its creator, Introduction to Robotics @ Princeton.

Want the full transcript?

Save this video in YouTube Collector to get its complete searchable transcript, your own AI summaries, and a library that keeps every video you collect in one place.