加权网格埋伏对策问题研究  

Research on Problem of Weighted Lattice Ambush Game

作　　者：张建军[1] 王蔚蔚 纪祥鲲[1] 

机构地区：[1]海军工程大学理学院 [2]中国人民解放军92858部队指挥自动化站

出　　处：《兵工自动化》2017年第10期49-52,共4页Ordnance Industry Automation

基　　金：海军工程大学自然科学基金项目(HJGSK2014G124);海军工程大学理学院基础研究基金项目(HGDYDJJ17001)

摘　　要：为解决目前埋伏对策模型存在对实际需求适应性不强以及求解效率低等问题,提出一类新的网格埋伏对策模型。考虑埋伏资源的限制,构造局中人的可行策略集合。根据各列的防守程度和价值的不同,赋予各列不同的权值,构造相应的支付函数建立加权网格搜索对策模型。将对策论问题转化为约束最优化问题,求解约束问题获得条件极值,转化为模型的对策值,并给出双方的最优策略。军事应用实例结果表明:该模型能较全面地对埋伏问题进行定量描述,具有一定的理论和应用价值。To solve the problem that the current ambush game model has weak adaptability and low efficiency to actual demands, a new kind of ambush game model on a lattice is proposed. Considering the constraints of the ambush resources, the feasible strategy sets of the players are constructed. According to the differences of the defense degrees and the values of the columns, each column is given different weight and the corresponding payment function is constructed, and so the model of weighted ambush game on a lattice is established. The game theory problem is transformed into a constrained optimization problem. Solving the constrained optimization problem, the optimal value is obtained and converted into the value of the model, and so the optimal mixed strategy is also given. A military example validates that the model can comprehensively give a quantitative description of ambush game and so has a certain value of theory and application.

关 键 词：埋伏对策 网格 防守程度 价值 加权 约束最优化问题 

分 类 号：TP391.92[自动化与计算机技术—计算机应用技术]