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
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
Cites
Statistics
Verification
Claims the paper makes
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?
In the citing paper
“Most SLAM algorithms are based on iterative nonlinear optimization [63, 99, 125, 126, 192, 204].”
From Past, Present, and Future of Simultaneous Localization and Mapping: Toward the Robust-Perception Age (2016) · cites this paper as [99]
Citations
Cites
Stanley: The robot that won the DARPA Grand Challenge
Thrun, S., Montemerlo, M., Dahlkamp, H., Stavens, D., Aron, A., Diebel, J., Fong, P., Gale, J., Halpenny, M., Hoffmann, G., et al. (2006) · Journal of Field Robotics · doi:10.1002/rob.20147 · Cited by 2,237 · cited 2×
“Using such cars as robots has become popular in the robotics community [3], [29], [ 34 ], [38].”
A new approach for filtering nonlinear systems
Julier, S. J., Uhlmann, J. K., & Durrant-Whyte, H. F. (2005) · Proceedings of 1995 American Control Conference - ACC'95 · doi:10.1109/acc.1995.529783 · Cited by 1,926
Globally Consistent Range Scan Alignment for Environment Mapping
Lu, F., & Milios, E. (1997) · Autonomous Robots · doi:10.1023/a:1008854305733 · Cited by 1,304
Estimating Uncertain Spatial Relationships in Robotics
Smith, R., Self, M., & Cheeseman, P. (1990) · Autonomous Robot Vehicles · doi:10.1007/978-1-4613-8997-2_14 · Cited by 1,288
Mobile robot localization by tracking geometric beacons
Leonard, J. J., & Durrant-Whyte, H. F. (1991) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.88147 · Cited by 1,245
Square Root SAM: Simultaneous Localization and Mapping via Square Root Information Smoothing
Dellaert, F., & Kaess, M. (2006) · The International Journal of Robotics Research · doi:10.1177/0278364906072768 · Cited by 922
Montemerlo, M., Thrun, S., Roller, D., & Wegbreit, B. (2003) · International Joint Conference on Artificial Intelligence · Cited by 868
Estimating uncertain spatial relationships in robotics
Smith, R., Self, M., & Cheeseman, P. (2005) · Proceedings. 1987 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1987.1087846 · Cited by 757
Simultaneous Localization and Mapping with Sparse Extended Information Filters
Thrun, S., Liu, Y., Koller, D., Ng, A. Y., Ghahramani, Z., & Durrant-Whyte, H. (2004) · The International Journal of Robotics Research · doi:10.1177/0278364904045479 · Cited by 651
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
Research works printed but not linked: 5
- stachniss, 2007, TORO project at OpenSLAM org
- ranganathan, 2007, loopy sam, Proc IJCAI, 2191
- uhlmann, 1995, Dynamic map building and localization New theoretical foundations
- 10.1109/TRO.2004.839220 · DOI · Paper page
- barrera, 2004, incremental spherical linear interpolation, Proc SIGRAD, 13, 7
Cited by
A benchmark for the evaluation of RGB-D SLAM systems
Sturm, J., Engelhard, N., Endres, F., Burgard, W., & Cremers, D. (2012) · 2012 IEEE/RSJ International Conference on Intelligent Robots and Systems · doi:10.1109/iros.2012.6385773 · Cited by 3,976
Self-citationPast, Present, and Future of Simultaneous Localization and Mapping: Toward the Robust-Perception Age
Cadena, C., Carlone, L., Carrillo, H., Latif, Y., Scaramuzza, D., Neira, J., Reid, I., & Leonard, J. J. (2016) · IEEE Transactions on Robotics · doi:10.1109/tro.2016.2624754 · Cited by 3,596
“5(left).”
Past, present, and future of simultaneous localization and mapping: Toward the robust-perception age
Cadena, C., Carlone, L., Carrillo, H., Latif, Y., Scaramuzza, D., Neira, J., Reid, I. D., & Leonard, J. J. (2016) · Zurich Open Repository and Archive (University of Zurich) · doi:10.5167/uzh-138892 · Cited by 3,048
G2o: A general framework for graph optimization
Kummerle, R., Grisetti, G., Strasdat, H., Konolige, K., & Burgard, W. (2011) · 2011 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2011.5979949 · Cited by 1,982
“Typical instances are simultaneous localization and mapping (SLAM) [19], [5], [22], [10], [16], [26] or bundle adjustment (BA) [27], [15], [18].”
BackgroundMethodSelf-citationAUV Navigation and Localization: A Review
Paull, L., Saeedi, S., Seto, M., & Li, H. (2014) · IEEE Journal of Oceanic Engineering · doi:10.1109/joe.2013.2278891 · Cited by 1,536
“[45], [46], and hierarchical optimization for pose graphs on manifolds (HOGMAN) [47].”
Background
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.