The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
High-speed navigation using the global dynamic window approach
Abstract
Many applications in mobile robotics require the safe execution of a collision-free motion to a goal position. Planning approaches are well suited for achieving a goal position in known static environments, while real-time obstacle avoidance methods allow reactive motion behavior in dynamic and unknown environments. This paper proposes the global dynamic window approach as a generalization of the dynamic window approach. It combines methods from motion planning and real-time obstacle avoidance to result in a framework that allows robust execution of high-velocity, goal-directed reactive motion for a mobile robot in unknown and dynamic environments. The global dynamic window approach is applicable to nonholonomic and holonomic mobile robots.
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
Real-Time Obstacle Avoidance for Manipulators and Mobile Robots
Khatib, O. (1986) · The International Journal of Robotics Research · doi:10.1177/027836498600500106 · Cited by 7,894
Self-citationLatombe, J.-C. (1991) · Springer eBooks · doi:10.1007/978-1-4615-4022-9 · Cited by 6,396
The dynamic window approach to collision avoidance
Fox, D., Burgard, W., & Thrun, S. (1997) · IEEE Robotics & Automation Magazine · doi:10.1109/100.580977 · Cited by 3,771
The vector field histogram-fast obstacle avoidance for mobile robots
Borenstein, J., & Koren, Y. (1991) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.88137 · Cited by 2,301
Learning metric-topological maps for indoor mobile robot navigation
Thrun, S. (1998) · Artificial Intelligence · doi:10.1016/s0004-3702(97)00078-7 · Cited by 1,042
Robot Motion Planning: A Distributed Representation Approach
Barraquand, J., & Latombe, J.-C. (1991) · The International Journal of Robotics Research · doi:10.1177/027836499101000604 · Cited by 995
The curvature-velocity method for local obstacle avoidance
Simmons, R. (2002) · Proceedings of IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1996.511023 · Cited by 522
Exact robot navigation by means of potential functions: Some topological considerations
Koditschek, D. (2005) · Proceedings. 1987 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1987.1088038 · Cited by 345
Map learning and high-speed navigation in RHINO
Thrun, S., Bücken, A., Burgard, W., Fox, D., Fröhlinghaus, T., Hennig, D., Hofmann, T., Krell, M. B., & Schmidt, T. T. (1998) · The MIT Press eBooks · Cited by 252
Real-time path planning using harmonic potentials in dynamic environments
Feder, H. J. S., & Slotine, J.-J. E. (2002) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.1997.620144 · Cited by 109
A hybrid collision avoidance method for mobile robots
Fox, D., Burgard, W., Thrun, S., & Cremers, A. B. (2002) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.1998.677270 · Cited by 103
Robust obstacle avoidance in unknown and cramped environments
Feiten, W., Bauer, R., & Lawitzky, G. (2002) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.1994.351150 · Cited by 81
Cited by
A Survey of Motion Planning Algorithms from the Perspective of Autonomous UAV Guidance
Goerzen, C., Kong, Z., & Mettler, B. (2010) · Journal of Intelligent and Robotic Systems · doi:10.1007/s10846-009-9383-1 · Cited by 779
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
Campbell, S., Naeem, W., & Irwin, G. W. (2012) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2012.09.008 · Cited by 478
Path Planning for Autonomous Mobile Robots: A Review
Sánchez-Ibáñez, J. R., Pérez-del-Pulgar, C. J., & García-Cerezo, A. (2021) · Sensors · doi:10.3390/s21237898 · Cited by 462
Nearness Diagram (ND) Navigation: Collision Avoidance in Troublesome Scenarios
Minguez, J., & Montano, L. (2004) · IEEE Transactions on Robotics and Automation · doi:10.1109/tra.2003.820849 · Cited by 452
Metadata
- Authors
- Brock, O., & Khatib, O.
- Venue
- Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C)
- Publisher
- IEEE
- Published
- 2003-01-20
- Volume
- 1
- Pages
- 341-346
- ISSN
- 1050-4729 (ISSN-L)
- OpenAlex
- W2131505299
- Cited by
- 539
- References
- 12
- FWCI
- 23.69
- Type
- conference paper
- 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.