SLAM++1-A highly efficient and temporally scalable incremental SLAM framework

Viorela Ila*, Lukas Polok, Marek Solony, Pavel Svoboda

*Corresponding author for this work

    Research output: Contribution to journalArticlepeer-review

    66 Citations (Scopus)

    Abstract

    The most common way to deal with the uncertainty present in noisy sensorial perception and action is to model the problem with a probabilistic framework. Maximum likelihood estimation is a well-known estimation method used in many robotic and computer vision applications. Under Gaussian assumption, the maximum likelihood estimation converts to a nonlinear least squares problem. Efficient solutions to nonlinear least squares exist and they are based on iteratively solving sparse linear systems until convergence. In general, the existing solutions provide only an estimation of the mean state vector, the resulting covariance being computationally too expensive to recover. Nevertheless, in many simultaneous localization and mapping (SLAM) applications, knowing only the mean vector is not enough. Data association, obtaining reduced state representations, active decisions and next best view are only a few of the applications that require fast state covariance recovery. Furthermore, computer vision and robotic applications are in general performed online. In this case, the state is updated and recomputed every step and its size is continuously growing, therefore, the estimation process may become highly computationally demanding. This paper introduces a general framework for incremental maximum likelihood estimation called SLAM++, which fully benefits from the incremental nature of the online applications, and provides efficient estimation of both the mean and the covariance of the estimate. Based on that, we propose a strategy for maintaining a sparse and scalable state representation for large scale mapping, which uses information theory measures to integrate only informative and non-redundant contributions to the state representation. SLAM++ differs from existing implementations by performing all the matrix operations by blocks. This led to extremely fast matrix manipulation and arithmetic operations used in nonlinear least squares. Even though this paper tests SLAM++ efficiency on SLAM problems, its applicability remains general.

    Original languageEnglish
    Pages (from-to)210-230
    Number of pages21
    JournalInternational Journal of Robotics Research
    Volume36
    Issue number2
    DOIs
    Publication statusPublished - 1 Feb 2017

    Fingerprint

    Dive into the research topics of 'SLAM++1-A highly efficient and temporally scalable incremental SLAM framework'. Together they form a unique fingerprint.

    Cite this