The DOI matches its Crossref record; 38 of the 38 references it cites were found in a registry or an index.
Differentially constrained mobile robot motion planning in state lattices
Abstract
We present an approach to the problem of differentially constrained mobile robot motion planning in arbitrary cost fields. The approach is based on deterministic search in a specially discretized state space. We compute a set of elementary motions that connects each discrete state value to a set of its reachable neighbors via feasible motions. Thus, this set of motions induces a connected search graph. The motions are carefully designed to terminate at discrete states, whose dimensions include relevant state variables (e.g., position, heading, curvature, and velocity). The discrete states, and thus the motions, repeat at regular intervals, forming a lattice. We ensure that all paths in the graph encode feasible motions via the imposition of continuity constraints on state variables at graph vertices and compliance of the graph edges with a differential equation comprising the vehicle model. The resulting state lattice permits fast full configuration space cost evaluation and collision detection. Experimental results with research prototype rovers demonstrate that the planner allows us to exploit the entire envelope of vehicle maneuverability in rough terrain, while featuring real‐time performance. © 2009 Wiley Periodicals, Inc.
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
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
Hart, P., Nilsson, N., & Raphael, B. (1968) · IEEE Transactions on Systems Science and Cybernetics · doi:10.1109/tssc.1968.300136 · Cited by 12,738
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
Dubins, L. E. (1957) · American Journal of Mathematics · doi:10.2307/2372560 · Cited by 3,045
An algorithm for planning collision-free paths among polyhedral obstacles
Lozano-Pérez, T., & Wesley, M. A. (1979) · Communications of the ACM · doi:10.1145/359156.359164 · Cited by 2,304
Spatial Planning: A Configuration Space Approach
Lozano-Perez (1983) · IEEE Transactions on Computers · doi:10.1109/tc.1983.1676196 · Cited by 2,113
OBBTree: a hierarchical structure for rapid interference detection
Gottschalk, S., Lin, M. C., & Manocha, D. (1996) · Proceedings of the 23rd annual conference on Computer graphics and interactive techniques · doi:10.1145/237170.237244 · Cited by 2,081
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
The focussed D* algorithm for real-time replanning
Stentz, A. (1995) · Cited by 865
Bohlin, R., & Kavraki, L. E. (2000) · Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065) · doi:10.1109/robot.2000.844107 · Cited by 856
Complexity 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
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
On the Relationship between Classical Grid Search and Probabilistic Roadmaps
LaValle, S. M., Branicky, M. S., & Lindemann, S. R. (2004) · The International Journal of Robotics Research · doi:10.1177/0278364904045481 · Cited by 436
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
Self-citationA Single-Query Bi-Directional Probabilistic Roadmap Planner with Lazy Collision Checking
Sánchez, G., & Latombe, J.-C. (2003) · Springer Tracts in Advanced Robotics · doi:10.1007/3-540-36460-9_27 · Cited by 313
On Delaying Collision Checking in PRM Planning: Application to Multi-Robot Coordination
Sánchez, G., & Latombe, J.-C. (2002) · The International Journal of Robotics Research · doi:10.1177/027836402320556458 · Cited by 248
A Monte-Carlo algorithm for path planning with many degrees of freedom
Barraquand, J., & Latombe, J.-C. (2002) · Proceedings., IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1990.126256 · Cited by 247
Smooth motion planning for car-like vehicles
Lamiraux, F., & Lammond, J.-P. (2001) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.954762 · Cited by 186
Algorithmic and Computational Robotics: New Directions
Rigelsford, J. (2001) · Industrial Robot the international journal of robotics research and application · doi:10.1108/ir.2001.04928fae.002 · Cited by 167
Quasi-randomized path planning
Branicky, M. S., LaValle, S. M., Olson, K., & Yang, L. (2002) · Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164) · doi:10.1109/robot.2001.932820 · Cited by 167
Current Issues in Sampling-Based Motion Planning
Lindemann, S. R., & LaValle, S. M. (2005) · Springer Tracts in Advanced Robotics · doi:10.1007/11008941_5 · Cited by 166
RANDOM NETWORKS IN CONFIGURATION SPACE FOR FAST PATH PLANNING
Kavraki, L. E. (1994) · doi:10.12681/eadd/4455 · Cited by 110
Barraquand, J., & Latombe, J.-C. (2002) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.1991.131750 · Cited by 108
Multiresolution rough terrain motion planning
Pai, D. K., & Reissell, L.-M. (1998) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.660835 · Cited by 95
High Performance State Lattice Planning Using Heuristic Look-Up Tables
Knepper, R. A., & Kelly, A. (2006) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2006.282515 · Cited by 76
Self-citationAn exact algorithm for kinodynamic planning in the plane
Canny, J., Rege, A., & Reif, J. H. (1991) · Discrete & Computational Geometry · doi:10.1007/bf02574702 · Cited by 75
Autonomous agents for real-time animation
Latombe, J., & Kuffner, J. (1999) · Cited by 70
Path planning for autonomous vehicles driving over rough terrain
Lacaze, A., Moscovitz, Y., DeClaris, N., & Murphy, K. N. (2002) · doi:10.1109/isic.1998.713634 · Cited by 66
Toward Optimal Sampling in the Space of Paths
Green, C. J., & Kelly, A. (2010) · Springer tracts in advanced robotics · doi:10.1007/978-3-642-14743-2_24 · Cited by 65
Self-citationReal-time motion planning for agile autonomous vehicles
Frazzoli, E., Dahleh, M. A., & Féron, É. (2000) · AIAA Guidance, Navigation, and Control Conference and Exhibit · doi:10.2514/6.2000-4056 · Cited by 64
Donald, B. R., & Xavier, P. G. (1995) · Algorithmica · doi:10.1007/bf01586636 · Cited by 55
A variational approach to optimal nonholonomic motion planning
Fernandes, C., Gurvits, L., & Li, Z. (2002) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.1991.131662 · Cited by 51
Path planning in practice; lazy evaluation on a multi-resolution grid
Bohlin, R. (2002) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2001.973335 · Cited by 44
A Random Sampling Scheme for Path Planning
Barraquand, J., Kavraki, L. E., Latombe, J., Li, T., Motwani, R., & Raghavan, P. (1996) · Springer eBooks · doi:10.1007/978-1-4471-1021-7_28 · Cited by 43
Toward Reliable Off Road Autonomous Vehicles Operating in Challenging Environments
Kelly, A., Amidi, O., Bode, M., Happold, M., Herman, H., Pilarski, T., Rander, P. W., Stentz, A., Vallidis, N., & Warner, R. (2006) · Springer tracts in advanced robotics · doi:10.1007/11552246_57 · Cited by 40
Self-citationKinodynamic motion planning for all-terrain wheeled vehicles
Cherif, M. (2003) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.1999.769998 · Cited by 32
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
Badue, C., Guidolini, R., Carneiro, R. V., Azevedo, P., Cardoso, V. B., Forechi, A., Jesus, L., Berriel, R., Paixão, T. M., Mutz, F., et al. (2021) · Expert Systems with Applications · doi:10.1016/j.eswa.2020.113816 · Cited by 1,209
Planning and Decision-Making for Autonomous Vehicles
Schwarting, W., Alonso-Mora, J., & Rus, D. (2018) · Annual Review of Control, Robotics, and Autonomous Systems · doi:10.1146/annurev-control-060117-105157 · Cited by 972
Katrakazas, C., Quddus, M., Chen, W.-H., & Deka, L. (2015) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2015.09.011 · Cited by 800
Sampling-Based Robot Motion Planning: A Review
Elbanhawi, M., & Simic, M. (2014) · IEEE Access · doi:10.1109/access.2014.2302442 · Cited by 786
Metadata
- Authors
- Pivtoraiko, M., Knepper, R. A., & Kelly, A.
- Venue
- Journal of Field Robotics
- Publisher
- Wiley
- Published
- 2009-02-11
- Volume
- 26
- Issue
- 3
- Pages
- 308-333
- ISSN
- 1556-4959 (ISSN-L)
- 1556-4967
- OpenAlex
- W4231761304
- Cited by
- 393
- References
- 38
- FWCI
- 10.63
- 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.