The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Fast replanning for navigation in unknown terrain
Abstract
Mobile robots often operate in domains that are only incompletely known, for example, when they have to move from given start coordinates to given goal coordinates in unknown terrain. In this case, they need to be able to replan quickly as their knowledge of the terrain changes. Stentz' Focussed Dynamic A/sup */ (D/sup */) is a heuristic search method that repeatedly determines a shortest path from the current robot coordinates to the goal coordinates while the robot moves along the path. It is able to replan faster than planning from scratch since it modifies its previous search results locally. Consequently, it has been extensively used in mobile robotics. In this article, we introduce an alternative to D/sup */ that determines the same paths and thus moves the robot in the same way but is algorithmically different. D/sup */ Lite is simple, can be rigorously analyzed, extendible in multiple ways, and is at least as efficient as D/sup */. We believe that our results will make D/sup */-like replanning methods even more popular and enable robotics researchers to adapt them to additional applications.
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
Latombe, J.-C. (1991) · Springer eBooks · doi:10.1007/978-1-4615-4022-9 · Cited by 6,396
Heuristics: Intelligent search strategies for computer problem solving.
(1985) · Information Processing & Management · doi:10.1016/0306-4573(85)90100-1 · Cited by 1,430
Optimal and Efficient Path Planning for Partially Known Environments
Stentz, A. (1997) · Intelligent Unmanned Ground Vehicles · doi:10.1007/978-1-4615-6325-9_11 · Cited by 1,233
Optimal and efficient path planning for partially-known environments
Stentz, A. (2002) · Proceedings of the 1994 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1994.351061 · Cited by 929
Korf, R. E. (1990) · Artificial Intelligence · doi:10.1016/0004-3702(90)90054-4 · Cited by 917
The focussed D* algorithm for real-time replanning
Stentz, A. (1995) · Cited by 865
Lumelsky, V. J., & Stepanov, A. A. (1987) · Algorithmica · doi:10.1007/bf01840369 · Cited by 699
Koenig, S., Likhachev, M. A., & Furcy, D. (2004) · Artificial Intelligence · doi:10.1016/j.artint.2003.12.001 · Cited by 662
Self-citationImproved 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
Self-citationMoore, A. W., & Atkeson, C. G. (1995) · Machine Learning · doi:10.1023/a:1022656217772 · Cited by 259
Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs
King, V. (2003) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sffcs.1999.814580 · Cited by 225
A complete navigation system for goal acquisition in unknown environments
Stentz, A., & Hebert, M. (1995) · Autonomous Robots · doi:10.1007/bf00735431 · Cited by 159
A portable, autonomous, urban reconnaissance robot
Matthies, L. H., Xiong, Y., Hogg, R., Zhu, D., Rankin, A., Kennedy, B. A., Hebert, M., MacLachlan, R. A., Won, C., Frost, T., et al. (2002) · Robotics and Autonomous Systems · doi:10.1016/s0921-8890(02)00241-5 · Cited by 148
On Finding and Updating Spanning Trees and Shortest Paths
Spira, P. M., & Pan, A. (1975) · SIAM Journal on Computing · doi:10.1137/0204032 · Cited by 141
GRAMMPS: a generalized mission planner for multiple mobile robots in unstructured environments
Brumitt, B. L., & Stentz, A. (2002) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.1998.677360 · Cited by 115
Fully dynamic all pairs shortest paths with real edge weights
Demetrescu, C., & Italiano, G. F. (2006) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2005.05.005 · Cited by 96
Koenig, S., Tovey, C. A., & Halliburton, W. (2002) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2001.933175 · Cited by 84
Self-citationBarbehenn, M., & Hutchinson, S. (1995) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.370502 · Cited by 69
Podsędkowski, L., Nowakowski, J., Idzikowski, M., & Vizvary, I. (2001) · Robotics and Autonomous Systems · doi:10.1016/s0921-8890(00)00118-4 · Cited by 65
Fully dynamic all pairs shortest paths with real edge weights
Demetrescu, C., & Italiano, G. F. (2001) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2001.959900 · Cited by 37
Sensor based planning and nonsmooth analysis
Choset, H., & Burdick, J. W. (2002) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.1994.351103 · Cited by 35
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
Campbell, S., Naeem, W., & Irwin, G. W. (2012) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2012.09.008 · Cited by 478
Hoy, M., Matveev, A. S., & Savkin, A. V. (2015) · Robotica · doi:10.1017/s0263574714000289 · Cited by 469
Gammell, J. D., Srinivasa, S. S., & Barfoot, T. D. (2015) · 2015 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra.2015.7139620 · Cited by 416
A Fully Autonomous Indoor Quadrotor
Grzonka, S., Grisetti, G., & Burgard, W. (2012) · IEEE Transactions on Robotics · doi:10.1109/tro.2011.2162999 · Cited by 386
Metadata
- Authors
- Koenig, S., & Likhachev, M.
- Venue
- IEEE Transactions on Robotics
- Published
- 2005-06
- Volume
- 21
- Issue
- 3
- Pages
- 354-363
- ISSN
- 1552-3098 (ISSN-L)
- OpenAlex
- W2113256452
- Cited by
- 697
- References
- 21
- FWCI
- 11.97
- 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.