Michael Kaess
Center for Robotics and Intelligent Machines, Georgia Tech GT CoC IC GVU RIM@GT BORG

please see my MIT page for up-to-date information

Fast Incremental Square Root Information Smoothing

Download: PDF.

“Fast Incremental Square Root Information Smoothing” by M. Kaess, A. Ranganathan, and F. Dellaert. In Intl. Joint Conf. on Artificial Intelligence, IJCAI, (Hyderabad, India), Jan. 2007, pp. 2129-2134. Oral presentation acceptance ratio 15.7% (212 of 1353).

Abstract

We propose a novel approach to the problem of simultaneous localization and mapping (SLAM) based on incremental smoothing, that is suitable for real-time applications in large-scale environments. The main advantages over filter-based algorithms are that we solve the full SLAM problem without the need for any approximations, and that we do not suffer from linearization errors. We achieve efficiency by updating the square-root information matrix, a factored version of the naturally sparse smoothing information matrix. We can efficiently recover the exact trajectory and map at any given time by back-substitution. Furthermore, our approach allows access to the exact covariances, as it does not suffer from under-estimation of uncertainties, which is another problem inherent to filters. We present simulation-based results for the linear case, showing constant time updates for exploration tasks. We further evaluate the behavior in the presence of loops, and discuss how our approach extends to the non-linear case. Finally, we evaluate the overall non-linear algorithm on the standard Victoria Park data set.

Download: PDF.

BibTeX entry:

@inproceedings{Kaess07ijcai,
   author = {M. Kaess and A. Ranganathan and F. Dellaert},
   title = {Fast Incremental Square Root Information Smoothing},
   booktitle = {Intl. Joint Conf. on Artificial Intelligence, IJCAI},
   pages = {2129-2134},
   address = {Hyderabad, India},
   month = {Jan},
   year = {2007},
   note = {Oral presentation acceptance ratio 15.7% (212 of 1353)}
}