arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1611.00889cs.ROcs.DS

Designing Sparse Reliable Pose-Graph SLAM: A Graph-Theoretic Approach

University of Technology Sydney(悉尼科技大学);University of Southern California(南加州大学)

Kasra Khosoussi, Gaurav S. Sukhatme, Shoudong Huang, Gamini Dissanayake

英文摘要:

In this paper, we aim to design sparse D-optimal (determinantoptimal) pose-graph SLAM problems through the synthesis of sparse graphs with the maximum weighted number of spanning trees. Characterizing graphs with the maximum number of spanning trees is an open problem in general. To tackle this problem, several new theoretical results are established in this paper, including the monotone log-submodularity of the weighted number of spanning trees. By exploiting these structures, we design a complementary pair of near-optimal efficient approximation algorithms with provable guarantees. Our theoretical results are validated using random graphs and a publicly available pose-graph SLAM dataset.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑