水面舰艇规避鱼雷最优策略

规避机动是水面舰艇对鱼雷防御的基础和前提,通过对水面舰艇规避鱼雷过程的分析,建立了水面舰艇规避鱼雷的战术基础模型,并采用变分法进行解算,从所有可能的规避轨线中选取最优的规避轨线.水面舰艇规避鱼雷的战术基础模型,为水面舰艇防御鱼雷作战方案的仿真论证、防御鱼雷最优规避轨线的方案生成提供依据.对研究水面舰艇规避鱼雷战术具有一定的参考价值.     

基于逐步后退法的车辆半侧液压主动悬挂最优控制设计与仿真

建立了充分考虑液压装置动力学特性的车辆半侧非线性主动悬挂模型,并提出了线性二次型最优控制与非线性逐步后退法相结合的内外环控制方案。首先根据目标需求在外环设计二次型指标下的最优控制器;然后在内环利用逐步后退法处理因液压装置引入的非线性项。仿真结果表明,使用该设计方案的主动悬挂可以获得比被动悬挂优越的车辆性能。     

解析法计算机载布撒器对单条跑道的最佳封锁策略

机载布撒器是一种先进的面覆盖式武器系统,其带状毁伤区域能有效地破坏和封锁敌方机场跑道.根据采用下抛方案的机载布撒器攻击机场跑道的工作原理,以3a为必然事件的原则,用解析的方法计算布撒器对单条机场跑道的最佳封锁策略,包括布撒器对跑道的攻击角度、所需投放的布撒器数目以及各瞄准点坐标的确定,给出了具体的算例.这种方法计算速度快,精度高,对布撒器的总体设计、作战效能分析和作战指挥都具有重要的参考价值.     

A branch and bound algorithm for computing optimal replacement policies in consecutive k‐out‐of‐n‐systems

This paper presents a branch and bound algorithm for computing optimal replacement policies in a discrete‐time, infinite‐horizon, dynamic programming model of a binary coherent system with n statistically independent components, and then specializes the algorithm to consecutive k‐out‐of‐n systems. The objective is to minimize the long‐run expected average undiscounted cost per period. (Costs arise when the system fails and when failed components are replaced.) An earlier paper established the optimality of following a critical component policy (CCP), i.e., a policy specified by a critical component set and the rule: Replace a component if and only if it is failed and in the critical component set. Computing an optimal CCP is a optimization problem with n binary variables and a nonlinear objective function. Our branch and bound algorithm for solving this problem has memory storage requirement O(n) for consecutive k‐out‐of‐n systems. Extensive computational experiments on such systems involving over 350,000 test problems with n ranging from 10 to 150 find this algorithm to be effective when n ≤ 40 or k is near n. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 288–302, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10017     

空空导弹随机最优导引规律的研究

通过建立导弹目标攻击简化数学模型 ,提出一种随机最优导引规律 ;运用卡尔曼滤波理论 ,引进了机动目标加速度和量测系统的不确定性。通过数字仿真 ,分别和传统比例导引规律、扩展比例导引规律相比较 ,表明了该规律的最优性     

A specially structured nonlinear integer resource allocation problem

We present an algorithm for solving a specially structured nonlinear integer resource allocation problem. This problem was motivated by a capacity planning study done at a large Health Maintenance Organization in Texas. Specifically, we focus on a class of nonlinear resource allocation problems that involve the minimization of a convex function over one general convex constraint, a set of block diagonal convex constraints, and bounds on the integer variables. The continuous variable problem is also considered. The continuous problem is solved by taking advantage of the structure of the Karush‐Kuhn‐Tucker (KKT) conditions. This method for solving the continuous problem is then incorporated in a branch and bound algorithm to solve the integer problem. Various reoptimization results, multiplier bounding results, and heuristics are used to improve the efficiency of the algorithms. We show how the algorithms can be extended to obtain a globally optimal solution to the nonconvex version of the problem. We further show that the methods can be applied to problems in production planning and financial optimization. Extensive computational testing of the algorithms is reported for a variety of applications on continuous problems with up to 1,000,000 variables and integer problems with up to 1000 variables. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 770–792, 2003.     

The value of information sharing in a two‐stage supply chain with production capacity constraints

We consider a simple two‐stage supply chain with a single retailer facing i.i.d. demand and a single manufacturer with finite production capacity. We analyze the value of information sharing between the retailer and the manufacturer over a finite time horizon. In our model, the manufacturer receives demand information from the retailer even during time periods in which the retailer does not order. To analyze the impact of information sharing, we consider the following three strategies: (1) the retailer does not share demand information with the manufacturer; (2) the retailer does share demand information with the manufacturer and the manufacturer uses the optimal policy to schedule production; (3) the retailer shares demand information with the manufacturer and the manufacturer uses a greedy policy to schedule production. These strategies allow us to study the impact of information sharing on the manufacturer as a function of the production capacity, and the frequency and timing in which demand information is shared. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

基于红外图像的小目标检测与跟踪方法

为了能在强杂波、低信噪比的情况下检测小目标,人们提出了许多针对小目标检测与跟踪的方法。介绍了基于红外图像的小目标检测和跟踪的各种方法和最新进展,重点讨论了灰度形态法、小波变换法、最优时空非线性滤波法用于小目标检测与跟踪的原理,并指出了今后的发展和研究方向。     

基于未确知测度的多目标决策方法及其应用

定义策略、目标和评判三个空间以及满足非负性、归一性和可加性的未确知测度函数,给出了适合于有序分割类评判空间寻优的最优决策准则,从而提出了一种未确知信息数学处理理论基础上的未确知测度决策方法,对含多因素特别是难以量化因素的决策问题寻优建立了一个合理、精细、分辨率高、计算简单高效的数学模型,用来求解多目标决策问题中的最优策略,并结合火力打击选择的一个实例分析,获得了较为成功的应用.     

舰船最优概念设计方案的构造方法研究

在舰船概念设计阶段,设计者往往需要从大量设计方案中筛选优秀方案,此问题属于多属性多目标优化的问题,而进化算法的兴起为此类问题的解决提供了较好的途径.针对进化算法中Pareto最优解集的特点,结合舰船设计实际,提出一种新的构造最优解集的方法--提取法.案例验证表明,提取法是合理和有效的.