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

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

Autonomous robotic exploration based on multiple rapidly-exploring randomized trees

Umari, Hassan, Mukhopadhyay, Shayok·2017·2017 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)

Abstract

Efficient robotic navigation requires a predefined map. Various autonomous exploration strategies exist, which direct robots to unexplored space by detecting frontiers. Frontiers are boundaries separating known space form unknown space. Usually frontier detection utilizes image processing tools like edge detection, thus limiting it to two dimensional (2D) exploration. This paper presents a new exploration strategy based on the use of multiple Rapidly-exploring Random Trees (RRTs). The RRT algorithm is chosen because, it is biased towards unexplored regions. Also, using RRT provides a general approach which can be extended to higher dimensional spaces. The proposed strategy is implemented and tested using the Robot Operating System (ROS) framework. Additionally this work uses local and global trees for detecting frontier points, which enables efficient robotic exploration. Current efforts are limited to the single robot case. Extension to multi-agent systems and three-dimensional (3D) space is left for future effort.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Integrity signals

Registry

Crossref · 10.1109/iros.2017.8202319

Cites

20 of 20 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.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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 20 references

Cited by

See all 286

Metadata

Authors
Umari, H., & Mukhopadhyay, S.
Venue
2017 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)
Publisher
IEEE
Published
2017-09
Pages
1396-1402
OpenAlex
W2771728020
Cited by
286
References
20
FWCI
3.72
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: Autonomous robotic exploration based on multiple rapidly-exploring randomized trees. https://app.cochat.ai/papers/10.1109/iros.2017.8202319
The paper
Umari, H., & Mukhopadhyay, S. (2017). Autonomous robotic exploration based on multiple rapidly-exploring randomized trees. 2017 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). https://doi.org/10.1109/iros.2017.8202319

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.