Overview of Path-Planning and Obstacle Avoidance Algorithms for UAVs: A Comparative Study
The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Abstract
Unmanned aerial vehicles (UAVs) have recently attracted the attention of researchers due to their numerous potential civilian applications. However, current robot navigation technologies need further development for efficient application to various scenarios. One key issue is the “Sense and Avoid” capability, currently of immense interest to researchers. Such a capability is required for safe operation of UAVs in civilian domain. For autonomous decision making and control of UAVs, several path-planning and navigation algorithms have been proposed. This is a challenging task to be carried out in a 3D environment, especially while accounting for sensor noise, uncertainties in operating conditions, and real-time applicability. Heuristic and non-heuristic or exact techniques are the two solution methodologies that categorize path-planning algorithms. The aim of this paper is to carry out a comprehensive and comparative study of existing UAV path-planning algorithms for both methods. Three different obstacle scenarios test the performance of each algorithm. We have compared the computational time and solution optimality, and tested each algorithm with variations in the availability of global and local obstacle information.
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
A note on two problems in connexion with graphs
Dijkstra, E. W. (1959) · Numerische Mathematik · doi:10.1007/bf01386390 · Cited by 29,065
Reinforcement Learning: An Introduction
Sutton, R. S., & Barto, A. G. (1998) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.1998.712192 · Cited by 27,225
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
Learning to predict by the methods of temporal differences
Sutton, R. S. (1988) · Machine Learning · doi:10.1007/bf00115009 · Cited by 5,148
Reinforcement learning in robotics: A survey
Kober, J., Bagnell, J. A., & Peters, J. (2013) · The International Journal of Robotics Research · doi:10.1177/0278364913495721 · Cited by 3,160
Coordinated multi-robot exploration
Burgard, W., Moors, M., Stachniss, C., & Schneider, F. E. (2005) · IEEE Transactions on Robotics · doi:10.1109/tro.2004.839232 · Cited by 1,177
Handbook of Unmanned Aerial Vehicles
(2015) · doi:10.1007/978-90-481-9707-1 · Cited by 1,103
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
A Note on Dijkstra's Shortest Path Algorithm
Johnson, D. B. (1973) · Journal of the ACM · doi:10.1145/321765.321768 · Cited by 380
Cited by
Survey on computational-intelligence-based UAV path planning
Zhao, Y., Zheng, Z., & Liu, Y. (2018) · Knowledge-Based Systems · doi:10.1016/j.knosys.2018.05.033 · Cited by 418
Unmanned Aerial Vehicles (UAVs): Collision Avoidance Systems and Approaches
Yasin, J. N., Mohamed, S. A. S., Haghbayan, M.-H., Heikkonen, J., Tenhunen, H., & Plosila, J. (2020) · IEEE Access · doi:10.1109/access.2020.3000064 · Cited by 329
“Force-field methods, also known as potential field methods, use the concept of a repulsive or attractive force field either to repel an agent/robot from an obstacle or to attract it towards a target [92], [100]–[102].”
BackgroundUAV Path Planning Using Optimization Approaches: A Survey
Ait Saadi, A., Soukane, A., Meraihi, Y., Benmessaoud Gabis, A., Mirjalili, S., & Ramdane-Cherif, A. (2022) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-022-09742-7 · Cited by 269
Path-Planning for Unmanned Aerial Vehicles with Environment Complexity Considerations: A Survey
Jones, M., Djahel, S., & Welsh, K. (2023) · ACM Computing Surveys · doi:10.1145/3570723 · Cited by 258
Metadata
- Authors
- Radmanesh, M., Kumar, M., Guentert, P. H., & Sarim, M.
- Venue
- Unmanned Systems
- Publisher
- World Scientific Pub Co Pte Ltd
- Published
- 2018-04
- Volume
- 06
- Issue
- 02
- Pages
- 95-118
- ISSN
- 2301-3850 (ISSN-L)
- 2301-3869
- OpenAlex
- W2798000375
- Cited by
- 217
- References
- 9
- FWCI
- 11.09
- 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.