考虑弹体动态特性的机动效率约束导引律

针对考虑交会角和过载约束导引律在大机动时能量损失大的问题,提出一种考虑导弹机动效率的多约束制导律。应用最优二次型原理推导出考虑一阶弹体延迟的时变导引系数闭环次优制导形式,将导弹机动时刻阻力系数引入时变权系数,并通过迭代确定机动效率约束边界。将时变约束表示成剩余时间与弹体延迟时间的函数,代入制导指令,进行弹道仿真。结果表明,对于常值与机动目标,文中制导律与过载约束导引律同只考虑交会角约束的导引律相比,对目标均能实现末端弹道成型要求,而考虑机动效率的制导指令分配更为合理,在避免指令加速度饱和的同时有效降低了拦截末端速度损耗,提高制导精度与毁伤效果。且该制导律中时变权系数无须配平求解,在保证精度的同时极大地提高了迭代速度。     

航天测控通信系统可靠性分析的Krylov子空间投影算法

基于Markov模型对航天测控通信系统进行可靠性分析的过程中,若系统中测控通信设备数量较多,模型中的状态空间随设备数量呈指数增长,将会导致数值计算困难.提出了一种基于Krylov子空间技术的可靠性分析方法,将大规模问题投影至小规模子空间中,求得问题的近似解.实验结果证明,Krylov子空间方法的计算速度及精度优于Ross方法和前向Euler法(forward Euler method,FEM).     

固体推进剂裂纹摩擦热点形成细观模型分析

分析机械撞击载荷作用下复合固体推进剂内部裂纹摩擦形成热点过程。研究在压应力与剪切应力作用下闭合裂纹滑移、扩展、摩擦生热、热扩散、推进剂热分解及与气相产物相互作用。利用断裂力学、热传导、推进剂热分解动力学方法,建立裂纹摩擦热点细观模型。通过模型数值计算,探讨推进剂裂纹摩擦产生高温热点的过程和条件。分析计算表明裂纹摩擦和扩展可导致推进剂形成高温热点。     

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     

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     

基于不确定性理论的研制技术风险评估方法研究

分析了装备研制技术风险的含义,根据技术风险的特点建立了评价技术风险的指标体系。在技术风险度量中引入不确定性理论的概念,并建立了基于不确定性的技术风险的度量方法,对综合技术风险进行评价。最后通过实例验证了综合评价方法的可用性。     

陆军诸兵种合同作战兰切斯特方程的弹药消耗预测研究

描述了诸兵种合同作战的兰切斯特方程及其矩阵解,提出了一种通过兵力损耗换算弹药损耗的新思路,分析和确定了用该方法预测弹药消耗的相关参数,最后运用Matlab进行仿真计算,预测出了武器装备战损情况和弹药消耗情况。