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

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

Robust loop closing over time for pose graph SLAM

Latif, Yasir, Cadena, César, Neira, José · 2013 · The International Journal of Robotics Research

Abstract

Long-term autonomous mobile robot operation requires considering place recognition decisions with great caution. A single incorrect decision that is not detected and reconsidered can corrupt the environment model that the robot is trying to build and maintain. This work describes a consensus-based approach to robust place recognition over time, that takes into account all the available information to detect and remove past incorrect loop closures. The main novelties of our work are: (1) the ability of realizing that, in light of new evidence, an incorrect past loop closing decision has been made; the incorrect information can be removed thus recovering the correct estimation with a novel algorithm; (2) extending our proposal to incremental operation; and (3) handling multi-session, spatially related or unrelated scenarios in a unified manner. We demonstrate our proposal, the RRR algorithm, on different odometry systems, e.g. visual or laser, using different front-end loop-closing techniques. For our experiments we use the efficient graph optimization framework g2o as back-end. We back our claims up with several experiments carried out on real data, in single and multi-session experiments showing better results than those obtained by state-of-the-art methods, comparisons against whom are also presented.

Overview

Integrity signals

Registry

Crossref · 10.1177/0278364913498910

Cites

31 of 31 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Show all 32 references

Research works printed but not linked: 1

  1. 10.21236/ADA576491 · doi:10.21236/ada576491 · Paper page

Cited by

See all 221

Metadata

Authors
Latif, Y., Cadena, C., & Neira, J.
Affiliations
  • Universidad de Zaragoza (ES)
  • George Mason University (US)
Venue
The International Journal of Robotics Research
Published
2013-10-04
Volume
32
Issue
14
Pages
1611-1626
ISSN
  • 0278-3649 (ISSN-L)
  • 1741-3176
OpenAlex
W2011767579
Cited by
221
References
32
Citations by year
2026: 7 · 2025: 7 · 2024: 14 · 2023: 12 · 2022: 25 · 2021: 22 · 2020: 21 · 2019: 24 · 2018: 27 · 2017: 16 · 2016: 18 · 2015: 16 · 2014: 11 · 2013: 1
FWCI
24.65
Type
journal article
Language
en
Open access
closed
Licence
journals.sagepub.com/page/policies/text-and-data-mining-license (tdm)
Locations
  • The International Journal of Robotics Research (publishedVersion)
  • Adelaide Research & Scholarship (AR&S) (University of Adelaide) (submittedVersion)
Topics
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Robotics and Sensor-Based Localization
  • Physical Sciences › Earth and Planetary Sciences › Geology › 3D Surveying and Cultural Heritage
  • Physical Sciences › Engineering › Aerospace Engineering › Inertial Sensor and Navigation
Keywords
loop closure detection, place recognition, pose graph SLAM, odometry, visual odometry, mobile robots

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: Robust loop closing over time for pose graph SLAM. https://app.cochat.ai/papers/10.1177/0278364913498910
The paper
Latif, Y., Cadena, C., & Neira, J. (2013). Robust loop closing over time for pose graph SLAM. The International Journal of Robotics Research. https://doi.org/10.1177/0278364913498910

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.