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

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

Roadmap-Based Path Planning - Using the Voronoi Diagram for a Clearance-Based Shortest Path

Bhattacharya, Priyadarshi, Gavrilova, Marina·2008·IEEE Robotics & Automation Magazine

Abstract

Path planning still remains one of the core problems in modern robotic applications, such as the design of autonomous vehicles and perceptive systems. The basic path-planning problem is concerned with finding a good-quality path from a source point to a destination point that does not result in collision with any obstacles. In this article, we chose the roadmap approach and utilized the Voronoi diagram to obtain a path that is a close approximation of the shortest path satisfying the required clearance value set by the user. The advantage of the proposed technique versus alternative path-planning methods is in its simplicity, versatility, and efficiency.

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/mra.2008.921540

Cites

24 of 24 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 24 references

Cited by

See all 312

Metadata

Authors
Bhattacharya, P., & Gavrilova, M.
Venue
IEEE Robotics & Automation Magazine
Published
2008-06
Volume
15
Issue
2
Pages
58-66
ISSN
1070-9932 (ISSN-L)
OpenAlex
W2116772004
Cited by
312
References
24
FWCI
10.50
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: Roadmap-Based Path Planning - Using the Voronoi Diagram for a Clearance-Based Shortest Path. https://app.cochat.ai/papers/10.1109/mra.2008.921540
The paper
Bhattacharya, P., & Gavrilova, M. (2008). Roadmap-Based Path Planning - Using the Voronoi Diagram for a Clearance-Based Shortest Path. IEEE Robotics & Automation Magazine. https://doi.org/10.1109/mra.2008.921540

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.