[1]赵 坤,随旭东,梁 静,等.双无人飞行平台的多传感器规划调度[J].郑州大学学报(工学版),2023,44(04):67-73.[doi:10.13705/j.issn.1671-6833.2023.04.007]
 ZHAO Kun,SUI Xudong,LIANG Jing,et al.Multi-Sensor Planning and Scheduling of Dual Unmanned Flight Platforms[J].Journal of Zhengzhou University (Engineering Science),2023,44(04):67-73.[doi:10.13705/j.issn.1671-6833.2023.04.007]
点击复制

双无人飞行平台的多传感器规划调度()
分享到:

《郑州大学学报(工学版)》[ISSN:1671-6833/CN:41-1339/T]

卷:
44
期数:
2023年04期
页码:
67-73
栏目:
出版日期:
2023-06-01

文章信息/Info

Title:
Multi-Sensor Planning and Scheduling of Dual Unmanned Flight Platforms
作者:
赵 坤1随旭东2 梁 静2岳彩通2李功平2于坤杰2
1.中国电子科技集团公司 第二十七研究所,河南 郑州 450001, 2.郑州大学 电气与信息工程学院,河南 郑州450001
Author(s):
ZHAO Kun1 SUI Xudong2 LIANG Jing2 YUE Caitong2 LI Gongping2 YU Kunjie2
1.27th Institute of China Electronics Technology Group Corporation, Zhengzhou 450001, Henan, 2.School of Electrical and Information Engineering, Zhengzhou University, 450001, Zhengzhou, Henan
关键词:
双无人飞行平台 传感器调度 协同工作 目标捕获 任务迁移
Keywords:
dual unmanned flight platforms sensor scheduling collaborative work capture target task migration
分类号:
TP212;O231
DOI:
10.13705/j.issn.1671-6833.2023.04.007
文献标志码:
A
摘要:
双无人飞行平台的多传感器调度问题具有复杂耦合关系,如何合理匹配航线、传感器及目标是问题的难 点。 为解决双无人飞行平台的多传感器调度中存在的问题,首先,提出了一种航线任务分配机制,通过航线与目标 的位置关系进行任务分配,可以有效分割任务并解决两平台间任务耦合的问题。 其次,对目标及传感器进行预处 理,提前甄别稀缺传感器资源与独立目标以引导后续调度匹配。 再次,进行传感器与目标的匹配,以任务收益为基 础对传感器进行规划调度,根据传感器资源空闲情况对调度冲突航段进行调整。 最后,对未完成既定分配任务的 目标进行任务迁移,根据目标任务剩余情况匹配相应航段的可用空闲传感器进行任务的迁移,提高任务收益。 为 了验证所提出算法的有效性,通过仿真实验与现有算法在 10 个测试问题上进行了比较,实验结果表明,所提算法 在减少大量运行时间的基础上任务收益与稳定性均优于现有算法。
Abstract:
The multi-sensor scheduling problem of dual unmanned flight platforms has a complex coupling relationship, and how to reasonably match flight segments, sensors and targets is an intricate part of the problem. To solve the multi-sensor scheduling problem of dual unmanned flight platforms, firstly, this paper proposes a flight segment task allocation mechanism, which assigns tasks through the position relationship between the flight segment and the target. This mechanism can effectively split the tasks and solve the task coupling problem of the two platforms. Secondly, pre-processing targets and sensors are carried out to identify scarce sensor resources and independent targets in advance to guide subsequent scheduling matching. Then, sensor-target matching is carried out to plan the scheduling of sensors based on the task revenue. The scheduling of conflicting segments is adjusted according to the availability of sensor resources. Finally, task migration is carried out for targets who still need to complete their assigned tasks. The available free sensors in the corresponding flight segments are matched according to the target task remaining to improve the task revenue. In order to verify the effectiveness of the proposed algorithm in this paper, existing algorithms were compared through simulation experiments on 10 test problems. The experimental results show that this algorithm outperforms existing algorithms in task revenue and stability with a significant reduction in running time.
更新日期/Last Update: 2023-07-01