Dissemin is shutting down on January 1st, 2025

Published in

Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference

DOI: 10.1109/cdc.2009.5399747

Links

Tools

Export citation

Search in Google Scholar

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

Proceedings article published in 2009 by Gibson Hu, Shoudong Huang ORCID, Gamini Dissanayake
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Green circle
Postprint: archiving allowed
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO

Abstract

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.