Exact state and covariance submatrix recovery for submap based sparse EIF SLAM algorithms

Publisher:
IEEE
Publication Type:
Conference Proceeding
Citation:
Proceeding of 2008 IEEE International Conference on Robotics and Automation, 2008, pp. 1868 - 1873
Issue Date:
2008-01
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2008002084.pdf1.88 MB
Adobe PDF
This paper provides a novel state vector and covariance sub-matrix recovery algorithm for a recently developed submap based exactly sparse extended information filter (EIF) SLAM algorithm - sparse local submap joining filter (SLSJF). The algorithm achieves exact recovery instead of approximate recovery. The recovery algorithm is very efficient because of an incremental Cholesky factorization approach and a natural reordering of the global state vector. Simulation results show that the computation cost of the SLSJF is much lower as compared with the sequential map joining algorithm using extended Kalman filter (EKF). The SLSJF with the proposed recovery algorithm is also successfully applied to the Victoria Park data set.
Please use this identifier to cite or link to this item: