Multi-UAV Data Collection and Path Planning Method for Large-Scale Terminal Access

Abstract

In the context of the relentless evolution of network and communication technologies, the need for enhanced communication content and quality continues to escalate. Addressing the demands of data collection from the abundance of terminals within Internet of Things (IoT) scenarios, this paper presents an advanced approach to multi-Unmanned Aerial Vehicle (UAV) data collection and path planning tailored for extensive terminal accessibility. This paper focuses on optimizing the complex interplay between task completion time and task volume equilibrium. To this end, a novel strategy is devised that integrates sensor area partitioning and flight trajectory planning for multiple UAVs, forming an optimization framework geared towards minimizing task completion duration. The core idea of this work involves designing an innovative k-means algorithm capable of balancing data quantities within each cluster, thereby achieving balanced sensor node partitioning based on data volume. Then, the UAV flight trajectory paths are discretely modeled, and a grouped, improved genetic algorithm is used to solve the Multiple Traveling Salesman Problem (MTSP). The algorithm introduces a 2-opt optimization operator to improve the computational efficiency of the genetic algorithm. Empirical validation through comprehensive simulations clearly underscores the efficacy of the proposed approach. In particular, the method demonstrates a remarkable capacity to rectify the historical issue of diverse task volumes among multiple UAVs, all the while significantly reducing task completion times. Moreover, its convergence rate substantially outperforms that of the conventional genetic algorithm, attesting to its computational efficiency. This paper contributes an innovative and efficient paradigm to improve the problem of data collection from IoT terminals through the use of multiple UAVs. As a result, it not only augments the efficiency and balance of task distribution but also showcases the potential of tailored algorithm solutions for realizing optimal outcomes in complex engineering scenarios.