摘要
针对反辐射无人机作战目标优化分配问题,提出了基于贪心法的解决方案,并完成了对该方案全局最优性的数学证明。计算机仿真表明,该方法能够得到与遍历法效能相同的全局最优解,同时计算所需的时间相较于遗传算法等经典次优算法有明显的优势,使用此方法进行作战目标动态分配能够得到明显优于静态分配的作战效能。
In order to solve the operational targets assignment problem of anti-radiation UAV,a solution based on greedy algorithm is proposed and the mathematical proof of global optimality of this solution is performed.The simulation results show that the proposed solution has the same operational effectiveness expectation as that of the traversing method,and consumes much less time compared with such sub-optimal algorithm as genetic algorithm,furthermore,the dynamic target assignment using the proposed solution can obtain better operational effectiveness than the static assignment strategy.
作者
李峥
蔡译锋
吴军
LI Zheng;CAI Yifeng;WU Jun(Southwest China Research Institute of Electronic Equipment,Chengdu,Sichuan 610036,China)
出处
《无线电工程》
2019年第10期849-854,共6页
Radio Engineering
基金
装发重点实验室基金资助项目(614210502040317)
关键词
辐射无人机
作战效能
目标分配
贪心法
anti-radiation UAV
operational effectiveness
target assignment
greedy algorithm
