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

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

Subgraph-preconditioned conjugate gradients for large scale SLAM

Open access
Dellaert, F, Carlson, J, Ila, V, Kai Ni, Thorpe, C E · 2010 · 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems

Abstract

In this paper we propose an efficient preconditioned conjugate gradients (PCG) approach to solving large-scale SLAM problems. While direct methods, popular in the literature, exhibit quadratic convergence and can be quite efficient for sparse problems, they typically require a lot of storage and efficient elimination orderings to be found. In contrast, iterative optimization methods only require access to the gradient and have a small memory footprint, but can suffer from poor convergence. Our new method, subgraph preconditioning, is obtained by re-interpreting the method of conjugate gradients in terms of the graphical model representation of the SLAM problem. The main idea is to combine the advantages of direct and iterative methods, by identifying a sub-problem that can be easily solved using direct methods, and solving for the remaining part using PCG. The easy sub-problems correspond to a spanning tree, a planar subgraph, or any other substructure that can be efficiently solved. As such, our approach provides new insights into the performance of state of the art iterative SLAM methods based on re-parameterized stochastic gradient descent. The efficiency of our new algorithm is illustrated on large datasets, both simulated and real.

Overview

Integrity signals

Registry

Crossref · 10.1109/iros.2010.5650422

Cites

24 of 24 references verified0 citation errors · 0 not checkable

Statistics

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

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, 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 24 references

Research works printed but not linked: 1

  1. thrun, 2003, Multi-robot SLAM with sparse extended information filters, Proceedings of the 11th International Symposium of Robotics Research(ISRR'03)

Cited by

See all 58

Metadata

Authors
Dellaert, F., Carlson, J., Ila, V, Ni, K., & Thorpe, C. E.
Affiliations
  • Georgia Institute of Technology (US)
  • Carnegie Mellon University Qatar (QA)
Venue
2010 IEEE/RSJ International Conference on Intelligent Robots and Systems
Publisher
IEEE
Published
2010-10
Pages
2566-2571
ISSN
2153-0858 (ISSN-L)
OpenAlex
W2056458921
Cited by
58
References
24
Citations by year
2026: 1 · 2025: 2 · 2024: 1 · 2023: 2 · 2022: 2 · 2021: 3 · 2020: 4 · 2019: 1 · 2018: 2 · 2017: 2 · 2016: 7 · 2015: 5 · 2014: 5 · 2013: 5 · 2012: 9
FWCI
13.37
Type
conference paper
Language
en
Open access
Licence
cc-by-nc-nd
Locations
  • IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) (publishedVersion)
  • UPCommons institutional repository (Universitat Politècnica de Catalunya) (publishedVersion, cc-by-nc-nd)
  • DIGITAL.CSIC (Spanish National Research Council (CSIC)) (submittedVersion, other-oa)
  • RECERCAT (Consorci de Serveis Universitaris de Catalunya) (submittedVersion, cc-by-nc-nd)
  • SMARTech Repository (Georgia Institute of Technology) (submittedVersion)
Funders
  • National Science Foundation (0713162, CAREER, 0448111)
  • Ministerio de Ciencia e Innovación
Topics
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Robotics and Sensor-Based Localization
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Matrix Theory and Algorithms
  • Physical Sciences › Computer Science › Artificial Intelligence › Target Tracking and Data Fusion in Sensor Networks
Keywords
SLAM, preconditioned conjugate gradient, large-scale optimization, probabilistic graphical models, spanning trees, planar subgraphs, iterative optimization

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: Subgraph-preconditioned conjugate gradients for large scale SLAM. https://app.cochat.ai/papers/10.1109/iros.2010.5650422
The paper
Dellaert, F., Carlson, J., Ila, V, Ni, K., & Thorpe, C. E. (2010). Subgraph-preconditioned conjugate gradients for large scale SLAM. 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems. https://doi.org/10.1109/iros.2010.5650422

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.