Applications of Ear Decomposition to Efficient Heterogeneous Algorithms for Shortest Path/Cycle Problems

Dutta, Debarshi; Chaitanya, Meher; Kothapalli, Kishore; Bera, Debajyoti

doi:10.1109/ipdpsw.2017.78

Cited by 3 publications

(9 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…On the present architecture, the computational bottleneck of MCB algorithms is the all-pairs-shortest-paths (APSP) [81], [82]. APSP is required to construct the Horton set, and a consistent APSP for the isometric set.…”

Section: Computation Of Minimum Length Cycle Basismentioning

confidence: 99%

“…then {S j } ν j=k,j =l is a set of support vectors for {C i } k i=1 . A direct use of support vectors to check independence can be found in [81]. We invert the process in [81] to accommodate our description.…”

Section: Independence Testmentioning

confidence: 99%

“…A direct use of support vectors to check independence can be found in [81]. We invert the process in [81] to accommodate our description. Given a spanning tree T , we can initialize ν independent support vectors by ν off-tree edges, where each support vector contains one off-tree edge [81].…”

Section: Independence Testmentioning

confidence: 99%

“…We invert the process in [81] to accommodate our description. Given a spanning tree T , we can initialize ν independent support vectors by ν off-tree edges, where each support vector contains one off-tree edge [81]. Then, at each phase, we evaluate the independence of a new circuit C by support vectors, which will be subsequently updated if C is evidenced to be independent by a support vector S l .…”

Section: Independence Testmentioning

confidence: 99%

“…Iterate this process until an MCB is found. As in [81], the drawback of this method is that we might need to check many support vectors in order to verify C, S l = 1.…”

Section: Independence Testmentioning

confidence: 99%

See 4 more Smart Citations

Sparse Pose Graph Optimization in Cycle Space

2021

View full text Add to dashboard Cite

The state-of-the-art modern pose-graph optimization (PGO) systems are vertex based. In this context, the number of variables might be high, albeit the number of cycles in the graph (loop closures) is relatively low. For sparse problems particularly, the cycle space has a significantly smaller dimension than the number of vertices. By exploiting this observation, in this article, we propose an alternative solution to PGO that directly exploits the cycle space. We characterize the topology of the graph as a cycle matrix, and reparameterize the problem using relative poses, which are further constrained by a cycle basis of the graph. We show that by using a minimum cycle basis, the cycle-based approach has superior convergence properties against its vertex-based counterpart, in terms of convergence speed and convergence to the global minimum. For sparse graphs, our cycle-based approach is also more time efficient than the vertex-based. As an additional contribution of this work, we present an effective algorithm to compute the minimum cycle basis. Albeit known in computer science, we believe that this algorithm is not familiar to the robotics community. All the claims are validated by experiments on both standard benchmarks and simulated datasets. To foster the reproduction of the results, we provide a complete open-source C++ implementation 1 of our approach. Index Terms-Minimum cycle basis, pose graph optimization (PGO), special Euclidean group (SE(3)), simultaneous localization and mapping (SLAM). I. INTRODUCTION P OSE graph optimization (PGO) is a fundamental problem, which arises in various research disciplines, such as simultaneous localization and mapping (SLAM) [1]-[5], structure from motion [6]-[8], calibration of multicamera rig [9], and sensor network localization [10], [11].A pose graph is a graph whose vertices encode positions and orientations of 3-D poses, and whose edges represent spatial constraints between the connected vertices. Taking a graph-based SLAM system as an example, the system processes the raw measurements to construct local maps. These local maps are Manuscript

show abstract

Section: Computation Of Minimum Length Cycle Basismentioning

confidence: 99%

Section: Independence Testmentioning

confidence: 99%

Section: Independence Testmentioning

confidence: 99%

Section: Independence Testmentioning

confidence: 99%

“…Iterate this process until an MCB is found. As in [81], the drawback of this method is that we might need to check many support vectors in order to verify C, S l = 1.…”

Section: Independence Testmentioning

confidence: 99%

See 3 more Smart Citations