Exactly Sparse Delayed-State Filters

10 years 3 months ago
Exactly Sparse Delayed-State Filters
— This paper presents the novel insight that the SLAM information matrix is exactly sparse in a delayedstate framework. Such a framework is used in view-based representations of the environment which rely upon scanmatching raw sensor data. Scan-matching raw data results in virtual observations of robot motion with respect to a place its previously been. The exact sparseness of the delayed-state information matrix is in contrast to other recent featurebased SLAM information algorithms like Sparse Extended Information Filters or Thin Junction Tree Filters. These methods have to make approximations in order to force the feature-based SLAM information matrix to be sparse. The benefit of the exact sparseness of the delayed-state framework is that it allows one to take advantage of the information space parameterization without having to make any approximations. Therefore, it can produce equivalent results to the “full-covariance” solution.
Ryan Eustice, Hanumant Singh, John J. Leonard
Added 25 Jun 2010
Updated 25 Jun 2010
Type Conference
Year 2005
Where ICRA
Authors Ryan Eustice, Hanumant Singh, John J. Leonard
Comments (0)