Spatially-Adaptive Learning Rates for Online Incremental SLAM

— Several recent algorithms have formulated the SLAM problem in terms of non-linear pose graph optimization. These algorithms are attractive because they offer lower computational and memory costs than the traditional Extended Kalman Filter (EKF), while simultaneously avoiding the linearization error problems that affect EKFs. In this paper, we present a new non-linear SLAM algorithm that allows incremental optimization of pose graphs, i.e., allows new poses and constraints to be added without requiring the solution to be recomputed from scratch. Our approach builds upon an existing batch algorithm that combines stochastic gradient descent and an incremental state representation. We develop an incremental algorithm by adding a spatially-adaptive learning rate, and a technique for reducing computational requirements by restricting optimization to only the most volatile portions of the graph. We demonstrate our algorithms on real datasets, and compare against other online algorithms.

• Type: Conference
• Year: 2007
• Where: RSS
• Authors: Edwin Olson, John J. Leonard, Seth J. Teller
• Keywords: Algorithms, Pose Graph Optimization, Pose Graphs, Robotics, RSS 2007