The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Using interpolation to improve path planning: The Field D* algorithm
Abstract
We present an interpolation‐based planning and replanning algorithm for generating low‐cost paths through uniform and nonuniform resolution grids. Most grid‐based path planners use discrete state transitions that artificially constrain an agent's motion to a small set of possible headings (e.g., 0, π/4, π/2, etc.). As a result, even “optimal” grid‐based planners produce unnatural, suboptimal paths. Our approach uses linear interpolation during planning to calculate accurate path cost estimates for arbitrary positions within each grid cell and produce paths with a range of continuous headings. Consequently, it is particularly well suited to planning low‐cost trajectories for mobile robots. In this paper, we introduce a version of the algorithm for uniform resolution grids and a version for nonuniform resolution grids. Together, these approaches address two of the most significant shortcomings of grid‐based path planning: the quality of the paths produced and the memory and computational requirements of planning over grids. We demonstrate our approaches on a number of example planning problems, compare them to related algorithms, and present several implementations on real robotic systems.
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 note on two problems in connexion with graphs
Dijkstra, E. W. (1959) · Numerische Mathematik · doi:10.1007/bf01386390 · Cited by 24,043
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
Advances in Neural Information Processing Systems 14: Proceedings of the 2001 Conference
(2002) · The MIT Press eBooks · doi:10.7551/mitpress/1120.001.0001 · Cited by 8,890
LaValle, S. M. (2006) · Cambridge University Press eBooks · doi:10.1017/cbo9780511546877 · Cited by 5,211
LaValle, S. M. (2006) · Cited by 4,177
Principles of Artificial Intelligence
Nilsson, N. J. (1982) · doi:10.1007/978-3-662-09438-9 · Cited by 3,457 · cited 2×
“for replanning Hart et al., 1968; Nilsson, 1980; Stentz, 1995; Koenig & Likhachev, 2002b.”
BackgroundA fast marching level set method for monotonically advancing fronts.
Sethian, J. A. (1996) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.93.4.1591 · Cited by 3,221
The focussed D* algorithm for real-time replanning
Stentz, A. (1995) · Cited by 865
Self-citationPrinciples of Artificial Intelligence
(1981) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1981.4767059 · Cited by 847
ARA*: Anytime A* with Provable Bounds on Sub-Optimality
Likhachev, M. A., Gordon, G. J., & Thrun, S. (2003) · Cited by 643
Anytime dynamic A*: an anytime, replanning algorithm
Likhachev, M. A., Ferguson, D., Gordon, G., Stentz, A., & Thrun, S. (2005) · Cited by 558
Self-citationHigh-speed navigation using the global dynamic window approach
Brock, O., & Khatib, O. (2003) · Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C) · doi:10.1109/robot.1999.770002 · Cited by 539
Multiresolution path planning for mobile robots
Kambhampati, S., & Davis, L. (1986) · IEEE Journal on Robotics and Automation · doi:10.1109/jra.1986.1087051 · Cited by 442
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 weighted region problem: finding shortest paths through a weighted planar subdivision
Mitchell, J. S. B., & Papadimitriou, C. H. (1991) · Journal of the ACM · doi:10.1145/102782.102784 · Cited by 295
Improved fast replanning for robot navigation in unknown terrain
Koenig, S., & Likhachev, M. (2003) · Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292) · doi:10.1109/robot.2002.1013481 · Cited by 294
Recent progress in local and global traversability for planetary rovers
Singh, S., Simmons, R., Smith, T., Stentz, A., Verma, V., Yahja, A., & Schwehr, K. (2002) · Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065) · doi:10.1109/robot.2000.844761 · Cited by 248
Self-citationA gradient method for realtime robot control
Konolige, K. (2002) · Proceedings. 2000 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2000) (Cat. No.00CH37113) · doi:10.1109/iros.2000.894676 · Cited by 181
Principles of Dynamic Programming
Larson, R. E. (1978) · CERN Document Server (European Organization for Nuclear Research) · Cited by 168
A complete navigation system for goal acquisition in unknown environments
Stentz, A., & Hebert, M. (1995) · Autonomous Robots · doi:10.1007/bf00735431 · Cited by 159
Self-citationStachniss, C., & Burgard, W. (2003) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/irds.2002.1041441 · Cited by 137
Kelly, A. (1996) · Cited by 100
An Interpolated Dynamic Navigation Function
Philippsen, R., & Siegwart, R. (2006) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2005.1570697 · Cited by 86
A survey of dynamic programming computational procedures
Larson, R. E. (1967) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1967.1098755 · Cited by 81
Mission-level path planning and re-planning for rover exploration
Tompkins, P., Stentz, A., & Wettergreen, D. S. (2006) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2005.09.027 · Cited by 52
Self-citation
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
Path planning techniques for mobile robots: Review and prospect
Liu, L., Wang, X., Yang, X., Liu, H., Li, J., & Wang, P. (2023) · Expert Systems with Applications · doi:10.1016/j.eswa.2023.120254 · Cited by 707
Path Planning for the Mobile Robot: A Review
Zhang, H.-Y., Lin, W.-M., & Chen, A.-X. (2018) · Symmetry · doi:10.3390/sym10100450 · Cited by 447
Path Planning for Autonomous Underwater Vehicles
Petres, C., Pailhas, Y., Patron, P., Petillot, Y., Evans, J., & Lane, D. (2007) · IEEE Transactions on Robotics · doi:10.1109/tro.2007.895057 · Cited by 433
Liu, P., Chen, A. Y., Huang, Y.-N., Han, J.-Y., Lai, J.-S., Kang, S.-C., Wu, T.-H., Wen, M.-C., & Tsai, M.-H. (2014) · Smart Structures and Systems · doi:10.12989/sss.2014.13.6.1065 · Cited by 377
Metadata
- Authors
- Ferguson, D., & Stentz, A.
- Venue
- Journal of Field Robotics
- Publisher
- Wiley
- Published
- 2006-02
- Volume
- 23
- Issue
- 2
- Pages
- 79-101
- ISSN
- 1556-4959 (ISSN-L)
- 1556-4967
- OpenAlex
- W2003708116
- Cited by
- 393
- References
- 25
- FWCI
- 14.11
- 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.
