基于搜索论的反舰导弹机动搜捕策略建模方法

针对概略射击条件下反舰导弹机动搜索目标策略优化选择的需求,采用搜索论的基本理论对反舰导弹机动搜捕策略问题进行了研究,建立了反舰导弹随机搜索策略、平行搜索策略和螺旋搜索策略搜捕概率计算模型,并进行了仿真计算。仿真结果表明:在已知目标概略位置的条件下,反舰导弹假若采取螺旋式搜索策略,能以较高的概率快速捕捉目标。     

可变搜索区末制导雷达捕捉模型

反舰导弹远程化是一种发展趋势。但是随着射程的增加,反舰导弹自控终点的误差散布也增加,同时降低了目标捕捉概率,扩大末制导雷达搜索区域是解决该问题的一个途径,但这将降低末制导雷达的目标选择能力。选用可变搜索区末制导雷达是解决该矛盾的一种方法。在分析该模式末制导雷达搜索规律的基础上,建立了可变搜索区末制导雷达目标捕捉模型,为该模式末制导雷达目标捕捉概率的计算提供了一种较准确的方法。仿真结果显示该模型基本可信。     

反舰导弹对岛礁区目标的搜捕概率研究

针对打击岛礁区目标时反舰导弹搜捕概率计算问题,通过分析末制导雷达实际搜索过程和捕获条件,构建了目标选择规则,建立了岛礁影响下的反舰导弹搜捕概率计算模型,给出了综合距离、方位、分辨率和目标选择的搜捕判据,并依据概率分布函数,研究了反舰导弹自控终点散布、水面舰艇机动模型及其对搜捕概率的影响。最后仿真分析了目指坐标位于岛礁四周不同位置、搜索扇面变化对搜捕概率的影响。结果显示,水面舰艇靠近岛礁、或位于岛礁后方长条形区域内时,搜捕概率越低;位于岛礁前方即使距离较近时搜捕概率也较高;距岛礁较近时,较小的搜索扇面更优。     

反舰导弹末制导雷达搜捕方式确定模型

当反舰导弹到达航路规划终点时,由于实际位置与理论位置具有一定误差,导弹与各个目标的相对位置关系难以确定,增大了导弹发射前装订末制导雷达搜捕方案的难度。因此,建立了一种针对反舰导弹末制导雷达搜捕方式确定模型。整个模型在大地坐标中推演,并避免了传统计算模型中蒙特卡罗法带来的多样本大数据的计算,因此该算法的实用性与计算效率得到提高。建立模型时需要根据导弹末制导开机点误差散布参数与导弹同目标的相对位置关系构建战场参数模型;其次,根据导弹理论开机点、误差散布圆、目标位置信息与雷达搜捕模式信息,直接判断该理论开机点处开机时,导弹捕捉到预定目标的概率是否符合战术要求,从而达到为某个理论开机点选择合适末制导雷达搜捕方式的目的。仿真结果验证了该模型的有效性。     

目标散布下反舰导弹捕捉概率的计算

分析了反舰导弹在攻击海上目标时,由于测量误差的存在,从而造成目标真实位置散布的情况,并给出了求目标散布区域的计算方法;同时根据导弹末制导雷达搜捕目标的原理,提出了目标散布时导弹对目标的捕捉概率的大小计算方法,探讨了其战术意义,并给出了算例分析.     

反舰导弹对编队内预定目标捕捉概率研究

基于现代反舰导弹末制导雷达的搜索过程，通过分析反舰导弹对编队内预定目标的捕捉条件，研究反舰导弹对编队内预定目标的捕捉概率计算模型，研究了反舰导弹对编队进行突击时捕捉概率的计算方法，并通过实例计算，得出反舰导弹对编队突击时，突击方向和开机时机等参数的确定方法。     

反舰导弹目标捕捉概率影响因素分析

分析了陀螺漂移速率、目标运动、海面风场,以及末制导雷达搜索范围等因素对反舰导弹目标捕捉概率的影响;用蒙特卡洛法对导弹目标捕捉概率进行了求解。得出了有用的结论。     

舰艇隐身对反舰导弹末制导 雷达目标截获能力的影响

以法国海军的拉菲特级隐身舰为典型对象,就水面舰艇目前的隐身水平进行了评估,分析和计算了典型反舰导弹末制导雷达对隐身舰艇的检测概率和理想状态下对隐身舰艇的截获概率。指出在反舰导弹的攻击过程中,如果能够保证末制导雷达对目标的多次捕捉,舰艇隐身的效果将被抵销;隐身舰艇利用电子干扰产生假目标将可以抑制末制导雷达对真实目标的捕捉。因此,反舰导弹及其末制导雷达要对付舰艇隐身,其关键不是采用新体制雷达来提高检测能力,而在于提高现体制末制导雷达的目标识别能力。     

基于加权MHD的反舰导弹预定目标选择方法

平均Hausdorff距离(MHD)方法基于编队的整体形状进行匹配来寻找对应点,因此,不像距离选择区法和扩展搜索图选择法那样受导弹自控段的导航误差和目标机动散布的影响。为了进一步提高反舰导弹的目标选择能力,考虑所匹配点集不同区域对Hausdorff距离函数的贡献程度不一样,提出了加权MHD(WMHD)来研究编队预定目标选择问题。首先通过刚体变换方法将火控雷达和末制导雷达探测到的编队点集进行位置匹配,然后利用WMHD方法获取其最优变换位置,最后据此最优变换位置预测预定选择目标在末制导雷达开机的位置。通过仿真实验表明其具有较强对抗冲淡干扰和形状扭曲失真的能力,且性能明显优于MHD方法。     

主被动雷达协同跟踪制导方法研究

针对导弹主被动雷达协同跟踪制导问题,采取了复合制导的方法,把2种不同制导律复合作为导弹主被动雷达协同跟踪的导引法,并把卡尔曼滤波器估计应用到有目标机动时导弹的末制导。用Matlab进行仿真,对导弹的机动性,弹目遭遇时间进行研究,最后仿真分析表明了复合制导方法的优越性。     

潜艇离散搜索分析

以潜艇离散搜索战术为背景,对离散搜索的定义及优缺点进行了阐述,建立了离散搜索发现概率模型,模型中对单位周期的发现目标期望数和发现概率进行了计算,并对隐蔽与非隐蔽两种离散搜索样式的搜索效果进行了模拟仿真,但计算中没有考虑水声环境的影响和敌方潜艇实施反搜索的情况,最后,结合仿真结果,针对潜艇实际运用确定了高低速航行时间,提出了实施此战术时的几点建议,以期为部队合理使用离散搜索战术提供决策依据。     

Rendezvous of three agents on the line

This paper considers a three‐person rendezvous problem on the line which was introduced earlier by the authors. Three agents are placed at three consecutive integer value points on the real line, say 1, 2, and 3. Each agent is randomly faced towards the right or left. Agents are blind and have a maximum speed of 1. Their common aim is to gather at a common location as quickly as possible. The main result is the proof that a strategy given by V. Baston is the unique minimax strategy. Baston's strategy ensures a three way rendezvous in time at most 3.5 for any of the 3!2³ = 48 possible initial configurations corresponding to positions and directions of each agent. A connection is established between the above rendezvous problem and a search problem of L. Thomas in which two parents search separately to find their lost child and then meet again. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 244–255, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10005     

A cooperative game in search theory

Search theory originates from the military research efforts of WWII. Most researchers of that period modeled their search games in noncooperative games, where players are enemies or compete against each other. In this article, we deal with a cooperative search game, where multiple searchers behave cooperatively. First we describe several search problems and discuss the possibility of a coalition or cooperation among searchers. For the cooperative search game, we define a function named quasi‐characteristic function, which gives us a criterion similar to the so‐called characteristic function in the general coalition game with transferable utility. The search operation includes a kind of randomness with respect to whether the searchers can detect a target and get the value of the target. We also propose a methodology to divide the obtained target value among members of the coalition taking account of the randomness. As a concrete problem of the cooperative search game, we take the so‐called search allocation game, where searchers distribute their searching resources to detect a target in a cooperative way and the target moves in a search space to evade the searchers. Lastly, we discuss the core of the cooperative search allocation game. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

Heuristics for the location of inspection stations on a network

This article considers the preventive flow interception problem (FIP) on a network. Given a directed network with known origin‐destination path flows, each generating a certain amount of risk, the preventive FIP consists of optimally locating m facilities on the network in order to maximize the total risk reduction. A greedy search heuristic as well as several variants of an ascent search heuristic and of a tabu search heuristic are presented for the FIP. Computational results indicate that the best versions of the latter heuristics consistently produce optimal or near optimal solutions on test problems. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 287–303, 2000     

基于随机漫游模型的协同搜索力最优分配方法

针对多平台协同搜索的最优搜索问题,以多无人机区域搜索任务为背景,将搜索论和随机规划引入到编队协同搜索中,建立了环境模型、无人机模型、传感器模型;为了解决目标丢失后的“应召”搜索问题,建立了目标的随机漫游模型;通过对搜索力最优分配问题的分析,认为其实质为一类线性规划问题,提出了一种基于递归原理的解算方法;最后,通过仿真计算,证明了该随机漫游模型的合理性,并验证了所提算法的有效性。     

对运动目标螺旋搜索误区分析

对运动目标搜索是军事系统工程的一个重要内容,其在很多领域具有广泛应用,如对潜艇搜索、对失事舰船飞机搜救、制导武器搜索捕捉目标等.用运动学和数学的有关知识分析了目标定速直航机动时的分布函数以及搜索者与其可相遇的条件,提出了对运动目标按螺旋线搜索的另一种证明方法,建立了直线搜索时目标可能位置点的数学模型,并以此为依据分析了对运动目标螺旋搜索模式的一个误区.     

一类对固定目标的集群搜寻对策问题及求解

利用集群搜索对策的理论与方法 ,建立了集群对固定目标的一类搜索对策模型 ,给出了集群的ε -最优搜寻策略 ,并考虑了其在搜索过程中的应用     

New results on a Ruckle problem in discrete games of ambush

This article deals with a two‐person zero‐sum game in which player I chooses in integer interval [1, N] two integer intervals consisting of p and q points where p + q < N, and player II chooses an integer point in [1, N]. The payoff to player I equals 1 if the point chosen by player II is at least in one of the intervals chosen by player II and 0 otherwise. This paper complements the results obtained by Ruckle, Baston and Bostock, Lee, Garnaev, and Zoroa, Zoroa and Fernández‐Sáez. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 98–106, 2001     

Rendezvous search when marks are left at the starting points

Leaving marks at the starting points in a rendezvous search problem may provide the players with important information. Many of the standard rendezvous search problems are investigated under this new framework which we call markstart rendezvous search. Somewhat surprisingly, the relative difficulties of analysing problems in the two scenarios differ from problem to problem. Symmetric rendezvous on the line seems to be more tractable in the new setting whereas asymmetric rendezvous on the line when the initial distance is chosen by means of a convex distribution appears easier to analyse in the original setting. Results are also obtained for markstart rendezvous on complete graphs and on the line when the players' initial distance is given by an unknown probability distribution. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 722–731, 2001