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

The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.

Efficient Autonomous Exploration Planning of Large-Scale 3-D Environments

Open access
Selin, Magnus, Tiger, Mattias, Duberg, Daniel, Heintz, Fredrik, Jensfelt, Patric · 2019 · IEEE Robotics and Automation Letters

Abstract

Exploration is an important aspect of robotics, whether it is for mapping, rescue missions or path planning in an unknown environment. Frontier Exploration planning (FEP) and Receding Horizon Next-Best-View planning (RH-NBVP) are two different approaches with different strengths and weaknesses. FEP explores a large environment consisting of separate regions with ease, but is slow at reaching full exploration due to moving back and forth between regions. RH-NBVP shows great potential and efficiently explores individual regions, but has the disadvantage that it can get stuck in large environments not exploring all regions. In this work we present a method that combines both approaches, with FEP as a global exploration planner and RH-NBVP for local exploration. We also present techniques to estimate potential information gain faster, to cache previously estimated gains and to exploit these to efficiently estimate new queries.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/lra.2019.2897343

Cites

3 of 3 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 3 references

Cited by

See all 231

Metadata

Authors
Selin, M., Tiger, M., Duberg, D., Heintz, F., & Jensfelt, P.
Venue
IEEE Robotics and Automation Letters
Published
2019-04
Volume
4
Issue
2
Pages
1699-1706
ISSN
  • 2377-3766 (ISSN-L)
  • 2377-3774
OpenAlex
W2912372166
Cited by
231
References
3
FWCI
15.19
Type
journal article
Language
en
Open access
green

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 Autonomous Exploration Planning of Large-Scale 3-D Environments. https://app.cochat.ai/papers/10.1109/lra.2019.2897343
The paper
Selin, M., Tiger, M., Duberg, D., Heintz, F., & Jensfelt, P. (2019). Efficient Autonomous Exploration Planning of Large-Scale 3-D Environments. IEEE Robotics and Automation Letters. https://doi.org/10.1109/lra.2019.2897343

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.