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

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

On Finding Narrow Passages with Probabilistic Roadmap Planners

·1998·Robotics: The Algorithmic Perspective

Abstract

A probabilistic roadmap is a network of simple paths connecting collision-free configurations obtained by sampling a robot’s configuration space at random. Several probabilistic roadmap planners have solved un­ usually difficult path-planning problems, but their effi­ ciency remains disappointing when the free space con­ tains narrow passages. This paper provides foundations for understanding the effect of passages on the con­ nectedness of probabilistic roadmaps. It also proposes a new random sampling scheme for finding such pas­ sages. An initial roadmap is built in a “dilated” free space allowing some penetration distance of the robot into the obstacles. This roadmap is then modified by resampling around the links that do not lie in the true free space. Experiments show that this strategy allows relatively small roadmaps to reliably capture the free space connectivity.

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.1201/9781439863886-18

Cites

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

Cited by

See all 307

Metadata

Venue
Robotics: The Algorithmic Perspective
Published
1998-12-15
Pages
151-164
OpenAlex
W1670942551
Cited by
307
References
1
FWCI
24.14
Type
book chapter
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: On Finding Narrow Passages with Probabilistic Roadmap Planners. https://app.cochat.ai/papers/10.1201/9781439863886-18
The paper
On Finding Narrow Passages with Probabilistic Roadmap Planners. (1998). Robotics: The Algorithmic Perspective. https://doi.org/10.1201/9781439863886-18

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.