Journals / Politeknik Dergisi / 2019 / Cilt: 22 - Sayı: 4

A New Solution Approach for UAV Routing Problem with Moving Target – Heterogeneous Fleet

Hareketli Hedefli - Heterojen Filolu İHA Rotalama Problemi İçin Yeni Bir Çözüm Yaklaşımı

Pages
999–1016
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

As a result, it has been determined that all targets are destroyed with minimum number of vehicles according to the specified order of priority within the acceptable solution period and the proposed method contributed to the efficient routing of (heterogeneous) unmanned aerial vehicles moving in a fleet.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:The technological developments in the defence industry lead countries to create unmanned armies based on robotic systems.
📊
Key Findings & Data:The Analytical Hierarchical Process method was used to prioritize the targets and pursuers; and it was aimed to destroy all targets with a minimum number of vehicles in a short time due to the cost of flights with UAVs, increase in maintenance-repair costs and the risk of fault due to unnecessary UAV use, the use of large numbers of UAVs in the field of operation evoked enemy elements and directed them to take defensive measures against UAVs.
💡
Conclusion & Impact:As a result, it has been determined that all targets are destroyed with minimum number of vehicles according to the specified order of priority within the acceptable solution period and the proposed method contributed to the efficient routing of (heterogeneous) unmanned aerial vehicles moving in a fleet.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Dinamik insansız hava aracı rotalama · analitik hiyerarşik proses · sezgisel algoritma

Abstract

The technological developments in the defence industry lead countries to create unmanned armies based on robotic systems. Due to the intense use of unmanned aerial vehicles in the instant surveillance, tracking, detection and disposal of targets, it is an important and difficult problem to determine which of the different types of air vehicles in the field of operations should be selected and how they can be effectively routed. In this study, a multi-criteria solution approach based on heuristic algorithm is proposed for destroying moving targets taking into account of the capacity and time window constraints by armed and unarmed unmanned aerial vehicles moving as a fleet. The Analytical Hierarchical Process method was used to prioritize the targets and pursuers; and it was aimed to destroy all targets with a minimum number of vehicles in a short time due to the cost of flights with UAVs, increase in maintenance-repair costs and the risk of fault due to unnecessary UAV use, the use of large numbers of UAVs in the field of operation evoked enemy elements and directed them to take defensive measures against UAVs. The effectiveness of the algorithm has been tested on 25 different scenarios where the number of pursuers is between 10 and 50 and the target number ranges from 40 to 200. As a result, it has been determined that all targets are destroyed with minimum number of vehicles according to the specified order of priority within the acceptable solution period and the proposed method contributed to the efficient routing of (heterogeneous) unmanned aerial vehicles moving in a fleet.

Özet

Savunma sanayinde yaşanan teknolojik gelişmeler, ülkeleri robotik sistemlere dayalı askersiz ordular oluşturmaya yönlendirmektedir. Hedeflerin anlık olarak gözetlenmesi, takibi, tespiti ve imhasında, insansız hava araçlarının yoğun bir şekilde kullanmasıyla beraber, operasyon alanında farklı özelliklere sahip hava araçlarından hangilerinin seçileceği ve etkin bir şekilde nasıl rotalanacağı, önemli ve zor bir problem olarak ortaya çıkarmıştır. Bu çalışmada filo halinde hareket eden silahlı ve silahsız insansız hava araçlarının kapasite ve zaman penceresi kısıtları dikkate alınarak hareket halindeki hedefleri etkisiz hale getirmesi için sezgisel algoritmaya dayalı çok kriterli bir çözüm yaklaşımı önerilmiştir. Hedef ve vurucuların önceliklendirilmesinde Analitik Hiyerarşik Proses yönteminden yararlanılmış, İHA’ lara ait uçuşların belirli bir maliyete sahip olması, gereksiz kullanılan İHA’ ların bakım-onarım maliyetini ve arıza riskini artırması, operasyon alanında fazla sayıda İHA kullanılmasının düşman unsurlarını uyandırması ve İHA’ lara karşı savunma tedbirleri almaya yönlendirmesi nedenlerinden dolayı kısa bir çözüm süresi içinde tüm hedeflerin minimum sayıda araç ile imha edilmesi amaçlanmıştır. Algoritmanın etkinliği, vurucu sayısının 10 ile 50, hedef sayısının 40 ile 200 arasında değiştiği 25 farklı senaryo üzerinde test edilmiş, sonuç olarak kabul edilebilir çözüm süresi içerisinde tüm hedeflerin belirtilen öncelik sırasına göre minimum sayıda araçla imha edildiği tespit edilmiştir. Önerilen yöntemin filo halinde hareket eden farklı özelliklere sahip (heterojen) insansız hava araçlarının etkin bir şekilde rotalanmasına katkıda bulunduğu görülmüştür.

🔖

Cite This Article

UÇAR, U. Ü., İŞLEYEN, S. K. (2019). A New Solution Approach for UAV Routing Problem with Moving Target – Heterogeneous Fleet. Politeknik Dergisi, Cilt: 22 - Sayı: 4, 999–1016. https://ajindex.com/articles/307364

References (1)

  1. . Rana, K., Praharaj, S. & Nanda, T. (2016). Unmanned Aerial Vehicles (UAVs): An Emerging Technology for Logistics. International Journal of Business and Management Invention, 5(5), 86-92. [2]. Aydemir, H. (2014). Harekat Araştırması Ana Bilim Dalı. İnsansız Hava Araçlarının Rotalama Problemi İçin Simülasyon Tabanlı Karar Destek Sistemi. Kara Harp Okulu, Savunma Bilimleri Enstitüsü,[3]. Helvig, C. S., Robins, G., & Zelikovsky, A. (1998, August). Moving-target TSP and related problems. In European Symposium on Algorithms (pp. 453-464). Springer Berlin Heidelberg.[4]. Fügenschuh, A., Knapp, M., & Rothe, H. (2014). The Multiple Traveling Salesmen Problem with Moving Targets. Helmut-Schmidt-Univ., Professur für Angewandte Mathematik.[5]. Stieber, A., Fügenschuh, A., Epp, M., Knapp, M., & Rothe, H. (2015). The multiple traveling salesmen problem with moving targets. Optimization Letters, 9(8), 1569-1583.[6]. Stieber, A., & Fügenschuh, A. (2016). Variants in Modeling Time Aspects for the Multiple Traveling Salesmen Problem with Moving Targets.[7]. Jiang, Q., Sarker, R., & Abbass, H. (2005). Tracking moving targets and the non-stationary traveling salesman problem. Complexity International, 11(2005), 171-179.[8]. Jindal, P., & Kumar, A. (2011). Multiple Target Intercepting Traveling Salesman Problem, International Journal of Computer Science and Technology, 2(2), 327-331.[9]. Englot, B., Sahai, T., & Cohen, I. (2013, December). Efficient tracking and pursuit of moving targets by heuristic solution of the traveling salesman problem. In Decision and Control (CDC), 2013 IEEE 52nd Annual Conference on (pp. 3433-3438). IEEE.[10]. Jindal, P., Kumar, A., & Kumar, S. (2011). Dynamic version of Traveling Salesman Problem. International Journal of Computer Applications (0975–8887), 19(1).[11]. Khosravi, M., & Aghdam, A. G. (2014, December). Cooperative receding horizon control for multi-target interception in uncertain environments. In Decision and Control (CDC), 2014 IEEE 53rd Annual Conference on (pp. 4497-4502). IEEE.[12]. Zhou, A., Kang, L., & Yan, Z. (2003, December). Solving dynamic TSP with evolutionary approach in real time. In Evolutionary Computation, 2003. CEC'03. The 2003 Congress on (Vol. 2, pp. 951-957). IEEE.[13]. Choubey, N. S. (2013). Moving Target Travelling Salesman Problem Using Genetic Algorithm. International Journal of Computer Applications, 70(2).[14]. Lee, Z. J., Lee, C. Y., & Su, S. F. (2002). An immunity-based ant colony optimization algorithm