Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 194

The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.

Divide and Conquer: EKF SLAM in $O(n)$

Paz, L.M., Tardos, J.D., Neira, J. · 2008 · IEEE Transactions on Robotics

Abstract

In this paper, we show thatallprocesses associated with the move-sense-update cycle of extended Kalman filter (EKF) Simultaneous Localization and Mapping (SLAM) can be carried out in timelinearwith the number of map features. We describeDivide and ConquerSLAM, which is an EKF SLAM algorithm in which the computational complexity per step is reduced from$O(n^2)$to$O(n)$, and the total cost of SLAM is reduced from$O(n^3)$to$O(n^2)$. Unlike many current large-scale EKF SLAM techniques, this algorithm computes a solution without relying on approximations or simplifications (other than linearizations) to reduce computational complexity. Also, estimates and covariances are available when needed by data association without any further computation. Furthermore, as the method works most of the time in local maps, where angular errors remain small, the effect of linearization errors is limited. The resulting vehicle and map estimates are more precise than those obtained with standard EKF SLAM. The errors with respect to the true value are smaller, and the computed state covariance is consistent with the real error in the estimation. Both simulated experiments and the Victoria Park dataset are used to provide evidence of the advantages of this algorithm.

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/tro.2008.2004639

Cites

5 of 5 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

Show all 5 references

Cited by

See all 194

Metadata

Authors
Paz, L. M., Tardos, J. D., & Neira, J.
Venue
IEEE Transactions on Robotics
Published
2008-10
Volume
24
Issue
5
Pages
1107-1120
ISSN
  • 1552-3098 (ISSN-L)
  • 1941-0468
OpenAlex
W2158505966
Cited by
194
References
5
FWCI
33.49
Type
journal article
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: Divide and Conquer: EKF SLAM in $O(n)$. https://app.cochat.ai/papers/10.1109/tro.2008.2004639
The paper
Paz, L. M., Tardos, J. D., & Neira, J. (2008). Divide and Conquer: EKF SLAM in $O(n)$. IEEE Transactions on Robotics. https://doi.org/10.1109/tro.2008.2004639

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.