2016
DOI: 10.1007/s10846-016-0367-7
|View full text |Cite
|
Sign up to set email alerts
|

Efficient Cholesky Factor Recovery for Column Reordering in Simultaneous Localisation and Mapping

Abstract: Simultaneous Localisation And Mapping problems are inherently dynamic and the structure of the graph representing them changes significantly over time. To obtain the least square solution of such systems efficiently, it is desired to maintain a good column ordering such that fill-ins are reduced. This comes at a cost since general ordering changes require the complete re-computation of the Cholesky factor. While some methods have obtained good results with reordering at loop closing, the changes are not guaran… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 43 publications
(84 reference statements)
0
2
0
Order By: Relevance
“…Inverting matrix H would demand significant memory and computational resources, inefficient for resource-constrained devices [51]. Nonetheless, more efficient alternatives have been suggested in the literature, which leverage the Cholesky decomposition [52], [53]. Since H is symmetric positivedefinite, the decomposition calculates the lower triangular matrix L, such that H = LL T .…”
Section: # Construct the Linear System Matrixmentioning
confidence: 99%
See 1 more Smart Citation
“…Inverting matrix H would demand significant memory and computational resources, inefficient for resource-constrained devices [51]. Nonetheless, more efficient alternatives have been suggested in the literature, which leverage the Cholesky decomposition [52], [53]. Since H is symmetric positivedefinite, the decomposition calculates the lower triangular matrix L, such that H = LL T .…”
Section: # Construct the Linear System Matrixmentioning
confidence: 99%
“…CL is the cluster with 8+1 cores, while the FC is the single-core fabric controller of the GAP9 SoC. 52. 5.51 9.39 14.71 20.18 26.88 34.96 FC (1 core) 0.86 8.76 24.88 49.72 82.74 124.1 173.9 232.0 Speedup 1.68 3.47 4.52 5.29 5.63 6.15 6.47 6.64 Speedup SLAM 1.28 2.24 2.97 3.55 4.04 4.43 4.79 5.08…”
mentioning
confidence: 99%