Cited by 3,254Robotic Path Planning AlgorithmsReinforcement Learning in RoboticsAI-based Problem Solving and Planning

Randomized Kinodynamic Planning

LaValle, Steven M., Kuffner, James J.·2001·The International Journal of Robotics Research

Abstract

This paper presents the first randomized approach to kinodynamic planning (also known as trajectory planning or trajectory design). The task is to determine control inputs to drive a robot from an ini ial configuration and velocity to a goal configuration and velocity while obeying physically based dynamical models and avoiding obstacles in the robot’s environment. The authors consider generic systems that express the nonlinear dynamics of a robot in terms of the robot’s high-dimensional configuration space. Kinodynamic planning is treated as a motion-planning problem in a higher dimensional state space that has both first-order differential constraints and obstacle-based global constraints. The state space serves the same role as the configuration space for basic path planning; however, standard randomized path-planning techniques do not directly apply to planning trajectories in the state space. The authors have developed a randomized planning approach that is particularly tailored to trajectory planning problems in high-dimensional state spaces. The basis for this approach is the construction of rapidly exploring random trees, which offer benefits that are similar to those obtained by successful randomized holonomic planning methods but apply to a much broader class of problems. Theoretical analysis of the algorithm is given. Experimental results are presented for an implementation that computes trajectories for hovercrafts and satellites in cluttered environments, resulti…

Integrity signals

Registry

Crossref · 10.1177/02783640122067453

Cites

3 of 3 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • RRT* provides more optimal paths instead of completely random ones while sacrificing computational efficiency.

    “RRT* [258], an extension of the RRT, provides more optimal paths instead of completely random ones while sacrificing computational efficiency.”

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
LaValle, S. M., & Kuffner, J. J.
Affiliations
  • Iowa State University (US)
  • The University of Tokyo (JP)
Corresponding author
  • LaValle, Steven M.
  • Kuffner, James J.
Venue
The International Journal of Robotics Research
Published
2001-05
Volume
20
Issue
5
Pages
378-400
ISSN
  • 0278-3649 (ISSN-L)
  • 1741-3176
OpenAlex
W2000359213
Cited by
3,254
References
3
Citations by year
2026: 99 · 2025: 193 · 2024: 204 · 2023: 210 · 2022: 204 · 2021: 255 · 2020: 222 · 2019: 214 · 2018: 185 · 2017: 184 · 2016: 165 · 2015: 154 · 2014: 117 · 2013: 167 · 2012: 106
FWCI
34.57
Type
journal article
Language
en
Open access
closed
Locations
The International Journal of Robotics Research (publishedVersion)
Funders
National Science Foundation
Topics
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Robotic Path Planning Algorithms
  • Physical Sciences › Computer Science › Artificial Intelligence › Reinforcement Learning in Robotics
  • Physical Sciences › Computer Science › Artificial Intelligence › AI-based Problem Solving and Planning
Keywords
kinodynamic motion planning, trajectory planning, rapidly-exploring random tree, motion planning, obstacle avoidance, nonlinear robot dynamics, high-dimensional state spaces, satellite trajectory

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