The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Nearness Diagram (ND) Navigation: Collision Avoidance in Troublesome Scenarios
Abstract
This paper addresses the reactive collision avoidance for vehicles that move in very dense, cluttered, and complex scenarios. First, we describe the design of a reactive navigation method that uses a "divide and conquer" strategy based on situations to simplify the difficulty of the navigation. Many techniques could be used to implement this design (since it is described at symbolic level), leading to new reactive methods that must be able to navigate in arduous environments (as the difficulty of the navigation is simplified). We also propose a geometry-based implementation of our design called the nearness diagram navigation. The advantage of this reactive method is to successfully move robots in troublesome scenarios, where other methods present a high degree of difficulty in navigating. We show experimental results on a real vehicle to validate this research, and a discussion about the advantages and limitations of this new approach.
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
Latombe, 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
(1999) · Choice Reviews Online · doi:10.5860/choice.36-5109 · Cited by 2,528
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
Spatial Planning: A Configuration Space Approach
Lozano-Perez (1983) · IEEE Transactions on Computers · doi:10.1109/tc.1983.1676196 · Cited by 2,113
Potential field methods and their inherent limitations for mobile robot navigation
Koren, Y., & Borenstein, J. (2002) · Proceedings. 1991 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1991.131810 · Cited by 1,570
Real-time obstacle avoidance for fast mobile robots
Borenstein, J., & Koren, Y. (1989) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/21.44033 · Cited by 1,258
Elastic bands: connecting path planning and control
Quinlan, S., & Khatib, O. (2002) · [1993] Proceedings IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1993.291936 · Cited by 793
High-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
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
Integrated path planning and dynamic steering control for autonomous vehicles
Krogh, B., & Thorpe, C. (1986) · Proceedings. 1986 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1986.1087444 · Cited by 259
Intelligent Unmanned Ground Vehicles
Hebert, M. (1997) · Springer eBooks · doi:10.1007/978-1-4615-6325-9 · Cited by 167
Universal planning: an (almost) universally bad idea
Ginsberg, M. L. (1989) · doi:10.1609/aimag.v10i4.964 · Cited by 145
Local obstacle avoidance for mobile robots based on the method of artificial potentials
Tilove, R. B. (2002) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.1990.126041 · Cited by 141
Real-time re-planning in high-dimensional configuration spaces using sets of homotopic paths
Brock, O., & Khatib, O. (2002) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2000.844111 · Cited by 112
Intelligent Unmanned Ground Vehicles: Autonomous Navigation Research at Carnegie Mellon
Hebert, M. (1997) · Kluwer Academic Publishers eBooks · Cited by 99
Real-time obstacle avoidance for polygonal robots with a reduced dynamic window
Arras, K. O., Persson, J., Tomatis, N., & Siegwart, R. (2003) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2002.1013695 · Cited by 95
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
Masoud, A. A., Masoud, S. A., & Bayoumi, M. M. (2002) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.1994.351000 · Cited by 63
Global nearness diagram navigation (GND)
Mínguez, J., Montano, L., Siméon, T., & Alami, R. (2002) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2001.932526 · Cited by 57
Self-citationReal-time robot navigation in unstructured environments using a 3D laser rangefinder
Montano, L., & Asensio, J. R. (2002) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.1997.655062 · Cited by 34
Self-citationDiligent: towards a human-friendly navigation system
Alami, R., Belousov, I., Fleury, S., Herrb, M., Ingrand, F., Mínguez, J., & Morisset, B. (2002) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2000.894576 · Cited by 24
Learning How to Combine Sensory-Motor Modalities for a Robust Behavior
Morisset, B., & Ghallab, M. (2002) · Lecture notes in computer science · doi:10.1007/3-540-37724-7_10 · Cited by 10
Cited by
Iturrate, I., Antelis, J. M., Kubler, A., & Minguez, J. (2009) · IEEE Transactions on Robotics · doi:10.1109/tro.2009.2020347 · Cited by 512
Self-citationHoy, M., Matveev, A. S., & Savkin, A. V. (2015) · Robotica · doi:10.1017/s0263574714000289 · Cited by 469
Path Smoothing Techniques in Robot Navigation: State-of-the-Art, Current and Future Challenges
Ravankar, A., Ravankar, A. A., Kobayashi, Y., Hoshino, Y., & Peng, C.-C. (2018) · Sensors · doi:10.3390/s18093170 · Cited by 314
Metadata
- Authors
- Minguez, J., & Montano, L.
- Venue
- IEEE Transactions on Robotics and Automation
- Published
- 2004-02
- Volume
- 20
- Issue
- 1
- Pages
- 45-59
- ISSN
- 1042-296X (ISSN-L)
- OpenAlex
- W2165852544
- Cited by
- 452
- References
- 24
- FWCI
- 29.55
- 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.