首页|空地协同侦察任务派单算法研究

空地协同侦察任务派单算法研究

扫码查看
针对空地异构无人系统协同侦察的任务分配问题,提出一种面向侦察任务和通信中继任务的两阶段混合任务派单(Two-stage Mixed Task Assignment,TMTA)算法。基于各无人智能体的侦察距离、通信中继距离及目标位置,构建侦察位置与通信中继位置的备选集。以任务时效性与路径代价为目标函数,结合侦察任务/通信中继任务完成约束、任务位置选择/任务执行时间与任务路径的耦合约束,以及路径连续性等约束,构建侦察与通信中继任务派单模型。针对派单模型的非线性特征,综合集合覆盖算法、匈牙利算法和遗传算法的优势,设计TMTA算法,实现了模型的高效求解。通过实验对TMTA算法进行验证。实验结果表明,TMTA算法在任务时效性与无人系统行驶成本上均优于基准派单算法。
A Reconnaissance Task Allocation Algorithm for Air-Ground Heterogeneous Unmanned System
Aiming at the reconnaissance task allocation of air-ground heterogeneous unmanned system,this paper proposes a two-stage mixed task assignment(TMTA)algorithm for reconnaissance tasks and communication relay tasks.An alternative set of reconnaissance position and communication relay position are constructed based on the reconnaissance distance,communication relay distance and target position.An reconnaissance and communication relay tasks dispatching model is built by taking the task timeliness and path cost as the objective functions,in which the combining reconnaissance/communication relay task completion constraints,coupling constraints between task location selection/task execution time and task paths,and path continuity constraints,etc.,are considered.To solve the nonlinearity of the model,the advantages of set coverage algorithm,Hungarian algorithm,and genetic algorithm are synthesized to design a TMTA algorithm,which realizes the efficient solution of the model.The proposed method is validated through experiment.The experimental results show that the proposed algorithm outperforms the baseline dispatching algorithm in terms of task timeliness and path cost.

air-ground heterogeneousunmanned agentreconnaissance taskcommunication relay tasktask allocation algorithm

孙玉洁、苏波、段乐毅、纪超、杨超男

展开 >

中国北方车辆研究所,北京 100072

中兵智能创新研究院有限公司,北京 100072

群体协同与自主实验室,北京 100072

空地异构 无人智能体 侦察任务 通信中继任务 派单算法

2024

兵工学报
中国兵工学会

兵工学报

CSTPCD北大核心
影响因子:0.735
ISSN:1000-1093
年,卷(期):2024.45(z2)