EKF SLAM updates in O(n) with Divide and Conquer SLAM

L.M. Paz , Patric Jensfelt, J.D. TardÃ³s and J. Neira

Abstract:

In this paper we describe Divide and Conquer SLAM (D&C SLAM), an algorithm for performing Simultaneous Localization and Mapping using the Extended Kalman Filter. D&C SLAM overcomes the two fundamental limitations of standard EKF SLAM: 1- the computational cost per step is reduced from O(n2) to O(n) (the cost full SLAM is reduced from O(n3) to O(n2)); 2- the resulting vehicle and map estimates have better consistency properties than standard EKF SLAM in the sense that the computed state covariance adequately represents the real error in the estimation. Unlike many current large scale EKF SLAMtechniques, this algorithm computes an exact solution, without relying on approximations or simplifications to reduce computational complexity. Also, estimates and covariances are available when needed by data association without any further computation. Empirical results show that, as a bi-product of reduced computations, and without losing precision because of approximations, D&C SLAM has better consistency properties than standard EKF SLAM. Both characteristics allow to extend the range of environments that can be mapped in real time using EKF. We describe the algorithm and study its computational cost and consistency properties.

BibTeX Entry:

@InProceedings{Paz07a,
  author =       {L.M. Paz and P. Jensfelt and J.D. Tard{\'o}s and J. Neira},
  title =        {{EKF} {SLAM} updates in {O}(n) with {D}ivide and {C}onquer {SLAM}},
  booktitle =    {Proc.~of the IEEE International Conference on Robotics and Automation (ICRA'07)},
  year =         2007,
  address =      {Rome,Italy},
  month =        apr
}

Download: pdf (316k)