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.  and the D-SLAM by Wang et al.  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. © 2008 Springer-Verlag Berlin Heidelberg.
Please use this identifier to cite or link to this item: