/A Markov Chain Monte Carlo Approach to Closing the Loop in SLAM

A Markov Chain Monte Carlo Approach to Closing the Loop in SLAM

Michael Kaess and Frank Dellaert
Conference Paper, IEEE Intl. Conf. on Robotics and Automation, ICRA, pp. 645-650, April, 2005

Download Publication (PDF)

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.

Abstract

The problem of simultaneous localization and mapping has received much attention over the last years. Especially large scale environments, where the robot trajectory loops back on itself, are a challenge. In this paper we introduce a new solution to this problem of closing the loop. Our algorithm is EM-based, but differs from previous work. The key is a probability distribution over partitions of feature tracks that is determined in the E-step, based on the current estimate of the motion. This virtual structure is then used in the M-step to obtain a better estimate for the motion. We demonstrate the success of our algorithm in experiments on real laser data.

BibTeX Reference
@conference{Kaess-2005-9167,
author = {Michael Kaess and Frank Dellaert},
title = {A Markov Chain Monte Carlo Approach to Closing the Loop in SLAM},
booktitle = {IEEE Intl. Conf. on Robotics and Automation, ICRA},
year = {2005},
month = {April},
pages = {645-650},
}
2017-09-13T10:43:28+00:00