Advanced Trajectory Planning for Unmanned Aerial Vehicles in the Context of Data Collection from Spatially Distributed Wireless Sensor Networks

1 Abramov, M. M. New and Promising Directions for the Use of Unmanned Aerial Vehicles. Izvestiya of Tula State University. – Technical Sciences, 2022, No 3, pp. 227-232. Search in Google Scholar

2 Popescu, D., et al. A Survey of Collaborative UAV-WSN Systems for Efficient Monitoring. – Sensors, Vol. 19, 2019, No 21, 4690. Search in Google Scholar

3 Hedges, D. A., J. P. Coon, G. Chen. A Continuum Model for Route Optimization in Large-Scale Inhomogeneous Multi-Hop Wireless Networks. – IEEE Transactions on Communications, Vol. 68, 2020, No 2, pp. 1058-1070. Search in Google Scholar

4 Jawhar, I., N. Mohamed, J. Al-Jaroodi, S. Zhang. A Framework for Using Unmanned Aerial Vehicles for Data Collection in Linear Wireless Sensor Networks. – J. Intell. Robot. Syst., Vol. 74, 2014, pp. 437-453. Search in Google Scholar

5 Dumitrescu, A., J. S. B. Mitchell. Approximation Algorithms for TSP with Neighborhoods in the Plane. – Journal of Algorithms, Vol. 48, 2003, No 1, pp. 135-159. Search in Google Scholar

6 Alatartsev, S., M. Augustine, F. Ortmeier. Constricting Insertion Heuristic for Traveling Salesman Problem with Neighborhoods. – In: Proc. of International Conference on Automated Planning and Scheduling, Vol. 23, 2013, pp. 2-10. Search in Google Scholar

7 Gulczynski, D. J., J. W. Heath, C. C. Price. The Close Enough Traveling Salesman Problem: A Discussion of Several Heuristics. – Springer US, 2006, pp. 271-283. Search in Google Scholar

8 Abramov, M. M. New and Promising Directions for the Use of Unmanned Aerial Vehicles, Izvestiya of Tula State University. – Technical Sciences, 2022, No 3, pp. 227-232. Search in Google Scholar

9 Carrabs, F., et al. Improved Upper and Lower Bounds for the Close Enough Traveling Salesman Problem. – In: Proc. of 12th International Conference, Green, Pervasive, and Cloud Computing (GPC’17), Cetara, Italy, 11-14 May 2017. Springer International Publishing, 2017, pp. 165-177. Search in Google Scholar

10 Qian, Q., Y. Wang, D. Boyle. On Solving Close Enough Orienteering Problems with Overlapped Neighborhoods. – European Journal of Operational Research, Vol. 318, 2024, No 2, pp. 369-387. Search in Google Scholar

11 Carrabs, F., et al. A Novel Discretization Scheme for the Close Enough Traveling Salesman Problem. – Computers & Operations Research, Vol. 78, 2017. pp. 163-171. Search in Google Scholar

12 Carrabs, F., et al. An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for the Close-Enough Traveling Salesman Problem. – INFORMS Journal on Computing, Vol. 32, 2020, No 4, pp. 1030-1048. Search in Google Scholar

13 Sinha Roy, D., et al. Estimating the Tour Length for the Close Enough Traveling Salesman Problem. – Algorithms, Vol. 14, 2021, No 4, p. 123. Search in Google Scholar

14 Ait Saadi, A., et al. UAV Path Planning Using Optimization Approaches: A Survey. – Archives of Computational Methods in Engineering, Vol. 29, 2022, No 6, pp. 4233-4284. Search in Google Scholar

15 Rodionov, A. S., T. A. Matkurbanov. UAV Flight Trajectory Planning for Large-Area Monitoring. – Informatics and Automation, Vol. 24, 2025, No 3, pp. 791-827. Search in Google Scholar

16 Markov, A. V., V. I. Simankov. Methodology for Calculating UAV Flight Trajectories for Terrain Observation. – Reports of BSUIR, Vol. 4, 2019, No 122, pp. 57-63. Search in Google Scholar

17 Cariou, C., et al. Evolutionary Algorithm with Geometrical Heuristics for Solving the Close Enough Traveling Salesman Problem: Application to the Trajectory Planning of an Unmanned Aerial Vehicle. – Algorithms, Vol. 16, 2023, No 1, p. 44. Search in Google Scholar

18 Alemayehu, T. S., J. H. Kim. Efficient Nearest Neighbor Heuristic TSP Algorithms for Reducing Data Acquisition Latency of UAV Relay WSN. – Wireless Personal Communications, Vol. 95, 2017, No 3, pp. 3271-3285. Search in Google Scholar

19 Isaacs, J. T., J. P. Hespanha. Dubins Traveling Salesman Problem with Neighborhoods: A Graph-Based Approach. – Algorithms, Vol. 6, 2013, No 1, pp. 84-99. Search in Google Scholar

20 Janson, L., B. Ichter, M. Pavone. Deterministic Sampling-Based Motion Planning: Optimality, Complexity, and Performance. – The International Journal of Robotics Research, Vol. 37, 2018, No 1, pp. 46-61. Search in Google Scholar

21 Karaman, S., E. Frazzoli. Sampling-Based Algorithms for Optimal Motion Planning. – The International Journal of Robotics Research, Vol. 30, 2011, No 7, pp. 846-894. Search in Google Scholar

22 Alatartsev, S., M. Augustine, F. Ortmeier. Constricting Insertion Heuristic for Traveling Salesman Problem with Neighborhoods. – In: Proc. of International Conference on Automated Planning and Scheduling, Vol. 23, 2013, pp. 2-10. Search in Google Scholar

23 Goutham, M., et al. A Convex Hull Cheapest Insertion Heuristic for the Non-Euclidean TSP. – arXiv Preprint arXiv:2302.06582, 2023. Search in Google Scholar

24 Alemayehu, T. S., J. H. Kim. Efficient Nearest Neighbor Heuristic TSP Algorithms for Reducing Data Acquisition Latency of UAV Relay WSN. – Wireless Personal Communications, Vol. 95, 2017, No 3, pp. 3271-3285. Search in Google Scholar

25 Johnson, D. S., L. A. McGeoch. The Traveling Salesman Problem: A Case Study in Local Optimization. – In: Local Search in Combinatorial Optimization, 1997. Search in Google Scholar

26 Hougardy, S., M. Wilde. On the Nearest Neighbor Rule for the Metric Traveling Salesman Problem. – In: Discrete Applied Mathematics, 2015. Search in Google Scholar

27 Rodionov, A. S., T. A. Matkurbanov, U. B. Khairullaev. Constructing UAV Flight Trajectories for Agricultural Land Monitoring. – Problems of Informatics, Vol. 1, 2025, No 66. Search in Google Scholar

28 Hougardy, S., F. Zaiser, X. Zhong. The Approximation Ratio of the 2-OPT Heuristic for the Metric Traveling Salesman Problem. – In: Operations Research Letters, 2020. Search in Google Scholar

29 Keung, G. Y., et al. The Target Tracking in Mobile Sensor Networks. – In: Proc. of 2011 IEEE Global Telecommunications Conference (GLOBECOM’11), IEEE, 2011, pp. 1-5. Search in Google Scholar

30 Chavan, P., et al. Dual-Step Hybrid Mechanism for Energy Efficiency Maximization in Wireless Network. – Cybernetics and Information Technologies, Vol. 23, 2023, No 3, pp. 70-88. Search in Google Scholar

31 Kocken, K., B. Özkök, H. Köçken. A Fuzzy Programming-Based Approach to a Multi-Objective Multi-Echelon Green Closed-Loop Supply Chain Problem. – Cybernetics and Information Technologies, Vol. 23, 2023, No 3, pp. 40-55. Search in Google Scholar

32 Zhang, L., et al. Multi-UAV Data Collection and Path Planning Method for Large-Scale Terminal Access. – Sensors, Vol. 23, 2023, No 20, 8601. Search in Google Scholar

33 Nguyen, M. T., et al. UAV-Assisted Data Collection in Wireless Sensor Networks: A Comprehensive Survey. – Electronics, Vol. 10, 2021, No 21, 2603. Search in Google Scholar

34 Karegar, P. A., D. Z. Al-Hamid, P. H. J. Chong. Deep Reinforcement Learning for UAV-Based SDWSN Data Collection – Future Internet, Vol. 16, 2024, No 11, p. 398. Search in Google Scholar

35 Luo, J., Y. Tian, Z. Wang. Research on Unmanned Aerial Vehicle Path Planning. – Drones, Vol. 8, 2024, No 2, p. 51. Search in Google Scholar

36 Xiang, Z., et al. Unmanned-Aerial-Vehicle Trajectory Planning for Reliable Edge Data Collection in Complex Environments. – Biomimetics, Vol. 10, 2025, No 2, p. 109. Search in Google Scholar

37 Khan, M. A., F. Farooq. A Comprehensive Survey on UAV-Based Data Gathering Techniques in Wireless Sensor Networks. – ICCK Transactions on Intelligent Systems, Vol. 2, 2025, No 1, pp. 66-75. Search in Google Scholar

38 Karegar, P. A., D. Z. Al-Hamid, P. H. J. Chong. UAV-Enabled Software Defined Data Collection from an Adaptive WSN. – Wireless Networks, Vol. 31, 2025, No 1, pp. 69-90. Search in Google Scholar

39 Zhan, C., Y. Zeng, R. Zhang. Energy-Efficient Data Collection in UAV-Enabled Wireless Sensor Network. – IEEE Wireless Communications Letters, Vol. 7, 2017, No 3, pp. 328-331. Search in Google Scholar

40 Xiao, B., et al. Algorithms for Disk Covering Problems with the Most Points. – In: Proc. of IASTED Int’l Conf. Parallel and Distributed Computing and Systems, 2003, pp. 541-546. Search in Google Scholar

41 Tokekar, P., et al. Sensor Planning for a Symbiotic UAV and UGV System for Precision Agriculture. – IEEE Transactions on Robotics, Vol. 32, 2016, No 6, pp. 1498-1511. Search in Google Scholar

42 Carrabs, F., et al. An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for the Close-Enough Traveling Salesman Problem. – INFORMS Journal on Computing, Vol. 32, 2020, No 4, pp. 1030-1048. Search in Google Scholar