| Sign In to gain access to subscriptions and/or personal tools. |
The Graph SLAM Algorithm with Applications to Large-Scale Mapping of Urban StructuresStanford AI Lab, Stanford University, thrun{at}stanford.edu
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) This article has been cited by other articles:
|
|||||||||||||||
