The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Comparison of Parallel Genetic Algorithm and Particle Swarm Optimization for Real-Time UAV Path Planning
Abstract
The development of autonomous unmanned aerial vehicles (UAVs) is of high interest to many governmental and military organizations around the world. An essential aspect of UAV autonomy is the ability for automatic path planning. In this paper, we use the genetic algorithm (GA) and the particle swarm optimization algorithm (PSO) to cope with the complexity of the problem and compute feasible and quasi-optimal trajectories for fixed wing UAVs in a complex 3D environment, while considering the dynamic properties of the vehicle. The characteristics of the optimal path are represented in the form of a multiobjective cost function that we developed. The paths produced are composed of line segments, circular arcs and vertical helices. We reduce the execution time of our solutions by using the “single-program, multiple-data” parallel programming paradigm and we achieve real-time performance on standard commercial off-the-shelf multicore CPUs. After achieving a quasi-linear speedup of 7.3 on 8 cores and an execution time of 10 s for both algorithms, we conclude that by using a parallel implementation on standard multicore CPUs, real-time path planning for UAVs is possible. Moreover, our rigorous comparison of the two algorithms shows, with statistical significance, that the GA produces superior trajectories to the PSO.
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
Kennedy, J., & Eberhart, R. (2002) · Proceedings of ICNN'95 - International Conference on Neural Networks · doi:10.1109/icnn.1995.488968 · Cited by 58,192
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
Algorithm for computer control of a digital plotter
Bresenham, J. E. (1965) · IBM Systems Journal · doi:10.1147/sj.41.0025 · Cited by 2,172
Clerc, M. (2006) · Wiley eBooks · doi:10.1002/9780470612163 · Cited by 1,622
Introduction to Genetic Algorithms
Haupt, S. E. (2008) · Artificial Intelligence Methods in the Environmental Sciences · doi:10.1007/978-1-4020-9119-3_5 · Cited by 1,006
Introduction to Evolutionary Algorithms
Yu, X., & Gen, M. (2010) · Decision Engineering · doi:10.1007/978-1-84996-129-5 · Cited by 345
Pehlivanoglu, Y. V. (2012) · Aerospace Science and Technology · doi:10.1016/j.ast.2011.02.006 · Cited by 304
Fu, Y., Ding, M., & Zhou, C. (2012) · IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans · doi:10.1109/tsmca.2011.2159586 · Cited by 256
An Overview of Autonomous Mobile Robot Path Planning Algorithms
Sariff, N., & Buniyamin, N. (2006) · 2006 4th Student Conference on Research and Development · doi:10.1109/scored.2006.4339335 · Cited by 219
Classic And Heuristic Approaches In Robot Motion Planning A Chronological Review
Masehian, E., & Sedighizadeh, D. (2007) · doi:10.5281/zenodo.1074971 · Cited by 209
A Survey of Autonomous Control for UAV
Chen, H., Wang, X.-M., & Li, Y. (2009) · 2009 International Conference on Artificial Intelligence and Computational Intelligence · doi:10.1109/aici.2009.147 · Cited by 177
Słowik, A., & Slowik, J. (2007) · The International Journal of Advanced Manufacturing Technology · doi:10.1007/s00170-007-1013-0 · Cited by 42
Multiple UAVs Routes Planning Based on Particle Swarm Optimization Algorithm
Wang, G., Li, Q., & Guo, L. (2010) · International Symposium on Information Engineering and Electronic Commerce · doi:10.1109/ieec.2010.5533230 · Cited by 32
Feasible UAV Path Planning Using Genetic Algorithms and Bézier Curves
Macharet, D. G., Neto, A. A., & Campos, M. F. M. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-16138-4_23 · Cited by 27
Słowik, A., & Białko, M. (2007) · IEEE International Conference on Electronics, Circuits and Systems (ICECS) · doi:10.1109/icecs.2007.4510955 · Cited by 17
Cited by
Otto, A., Agatz, N., Campbell, J., Golden, B., & Pesch, E. (2018) · Networks · doi:10.1002/net.21818 · Cited by 985
“Thus, we do not include articles on obstacle-avoiding path planning from a given starting point to a given end point [12, 63, 108, 153, 194, 203, 220, 227, 245, 306] or on planning trajectories of drones flying in formation [220].”
BackgroundSafety-enhanced UAV path planning with spherical vector-based particle swarm optimization
Phung, M. D., & Ha, Q. P. (2021) · Applied Soft Computing · doi:10.1016/j.asoc.2021.107376 · Cited by 565
Wu, Q., Xu, J., Zeng, Y., Ng, D. W. K., Al-Dhahir, N., Schober, R., & Swindlehurst, A. L. (2021) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2021.3088681 · Cited by 562
Listou Ellefsen, A., Bjørlykhaug, E., Æsøy, V., Ushakov, S., & Zhang, H. (2019) · Reliability Engineering & System Safety · doi:10.1016/j.ress.2018.11.027 · Cited by 523
Cloud Computing Resource Scheduling and a Survey of Its Evolutionary Approaches
Zhan, Z.-H., Liu, X.-F., Gong, Y.-J., Zhang, J., Chung, H. S.-H., & Li, Y. (2015) · ACM Computing Surveys · doi:10.1145/2788397 · Cited by 482
Metadata
- Authors
- Roberge, V., Tarbouchi, M., & Labonte, G.
- Venue
- IEEE Transactions on Industrial Informatics
- Published
- 2013-02
- Volume
- 9
- Issue
- 1
- Pages
- 132-141
- ISSN
- 1551-3203 (ISSN-L)
- 1941-0050
- OpenAlex
- W2077831477
- Cited by
- 1,059
- References
- 15
- FWCI
- 29.83
- 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.