The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Kinodynamic RRT*: Asymptotically optimal motion planning for robots with linear dynamics
Abstract
We present Kinodynamic RRT*, an incremental sampling-based approach for asymptotically optimal motion planning for robots with linear dynamics. Our approach extends RRT*, which was introduced for holonomic robots [10], by using a fixed-final-state-free-final-time controller that optimally connects any pair of states, where the cost function is expressed as a trade-off between the duration of a trajectory and the expended control effort. Our approach generalizes earlier work on RRT* for kinodynamic systems, as it guarantees asymptotic optimality for any system with controllable linear dynamics, in state spaces of any dimension. In addition, we show that for the rich subclass of systems with a nilpotent dynamics matrix, closed-form solutions for optimal trajectories can be derived, which keeps the computational overhead of our algorithm compared to traditional RRT* at a minimum. We demonstrate the potential of our approach by computing asymptotically optimal trajectories in three challenging motion planning scenarios: (i) a planar robot with a 4-D state space and double integrator dynamics, (ii) an aerial vehicle with a 10-D state space and linearized quadrotor dynamics, and (iii) a car-like robot with a 5-D state space and non-linear dynamics.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Faires, J. D. (1978) · Cited by 6,711
Latombe, J.-C. (1991) · Springer eBooks · doi:10.1007/978-1-4615-4022-9 · Cited by 6,396
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
Sampling-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
LaValle, S. M. (2006) · Cambridge University Press eBooks · doi:10.1017/cbo9780511546877 · Cited by 5,211
Computational Geometry: Algorithms and Applications
de Berg, M., Cheong, O., van Kreveld, M. J., & Overmars, M. H. (1997) · CERN Document Server (European Organization for Nuclear Research) · Cited by 4,450
LaValle, S. M. (2006) · Cited by 4,177
Randomized Kinodynamic Planning
LaValle, S. M., & Kuffner, J. J. (2001) · The International Journal of Robotics Research · doi:10.1177/02783640122067453 · Cited by 3,254
Lewis, F. L. (1986) · Cited by 2,948
Computational Geometry: Algorithms and Applications
de Berg, M., van Kreveld, M., Overmars, M., & Schwarzkopf, O. C. (2000) · Springer eBooks · doi:10.1007/978-3-662-04245-8 · Cited by 1,473
The GRASP Multiple Micro-UAV Testbed
Michael, N., Mellinger, D., Lindsey, Q., & Kumar, V. (2010) · IEEE Robotics & Automation Magazine · doi:10.1109/mra.2010.937855 · Cited by 768
Incremental Sampling-based Algorithms for Optimal Motion Planning
Karaman, S., & Frazzoli, E. (2010) · Robotics: Science and Systems VI · doi:10.15607/rss.2010.vi.034 · Cited by 680
Donald, B., Xavier, P., Canny, J., & Reif, J. (1993) · Journal of the ACM · doi:10.1145/174147.174150 · Cited by 458
Optimal kinodynamic motion planning using incremental sampling-based methods
Karaman, S., & Frazzoli, E. (2010) · 49th IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2010.5717430 · Cited by 416
LQR-RRT*: Optimal sampling-based motion planning with automatically derived extension heuristics
Perez, A., Platt, R., Konidaris, G., Kaelbling, L., & Lozano-Perez, T. (2012) · 2012 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2012.6225177 · Cited by 225
Creating High-quality Paths for Motion Planning
Geraerts, R., & Overmars, M. H. (2007) · The International Journal of Robotics Research · doi:10.1177/0278364907079280 · Cited by 220
Incremental Sampling-based Algorithms for Optimal Motion Planning
Karaman, S., & Frazzoli, E. (2011) · Robotics · doi:10.7551/mitpress/9123.003.0038 · Cited by 190
LQR-trees: Feedback motion planning on sparse randomized trees
Tedrake, R. (2009) · Robotics: Science and Systems · doi:10.15607/rss.2009.v.003 · Cited by 158
Anytime computation of time-optimal off-road vehicle maneuvers using the RRT*
Jeon, J. H., Karaman, S., & Frazzoli, E. (2011) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2011.6161521 · Cited by 134
Cited by
A Survey of Motion Planning and Control Techniques for Self-Driving Urban Vehicles
Paden, B., Cap, M., Yong, S. Z., Yershov, D., & Frazzoli, E. (2016) · IEEE Transactions on Intelligent Vehicles · doi:10.1109/tiv.2016.2578706 · Cited by 2,585
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
Heuristic approaches in robot path planning: A survey
Mac, T. T., Copot, C., Tran, D. T., & De Keyser, R. (2016) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2016.08.001 · Cited by 641
Optimal Path Planning using RRT* based Approaches: A Survey and Future Directions
Noreen, I., Khan, A., & Habib, Z. (2016) · International Journal of Advanced Computer Science and Applications · doi:10.14569/ijacsa.2016.071114 · Cited by 326
Review of Autonomous Path Planning Algorithms for Mobile Robots
Qin, H., Shao, S., Wang, T., Yu, X., Jiang, Y., & Cao, Z. (2023) · Drones · doi:10.3390/drones7030211 · Cited by 322
Metadata
- Authors
- Webb, D. J., & van den Berg, J.
- Venue
- 2013 IEEE International Conference on Robotics and Automation
- Publisher
- IEEE
- Published
- 2013-05
- Pages
- 5054-5061
- ISSN
- 1050-4729 (ISSN-L)
- OpenAlex
- W2054585537
- Cited by
- 409
- References
- 19
- FWCI
- 9.39
- 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
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.