Effects of cueing in cooperative search

We consider the effects of cueing in a cooperative search mission that involves several autonomous agents. Two scenarios are discussed: one in which the search is conducted by a number of identical search‐and‐engage vehicles and one where these vehicles are assisted by a search‐only (reconnaissance) asset. The cooperation between the autonomous agents is facilitated via cueing, i.e., the information transmitted to the agents by a searcher that has just detected a target. The effect of cueing on the target detection probability is derived from first principles using a Markov chain analysis. In particular, it is demonstrated that the benefit of cueing on the system's effectiveness is bounded. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

基于赋时Petri网的自动测试系统建模

提出了利用赋时Petri网(Tim ed Petri Net)对自动测试系统建模和性能分析的方法。采用启发式算法,对系统的可达树进行搜索,实现测试序列的优化,不仅降低了计算的复杂度,而且获得了满意的并行度,提高了自动测试系统的测试效率。     

用赋形天线提高炮瞄雷达性能

"炮瞄雷达搜索天线系统"在原某型炮瞄雷达的基础上,通过展宽其垂直方向的波束宽度,使其成为赋型天线,并加装高放,来提高炮瞄雷达的性能。介绍了它的组成和战技性能,重点阐述了该系统对部队作战效能的影响,并对其可能产生的战术运用效果进行了简要的预测。     

目标搜索的预测分析及搜索计划的优化逼近

给出了目标搜索的预测分析公式,提出了最优搜索计划的一种优化逼近方法及有关实例     

一种无约束最优化方法——恰当共轭方向法

本文提出了一种求解无约束最优化问题的方法,称之为“恰当共轭方向法”。与通常的共轭方向法(如共轭梯度法)相比,这种方法可以节省大量的一维搜索工作量,并且还能提高收敛速率。     

Cyclic best first search: Using contours to guide branch‐and‐bound algorithms

The cyclic best‐first search (CBFS) strategy is a recent search strategy that has been successfully applied to branch‐and‐bound algorithms in a number of different settings. CBFS is a modification of best‐first search (BFS) that places search tree subproblems into contours which are collections of subproblems grouped in some way, and repeatedly cycles through all non‐empty contours, selecting one subproblem to explore from each. In this article, the theoretical properties of CBFS are analyzed for the first time. CBFS is proved to be a generalization of all other search strategies by using a contour definition that explores the same sequence of subproblems as any other search strategy. Further, a bound is proved between the number of subproblems explored by BFS and the number of children generated by CBFS, given a fixed branching strategy and set of pruning rules. Finally, a discussion of heuristic contour‐labeling functions is provided, and proof‐of‐concept computational results for mixed‐integer programming problems from the MIPLIB 2010 database are shown. © 2017 Wiley Periodicals, Inc. Naval Research Logistics, 64: 64–82, 2017     

To catch an intruder: Part A—uncluttered scenario

We analyze an interdiction scenario where an interceptor attempts to catch an intruder as the intruder moves through the area of interest. A motivating example is the detection and interdiction of drug smuggling vessels in the Eastern Pacific and Caribbean. We study two models in this article. The first considers a nonstrategic target that moves through the area without taking evasive action to avoid the interdictor. We determine the optimal location the interceptor should position itself to best respond when a target arrives. The second model analyzes the strategic interaction between the interceptor and intruder using a Blotto approach. The intruder chooses a route to travel on and the interceptor chooses a route to patrol. We model the interaction as a two‐player game with a bilinear payoff function. We compute the optimal strategy for both players and examine several extensions. © 2017 Wiley Periodicals, Inc. Naval Research Logistics, 64: 29–40, 2017     

舰艇防空反导自适应干扰HDP算法分析与仿真

为干扰来袭的多波次、多方向反舰导弹,提高舰艇防空反导能力,分析了自适应干扰HDP算法模型,并通过实例进行仿真。通过对结果进行分析,验证了启发式动态规划(HDP)算法在自适应电子干扰策略最优组合的生成过程中的时效性、预测精度以及适用性,为该算法的后续研究提供支持。     

多机吊放声纳对潜警戒扇面动态计算方法

针对多架反潜直升机使用吊放声纳搜索时的对潜警戒扇面动态计算问题,根据搜索方法建立多机悬停点坐标解算模型;采用等效的方法,将当前悬停点吊放声纳的探测区域与所有已完成探测的悬停点不存在潜艇的区域等效为对潜警戒范围进行计算;建立了各悬停点探测区域相对舰艇编队舷角的动态计算模型;给出了动态计算多机对潜警戒扇面起始、终止舷角的计算方法。最后仿真计算了对潜警戒扇面随搜索时间、间距系数的动态变化关系。结果显示:对潜警戒扇面将在一定范围内周期性动态变化;且受间距系数的影响较大。     

程序进化器

研究用模拟进化方法进行程序设计的途径。构造了以形式文法为遗传表示的程序进化器,提出了这个进化器使用的有关算法。本文用程序进化器解决了人工蚁问题。