The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Optimal kinodynamic motion planning using incremental sampling-based methods
Open accessAbstract
Sampling-based algorithms such as the Rapidly-exploring Random Tree (RRT) have been recently proposed as an effective approach to computationally hard motion planning problem. However, while the RRT algorithm is known to be able to find a feasible solution quickly, there are no guarantees on the quality of such solution, e.g., with respect to a given cost functional. To address this limitation, the authors recently proposed a new algorithm, called RRT*, which ensures asymptotic optimality, i.e., almost sure convergence of the solution returned by the algorithm to an optimal solution, while maintaining the same properties of the standard RRT algorithm, both in terms of computation of feasible solutions, and of computational complexity. In this paper, the RRT* algorithm is extended to deal with differential constraints. A sufficient condition for asymptotic optimality is provided. It is shown that the RRT* algorithm equipped with any local steering procedure that satisfies this condition converges to an optimal solution almost surely. In particular, simple local steering procedures are provided for a Dubins' vehicle as well as a double integrator. Simulation examples are also provided for these systems comparing the RRT and the RRT* algorithms.
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
(1995) · Cited by 10,558
Real-Time Obstacle Avoidance for Manipulators and Mobile Robots
Khatib, O. (1986) · The International Journal of Robotics Research · doi:10.1177/027836498600500106 · Cited by 7,894
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
LaValle, S. M. (2006) · Cambridge University Press eBooks · doi:10.1017/cbo9780511546877 · Cited by 5,211
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
Dubins, L. E. (1957) · American Journal of Mathematics · doi:10.2307/2372560 · Cited by 3,045
Nonlinear controllability and observability
Hermann, R., & Krener, A. (1977) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1977.1101601 · Cited by 2,374 · cited 1×
“However, any system that is locally controllable [21] satisfies Assumption 3.”
BackgroundReal-Time Motion Planning With Applications to Autonomous Urban Driving
Kuwata, Y., Karaman, S., Teo, J., Frazzoli, E., How, J. P., & Fiore, G. (2009) · IEEE Transactions on Control Systems Technology · doi:10.1109/tcst.2008.2012116 · Cited by 889
Self-citationReal-Time Motion Planning for Agile Autonomous Vehicles
Frazzoli, E., Dahleh, M. A., & Feron, E. (2002) · Journal of Guidance, Control, and Dynamics · doi:10.2514/2.4856 · Cited by 830
Self-citationComplexity of the mover's problem and generalizations
Reif, J. H. (1979) · 20th Annual Symposium on Foundations of Computer Science (sfcs 1979) · doi:10.1109/sfcs.1979.10 · Cited by 765
A subdivision algorithm in configuration space for findpath with rotation
Brooks, R. A., & Lozano-Perez, T. (1985) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1985.6313352 · Cited by 550
Planning Long Dynamically Feasible Maneuvers for Autonomous Vehicles
Likhachev, M., & Ferguson, D. (2009) · The International Journal of Robotics Research · doi:10.1177/0278364909340445 · Cited by 512
Randomized preprocessing of configuration for fast path planning
Kavraki, L., & Latombe, J.-C. (2002) · Proceedings of the 1994 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1994.350966 · Cited by 412
Approaches for heuristically biasing RRT growth
Urmson, C., & Simmons, R. (2004) · Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453) · doi:10.1109/iros.2003.1248805 · Cited by 334
Dynamically-Stable Motion Planning for Humanoid Robots
Kuffner, J. J., Kagami, S., Nishiwaki, K., Inaba, M., & Inoue, H. (2002) · Autonomous Robots · doi:10.1023/a:1013219111657 · Cited by 265
Motion Planning: A Journey of Robots, Molecules, Digital Actors, and Other Artifacts
Latombe, J.-C. (1999) · The International Journal of Robotics Research · doi:10.1177/02783649922067753 · Cited by 264
Real-Time Randomized Path Planning for Robot Navigation
Bruce, J., & Veloso, M. M. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45135-8_23 · Cited by 236
Ferguson, D., & Stentz, A. (2006) · 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems · doi:10.1109/iros.2006.282100 · Cited by 234
Motion Planning Under Uncertainty for Image-guided Medical Needle Steering
Alterovitz, R., Branicky, M., & Goldberg, K. (2008) · The International Journal of Robotics Research · doi:10.1177/0278364908097661 · Cited by 189
Teller, S. J., Walter, M. R., Antone, M. E., Correa, A., Davis, R., Fletcher, L., Frazzoli, E., Glass, J. R., How, J. P., Huang, A. S., et al. (2010) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2010.5509238 · Cited by 68
Self-citation
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
Self-citationA Review of Motion Planning Techniques for Automated Vehicles
Gonzalez, D., Perez, J., Milanes, V., & Nashashibi, F. (2016) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2015.2498841 · Cited by 1,670
Anytime Motion Planning using the RRT*
Karaman, S., Walter, M. R., Perez, A., Frazzoli, E., & Teller, S. (2011) · 2011 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2011.5980479 · Cited by 881
Self-citationSampling-Based Robot Motion Planning: A Review
Elbanhawi, M., & Simic, M. (2014) · IEEE Access · doi:10.1109/access.2014.2302442 · Cited by 786
Polynomial Trajectory Planning for Aggressive Quadrotor Flight in Dense Indoor Environments
Richter, C., Bry, A., & Roy, N. (2016) · Springer Tracts in Advanced Robotics · doi:10.1007/978-3-319-28872-7_37 · Cited by 747
Metadata
- Authors
- Karaman, S., & Frazzoli, E.
- Venue
- 49th IEEE Conference on Decision and Control (CDC)
- Publisher
- IEEE
- Published
- 2010-12
- Pages
- 7681-7687
- ISSN
- 0191-2216 (ISSN-L)
- OpenAlex
- W2071401582
- Cited by
- 416
- References
- 22
- FWCI
- 7.15
- Type
- conference paper
- 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
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.