Tradeoffs in SLAM with Sparse Information Filters

Designing filters exploiting the sparseness of the information matrix for efficiently solving the simultaneous localization and mapping (SLAM) problem has attracted significant attention during the recent past. The main contribution of this paper is a review of the various sparse information filters proposed in the literature to date, in particular, the compromises used to achieve sparseness. Two of the most recent algorithms that the authors have implemented, Exactly Sparse Extended Information Filter (ESEIF) by Walter et al. [5] and the D-SLAM by Wang et al. [6] are discussed and analyzed in detail. It is proposed that this analysis can stimulate developing a framework suitable for evaluating the relative merits of SLAM algorithms.

[1]  Tom Duckett,et al.  A multilevel relaxation algorithm for simultaneous localization and mapping , 2005, IEEE Transactions on Robotics.

[2]  Eduardo Mario Nebot,et al.  Optimization of the simultaneous localization and map-building algorithm for real-time implementation , 2001, IEEE Trans. Robotics Autom..

[3]  Gamini Dissanayake,et al.  Mapping large scale environments using relative position information among landmarks , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..

[4]  Hanumant Singh,et al.  Visually Navigating the RMS Titanic with SLAM Information Filters , 2005, Robotics: Science and Systems.

[5]  Hugh F. Durrant-Whyte,et al.  Simultaneous Localization and Mapping with Sparse Extended Information Filters , 2004, Int. J. Robotics Res..

[6]  Frank Dellaert,et al.  Fast Incremental Square Root Information Smoothing , 2007, IJCAI.

[7]  Frank Dellaert,et al.  Tectonic SAM: Exact, Out-of-Core, Submap-Based SLAM , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.

[8]  Zhan Wang.  Exactly sparse information filters for simultaneous localization and mapping , 2007 .

[9]  Frank Dellaert,et al.  Exploiting Locality in SLAM by Nested Dissection , 2006, Robotics: Science and Systems.

[10]  Mark A. Paskin,et al.  Thin Junction Tree Filters for Simultaneous Localization and Mapping , 2002, IJCAI.

[11]  Sebastian Thrun,et al.  The Graph SLAM Algorithm with Applications to Large-Scale Mapping of Urban Structures , 2006, Int. J. Robotics Res..

[12]  Gamini Dissanayake,et al.  D-SLAM: A Decoupled Solution to Simultaneous Localization and Mapping , 2007, Int. J. Robotics Res..

[13]  Udo Frese.  A Proof for the Approximate Sparsity of SLAM Information Matrices , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

[14]  Frank Dellaert,et al.  Square Root SAM: Simultaneous Localization and Mapping via Square Root Information Smoothing , 2006, Int. J. Robotics Res..

[15]  Henrik I. Christensen,et al.  Graphical SLAM - a self-correcting map , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[16]  Udo Frese,et al.  Treemap: An O(log n) algorithm for indoor simultaneous localization and mapping , 2006, Auton. Robots.

[17]  Matthew R. Walter,et al.  Exactly Sparse Extended Information Filters for Feature-based SLAM , 2007, Int. J. Robotics Res..

[18]  Hanumant Singh,et al.  Exactly Sparse Delayed-State Filters for View-Based SLAM , 2006, IEEE Transactions on Robotics.