基于EKF算法的弹道导弹助推段跟踪建模与仿真

围绕弹道导弹助推段跟踪问题,分析了助推段反弹道导弹的基本作战过程,建立了弹道导弹助推段动力学模型,分别就单传感器/单弹道导弹和多传感器/多弹道导弹两种情况建立了基于EKF算法的弹道导弹助推段跟踪模型,并通过算例验证了模型和算法的有效性,可为助推段反弹道导弹建模与仿真提供一定的参考。     

车用再制造发动机验收检验台架磨合规范试验研究

对未经磨合的再制造发动机新品进行动力性能试验,试验结果与原机标准相差较大,经分析后认为未进行充分磨合是性能不达标的主要原因。针对再制造发动机的出厂验收技术特点,制定了小负荷循环磨合规范,并对起初推断进行了试验验证。根据磨合过程中发动机动力性能的变化规律,通过试验对磨合规范进行了优化,总结出了快速有效的台架磨合规范。试验结果表明：快速磨合规范不仅能够提高磨合效率,而且保证了磨合效果。     

基于虚拟样机技术的某小口径火炮射击仿真分析

针对某小口径火炮在射击过程中零部件运动特性难以通过实弹射击试验获取的难题,联合三维建模软件和动力学仿真软件,建立了该炮的动力学模型。通过仿真数据与实弹射击试验数据的对比,验证了模型的有效性。在此基础上,研究了该炮在射击循环中各部件的运动规律和承受的发射应力载荷,研究结果可为该炮关键零部件的疲劳寿命分析和火炮射击精度研究提供参考。     

5GHz雷达的干扰计算模型概述

文章从开发5 GHz模型的目的入手,简要介绍了5 GHz模型的结构组成,详细讨论了5 GHz模型的干扰计算流程,包括无线局域网和雷达的场景设置、技术参数设置、总干扰计算等,最后给出了5 GHz模型的一个运行范例,以期为其它干扰模型的开发提供借鉴参考。     

发动机动态特性及其对车辆换档特性的影响

分析了影响发动机动态特性的因素,并通过试验得出了动态特性与稳态特性的关系。根据试验结果,分析了动态特性对车辆换档特性的影响,得出按发动机动态特性设计换档规律,有利于车辆换档特性的改善。     

大口径机枪结构动力学建模方法研究

总结了我国近年来关于大口径机枪结构动力学建模方法研究的主要成果,分析了目前建模方法上存在的某些问题以及对武器装备研制的影响,进一步介绍了边界条件的确定、模型正确性判别和载荷识别等方面的新技术。     

两栖装备乘员可靠性影响因素分析

人的可靠性指的是人在规定的时间内、规定的条件下、完成规定任务的能力,它是整个系统可靠性一个重要的组成部分,作为装甲装备而言,乘员可靠性的高低直接影响到整个装备作战系统可靠性.针对两栖装备的使用环境和使用特点,对影响乘员可靠性的因素进行了分析,得出了结论,对于如何提高两栖装备乘员可靠性有一定的指导意义.     

Algorithms for solving the conditional covering problem on paths

Consider the conditional covering problem on an undirected graph, where each node represents a site that must be covered by a facility, and facilities may only be established at these nodes. Each facility can cover all sites that lie within some common covering radius, except the site at which it is located. Although this problem is difficult to solve on general graphs, there exist special structures on which the problem is easily solvable. In this paper, we consider the special case in which the graph is a simple path. For the case in which facility location costs do not vary based on the site, we derive characteristics of the problem that lead to a linear‐time shortest path algorithm for solving the problem. When the facility location costs vary according to the site, we provide a more complex, but still polynomial‐time, dynamic programming algorithm to find the optimal solution. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Outsourcing warranty repairs: Dynamic allocation

In this paper we consider the problem of minimizing the costs of outsourcing warranty repairs when failed items are dynamically routed to one of several service vendors. In our model, the manufacturer incurs a repair cost each time an item needs repair and also incurs a goodwill cost while an item is awaiting and undergoing repair. For a large manufacturer with annual warranty costs in the tens of millions of dollars, even a small relative cost reduction from the use of dynamic (rather than static) allocation may be practically significant. However, due to the size of the state space, the resulting dynamic programming problem is not exactly solvable in practice. Furthermore, standard routing heuristics, such as join‐the‐shortest‐queue, are simply not good enough to identify potential cost savings of any significance. We use two different approaches to develop effective, simply structured index policies for the dynamic allocation problem. The first uses dynamic programming policy improvement while the second deploys Whittle's proposal for restless bandits. The closed form indices concerned are new and the policies sufficiently close to optimal to provide cost savings over static allocation. All results of this paper are demonstrated using a simulation study. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

On parallel machine replacement problems with general replacement cost functions and stochastic deterioration

The parallel machine replacement problem consists of finding a minimum cost replacement policy for a finite population of economically interdependent machines. In this paper, we formulate a stochastic version of the problem and analyze the structure of optimal policies under general classes of replacement cost functions. We prove that for problems with arbitrary cost functions, there can be optimal policies where a machine is replaced only if all machines in worse states are replaced (Worse Cluster Replacement Rule). We then show that, for problems with replacement cost functions exhibiting nonincreasing marginal costs, there are optimal policies such that, in any stage, machines in the same state are either all kept or all replaced (No‐Splitting Rule). We also present an example that shows that economies of scale in replacement costs do not guarantee optimal policies that satisfy the No‐Splitting Rule. These results lead to the fundamental insight that replacement decisions are driven by marginal costs, and not by economies of scale as suggested in the literature. Finally, we describe how the optimal policy structure, i.e., the No‐Splitting and Worse Cluster Replacement Rules, can be used to reduce the computational effort required to obtain optimal replacement policies. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005