共查询到19条相似文献,搜索用时 500 毫秒
1.
2.
3.
4.
基于改进TOPSIS法和蚁群算法的反TBM目标群目标分配研究 总被引:1,自引:0,他引:1
基于改进的TOPSIS法和蚁群算法,以弹道导弹目标群为研究对象,研究了反导指控系统对目标群的目标分配问题。首先通过改进的TOPSIS法确定TBM目标群威胁排序并基于拦截排序准则确定拦截排序;其次使作战效能最大化,基于蚁群算法确定目标的最优分配方案;最后通过仿真实例验证了在考虑目标威胁值排序前提下采用此算法,可使目标群分配方案更加科学有效和符合反导作战实际。 相似文献
5.
6.
7.
8.
地空导弹在火力对抗条件下的生存能力 总被引:1,自引:0,他引:1
在火力对抗条件下地空导弹提高生存能力的主要办法是避免被空中目标过早发现,尽早对空中目标进行火力拦截,提高在对抗过程中的拦截次数,增大每次对空中目标进行大力拦截的杀伤概率,直接拦截空袭武器和提高自身抗毁伤的能力。 相似文献
9.
以现代防空作战为背景,运用蒙特卡罗方法建立了防空导弹武器系统拦截空袭目标流的数学模型,编拟相应的计算机程序对其防空作战过程进行了仿真模拟.通过仿真结果对武器系统在不同目标流强度下的性能进行了分析,为指挥员做出科学、准确的决策提供了一定的参考. 相似文献
10.
角度闪烁干扰对地空导弹火力拦截能力的影响,是电子对抗部队迫切需要解决却又缺乏系统研究的难题。为解决这一难点问题,首先在研究杀伤区纵深和掩护扇区受干扰变化的基础上,分析了双机闪烁干扰对地空导弹射击目标脱靶量及射击次数的影响,然后建立了角度闪烁干扰条件下地空导弹对目标的合成杀伤概率计算模型,最后通过算例验证模型的有效性,得出了具有实用价值的结论,可为空袭作战中作战效能评估提供参考。 相似文献
11.
12.
《防务技术》2020,16(3):695-704
This paper is mainly on the problem of radiation interception risk control in sensor network for target tracking. Firstly, the sensor radiation interception risk is defined as the product of the interception probability and the cost caused by the interception. Secondly, the radiation interception probability model and cost model are established, based on which the calculation method of interception risk can be obtained. Thirdly, a sensor scheduling model of radiation risk control is established, taking the minimum interception risk as the objective function. Then the Hungarian algorithm is proposed to obtain sensor scheduling scheme. Finally, simulation experiments are mad to prove the effectiveness of the methods proposed in this paper, which shows that compared with the sensor radiation interception probability control method, the interception risk control method can keep the sensor scheduling scheme in low risk as well as protect sensors of importance in the sensor network. 相似文献
13.
14.
15.
16.
17.
对机动突防反舰导弹的防御 总被引:5,自引:0,他引:5
建立了舰空导弹反导拦截模型和反舰导弹“蛇行机动”突防弹道模型,通过攻防对抗仿真的方法研究了舰空导弹对末端机动突防反舰导弹的防御问题,提出了对舰空导弹未来发展的建议. 相似文献
18.
This article concerns scheduling policies in a surveillance system aimed at detecting a terrorist attack in time. Terrorist suspects arriving at a public area are subject to continuous monitoring, while a surveillance team takes their biometric signatures and compares them with records stored in a terrorist database. Because the surveillance team can screen only one terrorist suspect at a time, the team faces a dynamic scheduling problem among the suspects. We build a model consisting of an M/G/1 queue with two types of customers—red and white—to study this problem. Both types of customers are impatient but the reneging time distributions are different. The server only receives a reward by serving a red customer and can use the time a customer has spent in the queue to deduce its likely type. In a few special cases, a simple service rule—such as first‐come‐first‐serve—is optimal. We explain why the problem is in general difficult and we develop a heuristic policy motivated by the fact that terrorist attacks tend to be rare events. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009 相似文献
19.
火力分配问题是指用一定数量的武器对一定数量的目标进行打击,如何根据武器性能和目标特性等一系列的因素,制定打击计划,使打击效果最好,满足打击需求,是我二炮部队火力运用专业的研究课题之一.火力分配问题是NP难题,经典的求解算法存在指数级的时间复杂度.采用蚁群优化算法,对该问题进行了研究. 相似文献