A Proof for the Approximate Sparsity of SLAM Information Matrices
The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
For the Simultaneous Localization and Mapping problem several efficient algorithms have been proposed that make use of a sparse information matrix representation (e.g. SEIF, TJTF, treemap). Since the exact SLAM information matrix is dense, these algorithm have to approximate it (sparsification). It has been empirically observed that this approximation is adequate because entries in the matrix corresponding to distant landmarks are extremely small. This paper provides a theoretical proof for this observation, specifically showing that the off-diagonal entries corresponding to two landmarks decay exponentially with the distance traveled between observation of first and second landmark.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Globally Consistent Range Scan Alignment for Environment Mapping
Lu, F., & Milios, E. (1997) · Autonomous Robots · doi:10.1023/a:1008854305733 · Cited by 1,304
Cited by
G2o: A general framework for graph optimization
Kummerle, R., Grisetti, G., Strasdat, H., Konolige, K., & Burgard, W. (2011) · 2011 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2011.5979949 · Cited by 1,982
FrameSLAM: From Bundle Adjustment to Real-Time Visual Mapping
Konolige, K., & Agrawal, M. (2008) · IEEE Transactions on Robotics · doi:10.1109/tro.2008.2004832 · Cited by 532
Exactly Sparse Delayed-State Filters for View-Based SLAM
Eustice, R. M., Singh, H., & Leonard, J. J. (2006) · IEEE Transactions on Robotics · doi:10.1109/tro.2006.886264 · Cited by 306
Sliding window filter with application to planetary landing
Sibley, G., Matthies, L., & Sukhatme, G. (2010) · Journal of Field Robotics · doi:10.1002/rob.20360 · Cited by 259
Inference on networks of mixtures for robust robot mapping
Olson, E., & Agarwal, P. (2013) · The International Journal of Robotics Research · doi:10.1177/0278364913479413 · Cited by 252
“Recent Simultaneous Localization and Mapping (SLAM) algorithms can rapidly find maximum likelihood solutions for maps, exploiting both fundamental improvements in the understanding of the structure of mapping problems [1], [2], [3], and the computational convenience afforded by assuming that error models are simple un…”
Visually Mapping the RMS Titanic: Conservative Covariance Estimates for SLAM Information Filters
Eustice, R. M., Singh, H., Leonard, J. J., & Walter, M. R. (2006) · The International Journal of Robotics Research · doi:10.1177/0278364906072512 · Cited by 162
A review of recent developments in Simultaneous Localization and Mapping
Dissanayake, G., Huang, S., Wang, Z., & Ranasinghe, R. (2011) · 2011 6th International Conference on Industrial and Information Systems · doi:10.1109/iciinfs.2011.6038117 · Cited by 108
“au computational issues to some extent [6][7][8][9] the issue of inconsistency remained unresolved.”
Background
Metadata
- Authors
- Frese, U.
- Venue
- Proceedings of the 2005 IEEE International Conference on Robotics and Automation
- Publisher
- IEEE
- Published
- 2006-01-18
- Pages
- 329-335
- ISSN
- 1050-4729 (ISSN-L)
- OpenAlex
- W1870652675
- Cited by
- 45
- References
- 1
- FWCI
- 13.41
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.