复合材料层合圆柱壳的动力响应与层间应力

采用分层壳理论和厚度方向的二次插值函数推导出正交铺设层合圆柱壳的动力响应方程,并得出简支层合圆柱壳自由振动问题的解.对于给定算例,计算出的自振频率与三维分析的结果吻合良好,说明所推导的二维解具有足够精度.计算了前四阶模态对应的壳中应力.计算结果说明,对于高阶模态,层间应力相对于面内应力的比值远高于低阶模态的对应比值,高的层间正应力是高阶模态导致脱层破坏的主要原因.     

连续动态贝叶斯网络实现多传感器融合跟踪

利用多传感器数据进行目标跟踪,关键是怎样将多传感器的数据合理应用来对系统的状态做出最佳估计。提出应用连续动态贝叶斯网络的方法,结合卡尔曼滤波器模型,实现用多传感器数据进行目标跟踪的方法,并对算法进行了推导和验证。仿真结果证明了提出的多传感器数据互相修正融合滤波方法具有良好的滤波效果,并能够弥补传感器数据缺失和抑制脉冲噪声。     

航天试验指挥自动化系统体系结构

随着各种航天试验和航天器进入现代高技术局部战争,逐步形成了一体化的战争格局,提高航天试验指挥效能成为现代天战的迫切需求。体系结构是从顶层设计的角度,对指挥自动化系统进行的一种"统一的和概念的"描述。分析了航天试验指挥自动化系统的概念、结构组成及系统连接关系,研究航天试验指挥自动化系统的体系结构,对航天试验指挥自动化系统进一步发展和完善提供指导。     

迫弹引信动态模拟试验的终点效应相似准则

本文从动态模拟试验与靶场验收试验的等效性出发,根据瞬发发火和惯性发火作用机理的不同,分别建立了迫弹引信在碰击靶板过程中着发机构的物理数学模型,从理论上推导了考核引信瞬发发火可靠性和惯性发火可靠性的相似准则,即模拟弹着靶速度与靶场验收试验时实弹着靶速度间的关系。     

火控系统输出误差分离方法

本文提出的火控系统输出误差的分离法,为利用动态飞行试验数据评价火控系统及其火控系统子系统的性能提供了一种方法。     

基于过载的制导炮弹非线性控制系统设计

针对制导炮弹模型中的非线性和耦合性,提出一种基于过载的制导炮弹非线性控制系统设计方法,建立了炮弹的过载时变模型,在俯仰和偏航通道控制器设计过程中加入了一阶低通滤波器,消除了“计算膨胀”的难题,并通过非线性阻尼项消除外界扰动,最后由Lyapunov理论证明了系统是半全局域渐近稳定的,能准确跟踪指定过载。     

长杆射弹对钢纤维混凝土靶开坑特性的实验研究

为考察射弹对钢纤维混凝土靶的侵彻特性,采用57mm轻气炮,进行了小尺寸模拟射弹对钢纤维混凝土靶(钢纤维的体积分数为2%)的侵彻实验。实验中观察了钢纤维混凝土靶的开坑形状,测量了射弹的击靶速度,并且采用注沙法测出靶体的开坑体积,计算出射弹对靶体的侵彻体积,得到了长杆射弹的动能与侵彻体积的关系。引入射弹单位面积的冲击动能和靶体单位侵彻体积的冲击动能,结合钢纤维混凝土靶的实验数据,考察了两者之间的关系。     

机动目标建模及机动检测算法

为解决机动目标跟踪问题,建立了非机动(匀速直线运动)和机动目标当前统计两种动态模型,并对机动目标当前统计模型的输入控制的估计进行了适当改进.同时对非机动模型的观测残差和机动模型的输入估计进行检验,以便准确检测目标机动.     

Scheduling deteriorating jobs to minimize makespan

We consider a single-machine problem of scheduling n independent jobs to minimize makespan, in which the processing time of job J_j grows by w_j with each time unit its start is delayed beyond a given common critical date d. This processing time is p_j if J_j starts by d. We show that this problem is NP-hard, give a pseudopolynomial algorithm that runs in time and O(nd) space, and develop a branch-and-bound algorithm that solves instances with up to 100 jobs in a reasonable amount of time. We also introduce the case of bounded deterioration, where the processing time of a job grows no further if the job starts after a common maximum deterioration date D > d. For this case, we give two pseudopolynomial time algorithms: one runs in O(n²d(D − d) time and O(nd(D − d)) space, the other runs in p_j)²) time and p_j) space. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 511–523, 1998     

Robust shortest path planning and semicontractive dynamic programming

In this article, we consider shortest path problems in a directed graph where the transitions between nodes are subject to uncertainty. We use a minimax formulation, where the objective is to guarantee that a special destination state is reached with a minimum cost path under the worst possible instance of the uncertainty. Problems of this type arise, among others, in planning and pursuit‐evasion contexts, and in model predictive control. Our analysis makes use of the recently developed theory of abstract semicontractive dynamic programming models. We investigate questions of existence and uniqueness of solution of the optimality equation, existence of optimal paths, and the validity of various algorithms patterned after the classical methods of value and policy iteration, as well as a Dijkstra‐like algorithm for problems with nonnegative arc lengths.© 2016 Wiley Periodicals, Inc. Naval Research Logistics 66:15–37, 2019