Information-theoretic compression of pose graphs for laser-based SLAM
The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
In graph-based simultaneous localization and mapping (SLAM), the pose graph grows over time as the robot gathers information about the environment. An ever growing pose graph, however, prevents long-term mapping with mobile robots. In this paper, we address the problem of efficient information-theoretic compression of pose graphs. Our approach estimates the mutual information between the laser measurements and the map to discard the measurements that are expected to provide only a small amount of information. Our method subsequently marginalizes out the nodes from the pose graph that correspond to the discarded laser measurements. To maintain a sparse pose graph that allows for efficient map optimization, our approach applies an approximate marginalization technique that is based on Chow–Liu trees. Our contributions allow the robot to effectively restrict the size of the pose graph. Alternatively, the robot is able to maintain a pose graph that does not grow unless the robot explores previously unobserved parts of the environment. Real-world experiments demonstrate that our approach to pose graph compression is well suited for long-term mobile robot mapping.
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
FAB-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 6×
“Since then, a large variety of approaches to minimize the error in pose graphs have been proposed, for example, Estrada et al. (2005), Folkesson et al. (2005), Grisetti et al. (2010), Konolige and Agrawal (2008), and Ni et al. (2007). Most of these approaches to SLAM do not provide a means to effectively prune the gra…”
BackgroundInfluentialGlobally Consistent Range Scan Alignment for Environment Mapping
Lu, F., & Milios, E. (1997) · Autonomous Robots · doi:10.1023/a:1008854305733 · Cited by 1,304
Information Gain-based Exploration Using Rao-Blackwellized Particle Filters
Stachniss, C., Grisetti, G., & Burgard, W. (2005) · Robotics: Science and Systems I · doi:10.15607/rss.2005.i.009 · Cited by 542
Self-citationInformation-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 · cited 1×
“Ila et al. (2010) propose to only incorporate nonredundant poses and informative constraints based on the relative distance between poses in information space and the expected information gain of candidate loop closures.”
BackgroundEfficient information-theoretic graph pruning for graph-based SLAM with laser range finders
Kretzschmar, H., Stachniss, C., & Grisetti, G. (2011) · 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems · doi:10.1109/iros.2011.6094414 · Cited by 48 · cited 1×
“This paper extends the work of Kretzschmar et al. (2011) and Stachniss and Kretzschmar (2011) as it provides a more detailed description of the presented approach and a more comprehensive experimental evaluation.”
BackgroundSelf-citation
Cited by
University of Michigan North Campus long-term vision and lidar dataset
Carlevaris-Bianco, N., Ushani, A. K., & Eustice, R. M. (2016) · The International Journal of Robotics Research · doi:10.1177/0278364915614638 · Cited by 576
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
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
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
Generic 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
Metadata
- Authors
- Kretzschmar, H., & Stachniss, C.
- Venue
- The International Journal of Robotics Research
- Publisher
- SAGE Publications
- Published
- 2012-08-06
- Volume
- 31
- Issue
- 11
- Pages
- 1219-1230
- ISSN
- 0278-3649 (ISSN-L)
- 1741-3176
- OpenAlex
- W2091750321
- Cited by
- 109
- References
- 5
- FWCI
- 21.96
- 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: Information-theoretic compression of pose graphs for laser-based SLAM. https://app.cochat.ai/papers/10.1177/0278364912455072
- The paper
- Kretzschmar, H., & Stachniss, C. (2012). Information-theoretic compression of pose graphs for laser-based SLAM. The International Journal of Robotics Research. https://doi.org/10.1177/0278364912455072
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.