CoChat

A Proof for the Approximate Sparsity of SLAM Information Matrices

Frese, U. · 2006 · Proceedings of the 2005 IEEE International Conference on Robotics and Automation
Cited by 45

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/robot.2005.1570140

Cites

1 of 1 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Cited by

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.