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

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

Randomized kinodynamic planning

LaValle, S.M., Kuffner, J.J.·2003·Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C)

Abstract

The paper presents a state-space perspective on the kinodynamic planning problem, and introduces a randomized path planning technique that computes collision-free kinodynamic trajectories for high degree-of-freedom problems. By using a state space formulation, the kinodynamic planning problem is treated as a 2n-dimensional nonholonomic planning problem, derived from an n-dimensional configuration space. The state space serves the same role as the configuration space for basic path planning. The bases for the approach is the construction of a tree that attempts to rapidly and uniformly explore the state space, offering benefits that are similar to those obtained by successful randomized planning methods, but applies to a much broader class of problems. Some preliminary results are discussed for an implementation that determines the kinodynamic trajectories for hovercrafts and satellites in cluttered environments resulting in state spaces of up to twelve dimensions.

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.1999.770022

Cites

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

Cited by

See all 673

Metadata

Authors
LaValle, S. M., & Kuffner, J. J.
Venue
Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C)
Publisher
IEEE
Published
2003-01-20
Volume
1
Pages
473-479
ISSN
1050-4729 (ISSN-L)
OpenAlex
W1763528081
Cited by
673
References
28
FWCI
22.95
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: Randomized kinodynamic planning. https://app.cochat.ai/papers/10.1109/robot.1999.770022
The paper
LaValle, S. M., & Kuffner, J. J. (2003). Randomized kinodynamic planning. Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C). https://doi.org/10.1109/robot.1999.770022

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.