CoChat

Improving computational and memory requirements of simultaneous localization and map building algorithms

Guivant, J., Nebot, E. · 2003 · Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292)
Cited by 53

The DOI matches its Crossref record.

Abstract

Addresses the problem of implementing simultaneous localisation and map building (SLAM) in very large outdoor environments. A method is presented to reduce the computational requirement from /spl sim/O(N/sup 2/) to /spl sim/O(N), N being the states used to represent all the landmarks and vehicle pose. With this implementation the memory requirements are also reduced to /spl sim/O(N). This algorithm presents an efficient solution to the full update required by the compressed extended Kalman filter algorithm. Experimental results are also presented.

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.2002.1013645

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.

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

Cited by

See all 53

Metadata

Authors
Guivant, J., & Nebot, E.
Venue
Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292)
Publisher
IEEE
Published
2003-06-25
Volume
3
Pages
2731-2736
ISSN
1050-4729 (ISSN-L)
OpenAlex
W2156654921
Cited by
53
References
0
FWCI
15.09
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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Improving computational and memory requirements of simultaneous localization and map building algorithms. https://app.cochat.ai/papers/10.1109/robot.2002.1013645
The paper
Guivant, J., & Nebot, E. (2003). Improving computational and memory requirements of simultaneous localization and map building algorithms. Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292). https://doi.org/10.1109/robot.2002.1013645

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.