共查询到20条相似文献,搜索用时 62 毫秒
1.
2.
为了提高舰载直升机对于定向定速规避的敌潜艇(速度和航向不为我方所知)反潜搜索效率,解决舰载直升机在反潜作战训练中经常遇到的搜索方式问题,根据最优搜索理论中螺旋线搜索原理,应用概率论和随机过程理论,解决了舰载直升机在应召搜索中的点水位置和搜索路径问题,并给出了计算程序和示例,为直升机的反潜搜索战术应用提供了依据. 相似文献
3.
4.
本文以水面舰艇编队在海上发现潜艇后又失去接触的态势为研究背景,对舰载直升机使用“分割扇面法”搜索潜艇时各吊点的位置进行了分析,为舰机协同防潜战术研究提供参考。 相似文献
5.
6.
7.
8.
9.
10.
11.
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!23 = 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 相似文献
12.
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 相似文献
13.
针对多平台协同搜索的最优搜索问题,以多无人机区域搜索任务为背景,将搜索论和随机规划引入到编队协同搜索中,建立了环境模型、无人机模型、传感器模型;为了解决目标丢失后的“应召”搜索问题,建立了目标的随机漫游模型;通过对搜索力最优分配问题的分析,认为其实质为一类线性规划问题,提出了一种基于递归原理的解算方法;最后,通过仿真计算,证明了该随机漫游模型的合理性,并验证了所提算法的有效性。 相似文献
14.
Ryusuke Hohzaki 《海军后勤学研究》2009,56(3):264-278
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 相似文献
15.
针对概略射击条件下反舰导弹机动搜索目标策略优化选择的需求,采用搜索论的基本理论对反舰导弹机动搜捕策略问题进行了研究,建立了反舰导弹随机搜索策略、平行搜索策略和螺旋搜索策略搜捕概率计算模型,并进行了仿真计算。仿真结果表明:在已知目标概略位置的条件下,反舰导弹假若采取螺旋式搜索策略,能以较高的概率快速捕捉目标。 相似文献
16.
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 相似文献
17.
准最优增量搜索效率分析 总被引:1,自引:0,他引:1
在对极限搜索圆进行特殊分割的条件下,导出准最优增量搜索和准最优总量搜索发现目标概率的计算公式,并通过对搜索力变化时两种发现概率的比较,得出了准最优增量搜索优于准最优总量搜索的重要结论. 相似文献
18.
19.
舰载无人机光电载荷对海搜索方式与搜索宽度 总被引:2,自引:1,他引:1
搜索方式与搜索宽度是舰载无人机对海搜索效率与搜索力配置研究的基础。基于舰载无人机及其光电载荷的性能特点,提出了舰载无人机对海搜索的七种基本搜索方式,并从不同的角度对舰载无人机对海搜索方式进行了分类,给出了搜索方式的选择方法;建立了舰载无人机光电载荷搜索宽度计算模型,为舰载无人机系统采用不同的搜索方式进行搜索时计算其搜索效率和搜索力的配置提供了决策依据。 相似文献
20.
对运动目标搜索是军事系统工程的一个重要内容,其在很多领域具有广泛应用,如对潜艇搜索、对失事舰船飞机搜救、制导武器搜索捕捉目标等.用运动学和数学的有关知识分析了目标定速直航机动时的分布函数以及搜索者与其可相遇的条件,提出了对运动目标按螺旋线搜索的另一种证明方法,建立了直线搜索时目标可能位置点的数学模型,并以此为依据分析了对运动目标螺旋搜索模式的一个误区. 相似文献