共查询到20条相似文献,搜索用时 46 毫秒
1.
2.
为了提高无人机集群协同搜索移动目标的效率,提出一种基于飞蛾信息素寻偶机制的无人机集群协同搜索方法。根据飞蛾基于信息素选择飞行方向的寻偶行为,建立信息素图风向模型和飞蛾信息素寻偶模型。考虑无人机机间避撞约束,提出从飞蛾信息素寻偶机制到无人机集群分布式协同搜索的映射,并给出具体实现流程。仿真实验结果表明了所提方法在解决单个移动目标的协同搜索问题时的有效性和稳定性;外场飞行试验表明了所提方法在实际应用中的可行性。 相似文献
3.
针对舰载预警直升机对海搜索存在的问题,以提高舰载预警直升机对海搜索的隐蔽性与安全性为目标,结合舰载无人机被动探测区的特点,提出了舰载预警直升机机载雷达断续主动搜索与舰载无人机“Z”字形航线被动搜索相结合的协同对海搜索方式与策略,并给出了舰载预警直升机断续搜索周期计算模型及舰载无人机“Z”字形航线要素计算模型,通过仿真计算,验证了该协同方式的有效性,为舰载无人机与舰载预警直升机协同对海搜索提供了方法和依据。 相似文献
4.
无人机集群区域搜索在军事领域以及民用领域的搜救、巡逻、监测、环境勘测等方面有着广泛的应用,但如何保证不同场景下无人机集群搜索方法的效率问题依然是个难题。为了更好地解决搜索目标先验信息已知的无障碍区域内多无人机集群搜索航迹规划问题,提高无人机集群搜索效率,本文根据目标区域热度以及传感器探测概率等先验信息,提出了一种基于无人机航迹消除策略的概率计算方法,并在此基础上结合策略迭代算法动态规划无人机航迹,找到单个无人机航迹覆盖率最优策略;进而通过适当组合顺序实现无人机集群区域目标搜索整体覆盖率最优;最后,通过仿真计算验证了算法的有效性。 相似文献
5.
6.
7.
针对不确定环境下无人机区域搜索问题,建立了实时探测更新的搜索方法,提出了机载光电载荷参数优化配置策略。建立了基于二维离散网格的无人机区域搜索模型,采用概率地图描述目标信息的实时获取与更新;引入不确定度指标、目标网格的重访和网格探测次数控制,建立搜索目标函数;建立了基于粒子群算法的搜索路径滚动优化方法;通过对任务区域平均探测时间步数和误判概率的估计分析,建立了机载光电载荷参数优化配置策略。使用蒙特卡洛方法验证了区域搜索方法的有效性和光电载荷参数配置对搜索效率、误判概率的影响。 相似文献
8.
9.
多无人机协同任务分配问题是一个多目标优化问题,将多目标优化问题转化为单目标优化问题的传统方法易造成决策的主观性和片面性.为帮助决策者做出科学决策,提出了一种基于分解的多目标布谷鸟搜索算法用于求解多无人机协同任务分配问题.通过对多无人机协同任务分配问题分析,建立了多无人机协同任务分配模型.将布谷鸟搜索算法的两个关键组件转化为多目标优化算法的繁殖算子,并结合一种自适应算子选择策略,构成了多目标布谷鸟搜索算法.设计了一种新的编码方案,将带约束的多目标优化问题转为无约束的多目标优化问题.仿真实验表明,多目标布谷鸟搜索算法能有效求解多无人机协同任务分配问题. 相似文献
10.
舰载无人机光电载荷对海搜索方式与搜索宽度 总被引:2,自引:1,他引:1
搜索方式与搜索宽度是舰载无人机对海搜索效率与搜索力配置研究的基础。基于舰载无人机及其光电载荷的性能特点,提出了舰载无人机对海搜索的七种基本搜索方式,并从不同的角度对舰载无人机对海搜索方式进行了分类,给出了搜索方式的选择方法;建立了舰载无人机光电载荷搜索宽度计算模型,为舰载无人机系统采用不同的搜索方式进行搜索时计算其搜索效率和搜索力的配置提供了决策依据。 相似文献
11.
12.
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 相似文献
13.
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 相似文献
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.
利用集群搜索对策的理论与方法 ,建立了集群对固定目标的一类搜索对策模型 ,给出了集群的ε -最优搜寻策略 ,并考虑了其在搜索过程中的应用 相似文献