重型鱼雷的机动搜索及机动搜索弹道架构

针对潜射重型鱼雷在技术性能上的大幅提高和智能化作战的需要,在提出并分析鱼雷机动搜索概念和机动搜索时机的基础上,研究了远程重型鱼雷实现机动搜索在弥补发射平台目标定位误差、鱼雷发射后目标的有意机动和适应点对域攻击战法转变等作战环节中的必要性,构建了重型鱼雷机动搜索弹道的技术框架.     

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

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

集群搜索对策理论在搜索-规避对抗中的应用

使用对策论的观点和方法 ,结合搜索论的知识 ,建立了一类搜索 -规避对抗对策模型 .对模型的结论做了系统分析 ,考虑了对策双方的最优策略及使用 .     

机载红外搜索跟踪系统

红外搜索和跟踪（ＩＲＳＴ） 系统是迅速探测红外威胁源的存在, 识别威胁源的种类,测定威胁源的方位并报警的一种光电系统。介绍了对机载ＩＲＳＴ的性能要求, 美国和欧洲等国对机载ＩＲＳＴ的研制及装备概况, 分析了今后机载ＩＲＳＴ系统的发展方向。     

Benders' cuts guided large neighborhood search for the traveling umpire problem

This article introduces the use of Benders' cuts to guide a large neighborhood search to solve the traveling umpire problem, a sports scheduling problem inspired by the real‐life needs of the officials of a sports league. At each time slot, a greedy matching heuristic is used to construct a schedule. When an infeasibility is recognized first a single step backtracking is tried to resolve the infeasibility. If unsuccessful, Benders' cuts are generated to guide a large neighborhood search to ensure feasibility and to improve the solution. Realizing the inherent symmetry present in the problem, a large family of cuts are generated and their effectiveness is tested. The resulting approach is able to find better solutions to many instances of this problem. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

A genetic algorithm with neighborhood search for the resource‐constrained project scheduling problem

The resource‐constrained project scheduling problem (RCPSP) consists of a set of non‐preemptive activities that follow precedence relationship and consume resources. Under the limited amount of the resources, the objective of RCPSP is to find a schedule of the activities to minimize the project makespan. This article presents a new genetic algorithm (GA) by incorporating a local search strategy in GA operators. The local search strategy improves the efficiency of searching the solution space while keeping the randomness of the GA approach. Extensive numerical experiments show that the proposed GA with neighborhood search works well regarding solution quality and computational time compared with existing algorithms in the RCPSP literature, especially for the instances with a large number of activities. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Technical note: Find a hidden “treasure”

This paper deals with a two searchers game and it investigates the problem of how the possibility of finding a hidden object simultaneously by players influences their behavior. Namely, we consider the following two‐sided allocation non‐zero‐sum game on an integer interval [1,n]. Two teams (Player 1 and 2) want to find an immobile object (say, a treasure) hidden at one of n points. Each point i ∈ [1,n] is characterized by a detection parameter λ_i (μ_i) for Player 1 (Player 2) such that p_i(1 ? exp(?λ_ix_i)) (p_i(1 ? exp(?μ_iy_i))) is the probability that Player 1 (Player 2) discovers the hidden object with amount of search effort x_i (y_i) applied at point i where p_i ∈ (0,1) is the probability that the object is hidden at point i. Player 1 (Player 2) undertakes the search by allocating the total amount of effort X(Y). The payoff for Player 1 (Player 2) is 1 if he detects the object but his opponent does not. If both players detect the object they can share it proportionally and even can pay some share to an umpire who takes care that the players do not cheat each other, namely Player 1 gets q₁ and Player 2 gets q₂ where q₁ + q₂ ≤ 1. The Nash equilibrium of this game is found and numerical examples are given. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Constrained minimax optimization of continuous search efforts for the detection of a stationary target

Analytical resolution of search theory problems, as formalized by B.O. Koopman, may be applied with some model extension to various resource management issues. However, a fundamental prerequisite is the knowledge of the prior target density. Though this assumption has the definite advantage of simplicity, its drawback is clearly that target reactivity is not taken into account. As a preliminary step towards reactive target study stands the problem of resource planning under a min–max game context. This paper is related to Nakai's work about the game planning of resources for the detection of a stationary target. However, this initial problem is extended by adding new and more general constraints, allowing a more realistic modeling of the target and searcher behaviors. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

任务分配问题的对称群方法

探讨了无人飞行器(UAV)编队的任务分配问题。任务分配是UAV协同控制的基础,其解是任务区域内各任务的一个排列。求解UAV任务分配问题的有效方法是能在合理的计算时间内找到近似最优解的启发式算法。用对称群描述UAV任务分配的搜索空间,基于右乘运算构造搜索邻域。仿真结果验证了群论禁忌搜索算法的有效性。     

一种基于部分搜索的GNSS模糊度解算方法

为解决LAMBDA算法搜索策略效率不高的问题,提出了一种基于部分搜索的模糊度解算新方法。该方法的解算成功率接近LAMBDA算法,且只需对最后3维模糊度元素采取搜索策略。同时,通过合理设定搜索椭球的大小和搜索策略;大大提高了搜索效率。通过实验对该新算法与Bootraping算法、LAMBDA算法进行了比较分析,进一步验证了该新算法的有效性。