Online probabilistic topological mapping
The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Abstract
We present a novel algorithm for topological mapping, which is the problem of finding the graph structure of an environment from a sequence of measurements. Our algorithm, called Online Probabilistic Topological Mapping (OPTM), systematically addresses the problem by constructing the posterior on the space of all possible topologies given measurements. With each successive measurement, the posterior is updated incrementally using a Rao—Blackwellized particle filter. We present efficient sampling mechanisms using data-driven proposals and prior distributions on topologies that further enable OPTM’s operation in an online manner. OPTM can incorporate various sensors seamlessly, as is demonstrated by our use of appearance, laser, and odometry measurements. OPTM is the first topological mapping algorithm that is theoretically accurate, systematic, sensor independent, and online, and thus advances the state of the art significantly. We evaluate the algorithm on a robot in diverse environments.
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
Distinctive Image Features from Scale-Invariant Keypoints
Lowe, D. G. (2004) · International Journal of Computer Vision · doi:10.1023/b:visi.0000029664.99615.94 · Cited by 55,589
Simultaneous localization and mapping (SLAM): part II
Bailey, T., & Durrant-Whyte, H. (2006) · IEEE Robotics & Automation Magazine · doi:10.1109/mra.2006.1678144 · Cited by 2,554
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 3×
“Cummins and Newman (2008) also provide an appearance-based technique for loop closing based on generative-modeling of bag-of-words models of location images.”
BackgroundObject modeling by registration of multiple range images
Chen, Y., & Medioni, G. (2002) · Proceedings. 1991 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1991.132043 · Cited by 1,409 · cited 2×
“We use the scheme of Chen and Medioni [10], which involves point-to-plane matching, to perform scan matching.”
MethodGlobally Consistent Range Scan Alignment for Environment Mapping
Lu, F., & Milios, E. (1997) · Autonomous Robots · doi:10.1023/a:1008854305733 · Cited by 1,304
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
Bosse, M., Newman, P., Leonard, J., & Teller, S. (2004) · The International Journal of Robotics Research · doi:10.1177/0278364904049393 · Cited by 305 · cited 1×
“We used the MIT Killian Court dataset (Bosse et al. 2004) which is another widely used dataset in the SLAM community.”
Method
Cited by
Deliberation for autonomous robots: A survey
Ingrand, F., & Ghallab, M. (2017) · Artificial Intelligence · doi:10.1016/j.artint.2014.11.003 · Cited by 309
“…models and surveyed in [197]; • Environment models , in particular at the geometric level SLAM techniques 209, 11], possibly combined with planning [145], and at the combined geometric and topologic levels, e.g., [45, 125, 184]. sensory-motor and environment the scope of this focus to deliberation.”
BackgroundRobust loop closing over time for pose graph SLAM
Latif, Y., Cadena, C., & Neira, J. (2013) · The International Journal of Robotics Research · doi:10.1177/0278364913498910 · Cited by 221
Tsintotas, K. A., Bampis, L., & Gasteratos, A. (2022) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2022.3175656 · Cited by 175
“becomes progressively less accurate, these approaches attempt to detect loops only upon the similarity between sensory measurements [57]–[59].”
BackgroundAutonomous Vehicle Navigation in Rural Environments Without Detailed Prior Maps
Ort, T., Paull, L., & Rus, D. (2018) · 2018 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra.2018.8460519 · Cited by 147
Metadata
- Authors
- Ranganathan, A., & Dellaert, F.
- Venue
- The International Journal of Robotics Research
- Publisher
- SAGE Publications
- Published
- 2011-01-24
- Volume
- 30
- Issue
- 6
- Pages
- 755-771
- ISSN
- 0278-3649 (ISSN-L)
- 1741-3176
- OpenAlex
- W1996518131
- Cited by
- 68
- References
- 7
- FWCI
- 15.46
- 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: Online probabilistic topological mapping. https://app.cochat.ai/papers/10.1177/0278364910393287
- The paper
- Ranganathan, A., & Dellaert, F. (2011). Online probabilistic topological mapping. The International Journal of Robotics Research. https://doi.org/10.1177/0278364910393287
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.