3D I-SLSJF: A consistent sparse local submap joining algorithm for building large-scale 3D Map

Publication Type:
Conference Proceeding
Proceedings of the 48th IEEE Conference on Decision and Control, 2009 held jointly with the 2009 28th Chinese Control Conference. CDC/CCC 2009., 2009, pp. 6040 - 6045
Issue Date:
Full metadata record
Files in This Item:
Filename Description SizeFormat
2009001932.pdf1.08 MBAdobe PDF
This paper presents an efficient and reliable algorithm for autonomous robots to build large-scale three dimensional maps by combining small local submaps. The algorithm is a generalization of our recent work on two dimensional map joining algorithm â Iterated Sparse Local Submap Joining Filter (I-SLSJF). The 3D local submap joining problem is formulated as a least squares optimization problem and solved by Extended Information Filter (EIF) together with smoothing and iterations. The resulting information matrix is exactly sparse and this makes the algorithm efficient. The smoothing and iteration steps improve the accuracy and consistency of the estimate. The consistency and efficiency of 3D I-SLSJF is demonstrated by comparing the algorithm with some existing algorithms using computer simulations.
Please use this identifier to cite or link to this item: