The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
From Reeds and Shepp's to Continuous-Curvature Paths
Abstract
This paper presents Continuous Curvature (CC) Steer, a steering method for car-like vehicles, i.e., an algorithm planning paths in the absence of obstacles. CC Steer is the first to compute paths with: 1) continuous curvature; 2) upper-bounded curvature; and 3) upper-bounded curvature derivative. CC Steer also verifies a topological property that ensures that when it is used within a general motion-planning scheme, it yields a complete collision-free path planner. The coupling of CC Steer with a general planning scheme yields a path planner that computes collision-free paths verifying the properties mentioned above. Accordingly, a car-like vehicle can follow such paths without ever having to stop in order to reorient its front wheels. Besides, such paths can be followed with a nominal speed which is proportional to the curvature derivative limit. The paths computed by CC Steer are made up of line segments, circular arcs, and clothoid arcs. They are not optimal in length. However, it is shown that they converge toward the optimal "Reeds and Shepp" paths when the curvature derivative upper bound tends to infinity. The capabilities of CC Steer to serve as an efficient steering method within two general planning schemes are also demonstrated.
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
Handbook of Mathematical Functions
McQuarrie, D. A. (1966) · American Journal of Physics · doi:10.1119/1.1972842 · Cited by 40,433
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 4×
“Given such asteering method, it is possible to use it within agenera l motion-planning scheme such as the Probabilistic Path Planner (PPP) [ 10 ], the Ariadne’s Clew Algorithm (ACA) [11], or the Holonomic Path Approximation Algorithm [12], in order to deal with the obstacles and solve the full problem (in these scheme…”
BackgroundMethodInfluentialApplied Optimal Control: Optimization, Estimation, and Control
Bryson, A. E., & Ho, Y.-C. (2018) · Routledge eBooks · doi:10.1201/9781315137667 · Cited by 6,015
Dubins, L. E. (1957) · American Journal of Mathematics · doi:10.2307/2372560 · Cited by 3,045
Nonholonomic motion planning: steering using sinusoids
Murray, R. M., & Sastry, S. S. (1993) · IEEE Transactions on Automatic Control · doi:10.1109/9.277235 · Cited by 1,771
Optimal paths for a car that goes both forwards and backwards
Reeds, J., & Shepp, L. (1990) · Pacific Journal of Mathematics · doi:10.2140/pjm.1990.145.367 · Cited by 1,447
Robot Motion Planning and Control
(1998) · Lecture Notes in Control and Information Sciences · doi:10.1007/bfb0036069 · Cited by 831
A motion planner for nonholonomic mobile robots
Laumond, J.-P., Jacobs, P. E., Taix, M., & Murray, R. M. (1994) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.326564 · Cited by 583
Guidelines in nonholonomic motion planning for mobile robots
Laumond, J. P., Sekhavat, S., & Lamiraux, F. (2006) · Lecture Notes in Control and Information Sciences · doi:10.1007/bfb0036070 · Cited by 330
Trajectory generation for the N-trailer problem using Goursat normal form
Tilbury, D. M., Murray, R. M., & Sastry, S. (1995) · IEEE Transactions on Automatic Control · doi:10.1109/9.384215 · Cited by 276
Cited by
A 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
Sampling-Based Robot Motion Planning: A Review
Elbanhawi, M., & Simic, M. (2014) · IEEE Access · doi:10.1109/access.2014.2302442 · Cited by 786
Differentially constrained mobile robot motion planning in state lattices
Pivtoraiko, M., Knepper, R. A., & Kelly, A. (2009) · Journal of Field Robotics · doi:10.1002/rob.20285 · Cited by 393
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
Path Smoothing Techniques in Robot Navigation: State-of-the-Art, Current and Future Challenges
Ravankar, A., Ravankar, A. A., Kobayashi, Y., Hoshino, Y., & Peng, C.-C. (2018) · Sensors · doi:10.3390/s18093170 · Cited by 314
Metadata
- Authors
- Fraichard, T., & Scheuer, A.
- Venue
- IEEE Transactions on Robotics
- Published
- 2004-12
- Volume
- 20
- Issue
- 6
- Pages
- 1025-1035
- ISSN
- 1552-3098 (ISSN-L)
- OpenAlex
- W2163385431
- Cited by
- 441
- References
- 25
- FWCI
- 8.49
- Type
- journal article
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: From Reeds and Shepp's to Continuous-Curvature Paths. https://app.cochat.ai/papers/10.1109/tro.2004.833789
- The paper
- Fraichard, T., & Scheuer, A. (2004). From Reeds and Shepp's to Continuous-Curvature Paths. IEEE Transactions on Robotics. https://doi.org/10.1109/tro.2004.833789
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.