小高炮综合体动态射击精度考核方法和设备的研究

本文论述了目前小高炮综合体的动态射击精度、考核方法及其测量设备的优缺点,并对新的考核方法和设备提出了设想。     

C~3l系统软件质量保障技术研究

针对C~3I 软件系统设计实现中所存在的问题,文章重点对软件质量保障方法进行了分析研究,同时提出一种简化任务评审阶段的软件质量综合保障建议。对从事C~3I 系统工程软件质量保障的人员可供参考。     

移动电站整机性能自动测试仪的研制

本文研究将分布式双处理器控制技术应用于移动电站性能测试中,构成移动电站整机性能参数自动测试仪,该测试仪比传统测试方法提高效率8～10倍,且操作简便。     

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

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

高炮人-机跟踪系统建模及动态特性分析

本文以某高炮人-机系统为对象,以人的最优控制模型为基础,建立该人-机跟踪系统部分的数学模型,利用计算机求解——即模型预测方法,研究操作者(炮手)在跟踪沿不同航路飞行的空中目标时系统的跟踪误差和动态性能;与此同时研制一套模拟原高炮人-机系统的仿真试验装置,以获取的试验数据做为检验上述模型预测结果和进行全系统性能分析的依据。     

飞行控制软件导航仿真模型遥测数据注入仿真

研究了飞行控制软件导航仿真模型遥测数据注入仿真中的一些问题,构造了遥测数据输入序列的误差补偿算法,重建相应的输入序列,使得将它们注入到相应的数字仿真模型进行仿真时,得到的输出与飞行试验中弹上计算机发送的遥测数据相符。     

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

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

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

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

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