检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:张美丽[1] 杨悦[1] 王继超 谭锐 刘江涛 连岳岱 王保恒
机构地区:[1]海军大连舰艇学院数学教研室,辽宁 大连 [2]海军大连舰艇学院学员三大队,辽宁 大连
出 处:《应用数学进展》2022年第9期6843-6849,共7页Advances in Applied Mathematics
摘 要:港口的封控作战筹划问题是保护我方海上运输线和生命线,增加发现敌对船只的可能,从而减少敌对势力对我方利益威胁,对港内安全与稳定有着重要影响,甚至关乎临战状态下港口保卫的重要问题。本文针对现阶段港口封控兵力规划存在效率低、耗时长、对突发情况应对能力低等问题,通过海警船和护卫舰在拦截行动中的优化运用,利用元胞自动机和马尔可夫过程的冲突对抗模型,从复杂系统和随机过程的特征去分析、建模,并求解拦截率最高规划,以最优化解决封控兵力规划问题。该方法具有兵力规划快速高效、精准可靠、行动要素覆盖全面等特点,在反潜和防空领域有重大意义。The problem of port containment operation planning is to protect our sea transportation line and lifeline, increase the possibility of finding hostile ships, so as to reduce the threat of hostile forces to our interests, has an important impact on the security and stability of the port, and even relates to the important issue of port protection in the state of war. Aiming at the problems of low efficiency, long time consuming and low ability to respond to emergencies in port force planning, we use the optimized use of coast guard ships and frigates to establish a conflict confrontation model. Cellular automat and Markov process are used to analyze, model and solve the maximum interception rate planning problem from the characteristics of complex systems and random processes, so as to solve the containment force planning problem. This method has the characteristics of rapid, efficient, ac-curate and reliable force planning and comprehensive coverage of operational elements, which is of great significance in the field of anti-submarine and air defense.
分 类 号:O211.62[理学—概率论与数理统计]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229