ICRA 2011 Paper Abstract

Close

Paper WeA210.3

Kaess, Michael (MIT), Johannsson, Hordur (MIT), Roberts, Richard (Georgia Institute of Technology), Ila, Viorela (Georgia Tech), Leonard, John (MIT), Dellaert, Frank (Georgia Institute of Technology)

iSAM2: Incremental Smoothing and Mapping with Fluid Relinearization and Incremental Variable Reordering

Scheduled for presentation during the Regular Sessions "Mapping and Navigation II" (WeA210), Wednesday, May 11, 2011, 10:35−10:50, Room 5E

2011 IEEE International Conference on Robotics and Automation, May 9-13, 2011, Shanghai International Conference Center, Shanghai, China

This information is tentative and subject to change. Compiled on December 8, 2019

Keywords SLAM

Abstract

We present iSAM2, a fully incremental, graph-based version of incremental smoothing and mapping (iSAM). iSAM2 is based on a novel graphical model-based interpretation of incremental sparse matrix factorization methods, afforded by the recently introduced Bayes tree data structure. The original iSAM algorithm incrementally maintains the square root information matrix by applying matrix factorization updates. We analyze the matrix updates as simple editing operations on the Bayes tree and the conditional densities represented by its cliques. Based on that insight, we present a new method to incrementally change the variable ordering which has a large effect on efficiency. The efficiency and accuracy of the new method is based on fluid relinearization, the concept of selectively relinearizing variables as needed. This allows us to obtain a fully incremental algorithm without any need for periodic batch steps. We analyze the properties of the resulting algorithm in detail, and show on various real and simulated datasets that the iSAM2 algorithm compares favorably with other recent mapping algorithms in both quality and efficiency.

 

 

Technical Content © IEEE Robotics & Automation Society

This site is protected by copyright and trademark laws under US and International law.
All rights reserved. © 2002-2019 PaperCept, Inc.
Page generated 2019-12-08  02:51:35 PST  Terms of use