Simultaneous Localization and Mapping
Also known as: SLAM, Concurrent Mapping and Localization
Simultaneous Localization and Mapping (SLAM) is the problem of enabling a mobile robot to build a map of its environment while simultaneously determining its own location within that map using noisy sensor measurements. Formulated by Durrant-Whyte and Bailey in 2006, SLAM is fundamental to autonomous robotics, enabling robots to navigate and explore unknown environments without prior maps or external positioning systems.
Read the full method
Sign in with a free account to read this section.
Method map
The neighbourhood of related methods — select a node to explore.
When to use it
Use SLAM when a robot must navigate an unknown environment without prior maps or GPS. It is essential for autonomous indoor navigation (factories, warehouses, hospitals), outdoor exploration (mining, agriculture), and underwater or aerial robots. SLAM is most practical for environments with rich, observable features (visual landmarks, geometric structure). Avoid SLAM in featureless environments (empty rooms, corridors), in dynamic environments where landmarks move, or if computational resources are severely limited.
Strengths & limitations
- Enables autonomous navigation without pre-built maps or external positioning infrastructure.
- Produces metric maps useful for downstream planning and control tasks.
- Naturally fuses multiple sensor types (visual, lidar, inertial) through probabilistic framework.
- Loop closure detection enables global map consistency; posterior uncertainty decreases as loops close.
- Mature algorithms exist for various platforms (wheeled robots, drones, underwater vehicles).
- Data association (matching observations to landmarks) is computationally hard and error-prone; mistakes compound and degrade mapping.
- Loop closure detection can fail in repetitive environments (corridors with identical pillars) or with large appearance changes.
- Computational cost grows with map size; maintaining 10,000+ landmarks requires efficient algorithms and hardware.
- Performance degrades in textureless, symmetric, or dynamic environments; prior mapping is more practical in such cases.
- Initialization and sensor calibration are critical; poor calibration causes persistent drift.
Frequently asked
What is data association and why is it critical to SLAM?
Data association is the problem of matching sensor observations (e.g., corner features from a camera) to known landmarks in the map. For each new observation, you must decide which landmark (if any) it corresponds to. Incorrect associations (assigning an observation to the wrong landmark) corrupt the map. Modern SLAM uses statistical hypothesis testing or machine learning for robust association, but ambiguity in repetitive environments remains a major challenge.
What is loop closure and how does it improve SLAM?
Loop closure occurs when the robot returns to a previously visited location. Detecting and constraining loop closure causes the accumulated odometry drift to be corrected. When a loop closes, the map uncertainty (covariance) decreases significantly, and past states can be updated retroactively. Loop closure is essential for global map consistency; without it, long missions accumulate unbounded drift.
What sensors are best for SLAM?
Different sensors excel in different environments: LiDAR provides accurate metric measurements and works day/night but is expensive; cameras are cheap and rich in information but sensitive to lighting; IMUs provide short-term drift-free motion estimates but accumulate errors; ultrasonic and sonar work in darkness or underwater. Multi-sensor fusion (lidar + camera + IMU) is most robust.
Can SLAM work in dynamic environments?
Standard SLAM assumes a static environment. In dynamic environments (moving people, vehicles, clutter), algorithms must separate dynamic objects from static landmarks. Methods include: (1) temporal filtering (ignore fast-moving features), (2) semantic segmentation (recognize and mask moving objects), (3) dynamic object tracking (track and predict motion of dynamic elements separately).
Sources
- Durrant-Whyte, H., & Bailey, T. (2006). Simultaneous localization and mapping (SLAM): Part I. IEEE Robotics & Automation Magazine, 13(2), 99-110. DOI: 10.1109/MRA.2006.1638022 ↗
- Thrun, S., Burgard, W., & Fox, D. (2005). Probabilistic Robotics. MIT Press. link ↗
- Dellaert, F., & Kaess, M. (2012). Square root SAM: Simultaneous localization and mapping via square root factor graphs. International Journal of Robotics Research, 25(12), 1181-1203. link ↗
How to cite this page
ScholarGate. (2026, June 3). Simultaneous Localization and Mapping. ScholarGate. https://scholargate.app/en/control-theory/simultaneous-localization-and-mapping
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- Extended Kalman FilterControl Theory↔ compare
- Particle FilterBayesian↔ compare
- Unscented Kalman FilterControl Theory↔ compare