CoChat

Online constraint network optimization for efficient maximum likelihood map learning

Grisetti, G., Lodi Rizzini, D., Stachniss, C., Olson, E., Burgard, W. · 2008 · 2008 IEEE International Conference on Robotics and Automation
Cited by 69

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

Abstract

In this paper, we address the problem of incrementally optimizing constraint networks for maximum likelihood map learning. Our approach allows a robot to efficiently compute configurations of the network with small errors while the robot moves through the environment. We apply a variant of stochastic gradient descent and use a tree-based parameterization of the nodes in the network. By integrating adaptive learning rates in the parameterization of the network, our algorithm can use previously computed solutions to determine the result of the next optimization run. Additionally, our approach updates only the parts of the network which are affected by the newly incorporated measurements and starts the optimization approach only if the new data reveals inconsistencies with the network constructed so far. These improvements yield an efficient solution for this class of online optimization problems. Our approach has been implemented and tested on simulated and on real data. We present comparisons to recently proposed online and offline methods that address the problem of optimizing constraint network. Experiments illustrate that our approach converges faster to a network configuration with small errors than the previous approaches.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/robot.2008.4543481

Cites

3 of 3 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 3 references

Cited by

See all 69

Metadata

Authors
Grisetti, G., Lodi Rizzini, D., Stachniss, C., Olson, E., & Burgard, W.
Venue
2008 IEEE International Conference on Robotics and Automation
Publisher
IEEE
Published
2008-05
Pages
1880-1885
ISSN
1050-4729 (ISSN-L)
OpenAlex
W2123940811
Cited by
69
References
3
FWCI
24.12
Type
conference paper
Language
en
Open access
closed

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: Online constraint network optimization for efficient maximum likelihood map learning. https://app.cochat.ai/papers/10.1109/robot.2008.4543481
The paper
Grisetti, G., Lodi Rizzini, D., Stachniss, C., Olson, E., & Burgard, W. (2008). Online constraint network optimization for efficient maximum likelihood map learning. 2008 IEEE International Conference on Robotics and Automation. https://doi.org/10.1109/robot.2008.4543481

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.