The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Obstacle avoidance in a dynamic environment: a collision cone approach
Abstract
A novel collision cone approach is proposed as an aid to collision detection and avoidance between irregularly shaped moving objects with unknown trajectories. It is shown that the collision cone can be effectively used to determine whether collision between a robot and an obstacle (both moving in a dynamic environment) is imminent. No restrictions are placed on the shapes of either the robot or the obstacle, i.e., they can both be of any arbitrary shape. The collision cone concept is developed in a phased manner starting from existing analytical results that enable prediction of collision between two moving point objects. These results are extended to predict collision between a point and a circular object, between a point and an irregularly shaped object, between two circular objects, and finally between two irregularly shaped objects. Using the collision cone approach, several strategies that the robot can follow in order to avoid collision, are presented. A discussion on how the shapes of the robot and obstacles can be approximated in order to reduce computational burden is also presented. A number of examples are given to illustrate both collision prediction and avoidance strategies of the robot.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Linear and nonlinear programming.
(1986) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(86)90092-3 · Cited by 4,805
Spatial Planning: A Configuration Space Approach
Lozano-Perez (1983) · IEEE Transactions on Computers · doi:10.1109/tc.1983.1676196 · Cited by 2,113
Linear and nonlinear programming
Sydsæter, K., Strøm, A., & Berck, P. (1999) · Economists’ Mathematical Manual · doi:10.1007/978-3-662-03995-3_15 · Cited by 864
Gross motion planning—a survey
Hwang, Y. K., & Ahuja, N. (1992) · ACM Computing Surveys · doi:10.1145/136035.136037 · Cited by 826
Toward Efficient Trajectory Planning: The Path-Velocity Decomposition
Kant, K., & Zucker, S. W. (1986) · The International Journal of Robotics Research · doi:10.1177/027836498600500304 · Cited by 753
Inertial navigation systems for mobile robots
Barshan, B., & Durrant-Whyte, H. F. (1995) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.388775 · Cited by 723
Motion planning in the presence of moving obstacles
Reif, J., & Sharir, M. (1994) · Journal of the ACM · doi:10.1145/179812.179911 · Cited by 174
Motion Planning in Dynamic Environments
Fujimura, K. (1991) · Computer science workbench · doi:10.1007/978-4-431-68165-6 · Cited by 151
A survey of motion planning and related geometric algorithms
Schwartz, J. T., & Sharir, M. (1988) · Artificial Intelligence · doi:10.1016/0004-3702(88)90053-7 · Cited by 131
Guidance Laws for Short-Range Tactical Missiles
PASTRICK, H., Seltzer, S. M., & Warren, M. E. (1981) · Journal of Guidance and Control · doi:10.2514/3.56060 · Cited by 120
Path tracking through uncharted moving obstacles
de Lamadrid, J. G., & Gini, M. L. (1990) · IEEE Transactions on Systems Man and Cybernetics · doi:10.1109/21.61210 · Cited by 32
Efficient Collision Prediction Among Many Moving Objects
Vincent Hayward, B., Aubry, S., Foisy, A., et al. (1995) · The International Journal of Robotics Research · doi:10.1177/027836499501400203 · Cited by 31
Motion Planning Amid Transient Obstacles
Fujimura, K. (1994) · The International Journal of Robotics Research · doi:10.1177/027836499401300502 · Cited by 24
Cited by
Unmanned Aerial Vehicles (UAVs): A Survey on Civil Applications and Key Research Challenges
Shakhatreh, H., Sawalmeh, A. H., Al-Fuqaha, A., Dou, Z., Almaita, E., Khalil, I., Othman, N. S., Khreishah, A., & Guizani, M. (2019) · IEEE Access · doi:10.1109/access.2019.2909530 · Cited by 2,529
“Several different approaches utilize this method to avoid collision such as Point of Closest Approach [308], Collision Cone Approach [309], [313], and Dubins Paths Approach [314], [315].”
A review of conflict detection and resolution modeling methods
Kuchar, J. K., & Yang, L. C. (2000) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/6979.898217 · Cited by 1,069
Hoy, M., Matveev, A. S., & Savkin, A. V. (2015) · Robotica · doi:10.1017/s0263574714000289 · Cited by 469
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
The Hybrid Reciprocal Velocity Obstacle
Snape, J., Berg, J. V. D., Guy, S. J., & Manocha, D. (2011) · IEEE Transactions on Robotics · doi:10.1109/tro.2011.2120810 · Cited by 448
Metadata
- Authors
- Chakravarthy, A., & Ghose, D.
- Venue
- IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans
- Published
- 1998
- Volume
- 28
- Issue
- 5
- Pages
- 562-574
- ISSN
- 1083-4427 (ISSN-L)
- OpenAlex
- W2136947569
- Cited by
- 556
- References
- 14
- FWCI
- 2.07
- 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.