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

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

Nonlinear Constraint Network Optimization for Efficient Map Learning

Grisetti, G., Stachniss, C., Burgard, W. · 2009 · IEEE Transactions on Intelligent Transportation Systems

Abstract

Learning models of the environment is one of the fundamental tasks of mobile robots since maps are needed for a wide range of robotic applications, such as navigation and transportation tasks, service robotic applications, and several others. In the past, numerous efficient approaches to map learning have been proposed. Most of them, however, assume that the robot lives on a plane. In this paper, we present a highly efficient maximum-likelihood approach that is able to solve 3-D and 2-D problems. Our approach addresses the so-called graph-based formulation of simultaneous localization and mapping (SLAM) and can be seen as an extension of Olson's algorithm toward non-flat environments. It applies a novel parameterization of the nodes of the graph that significantly improves the performance of the algorithm and can cope with arbitrary network topologies. The latter allows us to bound the complexity of the algorithm to the size of the mapped area and not to the length of the trajectory. Furthermore, our approach is able to appropriately distribute the roll, pitch, and yaw error over a sequence of poses in 3-D mapping problems. We implemented our technique and compared it with multiple other graph-based SLAM solutions. As we demonstrate in simulated and real-world experiments, our method converges faster than the other approaches and yields accurate maps of the environment.

Overview

Integrity signals

Registry

Crossref · 10.1109/tits.2009.2026444

Cites

42 of 42 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 51 references

Research works printed but not linked: 5

  1. stachniss, 2007, TORO project at OpenSLAM org
  2. ranganathan, 2007, loopy sam, Proc IJCAI, 2191
  3. uhlmann, 1995, Dynamic map building and localization New theoretical foundations
  4. 10.1109/TRO.2004.839220 · DOI · Paper page
  5. barrera, 2004, incremental spherical linear interpolation, Proc SIGRAD, 13, 7

Cited by

See all 222

Metadata

Authors
Grisetti, G., Stachniss, C., & Burgard, W.
Affiliations
University of Freiburg (DE)
Venue
IEEE Transactions on Intelligent Transportation Systems
Published
2009-09
Volume
10
Issue
3
Pages
428-439
ISSN
  • 1524-9050 (ISSN-L)
  • 1558-0016
OpenAlex
W2119538218
Cited by
222
References
51
Citations by year
2026: 1 · 2025: 4 · 2024: 4 · 2023: 8 · 2022: 4 · 2021: 10 · 2020: 7 · 2019: 12 · 2018: 16 · 2017: 11 · 2016: 18 · 2015: 21 · 2014: 24 · 2013: 21 · 2012: 18
FWCI
38.84
Type
journal article
Language
en
Open access
closed
Locations
  • IEEE Transactions on Intelligent Transportation Systems (publishedVersion)
  • IRIS Research product catalog (Sapienza University of Rome) (submittedVersion)
Funders
  • Deutsche Forschungsgemeinschaft (SFB/TR 8)
  • École Polytechnique Fédérale de Lausanne
  • Eidgenössische Technische Hochschule Zürich
  • FP7 Information and Communication Technologies
Topics
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Robotics and Sensor-Based Localization
  • Physical Sciences › Computer Science › Artificial Intelligence › Reinforcement Learning in Robotics
  • Physical Sciences › Engineering › Control and Systems Engineering › Robotic Path Planning Algorithms
Keywords
map learning, SLAM, graph-based SLAM, maximum likelihood estimation, 3D mapping, arbitrary network topology, 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: Nonlinear Constraint Network Optimization for Efficient Map Learning. https://app.cochat.ai/papers/10.1109/tits.2009.2026444
The paper
Grisetti, G., Stachniss, C., & Burgard, W. (2009). Nonlinear Constraint Network Optimization for Efficient Map Learning. IEEE Transactions on Intelligent Transportation Systems. https://doi.org/10.1109/tits.2009.2026444

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.