This Article Full Text (PDF) References Alert me when this article is cited Alert me if a correction is posted Services Email this article to a friend Similar articles in this journal Alert me to new issues of the journal Add to Saved Citations Download to citation manager Request Permissions Request Reprints Add to My Marked Citations Citing Articles Citing Articles via Google Scholar Citing Articles via Scopus Google Scholar Articles by Thrun, S. Articles by Montemerlo, M. Search for Related Content Social Bookmarking                   What's this?

The Graph SLAM Algorithm with Applications to Large-Scale Mapping of Urban Structures

Stanford AI Lab, Stanford University, thrun{at}stanford.edu

Michael Montemerlo

Stanford AI Lab, Stanford University, mmde{at}stanford.edu

This article presents GraphSLAM, a unifying algorithm for the offline SLAM problem. GraphSLAM is closely related to a recent sequence of research papers on applying optimization techniques to SLAM problems. It transforms the SLAM posterior into a graphical network, representing the log-likelihood of the data. It then reduces this graph using variable elimination techniques, arriving at a lower-dimensional problems that is then solved using conventional optimization techniques. As a result, GraphSLAM can generate maps with 108 or more features. The paper discusses a greedy algorithm for data association, and presents results for SLAM in urban environments with occasional GPS measurements.

Key Words: SLAM • robot navigation • localization • mapping

The International Journal of Robotics Research, Vol. 25, No. 5-6, 403-429 (2006)
DOI: 10.1177/0278364906065387


CiteULike    Connotea    Del.icio.us    Digg    Reddit    Technorati    What's this?