CoChat

Information-Based Compact Pose SLAM

Open access
Ila, V., Porta, J.M., Andrade-Cetto, J. · 2010 · IEEE Transactions on Robotics

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

Abstract

Pose SLAM is the variant of simultaneous localization and map building (SLAM) is the variant of SLAM, in which only the robot trajectory is estimated and where landmarks are only used to produce relative constraints between robot poses. To reduce the computational cost of the information filter form of Pose SLAM and, at the same time, to delay inconsistency as much as possible, we introduce an approach that takes into account only highly informative loop-closure links and nonredundant poses. This approach includes constant time procedures to compute the distance between poses, the expected information gain for each potential link, and the exact marginal covariances while moving in open loop, as well as a procedure to recover the state after a loop closure that, in practical situations, scales linearly in terms of both time and memory. Using these procedures, the robot operates most of the time in open loop, and the cost of the loop closure is amortized over long trajectories. This way, the computational bottleneck shifts to data association, which is the search over the set of previously visited poses to determine good candidates for sensor registration. To speed up data association, we introduce a method to search for neighboring poses whose complexity ranges from logarithmic in the usual case to linear in degenerate situations. The method is based on organizing the pose information in a balanced tree whose internal levels are defined using interval arithmetic. The proposed Pose-SLAM approach is validated through simulations, real mapping sessions, and experiments using standard SLAM data sets.

Overview

Integrity signals

Registry

Crossref · 10.1109/tro.2009.2034435

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

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

Research works printed but not linked: 4

  1. moore, 1966, Interval Analysis
  2. esteban, 2008, slam for extremely large environments, presented at the Proc 14th Annu Conf Adv School Comput Imag
  3. ranganathan, 2007, loopy sam, Proc Int Joint Conf Artif Intell, 2191
  4. montemerlo, 2007, FastSLAM A Scalable Method for the Simultaneous Localization and Mapping Problem in Robotic

Cited by

Items 201–216 of 216

Metadata

Authors
Ila, V., Porta, J. M., & Andrade-Cetto, J.
Affiliations
  • Georgia Institute of Technology (US)
  • Consejo Superior de Investigaciones Científicas (ES)
Venue
IEEE Transactions on Robotics
Published
2010-02
Volume
26
Issue
1
Pages
78-93
ISSN
  • 1552-3098 (ISSN-L)
  • 1941-0468
OpenAlex
W2096052462
Cited by
183
References
46
Citations by year
2026: 3 · 2025: 3 · 2024: 7 · 2023: 6 · 2022: 6 · 2021: 6 · 2020: 11 · 2019: 13 · 2018: 16 · 2017: 19 · 2016: 20 · 2015: 15 · 2014: 18 · 2013: 14 · 2012: 11
FWCI
16.83
Type
journal article
Language
en
Open access
Locations
  • IEEE Transactions on Robotics (publishedVersion)
  • LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas) (publishedVersion, other-oa)
  • UPCommons institutional repository (Universitat Politècnica de Catalunya) (publishedVersion, other-oa)
  • DIGITAL.CSIC (Spanish National Research Council (CSIC)) (submittedVersion, other-oa)
  • RECERCAT (Consorci de Serveis Universitaris de Catalunya) (submittedVersion, public-domain)
Funders
  • European Commission
  • 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 › Artificial Intelligence › Target Tracking and Data Fusion in Sensor Networks
  • Physical Sciences › Engineering › Aerospace Engineering › Inertial Sensor and Navigation
Keywords
information filter, loop closure, data association, expected information gain, open-loop operation, balanced trees, interval arithmetic, robot trajectory estimation, computational efficiency

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

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.