Exploiting Locality by Nested Dissection For Square Root Smoothing and Mapping

Thumbnail Image
Krauthausen, Peter
Dellaert, Frank
Kipp, Alexander
Associated Organizations
Organizational Unit
Supplementary to
The problem of creating a map given only the erroneous odometry and feature measurements and locating the own position in this environment is known in the literature as the Simultaneous Localization and Mapping (SLAM) problem. In this paper we investigate how a Nested Dissection Ordering scheme can improve the the performance of a recently proposed Square Root Information Smoothing (SRIS) approach. As the SRIS does perform smoothing rather than filtering the SLAM problem becomes the Smoothing and Mapping problem (SAM). The computational complexity of the SRIS solution is dominated by the cost of transforming a matrix of all measurements into a square root form through factorization. The factorization of a fully dense measurement matrix has a cubic complexity in the worst case. We show that the computational complexity for the factorization of typical measurement matrices occurring in the SAM problem can be bound tighter under reasonable assumptions. Our work is motivated both from a numerical/linear algebra standpoint as well as by submaps used in EKF solutions to SLAM.
Date Issued
801538 bytes
Resource Type
Resource Subtype
Technical Report
Rights Statement
Rights URI