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

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

Coordinated motion planning for multiple car-like robots using probabilistic roadmaps

Svestka, P., Overmars, M.H.·2002·Proceedings of 1995 IEEE International Conference on Robotics and Automation

Abstract

Presents a new approach to the multi-robot path planning problem, where a number of robots are to change their positions through feasible motions in the same static environment. The approach is probabilistically complete. That is, any solvable problem is guaranteed to be solved within a finite amount of time. The method, which is an extension of previous work on probabilistic single-robot planners, is very flexible in the sense that it can easily be applied to different robot types. In this paper the authors apply it to non-holonomic car-like robots, and present experimental results which show that the method is powerful and fast.

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/robot.1995.525508

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 165

Metadata

Authors
Svestka, P., & Overmars, M. H.
Venue
Proceedings of 1995 IEEE International Conference on Robotics and Automation
Publisher
IEEE
Published
2002-11-19
Volume
2
Pages
1631-1636
ISSN
1050-4729 (ISSN-L)
OpenAlex
W1903576784
Cited by
165
References
1
FWCI
9.65
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: Coordinated motion planning for multiple car-like robots using probabilistic roadmaps. https://app.cochat.ai/papers/10.1109/robot.1995.525508
The paper
Svestka, P., & Overmars, M. H. (2002). Coordinated motion planning for multiple car-like robots using probabilistic roadmaps. Proceedings of 1995 IEEE International Conference on Robotics and Automation. https://doi.org/10.1109/robot.1995.525508

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.