基于博弈论的多雷达多目标分配方法研究  

A Study on Multi-radar Multi-target Assignment Method Based on Game Theory

作　　者：韩鹏 丁桂强 刘国彬 HAN Peng;DING Guiqiang;LIU Guobin(Luoyang Electronic Equipment Test Center,Mengzhou 454750,China)

机构地区：[1]中国洛阳电子装备试验中心,河南孟州454750

出　　处：《现代雷达》2020年第2期16-22,29,共8页Modern Radar

摘　　要：根据雷达网作战需求和作战任务分配准则,以雷达网目标分配效益为目标函数,对雷达网目标分配问题进行了建模,利用潜博弈理论进行了分析,并证明了纳什均衡的可行性、存在性和最优性。基于最佳动态反应设计了迭代目标分配策略选择算法,并分析了算法的复杂度。仿真结果表明:该目标分配策略选择算法具有很好的收敛性,能够在较短时间内寻求近似最优解。当不存在最大目标探测容量限制时,该算法能够获得与穷举法相同的性能。分配决策模型和算法合理便捷,可以较好地解决雷达网多目标分配问题,对实际作战指挥有一定的指导意义。Taking the assignment efficiency as the optimization objective,a mathematical model is constructed for the targets assignment of radar netting based on the principle of war-task assingment and the requirement of radar netting. The problem of targets assignment is analyzed using potential game theory,and feasibility,existence and optimality of the Nash equilibrium(NE) in this game are proved. Iterative targets assignment strategy selection algorithm based on optimal reaction criterion is presented,and complexity of this algorithm is analyzed. Simulation results show that targets assignment strategy selection algorithm has good convergence property,and approximate optimal solution can be gotton within a short time. The algorithm can get the same performance as the exhaustive method when there is no maximum target detection capacity limitation. The allocation and decision model and algorithm are proved to be useful and convenient for solving the problems of multiple target allocation in radar netting,and they are significant to actual operational command.

关 键 词：雷达网 目标分配 博弈论 纳什均衡 

分 类 号：TN953[电子电信—信号与信息处理]