Generic Node Removal for Factor-Graph SLAM
The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Abstract
This paper reports on a generic factor-based method for node removal in factor-graph simultaneous localization and mapping (SLAM), which we call generic linear constraints (GLCs). The need for a generic node removal tool is motivated by long-term SLAM applications, whereby nodes are removed in order to control the computational cost of graph optimization. GLC is able to produce a new set of linearized factors over the elimination clique that can represent either the true marginalization (i.e., dense GLC) or a sparse approximation of the true marginalization using a ChowLiu tree (i.e., sparse GLC). The proposed algorithm improves upon commonly used methods in two key ways: First, it is not limited to graphs with strictly full-state relative-pose factors and works equally well with other low-rank factors, such as those produced by monocular vision. Second, the new factors are produced in such a way that accounts for measurement correlation, which is a problem encountered in other methods that rely strictly upon pairwise measurement composition. We evaluate the proposed method over multiple real-world SLAM graphs and show that it outperforms other recently proposed methods in terms of Kullback-Leibler divergence. Additionally, we experimentally demonstrate that the proposed GLC method provides a principled and flexible tool to control the computational complexity of long-term graph SLAM, with results shown for 34.9 h of real-world indoor-outdoor data covering 147.4 km collected over 27 mapping sessions spanning a period of 15 months.
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
iSAM: Incremental Smoothing and Mapping
Kaess, M., Ranganathan, A., & Dellaert, F. (2008) · IEEE Transactions on Robotics · doi:10.1109/tro.2008.2006706 · Cited by 1,076
Self-citationFast 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
Information-Based Compact Pose SLAM
Ila, V., Porta, J. M., & Andrade-Cetto, J. (2010) · IEEE Transactions on Robotics · doi:10.1109/tro.2009.2034435 · Cited by 183
DDF-SAM 2.0: Consistent distributed smoothing and mapping
Cunningham, A., Indelman, V., & Dellaert, F. (2013) · 2013 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2013.6631323 · Cited by 171 · cited 1×
“1(d) and (f)].”
Consistent sparsification for graph optimization
Huang, G., Kaess, M., & Leonard, J. J. (2013) · 2013 European Conference on Mobile Robots · doi:10.1109/ecmr.2013.6698835 · Cited by 70
Self-citationGeneric factor-based node marginalization and edge sparsification for pose-graph SLAM
Carlevaris-Bianco, N., & Eustice, R. M. (2013) · 2013 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2013.6631403 · Cited by 52
Self-citationTemporally scalable visual SLAM using a reduced pose graph
Johannsson, H., Kaess, M., Fallon, M., & Leonard, J. J. (2013) · 2013 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2013.6630556 · Cited by 39
Self-citation
Cited by
Communication-constrained multi-AUV cooperative SLAM
Paull, L., Huang, G., Seto, M., & Leonard, J. J. (2015) · 2015 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra.2015.7139227 · Cited by 116
Nonlinear factor recovery for long-term SLAM
Mazuran, M., Burgard, W., & Tipaldi, G. D. (2016) · The International Journal of Robotics Research · doi:10.1177/0278364915581629 · Cited by 63
Autonomous Planetary Rover Navigation via Active SLAM
Li, G., Geng, Y., & Zhang, W. (2018) · Aircraft Engineering and Aerospace Technology · doi:10.1108/aeat-12-2016-0239 · Cited by 11
Metadata
- Authors
- Carlevaris-Bianco, N., Kaess, M., & Eustice, R. M.
- Venue
- IEEE Transactions on Robotics
- Published
- 2014-12
- Volume
- 30
- Issue
- 6
- Pages
- 1371-1385
- ISSN
- 1552-3098 (ISSN-L)
- 1941-0468
- OpenAlex
- W2095025682
- Cited by
- 96
- References
- 8
- FWCI
- 14.69
- Type
- journal article
- 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: Generic Node Removal for Factor-Graph SLAM. https://app.cochat.ai/papers/10.1109/tro.2014.2347571
- The paper
- Carlevaris-Bianco, N., Kaess, M., & Eustice, R. M. (2014). Generic Node Removal for Factor-Graph SLAM. IEEE Transactions on Robotics. https://doi.org/10.1109/tro.2014.2347571
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.