Online constraint network optimization for efficient maximum likelihood map learning
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.
Integrity signals
Registry
Cites
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.
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
Globally Consistent Range Scan Alignment for Environment Mapping
Lu, F., & Milios, E. (1997) · Autonomous Robots · doi:10.1023/a:1008854305733 · Cited by 1,304
Incremental mapping of large cyclic environments
Gutmann, J.-S., & Konolige, K. (2003) · Proceedings 1999 IEEE International Symposium on Computational Intelligence in Robotics and Automation. CIRA'99 (Cat. No.99EX375) · doi:10.1109/cira.1999.810068 · Cited by 568 · cited 1×
“Gutmann and Konolige [11] presented an effective way for constructing such a network and for detecting loop closures while running an incremental estimation algorithm.”
Fast iterative alignment of pose graphs with poor initial estimates
Olson, E., Leonard, J., & Teller, S. (2006) · Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006. · doi:10.1109/robot.2006.1642040 · Cited by 427
Self-citation
Cited by
Simultaneous Localization and Mapping
Thrun, S. (2007) · Springer Tracts in Advanced Robotics · doi:10.1007/978-3-540-75388-9_3 · Cited by 530
Real-Time Visual SLAM for Autonomous Underwater Hull Inspection Using Visual Saliency
Kim, A., & Eustice, R. M. (2013) · IEEE Transactions on Robotics · doi:10.1109/tro.2012.2235699 · Cited by 263
Hierarchical optimization on manifolds for online 2D and 3D mapping
Grisetti, G., Kummerle, R., Stachniss, C., Frese, U., & Hertzberg, C. (2010) · 2010 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.2010.5509407 · Cited by 199
Self-citationA convex relaxation for approximate global optimization in simultaneous localization and mapping
Rosen, D. M., DuHadway, C., & Leonard, J. J. (2015) · 2015 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra.2015.7140014 · Cited by 56
“Consequently, SLAM has been the focus of a sustained research effort over the previous three decades, and there now exist a variety of mature algorithms and software libraries to solve this problem in practice (cf. [2]–[5]).”
BackgroundMethodInfluentialOn the number of local minima to the point feature based SLAM problem
Huang, S., Wang, H., Frese, U., & Dissanayake, G. (2012) · 2012 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2012.6224876 · Cited by 28
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
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.