The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Optimal paths for a car that goes both forwards and backwards
Open accessAbstract
The path taken by a car with a given minimum turning radius has a lower bound on its radius of curvature at each point, but the path has cusps if the car shifts into or out of reverse gear.What is the shortest such path a car can travel between two points if its starting and ending directions are specified?One need consider only paths with at most 2 cusps or reversals.We give a set of paths which is sufficient in the sense that it always contains a shortest path and small in the sense that there are at most 68, but usually many fewer paths in the set for any pair of endpoints and directions.We give these paths by explicit formula.Calculating the length of each of these paths and selecting the (not necessarily unique) path with smallest length yields a simple algorithm for a shortest path in each case.These optimal paths or geodesies may be described as follows: If C is an arc of a circle of the minimal turning radius and S is a line segment, then it is sufficient to consider only certain paths of the form CCSCC where arcs and segments fit smoothly, one or more of the arcs or segments may vanish, and where reversals, or equivalently cusps, between arcs or segments are allowed.This contrasts with the case when cusps are not allowed, where Dubins (1957) has shown that paths of the form CCC and CSC suffice.
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
Theory of Ordinary Differential Equations
Coddington, E. A., Levinson, N., & Teichmann, T. (1956) · Physics Today · doi:10.1063/1.3059875 · Cited by 6,124
Theory of ordinary differential equations
Platzer, H. L. (1956) · Journal of the Franklin Institute · doi:10.1016/0016-0032(56)91150-4 · Cited by 5,520
Dubins, L. E. (1957) · American Journal of Mathematics · doi:10.2307/2372560 · Cited by 3,045
Functions of several variables
Werner, F., & Sotskov, Y. N. (2010) · Taylor & Francis eBooks · doi:10.4324/9780203401385_chapter_11 · Cited by 421
Dieudonné, J. A. (1969) · Cited by 274
Cited by
Randomized Kinodynamic Planning
LaValle, S. M., & Kuffner, J. J. (2001) · The International Journal of Robotics Research · doi:10.1177/02783640122067453 · Cited by 3,254
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
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
Distributed Control of Robotic Networks: A Mathematical Approach to Motion Coordination Algorithms
Bullo, F., Cortés, J., & Martínez, S. (2009) · Princeton University Press eBooks · doi:10.1515/9781400831470 · Cited by 1,509
Developments in nonholonomic control problems
(1995) · IEEE Control Systems · doi:10.1109/37.476384 · Cited by 1,243
Path Planning for Autonomous Vehicles in Unknown Semi-structured Environments
Dolgov, D., Thrun, S., Montemerlo, M., & Diebel, J. (2010) · The International Journal of Robotics Research · doi:10.1177/0278364909359210 · Cited by 976
Motion planning with sequential convex optimization and convex collision checking
Schulman, J., Duan, Y., Ho, J., Lee, A., Awwal, I., Bradlow, H., Pan, J., Patil, S., Goldberg, K., & Abbeel, P. (2014) · The International Journal of Robotics Research · doi:10.1177/0278364914528132 · Cited by 866
Real-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
Optimal trajectory generation for dynamic street scenarios in a Frenét Frame
Werling, M., Ziegler, J., Kammel, S., & Thrun, S. (2010) · 2010 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.2010.5509799 · Cited by 801
Sampling-Based Robot Motion Planning: A Review
Elbanhawi, M., & Simic, M. (2014) · IEEE Access · doi:10.1109/access.2014.2302442 · Cited by 786
Randomized Kinodynamic Motion Planning with Moving Obstacles
Hsu, D., Kindel, R., Latombe, J.-C., & Rock, S. (2002) · The International Journal of Robotics Research · doi:10.1177/027836402320556421 · Cited by 771
Controlling formations of multiple mobile robots
Desai, J. P., Ostrowski, J., & Kumar, V. (2002) · Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146) · doi:10.1109/robot.1998.680621 · Cited by 686
Randomized kinodynamic planning
LaValle, S. M., & Kuffner, J. J. (2003) · Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C) · doi:10.1109/robot.1999.770022 · Cited by 673
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
Motion Planning for Autonomous Driving: The State of the Art and Future Perspectives
Teng, S., Hu, X., Deng, P., Li, B., Li, Y., Ai, Y., Yang, D., Li, L., Xuanyuan, Z., Zhu, F., et al. (2023) · IEEE Transactions on Intelligent Vehicles · doi:10.1109/tiv.2023.3274536 · Cited by 590
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
Hoy, M., Matveev, A. S., & Savkin, A. V. (2015) · Robotica · doi:10.1017/s0263574714000289 · Cited by 469
Stable Pushing: Mechanics, Controllability, and Planning
Lynch, K. M., & Mason, M. T. (1996) · The International Journal of Robotics Research · doi:10.1177/027836499601500602 · Cited by 463
“Reeds and Shepp (1990) enumerated a set of canonical paths, guaranteed to include the shortest path in the obstacle-free plane, for a carlike mobile robot that can reverse.”
BackgroundOptimization-Based Collision Avoidance
Zhang, X., Liniger, A., & Borrelli, F. (2021) · IEEE Transactions on Control Systems Technology · doi:10.1109/tcst.2019.2949540 · Cited by 444
CommonRoad: Composable benchmarks for motion planning on roads
Althoff, M., Koschi, M., & Manzinger, S. (2017) · 2017 IEEE Intelligent Vehicles Symposium (IV) · doi:10.1109/ivs.2017.7995802 · Cited by 443
“We have not included Dubin or Reeds-Shepp cars since they require changing the steering angle infinitely fast (see e.g. [31]).”
BackgroundFrom Reeds and Shepp's to Continuous-Curvature Paths
Fraichard, T., & Scheuer, A. (2004) · IEEE Transactions on Robotics · doi:10.1109/tro.2004.833789 · Cited by 441
Geometric Shortest Paths and Network Optimization
Mitchell, J. S. B. (2000) · Handbook of Computational Geometry · doi:10.1016/b978-044482537-7/50016-4 · Cited by 427
Polack, P., Altche, F., d'Andrea-Novel, B., & de La Fortelle, A. (2017) · 2017 IEEE Intelligent Vehicles Symposium (IV) · doi:10.1109/ivs.2017.7995816 · Cited by 408
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 Rough Terrain Trajectory Generation for Wheeled Mobile Robots
Howard, T. M., & Kelly, A. (2007) · The International Journal of Robotics Research · doi:10.1177/0278364906075328 · Cited by 370
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
Visibility-based probabilistic roadmaps for motion planning
Siméon, T., Laumond, J.-P., & Nissoux, C. (2000) · Advanced Robotics · doi:10.1163/156855300741960 · Cited by 329
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
Nonholonomic navigation and control of cooperating mobile manipulators
Tanner, H. G., Loizou, S. G., & Kyriakopoulos, K. J. (2003) · IEEE Transactions on Robotics and Automation · doi:10.1109/tra.2002.807549 · Cited by 305
Robust hybrid control for autonomous vehicle motion planning
Frazzoli, E., Dahleh, M. A., & Feron, E. (2002) · Proceedings of the 39th IEEE Conference on Decision and Control (Cat. No.00CH37187) · doi:10.1109/cdc.2000.912871 · Cited by 297
Barraquand, J., & Latombe, J. C. (1993) · Algorithmica · doi:10.1007/bf01891837 · Cited by 293
Motion planning for multitarget surveillance with mobile sensor agents
Tang, Z., & Ozguner, U. (2005) · IEEE Transactions on Robotics · doi:10.1109/tro.2005.847567 · Cited by 269
Time-optimal paths for a Dubins airplane
Chitsaz, H., & LaValle, S. M. (2007) · 2007 46th IEEE Conference on Decision and Control · doi:10.1109/cdc.2007.4434966 · Cited by 259
A survey on path planning for persistent autonomy of autonomous underwater vehicles
Zeng, Z., Lian, L., Sammut, K., He, F., Tang, Y., & Lammas, A. (2015) · Ocean Engineering · doi:10.1016/j.oceaneng.2015.10.007 · Cited by 256
A review of motion planning algorithms for intelligent robots
Zhou, C., Huang, B., & Fränti, P. (2022) · Journal of Intelligent Manufacturing · doi:10.1007/s10845-021-01867-z · Cited by 255
Omnidirectional sensory and motor volumes in electric fish
Snyder, J. B., Nelson, M. E., Burdick, J. W., & MacIver, M. A. (2007) · PLoS Biology · doi:10.1371/journal.pbio.0050301 · Cited by 112
Optimal Synthesis of the Zermelo–Markov–Dubins Problem in a Constant Drift Field
Bakolas, E., & Tsiotras, P. (2013) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-012-0128-0 · Cited by 53
Autonomous Vehicle Parking Using Hybrid Artificial Intelligent Approach
Lee, C.-K., Lin, C.-L., & Shiu, B.-M. (2009) · Journal of Intelligent and Robotic Systems · doi:10.1007/s10846-009-9319-9 · Cited by 31
Metadata
- Authors
- Reeds, J., & Shepp, L.
- Venue
- Pacific Journal of Mathematics
- Publisher
- Mathematical Sciences Publishers
- Published
- 1990-10-01
- Volume
- 145
- Issue
- 2
- Pages
- 367-393
- ISSN
- 0030-8730 (ISSN-L)
- OpenAlex
- W1971998222
- Cited by
- 1,447
- References
- 5
- FWCI
- 8.98
- Type
- journal article
- Language
- en
- Open access
- bronze
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.