Reliable Graphs for SLAM. (March 2019)

• Record Type: Journal Article
• Authors: Khosoussi, Kasra; Giamou, Matthew; Sukhatme, Gaurav S; Huang, Shoudong; Dissanayake, Gamini; How, Jonathan P
• Is Part Of: International journal of robotics research. Volume 38:Number 2/3(2019)
• Page Start: 260
• Page End: 298
• Publication Date: 2019-03
• Subjects: SLAM -- measurement selection -- resource-constrained SLAM -- estimation over graphs -- pose-graph pruning -- number of spanning trees -- graph complexity; Robots -- Periodicals; Robots, Industrial -- Periodicals; 629.89205
• DOI: 10.1177/0278364918823086
• Languages: English
• ISSNs: 0278-3649

Abstract

Estimation-over-graphs (EoG) is a class of estimation problems that admit a natural graphical representation. Several key problems in robotics and sensor networks, including sensor network localization, synchronization over a group, and simultaneous localization and mapping (SLAM) fall into this category. We pursue two main goals in this work. First, we aim to characterize the impact of the graphical structure of SLAM and related problems on estimation reliability. We draw connections between several notions of graph connectivity and various properties of the underlying estimation problem. In particular, we establish results on the impact of the weighted number of spanning trees on the D-optimality criterion in 2D SLAM. These results enable agents to evaluate estimation reliability based only on the graphical representation of the EoG problem. We then use our findings and study the problem of designing sparse SLAM problems that lead to reliable maximum likelihood estimates through the synthesis of sparse graphs with the maximum weighted tree connectivity. Characterizing graphs with the maximum number of spanning trees is an open problem in general. To tackle this problem, we establish several new theoretical results, including the monotone log-submodularity of the weighted number of spanning trees. We exploit these structures and design a complementary greedy–convex pair of efficient approximation algorithms with provable guarantees. The proposed synthesis framework is applied to various forms of the measurement selection problem in resource-constrained SLAM. Our algorithms and theoretical findings are validated using random graphs, existing and new synthetic SLAM benchmarks, and publicly available real pose-graph SLAM datasets.