Spectral Trade-Off for Measurement Sparsification of Pose-Graph SLAM
- 29 November 2023
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 9 (1) , 723-730
Abstract
In this letter, we propose a trade-off optimization algorithm to compute an appropriate number of edges for measurement (edge) sparsification in pose-graph simultaneous localization and mapping (SLAM). The greater the amount of measurement data, the larger is the computational burden. To reduce computational burden, one can remove a portion of measurements. However, reliable data, such as odometric measurements, can be lost if measurements are removed without any principle. To remove measurements which is redundant, we propose a trade-off optimization algorithm between maximization of the Fiedler value and minimization of the largest eigenvalue of adjacency matrix for measurement graph. This problem formulation gives virtues twofold. First, it is scalable. For any dataset, when a weight for trade-off is given, this algorithm determines the appropriate number of edges since this is a trade-off optimization problem. Second, the edges of the measurement graph can be distributed evenly. The algorithm considers the minimization of the largest eigenvalue of the adjacency matrix, so it suppresses the upper bound of the maximum degree of the measurement graph. It removes the redundant information concentrated on a few nodes, and improves the estimation accuracy of the sparsified graph. To validate the performance of the proposed trade-off optimization algorithm, we apply our approach to CSAIL, Intel, and Manhattan datasets.Keywords
Funding Information
- Advanced Robotics Lab.
- CTO Division
- LG Electronics
This publication has 29 references indexed in Scilit:
- Growing connected networks under privacy constraint: Achieving trade-off between performance and security2015
- Generic Node Removal for Factor-Graph SLAMIEEE Transactions on Robotics, 2014
- Novel insights into the impact of graph structure on SLAM2014
- Toward Optimal Network Topology Design for Fast and Secure Distributed Computation2014
- Cramer-Rao bounds for synchronization of rotationsInformation and Inference: A Journal of the IMA, 2013
- Information-theoretic compression of pose graphs for laser-based SLAMThe International Journal of Robotics Research, 2012
- Weighted Algebraic Connectivity: An Application to Airport Transportation NetworkIFAC Proceedings Volumes, 2011
- Trust-Region Methods on Riemannian ManifoldsFoundations of Computational Mathematics, 2006
- Growing Well-connected Graphs2006
- Bounding the largest eigenvalue of trees in terms of the largest vertex degreeLinear Algebra and its Applications, 2003