检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:曾斌[1] 王睿[2] 李厚朴[3] 张鸿强 ZENG Bin;WANG Rui;LI Houpu;ZHANG Hongqiang(Department of Management and Economics,Naval University of Engineering,Wuhan 430033,China;Teaching and Research Support Center,Naval University of Engineering,Wuhan 430033,China;Department of Navigation Engineering,Naval University of Engineering,Wuhan 430033,China)
机构地区:[1]海军工程大学管理工程与装备经济系,湖北武汉430033 [2]海军工程大学教研保障中心,湖北武汉430033 [3]海军工程大学导航工程系,湖北武汉430033
出 处:《系统工程与电子技术》2022年第8期2570-2580,共11页Systems Engineering and Electronics
基 金:国家自然科学基金(41771487);湖北省杰出青年科学基金(2019CFA086)资助课题。
摘 要:针对海上保障基地安全的反潜资源调度是当前海上作战指挥的主要问题,通过分析海上利益冲突中敌我双方的攻防策略及约束条件,建立了反潜资源调度的不完全信息零和博弈模型和对应的收益矩阵。考虑敌方为理性对手和非理性对手2种情况,分别提出了求解小规模问题精确解的线性规划算法和求解大规模近似解的改进迭代算法,并进一步给出了对应纳什均衡和最优反应的求解步骤,得到了反潜资源调度博弈的混合策略。通过仿真实验验证了算法的复杂性、可行性和有效性,并分析了混合策略的适用环境。It is the key problem for naval command and control to schedule the anti-submarine teams between naval support bases. A zero sum game model with imperfect information and corresponding payoff matrix for the anti-submarine scheduling is designed through the analysis of attack and defense strategies with constraints of both sides in maritime conflict of interest. The linear programming algorithms for exact solution of small-scale problems and the improved iteration algorithms for approximate solution of large-scale problems are respectively proposed to consider the hostile forces are rational opponents and irrational opponents. The mixed strategy of anti-submarine scheduling can be obtained through the proposed computation procedure of Nash equilibrium and best response. The simulation results verified the complexity, feasibility and effectiveness of the algorithms and the application environment of the mixed strategy is analyzed.
分 类 号:TN948.16[电子电信—信号与信息处理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.216.237.210