Universität Bremen  
  FB 3  
  Group BKB > Publications > Search > Deutsch

Publications Search - Details

Publication type: Article in Proceedings
Author: U. Frese
Title: A Proof for the Approximate Sparsity of SLAM Information Matrices
Book / Collection title: Proceedings of the IEEE International Conference on Robotics and Automation
Page(s): 331 – 337
Year published: 2005
Abstract: For the Simultaneous Localization and Mapping problem several efficient algorithms have been proposed that make use of a sparse information matrix representation (eg SEIF, TJTF, treemap). Since the exact SLAM information matrix is dense, these algorithm have to approximate it (sparsification. It has been empirically observed that this approximation is adequate because entries in the matrix corresponding to distant landmarks are extremely small.

This paper provides a theoretical proof for this observation, specifically showing that the off-diagonal entries corresponding to two landmarks decay exponentially with the distance traveled between observation of first and second landmark.
Internet: http://www.informatik.uni-bremen.de/agebv/en/SlamDiscussion
PDF Version: http://www.informatik.uni-bremen.de/agebv/downloads/published/freseicra05.pdf
Status: Reviewed
Last updated: 28. 10. 2008

 Back to result list
Author: Automatically generated page
  Group BKB 
Last updated: February 23, 2006   impressum