An Incremental Trust-Region Method for Robust Online Sparse Least-Squares Estimation

David M. Rosen, Michael Kaess and John J. Leonard
Conference Paper, IEEE Intl. Conf. on Robotics and Automation, ICRA, pp. 1262-1269, May, 2012

View Publication

Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.


Many online inference problems in computer vision and robotics are characterized by probability distributions whose factor graph representations are sparse and whose factors are all Gaussian functions of error residuals. Under these condi- tions, maximum likelihood estimation corresponds to solving a sequence of sparse least-squares minimization problems in which additional summands are added to the objective function over time. In this paper we present Robust Incremental least-Squares Estimation (RISE), an incrementalized version of the Powell’s Dog-Leg trust-region method suitable for use in online sparse least-squares minimization. As a trust-region method, Powell’s Dog-Leg enjoys excellent global convergence properties, and is known to be considerably faster than both Gauss-Newton and Levenberg-Marquardt when applied to sparse least-squares problems. Consequently, RISE maintains the speed of current state-of-the-art incremental sparse least-squares methods while providing superior robustness to objective function nonlinearities.

author = {David M. Rosen and Michael Kaess and John J. Leonard},
title = {An Incremental Trust-Region Method for Robust Online Sparse Least-Squares Estimation},
booktitle = {IEEE Intl. Conf. on Robotics and Automation, ICRA},
year = {2012},
month = {May},
pages = {1262-1269},
} 2017-09-13T10:39:51-04:00