Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

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

Keidar, Matan, Kaminka, Gal A. · 2014 · The International Journal of Robotics Research

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

Crossref · 10.1177/0278364913494911

Cites

41 of 41 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Citations

Cites

Show all 45 references

Research works printed but not linked: 10

  1. Bouraqadi N, 2009, National conference on control architectures of robots
  2. Durrant-Whyte H, 2006, Robotics and Automation Magazine, 13, 80
  3. Fox D, 2010, Proceedings of the IEEE, 94, 1325
  4. Konolige K, 2003, Proceedings from the 2003 International workshop on multi-robot systems: from swarms to intelligent autonoma, 2, 193
  5. Lau H, 2003, Australasian conference on robotics and automation (ACRA)
  6. Puig Valls D, 2010, Journal of Physical Agents, 4, 35
  7. Sawhney R, 2009, Proceedings of the eighth International joint conference on autonomous agents and multi-agent systems (AAMAS-09), 73
  8. Simmons R, 2000, Proceedings of the seventeenth National conference on artificial intelligence (AAAI-00), 852
  9. Stachniss C (2006) Exploration and Mapping with Mobile Robots. Ph.D. thesis, University of Freiburg, Department of Computer Science.
  10. Stoeter S, 2000, Proceedings of the International conference on intelligent autonomous systems, 767

Cited by

See all 161

Metadata

Authors
Keidar, M., & Kaminka, G. A.
Affiliations
Bar-Ilan University (IL)
Venue
The International Journal of Robotics Research
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.