Closing a Million-Landmarks Loop
The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
We present an improved version of the treemap SLAM algorithm which uses Cholesky factors for representing Gaussians and a hierarchical tree partitioning algorithm derived from the established Kernighan-Lin heuristic for graph bisection. We demonstrate the algorithm's efficiency by mapping a simulated building with 1032271 landmarks. In the end, we close a million-landmarks loop in 21 ms, providing an estimate for ap10000 selected landmarks close to the robot, or in 442 ms for computing a full estimate
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
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
Bosse, M., Newman, P., Leonard, J., & Teller, S. (2004) · The International Journal of Robotics Research · doi:10.1177/0278364904049393 · Cited by 305
Cited by
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
“Treemap [48] uses Cholesky factors to represent probability distributions in a tree-based algorithm.”
MethodSimultaneous Localization and Mapping: A Survey of Current Trends in Autonomous Driving
Bresson, G., Alsayed, Z., Yu, L., & Glaser, S. (2017) · IEEE Transactions on Intelligent Vehicles · doi:10.1109/tiv.2017.2749181 · Cited by 885
“In a different approach, TreeMap [80] exploits a tree structure for the map and makes topological groups of landmarks so as to make the information matrix sparser and so quicken the processing ( O (log n) for n landmarks).”
Perception, Planning, Control, and Coordination for Autonomous Vehicles
Pendleton, S., Andersen, H., Du, X., Shen, X., Meghjani, M., Eng, Y., Rus, D., & Ang, M. (2017) · Machines · doi:10.3390/machines5010006 · Cited by 657
Simultaneous Localization and Mapping
Thrun, S. (2007) · Springer Tracts in Advanced Robotics · doi:10.1007/978-3-540-75388-9_3 · Cited by 530
Sliding window filter with application to planetary landing
Sibley, G., Matthies, L., & Sukhatme, G. (2010) · Journal of Field Robotics · doi:10.1002/rob.20360 · Cited by 259
Metadata
- Authors
- Frese, U., & Schroder, L.
- Venue
- 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems
- Publisher
- IEEE
- Published
- 2006-10
- Pages
- 5032-5039
- OpenAlex
- W2108673707
- Cited by
- 63
- References
- 2
- FWCI
- 15.23
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Closing a Million-Landmarks Loop. https://app.cochat.ai/papers/10.1109/iros.2006.282531
- The paper
- Frese, U., & Schroder, L. (2006). Closing a Million-Landmarks Loop. 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems. https://doi.org/10.1109/iros.2006.282531
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.