Randomized Kinodynamic Planning
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
Cites
Statistics
Claims the paper makes
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.”
From A Survey of Autonomous Driving: <i>Common Practices and Emerging Technologies</i> (2020) · cites this paper as [258]
Cites
Bellman, R. E. (2010) · doi:10.1515/9781400835386 · Cited by 14,588 · see citing works
Probabilistic roadmaps for path planning in high-dimensional configuration spaces
Kavraki, L. E., Svestka, P., Latombe, J.-C., & Overmars, M. H. (1996) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.508439 · Cited by 6,343 · see citing works
Approximate nearest neighbors: towards removing the curse of dimensionality
Indyk, P., & Motwani, R. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276876 · Cited by 4,188 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
Deep reinforcement learning for autonomous driving: A survey
Kiran, B. R., Sobh, I., Talpaert, V., Mannion, P., Sallab, A. A. A., Yogamani, S., & Perez, P. (2022) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2021.3054625 · Cited by 2,342 · see citing works
A Survey of Autonomous Driving: <i>Common Practices and Emerging Technologies</i>
Yurtsever, E., Lambert, J., Carballo, A., & Takeda, K. (2020) · IEEE Access · doi:10.1109/access.2020.2983149 · Cited by 1,889 · see citing works
Planning and Decision-Making for Autonomous Vehicles
Schwarting, W., Alonso-Mora, J., & Rus, D. (2018) · Annual Review of Control, Robotics, and Autonomous Systems · doi:10.1146/annurev-control-060117-105157 · Cited by 972 · see citing works
Perception, Planning, Control, and Coordination for Autonomous Vehicles
Pendleton, S., Andersen, H., Du, X., Shen, X., Meghjani, M., Eng, Y., Rus, D., & Ang, M. (2017) · Machines · doi:10.3390/machines5010006 · Cited by 657 · see citing works
A perception‐driven autonomous urban vehicle
Leonard, J., How, J., Teller, S., Berger, M., Campbell, S., Fiore, G., Fletcher, L., Frazzoli, E., Huang, A., Karaman, S., et al. (2008) · Journal of Field Robotics · doi:10.1002/rob.20262 · Cited by 429 · see citing works
Finding approximate POMDP solutions through belief compression
Roy, N., Gordon, G., & Thrun, S. (2005) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1496 · Cited by 254 · see citing works
Learning efficient navigation in vortical flow fields
Gunnarson, P., Mandralis, I., Novati, G., Koumoutsakos, P., & Dabiri, J. O. (2021) · Nature Communications · doi:10.1038/s41467-021-27015-y · Cited by 108 · see citing works
Applications and Challenges of Artificial Intelligence in Space Missions
Oche, P. A., Ewa, G. A., & Ibekwe, N. (2024) · IEEE Access · doi:10.1109/access.2021.3132500 · Cited by 68 · see citing works
- 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.
- ORCID
- LaValle, Steven M.
- Venue
- The International Journal of Robotics Research
- Publisher
- SAGE Publications
- 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