The DOI matches its Crossref record; 69 of the 69 references it cites were found in a registry or an index.
Asymptotically optimal sampling-based kinodynamic planning
Open accessAbstract
Sampling-based algorithms are viewed as practical solutions for high-dimensional motion planning. Recent progress has taken advantage of random geometric graph theory to show how asymptotic optimality can also be achieved with these methods. Achieving this desirable property for systems with dynamics requires solving a two-point boundary value problem (BVP) in the state space of the underlying dynamical system. It is difficult, however, if not impractical, to generate a BVP solver for a variety of important dynamical models of robots or physically simulated ones. Thus, an open challenge was whether it was even possible to achieve optimality guarantees when planning for systems without access to a BVP solver. This work resolves the above question and describes how to achieve asymptotic optimality for kinodynamic planning using incremental sampling-based planners by introducing a new rigorous framework. Two new methods, STABLE_SPARSE_RRT (SST) and SST*, result from this analysis, which are asymptotically near-optimal and optimal, respectively. The techniques are shown to converge fast to high-quality paths, while they maintain only a sparse set of samples, which makes them computationally efficient. The good performance of the planners is confirmed by experimental results using dynamical systems benchmarks, as well as physically simulated robots.
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.
Integrity signals
Registry
Cites
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.
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
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 · cited 11×
“The focus in this work is on the properties of the popular sampling-based motion planners for kinodynamic challenges (Hsu et al., 2002; Karaman and Frazzoli, 2011; Kavraki et al., 1996; LaValle and Kuffner, 2001a).”
BackgroundMethodInfluentialSampling-based algorithms for optimal motion planning
Karaman, S., & Frazzoli, E. (2011) · The International Journal of Robotics Research · doi:10.1177/0278364911406761 · Cited by 5,275
RRT-connect: An efficient approach to single-query path planning
Kuffner, J. J., & LaValle, S. M. (2000) · Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065) · doi:10.1109/robot.2000.844730 · Cited by 3,555
Randomized Kinodynamic Planning
LaValle, S. M., & Kuffner, J. J. (2001) · The International Journal of Robotics Research · doi:10.1177/02783640122067453 · Cited by 3,254
Flatness and defect of non-linear systems: introductory theory and examples
FLIESS, M., LÉVINE, J., MARTIN, P., & ROUCHON, P. (1995) · International Journal of Control · doi:10.1080/00207179508921959 · Cited by 3,126
Lewis, F. L. (1986) · Cited by 2,948
Survey of Numerical Methods for Trajectory Optimization
Betts, J. T. (1998) · Journal of Guidance, Control, and Dynamics · doi:10.2514/2.4231 · Cited by 2,602
An optimal algorithm for approximate nearest neighbor searching fixed dimensions
Arya, S., Mount, D. M., Netanyahu, N. S., Silverman, R., & Wu, A. Y. (1998) · Journal of the ACM · doi:10.1145/293347.293348 · Cited by 2,300
Probability and Random Processes.
Grimmett, G. R., & Stirzaker, D. R. (2001) · doi:10.1093/oso/9780198572237.001.0001 · Cited by 1,850
Time-Optimal Control of Robotic Manipulators Along Specified Paths
Bobrow, J. E., Dubowsky, S., & Gibson, J. S. (1985) · The International Journal of Robotics Research · doi:10.1177/027836498500400301 · Cited by 1,315
Cited by
Geometrically Constrained Trajectory Optimization for Multicopters
Wang, Z., Zhou, X., Xu, C., & Gao, F. (2022) · IEEE Transactions on Robotics · doi:10.1109/tro.2022.3160022 · Cited by 434
Metadata
- Authors
- Li, Y., Littlefield, Z., & Bekris, K. E.
- Venue
- The International Journal of Robotics Research
- Publisher
- SAGE Publications
- Published
- 2016-02-03
- Volume
- 35
- Issue
- 5
- Pages
- 528-564
- ISSN
- 0278-3649 (ISSN-L)
- 1741-3176
- OpenAlex
- W2132990760
- Cited by
- 262
- References
- 69
- FWCI
- 16.66
- Type
- journal article
- Language
- en
- Open access
- green
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: Asymptotically optimal sampling-based kinodynamic planning. https://app.cochat.ai/papers/10.1177/0278364915614386
- The paper
- Li, Y., Littlefield, Z., & Bekris, K. E. (2016). Asymptotically optimal sampling-based kinodynamic planning. The International Journal of Robotics Research. https://doi.org/10.1177/0278364915614386
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.