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

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

Unscented FastSLAM: A Robust and Efficient Solution to the SLAM Problem

Kim, C., Sakthivel, R., Chung, W.K.·2008·IEEE Transactions on Robotics

Abstract

The Rao--Blackwellized particle filter (RBPF) and FastSLAM have two important limitations, which are the derivation of the Jacobian matrices and the linear approximations of nonlinear functions. These can make the filter inconsistent. Another challenge is to reduce the number of particles while maintaining the estimation accuracy. This paper provides a robust new algorithm based on the scaled unscented transformation called unscented FastSLAM (UFastSLAM). It overcomes the important drawbacks of the previous frameworks by directly using nonlinear relations. This approach improves the filter consistency and state estimation accuracy, and requires smaller number of particles than the FastSLAM approach. Simulation results in large-scale environments and experimental results with a benchmark dataset are presented, demonstrating the superiority of the UFastSLAM algorithm.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Integrity signals

Registry

Crossref · 10.1109/tro.2008.924946

Cites

29 of 29 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.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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 29 references

Cited by

See all 275

Metadata

Authors
Kim, C., Sakthivel, R., & Chung, W. K.
Venue
IEEE Transactions on Robotics
Published
2008-08
Volume
24
Issue
4
Pages
808-820
ISSN
  • 1552-3098 (ISSN-L)
  • 1941-0468
OpenAlex
W2154202063
Cited by
275
References
29
FWCI
28.71
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: Unscented FastSLAM: A Robust and Efficient Solution to the SLAM Problem. https://app.cochat.ai/papers/10.1109/tro.2008.924946
The paper
Kim, C., Sakthivel, R., & Chung, W. K. (2008). Unscented FastSLAM: A Robust and Efficient Solution to the SLAM Problem. IEEE Transactions on Robotics. https://doi.org/10.1109/tro.2008.924946

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.