A quadratic-complexity observability-constrained unscented kalman filter for slam

Guoquan P. Huang, Anastasios I. Mourikis, Stergios I. Roumeliotis

Research output: Contribution to journalArticlepeer-review

68 Scopus citations


This paper addresses two key limitations of the unscented Kalman filter (UKF) when applied to the simultaneous localization and mapping (SLAM) problem: the cubic computational complexity in the number of states and the inconsistency of the state estimates. To address the first issue, we introduce a new sampling strategy for the UKF, which has constant computational complexity. As a result, the overall computational complexity of UKF-based SLAM becomes of the same order as that of the extended Kalman filter (EKF)-based SLAM, i.e., quadratic in the size of the state vector. Furthermore, we investigate the inconsistency issue by analyzing the observability properties of the linear-regression-based model employed by the UKF. Based on this analysis, we propose a new algorithm, termed observability-constrained (OC)-UKF, which ensures the unobservable subspace of the UKF's linear-regression-based system model is of the same dimension as that of the nonlinear SLAM system. This results in substantial improvement in the accuracy and consistency of the state estimates. The superior performance of the OC-UKF over other state-of-the-art SLAM algorithms is validated by both Monte-Carlo simulations and real-world experiments.

Original languageEnglish (US)
Article number6553094
Pages (from-to)1226-1243
Number of pages18
JournalIEEE Transactions on Robotics
Issue number5
StatePublished - 2013


  • Computational complexity
  • estimator consistency
  • simultaneous localization and mapping (SLAM)
  • system observability
  • unscented Kalman filter


Dive into the research topics of 'A quadratic-complexity observability-constrained unscented kalman filter for slam'. Together they form a unique fingerprint.

Cite this