Iterated SLSJF: A sparse local submap joining algorithm with improved consistency

Publication Type:
Conference Proceeding
Citation:
Proceedings of the 2008 Australasian Conference on Robotics and Automation, ACRA 2008, 2008
Issue Date:
2008-12-01
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2008002087.pdf5.58 MB
Adobe PDF
This paper presents a new local submap joining algorithm for building large-scale feature based maps. The algorithm is based on the recently developed Sparse Local Submap Joining Filter (SLSJF) and uses multiple iterations to improve the estimate and hence is called Iterated SLSJF (I-SLSJF). The input to the I-SLSJF algorithm is a sequence of local submaps. The output of the algorithm is a global map containing the global positions of all the features as well as all the robot start/end poses of the local submaps. In the submap joining step of I-SLSJF, whenever the change of state estimate computed by an Extended Information Filter (EIF) is larger than a predefined threshold, the information vector and the information matrix is recomputed as a sum of all the local map contributions. This improves the accuracy of the estimate as well as avoids the possibility that the Jacobian with respect to the same feature gets evaluated at different estimate values, which is one of the major causes of inconsistency for EIF/EKF algorithms. Although the computational cost of I-SLSJF is higher than that of SLSJF, the algorithm can still be implemented effciently due to the exactly sparseness of the information matrix. The new algorithm is compared with EKF SLAM and SLSJF using both computer simulation and experimental examples.
Please use this identifier to cite or link to this item: