The DOI matches its Crossref record; 45 of the 45 references it cites were found in a registry or an index.
A motion planner for nonholonomic mobile robots
Abstract
This paper considers the problem of motion planning for a car-like robot (i.e., a mobile robot with a nonholonomic constraint whose turning radius is lower-bounded). We present a fast and exact planner for our mobile robot model, based upon recursive subdivision of a collision-free path generated by a lower-level geometric planner that ignores the motion constraints. The resultant trajectory is optimized to give a path that is of near-minimal length in its homotopy class. Our claims of high speed are supported by experimental results for implementations that assume a robot moving amid polygonal obstacles. The completeness and the complexity of the algorithm are proven using an appropriate metric in the configuration space R/sup 2//spl times/S/sup 1/ of the robot. This metric is defined by using the length of the shortest paths in the absence of obstacles as the distance between two configurations. We prove that the new induced topology and the classical one are the same. Although we concentrate upon the car-like robot, the generalization of these techniques leads to new theoretical issues involving sub-Riemannian geometry and to practical results for nonholonomic motion planning.>
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
Latombe, J.-C. (1991) · Springer eBooks · doi:10.1007/978-1-4615-4022-9 · Cited by 6,396
Mathematical Theory of Optimal Processes
Pontryagin, L. S. (2018) · Routledge eBooks · doi:10.1201/9780203749319 · Cited by 3,713
A Comprehensive Introduction to Differential Geometry.
Kramer, A. D., & Spivak, M. (1973) · The American Mathematical Monthly · doi:10.2307/2319112 · Cited by 3,445
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
Manifolds, Tensor Analysis, and Applications
Abraham, R., Marsden, J. E., & Ratiu, T. (1988) · Applied Mathematical Sciences · doi:10.1007/978-1-4612-1029-0 · Cited by 1,757
Lie Groups, Lie Algebras, and Their Representations
Varadarajan, V. S. (1984) · Graduate Texts in Mathematics · doi:10.1007/978-1-4612-1126-6 · Cited by 1,739
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
The complexity of robot motion planning
Canny, J. (1988) · Medical Entomology and Zoology · Cited by 1,375
Manifolds, Tensor Analysis, and Applications
Abraham, R., Marsden, J. E., Ratiu, T., & DeWitt-Morette, C. (1984) · Physics Today · doi:10.1063/1.2916250 · Cited by 1,209
Cited by
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
Developments in nonholonomic control problems
(1995) · IEEE Control Systems · doi:10.1109/37.476384 · Cited by 1,243
Modeling and control of formations of nonholonomic mobile robots
Desai, J. P., Ostrowski, J. P., & Kumar, V. (2001) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.976023 · Cited by 1,158
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
Alami, R., Chatila, R., Fleury, S., Ghallab, M., & Ingrand, F. (1998) · The International Journal of Robotics Research · doi:10.1177/027836499801700402 · Cited by 561
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
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
From 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
The Geometric Mechanics of Undulatory Robotic Locomotion
Ostrowski, J., & Burdick, J. (1998) · The International Journal of Robotics Research · doi:10.1177/027836499801700701 · Cited by 334
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
Self-citationNonholonomic 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
Dynamic Nonprehensile Manipulation: Controllability, Planning, and Experiments
Lynch, K. M., & Mason, M. T. (1999) · International Journal of Robotics Research · doi:10.1177/02783649922066079 · Cited by 270
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
Metadata
- Authors
- Laumond, J.-P., Jacobs, P. E., Taix, M., & Murray, R. M.
- Venue
- IEEE Transactions on Robotics and Automation
- Published
- 1994
- Volume
- 10
- Issue
- 5
- Pages
- 577-593
- ISSN
- 1042-296X (ISSN-L)
- OpenAlex
- W2148970883
- Cited by
- 583
- References
- 45
- FWCI
- 21.05
- 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
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.