The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Robust map optimization using dynamic covariance scaling
Abstract
Developing the perfect SLAM front-end that produces graphs which are free of outliers is generally impossible due to perceptual aliasing. Therefore, optimization back-ends need to be able to deal with outliers resulting from an imperfect front-end. In this paper, we introduce dynamic covariance scaling, a novel approach for effective optimization of constraint networks under the presence of outliers. The key idea is to use a robust function that generalizes classical gating and dynamically rejects outliers without compromising convergence speed. We implemented and thoroughly evaluated our method on publicly available datasets. Compared to recently published state-of-the-art methods, we obtain a substantial speed up without increasing the number of variables in the optimization process. Our method can be easily integrated in almost any SLAM back-end.
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
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
Self-citationFAB-MAP: Probabilistic Localization and Mapping in the Space of Appearance
Cummins, M., & Newman, P. (2008) · The International Journal of Robotics Research · doi:10.1177/0278364908090961 · Cited by 1,472 · cited 2×
“Generating outlier-free graphs in the front-end, however, is very challenging, especially in environments showing selfsimilar structures [5], [6], [7].”
BackgroundGlobally Consistent Range Scan Alignment for Environment Mapping
Lu, F., & Milios, E. (1997) · Autonomous Robots · doi:10.1023/a:1008854305733 · Cited by 1,304
Parameter estimation techniques: a tutorial with application to conic fitting
Zhang, Z. (1997) · Image and Vision Computing · doi:10.1016/s0262-8856(96)01112-2 · Cited by 975
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
Switchable constraints for robust pose graph SLAM
Sunderhauf, N., & Protzel, P. (2012) · 2012 IEEE/RSJ International Conference on Intelligent Robots and Systems · doi:10.1109/iros.2012.6385590 · Cited by 344
Dynamic Maps for Long-Term Operation of Mobile Service Robots
Biber, P., & Duckett, T. (2005) · Robotics: Science and Systems I · doi:10.15607/rss.2005.i.003 · Cited by 334
An Atlas framework for scalable mapping
Bosse, M., Newman, P., Leonard, J., Soika, M., Feiten, W., & Teller, S. (2003) · 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422) · doi:10.1109/robot.2003.1241872 · Cited by 313
A multilevel relaxation algorithm for simultaneous localization and mapping
Frese, U., Larsson, P., & Duckett, T. (2005) · IEEE Transactions on Robotics · doi:10.1109/tro.2004.839220 · Cited by 283
Inference on networks of mixtures for robust robot mapping
Olson, E., & Agarwal, P. (2013) · The International Journal of Robotics Research · doi:10.1177/0278364913479413 · Cited by 252
Self-citationNonlinear Constraint Network Optimization for Efficient Map Learning
Grisetti, G., Stachniss, C., & Burgard, W. (2009) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2009.2026444 · Cited by 222 · cited 1×
“Since then, many approaches for minimizing the error in the constraint network have been proposed, including relaxation methods [13], [3], stochastic gradient descent and its variants [2], [14], smoothing techniques [4] and hierarchical techniques [15], [1].”
BackgroundSelf-citationHierarchical 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-citationRelaxation on a mesh: a formalism for generalized localization
Howard, A., Mataric, M. J., & Sukhatme, G. (2002) · Proceedings 2001 IEEE/RSJ International Conference on Intelligent Robots and Systems. Expanding the Societal Role of Robotics in the the Next Millennium (Cat. No.01CH37180) · doi:10.1109/iros.2001.976308 · Cited by 180
iSAM: Fast Incremental Smoothing and Mapping with Efficient Data Association
Kaess, M., Ranganathan, A., & Dellaert, F. (2007) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2007.363563 · Cited by 130
Recognizing places using spectrally clustered local matches
Olson, E. (2009) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2009.07.021 · Cited by 59
Latif, Y., Cadena, C., & Neira, J. (2012) · Robotics: Science and Systems · doi:10.15607/rss.2012.viii.030 · Cited by 55
FLIRT: Interest Regions for 2D Range Data with Applications to Robot Navigation
Tipaldi, G. D., Braun, M., & Arras, K. O. (2013) · Springer tracts in advanced robotics · doi:10.1007/978-3-642-28572-1_48 · Cited by 28
Self-citation
Cited by
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
Real-time loop closure in 2D LIDAR SLAM
Hess, W., Kohler, D., Rapp, H., & Andor, D. (2016) · 2016 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra.2016.7487258 · Cited by 1,938
3-D Mapping With an RGB-D Camera
Endres, F., Hess, J., Sturm, J., Cremers, D., & Burgard, W. (2014) · IEEE Transactions on Robotics · doi:10.1109/tro.2013.2279412 · Cited by 820
Self-citationQuadricSLAM: Dual Quadrics From Object Detections as Landmarks in Object-Oriented SLAM
Nicholson, L., Milford, M., & Sunderhauf, N. (2019) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2018.2866205 · Cited by 325
Yang, H., Antonante, P., Tzoumas, V., & Carlone, L. (2020) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2020.2965893 · Cited by 325
Metadata
- Authors
- Agarwal, P., Tipaldi, G. D., Spinello, L., Stachniss, C., & Burgard, W.
- Venue
- 2013 IEEE International Conference on Robotics and Automation
- Publisher
- IEEE
- Published
- 2013-05
- Pages
- 62-69
- ISSN
- 1050-4729 (ISSN-L)
- OpenAlex
- W2109271936
- Cited by
- 293
- References
- 17
- FWCI
- 35.99
- 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.