计算机科学
旅行商问题
信息共享
分段
遗传算法
能量(信号处理)
无人机
数学优化
实时计算
分布式计算
算法
机器学习
数学
数学分析
万维网
统计
生物
遗传学
作者
Cuntao Liu,Yan Guo,Ning Li,Bin Zhou,Wendong Zhao
出处
期刊:IEEE Wireless Communications Letters
[Institute of Electrical and Electronics Engineers]
日期:2020-12-02
卷期号:10 (4): 907-911
被引量:3
标识
DOI:10.1109/lwc.2020.3041707
摘要
Due to the overlap of different users' information requirements for reconnaissance targets, when unmanned aerial vehicles (UAVs), serving multiple users, perform field reconnaissance missions, it is likely to cause repetitive visit to the same targets. To deal with this problem, a reasonable cooperative mission assignment algorithm is needed. By introducing information sharing mechanism with air communication among UAVs, this letter models the mission assignment problem as a vehicle routing problem with air information sharing (VRPAIS), which can efficiently avoid the repetitive visit of targets. An improved piecewise genetic algorithm with integer splitting is proposed to solve VRPAIS in polynomial time. Simulation results show that in the case of high overlap (about 80%) of information requirements, the proposed method is much more energy efficient compared with the traditional Multiple Traveling Salesman Problem (MTSP) based method without information sharing, with an average energy savings rate of 34.2%.
科研通智能强力驱动
Strongly Powered by AbleSci AI