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

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

Inference on networks of mixtures for robust robot mapping

Olson, Edwin, Agarwal, Pratik · 2013 · The International Journal of Robotics Research

Abstract

The central challenge in robotic mapping is obtaining reliable data associations (or “loop closures”): state-of-the-art inference algorithms can fail catastrophically if even one erroneous loop closure is incorporated into the map. Consequently, much work has been done to push error rates closer to zero. However, a long-lived or multi-robot system will still encounter errors, leading to system failure. We propose a fundamentally different approach: allow richer error models that allow the probability of a failure to be explicitly modeled. In other words, rather than characterizing loop closures as being “right” or “wrong”, we propose characterizing the error of those loop closures in a more expressive manner that can account for their non-Gaussian behavior. Our approach leads to an fully integrated Bayesian framework for dealing with error-prone data. Unlike earlier multiple-hypothesis approaches, our approach avoids exponential memory complexity and is fast enough for real-time performance. We show that the proposed method not only allows loop closing errors to be automatically identified, but also that in extreme cases, the “front-end” loop-validation systems can be unnecessary. We demonstrate our system both on standard benchmarks and on the real-world data sets that motivated this work.

Overview

Integrity signals

Registry

Crossref · 10.1177/0278364913479413

Cites

43 of 43 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 43 references

Research works printed but not linked: 7

  1. Bailey T, 2002, Mobile Robot Localisation and Mapping in Extensive Outdoor Environments
  2. Kummerle R, 2011, Proceedings of the IEEE International Conference on Robotics and Automation (ICRA)
  3. Lerner U, 2001, Proceedings of the Proceedings of the Seventeenth Conference Annual Conference on Uncertainty in Artificial Intelligence (UAI-01), 310
  4. Ranganathan P, 2010, Proceedings of the Land Warfare Conference (LWC)
  5. Smith R, 1988, Proceedings of the International Symposium of Robotics Research (ISRR), 467
  6. Thrun S, 2003, Proceedings of the International Symposium of Robotics Research (ISRR)
  7. Walter M, 2005, Proceedings of the International Symposium of Robotics Research (ISRR), 214

Cited by

See all 258

Metadata

Authors
Olson, E., & Agarwal, P.
Affiliations
  • University of Michigan (US)
  • University of Freiburg (DE)
Venue
The International Journal of Robotics Research
Published
2013-06
Volume
32
Issue
7
Pages
826-840
ISSN
  • 0278-3649 (ISSN-L)
  • 1741-3176
OpenAlex
W1990884907
Cited by
252
References
43
Citations by year
2026: 11 · 2025: 11 · 2024: 13 · 2023: 18 · 2022: 25 · 2021: 21 · 2020: 22 · 2019: 19 · 2018: 17 · 2017: 14 · 2016: 22 · 2015: 17 · 2014: 25 · 2013: 15
FWCI
42.36
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)
Topics
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Robotics and Sensor-Based Localization
  • Physical Sciences › Computer Science › Artificial Intelligence › Target Tracking and Data Fusion in Sensor Networks
  • Physical Sciences › Engineering › Control and Systems Engineering › Robotic Path Planning Algorithms
Keywords
robot mapping, loop closure detection, data association, error modeling, Bayesian inference, error resilience, non-Gaussian errors, multi-robot systems, real-time mapping

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: Inference on networks of mixtures for robust robot mapping. https://app.cochat.ai/papers/10.1177/0278364913479413
The paper
Olson, E., & Agarwal, P. (2013). Inference on networks of mixtures for robust robot mapping. The International Journal of Robotics Research. https://doi.org/10.1177/0278364913479413

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.