一种基于Euler Spiral的缺失边界修复算法

在总结分析相关工作的基础上,提出了一种基于Euler Spiral修复认知轮廓中缺失边界的算法。该算法首先通过活动轮廓模型进行认知轮廓的初始定位,将视觉的预测性插值问题转化为中间插值问题,然后结合取向估计和Euler Spiral修复缺失的轮廓边界,取代了活动轮廓模型的迭代优化过程。对典型认知轮廓图形和遥感图像的实验结果验证了算法的有效性。     

海洋移动目标多模型运动预测方法

分析海洋移动目标的运动特征,提出了预测前插值的灰色预测方法,改进了航迹变更预测和潜在区域预测模型。通过集成匀速运动预测、航迹变更预测、基于航迹的预测和潜在区域预测,提出多模型运动预测方法及其模型参数配置依据,根据滑动时间窗口中的观测数据与预测值的统计比较,评价不同预测方法的近期预测效果,决策下阶段适宜选择的预测方法。仿真实验表明多模型运动预测比使用单一运动预测方法降低预测风险,提高了预测精度。     

驱护舰编队对潜防御性搜索态势分析与方法

针对驱护舰武器装备的发展,结合驱护舰编队海上对潜防御作战的新特点,根据特定驱护舰编队的使命任务,提出了特定驱护舰编队对潜进攻性搜索与防御性搜索的新概念,并在战斗战场范围内对特定驱护舰编队对潜防御性搜索态势进行了分析,给出了编队对潜防御性搜索方法.对部队作战与训练具有一定的参考应用价值.     

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     

Path optimization for the resource‐constrained searcher

We formulate and solve a discrete‐time path‐optimization problem where a single searcher, operating in a discretized three‐dimensional airspace, looks for a moving target in a finite set of cells. The searcher is constrained by maximum limits on the consumption of one or more resources such as time, fuel, and risk along any path. We develop a specialized branch‐and‐bound algorithm for this problem that uses several network reduction procedures as well as a new bounding technique based on Lagrangian relaxation and network expansion. The resulting algorithm outperforms a state‐of‐the‐art algorithm for solving time‐constrained problems and also is the first algorithm to solve multi‐constrained problems. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

区域目标搜索中基于改进RRT的UAV实时航迹规划

在线自主航迹规划是无人机(Unmanned Aerial Vehicles,UAV)执行区域目标搜索任务的有效保证.针对UAV区域搜索中航迹规划的实时性要求,提出了一种固定搜索模式和动态搜索模式相结合的UAV自主航迹规划框架.在快速扩展随机树(RRT)方法的基础上,通过改进随机扩展树的节点选择和引入启发式信息,提出了基于改进RRT的UAV实时搜索航迹规划算法,该算法能够有效降低在线航迹规划的时间代价和扩展节点数.仿真实验结果验证了本文方法的有效性.     

直升机吊放声纳搜索方法效能研究

利用直升机吊放声纳对潜艇目标进行搜索,是航空反潜作战的重要环节.引入蒙特卡罗法对吊放声纳搜潜方法进行效能评估,以概率和统计理论方法得出其搜索概率作为评定吊放声纳搜潜方法效能的指标.对三种吊放声纳搜潜方法进行了效能仿真.通过计算机模拟对三种方法对潜艇目标的搜索概率进行比较,结果表明采用蒙特卡罗法对吊放声纳搜潜方法进行效能评估是可行有效的.     

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     

风对反潜巡逻机应召搜索延迟时间的影响研究

为了定量分析风对反潜巡逻机应召搜索延迟时间的影响,根据飞行气象学中风对飞行的影响描述以及实际需求,建立了反潜巡逻机飞往潜艇初始概略位置的航路模型。研究结果证明了模型的正确性,并通过仿真分析了反潜巡逻机的航速和航向、风速和风向的变化对延迟时间的影响。结果表明风对延迟时间的影响是不能忽略的,为反潜巡逻机航路的优化、应召搜索效能的提高提供了决策依据。     

VNS和SA相结合的指挥控制资源部署

针对指挥控制资源部署问题,引入任务复杂度来定义决策实体的工作负载,并建立以最小化决策实体工作负载的均方根为目标的优化模型。针对传统的层次聚类法容易陷入局部最优,提出了一种变邻域搜索(Variable Neighborhood Search,VNS)和模拟退火(Simulated Annealing,SA)相结合的具有全局性的求解方法,使用VNS进行全局寻优,使用SA对VNS中的邻域进行局部寻优。最后通过一个联合作战案例的平台调度方案,验证了所提方法的优越性。