Efficient Strategy for Multi-Uav Path Planning in Target Coverage Problems
Efficient Strategy for Multi-Uav Path Planning in Target Coverage Problems
Yükleniyor...
Özet
In recent years, multi unmanned aerial vehicles (UAVs) are used in the same system to accomplish more complex missions. In many multi-UAV system applications, the main objective is to visit some predetermined checkpoints in operational area. If the number of check points and constraints increases, finding a feasible solution takes up too much time. In this paper, a checkpoint based multi-UAV path planning problem is solved by using improved genetic algorithm. The main contributions of this paper are: (1) the introducing revisit time interval concept, (2) the investigating of the effect of objective function description, and (3) looking into an outcome of using multiple runways on optimal multi-UAV path planning. The proposed strategy-based optimization methodology is performed for checkpoint based multi-UAV path planning problems in two-dimensional (2D) environment. Performance results show that the proposed strategy provides effective and feasible paths for each UAV.
Açıklama
Anahtar kelimeler
Genetic algorithm, Search, Multi-uav, Path planning, Genetic algorithm, Search, Multi-uav, Path planning
Bilim Dalları
0209 industrial biotechnology, 02 engineering and technology
Alıntı
Pehlivanoğlu, Y. V., Bekmezci, İ., & Pehlivanoğlu, P. (2023). Efficient Strategy for Multi-UAV Path Planning in Target Coverage Problems. In 2022 International Conference on Theoretical and Applied Computer Science and Engineering (ICTASCE) (pp. 110-115). IEEE.
WoS Q
Scopus Q

OpenCitations Atıf Sayısı
4
Cilt
Sayı
Başlangıç Sayfası
110
Bitiş Sayfası
115
Yükleniyor...
