The DOI matches its Crossref record; 41 of the 45 references it cites were found in a registry or an index.
Efficient frontier detection for robot exploration
Abstract
Frontier-based exploration is the most common approach to exploration, a fundamental problem in robotics. In frontier-based exploration, robots explore by repeatedly detecting (and moving towards) frontiers, the segments which separate the known regions from those unknown. A frontier detection sub-process examines map and/or sensor readings to identify frontiers for exploration. However, most frontier detection algorithms process the entire map data. This can be a time-consuming process, which affects the exploration decisions. In this work, we present several novel frontier detection algorithms that do not process the entire map data, and explore them in depth. We begin by investigating algorithms that represent two approaches: Wavefront Frontier Detector (WFD), a graph-search-based algorithm which examines only known areas, and Fast Frontier Detector (FFD), which examines only new laser readings data. We analytically examine the complexity of both algorithms, and discuss their correctness. We then improve by combining elements of both, to create two additional algorithms, called WFD-INC and WFD-IP . We empirically evaluate all algorithms, and show that they are all faster than a state-of-the-art frontier detector implementation (by several orders of magnitude). We additionally contrast them with each other and demonstrate the FFD and WFD-IP are faster than the others by one additional order of magnitude.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
Adhi Harmoko, S., M.Komp, Jacquard, J. M., Zuse, K., & Eniac (2005) · Cited by 18,035
Rayward-Smith, V. J. (1991) · Journal of the Operational Research Society · doi:10.1057/jors.1991.155 · Cited by 16,821
Monte Carlo sampling methods using Markov chains and their applications.
Hastings, W. K. (1970) · Biometrika · doi:10.1093/biomet/57.1.97 · Cited by 15,195 · cited 1×
“A particle filter is the online version of Markov chain Monte Carlo (MCMC) methods (Hastings, 1970; Geyer, 1992; Neal, 1993).”
MethodSimultaneous 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
Improved Techniques for Grid Mapping With Rao-Blackwellized Particle Filters
Grisetti, G., Stachniss, C., & Burgard, W. (2007) · IEEE Transactions on Robotics · doi:10.1109/tro.2006.889486 · Cited by 2,439
Algorithm for computer control of a digital plotter
Bresenham, J. E. (1965) · IBM Systems Journal · doi:10.1147/sj.41.0025 · Cited by 2,172
Practical markov chain monte carlo
Geyer, C. J. (1992) · Statistical Science · doi:10.1214/ss/1177011137 · Cited by 2,045
A frontier-based approach for autonomous exploration
Yamauchi, B. (2002) · Proceedings 1997 IEEE International Symposium on Computational Intelligence in Robotics and Automation CIRA'97. 'Towards New Computational Principles for Robotics and Automation' · doi:10.1109/cira.1997.613851 · Cited by 1,695
O’Regan, G. (2023) · Texts in Computer Science · doi:10.1007/978-3-031-26212-8_4 · Cited by 1,614
Research works printed but not linked: 10
- Bouraqadi N, 2009, National conference on control architectures of robots
- Durrant-Whyte H, 2006, Robotics and Automation Magazine, 13, 80
- Fox D, 2010, Proceedings of the IEEE, 94, 1325
- Konolige K, 2003, Proceedings from the 2003 International workshop on multi-robot systems: from swarms to intelligent autonoma, 2, 193
- Lau H, 2003, Australasian conference on robotics and automation (ACRA)
- Puig Valls D, 2010, Journal of Physical Agents, 4, 35
- Sawhney R, 2009, Proceedings of the eighth International joint conference on autonomous agents and multi-agent systems (AAMAS-09), 73
- Simmons R, 2000, Proceedings of the seventeenth National conference on artificial intelligence (AAAI-00), 852
- Stachniss C (2006) Exploration and Mapping with Mobile Robots. Ph.D. thesis, University of Freiburg, Department of Computer Science.
- Stoeter S, 2000, Proceedings of the International conference on intelligent autonomous systems, 767
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., & Leonard, J. J. (2016) · IEEE Transactions on Robotics · doi:10.1109/tro.2016.2624754 · Cited by 3,596
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
A Survey on Active Simultaneous Localization and Mapping: State of the Art and New Frontiers
Placed, J. A., Strader, J., Carrillo, H., Atanasov, N., Indelman, V., Carlone, L., & Castellanos, J. A. (2023) · IEEE Transactions on Robotics · doi:10.1109/tro.2023.3248510 · Cited by 332
Goal-Driven Autonomous Exploration Through Deep Reinforcement Learning
Cimurs, R., Suh, I. H., & Lee, J. H. (2022) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2021.3133591 · Cited by 184
Active Mapping and Robot Exploration: A Survey
Lluvia, I., Lazkano, E., & Ansuategi, A. (2021) · Sensors · doi:10.3390/s21072445 · Cited by 200
Metadata
- Authors
- Keidar, M., & Kaminka, G. A.
- Affiliations
- Bar-Ilan University (IL)
- ORCID
- Kaminka, Gal A.
- Venue
- The International Journal of Robotics Research
- Publisher
- SAGE Publications
- Published
- 2013-10-22
- Volume
- 33
- Issue
- 2
- Pages
- 215-236
- ISSN
- 0278-3649 (ISSN-L)
- 1741-3176
- OpenAlex
- W2169781427
- Cited by
- 151
- References
- 45
- Citations by year
- 2026: 13 · 2025: 24 · 2024: 18 · 2023: 18 · 2022: 14 · 2021: 16 · 2020: 10 · 2019: 9 · 2018: 11 · 2017: 2 · 2016: 6 · 2015: 4 · 2014: 6
- FWCI
- 8.57
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- journals.sagepub.com/page/policies/text-and-data-mining-license (tdm)
- Locations
- The International Journal of Robotics Research (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Robotics and Sensor-Based Localization
- Physical Sciences › Engineering › Control and Systems Engineering › Robotic Path Planning Algorithms
- Physical Sciences › Computer Science › Artificial Intelligence › Reinforcement Learning in Robotics
- Keywords
- frontier detection, robot exploration, frontier exploration, graph search, computational complexity, map partitioning, mobile robot navigation
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: Efficient frontier detection for robot exploration. https://app.cochat.ai/papers/10.1177/0278364913494911
- The paper
- Keidar, M., & Kaminka, G. A. (2014). Efficient frontier detection for robot exploration. The International Journal of Robotics Research. https://doi.org/10.1177/0278364913494911
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.