计算机工程与应用 ›› 2025, Vol. 61 ›› Issue (16): 292-304.DOI: 10.3778/j.issn.1002-8331.2503-0342

• 网络、通信与安全 • 上一篇    下一篇

面向无人机辅助物联网数据采集的双层优化算法

韩守飞,刘晓静   

  1. 1.安徽理工大学 人工智能学院,合肥 232001
    2.齐鲁工业大学(山东省科学院) 算力互联网与信息安全教育部重点实验室,济南 250300
    3.广东宏大控股集团股份有限公司 非煤露天矿山安全智能开采实验室,广州 510623
  • 出版日期:2025-08-15 发布日期:2025-08-15

Bilevel Optimization Algorithm for Unmanned Aerial Vehicle-Assisted Data Collection in Internet of Things

HAN Shoufei, LIU Xiaojing   

  1. 1.School of Artificial Intelligence, Anhui University of Science&Technology, Hefei 232001, China
    2.Key Laboratory of Computing Power Network and Information Security, Ministry of Education, Qilu University of Technology (Shandong Academy of Sciences), Jinan 250300, China
    3.Non-Coal Open-Pit Mine Safety and Intelligent Mining Laboratory, Guangdong Hongda Holding Group Co., Ltd., Guangzhou 510623, China
  • Online:2025-08-15 Published:2025-08-15

摘要: 针对基站遭受损坏阻碍物联网设备数据有效传输的问题,提出了一种无人机(unmanned aerial vehicle,UAV)充当移动基站辅助物联网数据采集的方法。以无人机在执行数据收集任务时的最小能耗为优化目标,结合无人机的部署策略与飞行轨迹规划,构建无人机辅助物联网数据采集的数学模型。设计一种双层优化算法来规划无人机的部署位置与飞行轨迹,旨在确保无人机能够高效完成数据收集任务的同时,实现能耗的最小化。在算法的上层部分,利用改进的蒲公英算法来优化无人机的落脚点数量与具体位置。通过一种新颖的编码策略,使每个蒲公英个体代表无人机的一个潜在落脚点,则整个蒲公英种群被视为一个完整的无人机部署方案。同时提出了两种突变策略,即Replace和Remove突变策略,前者用来更新无人机的落脚点位置,后者用来调整无人机落脚点的数量。基于算法上层得到的无人机部署结果(即落脚点的数量与位置),在算法的下层部分将无人机的飞行轨迹规划问题转化为经典的旅行商问题(traveling salesman problem,TSP)。利用迭代贪婪算法来搜索最优的无人机飞行轨迹。最后以10个实例验证双层优化方法的有效性。

关键词: 无人机(UAV), 物联网, 数据收集, 无人机部署, 飞行轨迹规划

Abstract: Aiming at the problem that the damaged base station hinders the effective transmission of Internet of things (IoT) device data, a method based on unmanned aerial vehicle (UAV) acting as a mobile base station to assist IoT data collection is proposed. Specifically, the mathematical model of UAV-assisted IoT data collection is constructed by taking the minimum energy consumption of the UAV in performing the data collection task as the optimization objective, and combining the deployment strategy and flight trajectory planning of the UAV. A bilevel optimization algorithm (BOA) is designed to finely plan the deployment and flight trajectory of the UAV, aiming to ensure that the UAV can efficiently complete the data collection task while minimizing energy consumption. In the upper-level, an improved dandelion algorithm (IDA) is used to optimize the number of footholds and the locations of the UAV. To this end, a novel coding strategy is designed, in which each individual in dandelion algorithm represents a potential foothold for a UAV, while the entire dandelion population is considered as a complete UAV deployment. In addition, two mutation strategies are proposed, namely Replace and Remove mutation strategies. The former is used to update the locations of the UAV footholds, and the latter is used to adjust the number of UAV footholds. Based on the UAV deployment results (i.e., the number and location of footholds) obtained from the upper-level, the lower-level transforms the UAV trajectory planning problem into the classical traveling salesman problem (TSP). An iterative greedy algorithm (IGA) is used to search for the optimal UAV flight trajectory. Finally, 10 instances are used to verify the effectiveness of the proposed bilevel optimization method.

Key words: unmanned aerial vehicle (UAV), Internet of things, data collection, UAV deployment, flight trajectory planning