A multi-threaded planning technique with combined paths approach for unmanned aerial vehicles
Parallel Computing, cilt.129, 2026 (SCI-Expanded, Scopus)
- Yayın Türü: Makale / Tam Makale
- Cilt numarası: 129
- Basım Tarihi: 2026
- Doi Numarası: 10.1016/j.parco.2026.103209
- Dergi Adı: Parallel Computing
- Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, Applied Science & Technology Source, Compendex, INSPEC, MathSciNet, zbMATH, Academic Search Ultimate (EBSCO), Engineering Source (EBSCO)
- Anahtar Kelimeler: Greedy heuristics, Multi-threading, Path planning, Unmanned aerial vehicles
- Erciyes Üniversitesi Adresli: Evet
Özet
Planning unmanned aerial vehicles (UAVs) by considering the optimization concerns about the enemy threats, fuel consumption or usage and maneuver limitations has a critical importance on the task being performed and safety of the flight. The Back-and-Forth (BaF) algorithm has been introduced recently as a solving technique for the geometrical description of the UAV path planning problem and its sole performance and positive contribution on the capabilities of another methods have been validated. In this study, the greedy heuristic guided by the BaF algorithm was redesigned with the purpose of getting the power of a multi-core architecture and a new geometrical UAV path planner named as the Combined Paths for short ComPaths was proposed. The performance of the ComPaths was evaluated over 3 different battlefield scenarios and 12 test cases derived from them. Moreover, the paths found by the ComPaths were compared to the paths of other 15 heuristic or meta-heuristic backed planners. Comparative studies between the ComPaths and other tested techniques allowed to conclude that the ComPaths is among the top three best planners for all cases even though it makes nearly 43 to 49 times less function calls than the remaining competitors.