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

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

马尔可夫链最优停止的值函数

本文讨论了时间无限的马尔可夫链的最优停止问题。对于无限状态情况,给出了其最优停止变量以及值函数存在的一个充分条件;对于有限状态情况,这个充分条件以及问题的计算等价于解一个线性规划问题。     

有限马氏链最优停止的线性规划解

离散时间的有限状态马尔可夫链最优停止的值函数存在的一个充分条件是所对应的线性规划有解,且其最优解等于值函数,本文证明这个条件还是必要的。     

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

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

某型导弹弹翼静力分析的一种数学模型

应用有限元方法,建立了变厚度薄板三角形单元刚度矩阵,给出了变厚度薄板三角形单元形心上的应力和位移计算的数学模型。通过对某型反坦克导弹弹翼进行静力分析和实验比较,表明采用这种模型进行分析合乎结构设计精度要求。     

基于 Petri 网的决策组织结构设计

决策组织设计的首要问题是如何获得可行的组织结构。决策组织作为典型的分布式智能系统,利用Ｐｅｔｒｉ网生成其可行的组织结构是极广泛采用的方法,并已取得很多成果。该文是对这一领域的过去、现在和未来的综述。     

离散滑模变结构控制稳定性分析

对流行的离散变结构控制的两种方案——K.Furuta方案和Wang氏方案进行了研究,发现Wang氏方案中的稳定性定理不能成立,其证明不充分。并通过仿真,给出了反例。文章指出控制结构在A区和B区交替变换过程中,系统状态运动的一个循环过程所对应的转移矩阵A_i~*的谱半径小于1,系统才是渐近稳定的。     

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     

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     

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

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