北约舰队防空体系分析

介绍了以美国为首的北约舰队防空体系的构成、任务和主要防御对象。对北约舰队防空体系的最新发展动向进行了分析。针对目前北约舰队防空体系中的薄弱环节,提出了突防的具体构想。     

Generating Pareto‐optimal boundary points in multiparty negotiations using constraint proposal method

In this paper a constraint proposal method is developed for computing Pareto‐optimal solutions in multiparty negotiations over continuous issues. Constraint proposal methods have been previously studied in a case where the decision set is unconstrained. Here we extend the method to situations with a constrained decision set. In the method the computation of the Pareto‐optimal solutions is decentralized so that the DMs do not have to know each others' value functions. During the procedure they have to indicate their optimal solutions on different sets of linear constraints. When the optimal solutions coincide, the common optimum is a candidate for a Pareto‐optimal point. The constraint proposal method can be used to generate either one Pareto‐optimal solution dominating the status quo solution or several Pareto‐optimal solutions. In latter case a distributive negotiation among the efficient points can be carried out afterwards. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 210–225, 2001     

后方油库整体生存概率分析计算

针对我军后方油库特点,探讨了油库整体生存概率计算的基本思路和方法,分析了各类分项目标生存概率的计算方法,采用层次分析对后方油库各分项目标权值进行了详细分析计算,可为后方油库伪装防护效能评估提供依据。     

Effectiveness of (R,Q) policies in one‐warehouse multiretailer systems with deterministic demand and backlogging

Consider a distribution system with a central warehouse and multiple retailers. Customer demand arrives at each of the retailers continuously at a constant rate. The retailers replenish their inventories from the warehouse which in turn orders from an outside supplier with unlimited stock. There are economies of scale in replenishing the inventories at both the warehouse and the retail level. Stockouts at the retailers are backlogged. The system incurs holding and backorder costs. The objective is to minimize the long‐run average total cost in the system. This paper studies the cost effectiveness of (R, Q) policies in the above system. Under an (R, Q) policy, each facility orders a fixed quantity Q from its supplier every time its inventory position reaches a reorder point R. It is shown that (R, Q) policies are at least 76% effective. Numerical examples are provided to further illustrate the cost effectiveness of (R, Q) policies. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 422–439, 2000     

反舰导弹仿真中的目标命中判断问题

阐述了模型校核的意义和作用。对属于模型校核范畴的仿真中的系统状态不连贯问题的基本概念通过乒乓球的下落和反舰导弹攻击目标舰艇的例子进行了说明。介绍了已有的解决系统状态不连贯问题的三种方法,并进行了优、缺点分析。给出了反舰导弹仿真中的目标命中判断模型。指出,反舰导弹仿真中的目标命中判断问题是一个系统状态不连贯问题。为解决该问题,提出并应用了一种新方法预测法。利用预测法,最多进行两步最小步长仿真,就能够以要求的精确度检测到任何一个系统状态不连贯。相对于以前的三种方法,在提高仿真效率的同时,预测法还能够避免对系统状态不连贯问题的漏检。     

拦截高速机动目标的捕获区及微分对策导引律

针对高速机动目标拦截场景,研究末制导段捕获区存在条件及微分对策导引律问题。建立弹目相对运动模型并引入控制动力学模型,采用终端投影方法对相对运动模型进行降阶处理;基于微分对策理论推导一种解析形式捕获区,并具体到直/气复合控制导弹对机动目标的拦截中,该捕获区的存在能够保证对任意机动目标进行准确捕获;重新选取性能指标,将目标与直/气复合控制导弹在末端带有碰撞角约束的制导问题转化为零和微分对策问题,并求解出弹目最优拦截策略。仿真分析了几种情形下直/气复合控制导弹对目标实施拦截的捕获区存在域,导引律仿真结果表明微分对策导引律在对高速机动目标进行拦截时具有优良性能。     

导弹突防后弹道机动调整策略强化学习

针对弹道导弹中段突防后飞行弹道与标准弹道产生较大偏离的弹道机动调整问题,建立了机动调整时机策略最优化模型。设计了机动调整逆序Q学习算法,采用Tile coding逼近器编码状态特征空间,并对其进行线性逼近。构建了Q学习算法与蒙特卡罗方法相结合的逆序更新策略机制,以对导弹机动调整最优时机进行训练。仿真测试分析结果表明,在给定场景参数下,通过10 000代强化学习算法训练得到的策略能够可靠地使用最少机动次数控制导弹突防后飞行弹道的调整决策,验证了方法的有效性。     

Optimal policies for M/M/m queue with two different kinds of (N,T)‐policies

In this paper, two different kinds of (N, T)‐policies for an M/M/m queueing system are studied. The system operates only intermittently and is shut down when no customers are present any more. A fixed setup cost of K > 0 is incurred each time the system is reopened. Also, a holding cost of h > 0 per unit time is incurred for each customer present. The two (N, T)‐policies studied for this queueing system with cost structures are as follows: (1) The system is reactivated as soon as N customers are present or the waiting time of the leading customer reaches a predefined time T, and (2) the system is reactivated as soon as N customers are present or the time units after the end of the last busy period reaches a predefined time T. The equations satisfied by the optimal policy (N*, T*) for minimizing the long‐run average cost per unit time in both cases are obtained. Particularly, we obtain the explicit optimal joint policy (N*, T*) and optimal objective value for the case of a single server, the explicit optimal policy N* and optimal objective value for the case of multiple servers when only predefined customers number N is measured, and the explicit optimal policy T* and optimal objective value for the case of multiple servers when only predefined time units T is measured, respectively. These results partly extend (1) the classic N or T policy to a more practical (N, T)‐policy and (2) the conclusions obtained for single server system to a system consisting of m (m ≥ 1) servers. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 240–258, 2000     

BTT导弹的新型三维非线性寻的制导律

建立了导弹与目标的三维相对运动模型,分析了目前寻的制导律的一些局限性,提出了新型非线性寻的制导律。在更复杂的交战环境中,将此制导律用于高性能的ＢＴＴ导弹,可望提高制导精度     

采用捷联惯性导航系统的战术导弹初始对准误差分离方法研究

捷联惯性导航系统的初始对准误差是战术地空导弹精度分配中的主要误差源之一 ,研究在外场条件下初始对准误差的快速分离方法对于提高导弹制导精度具有积极意义。