地地弹道导弹射击精度评估与分析

在分析射击弹道的基础上,建立了射击精度评估的简化数学模型,针对某型导弹飞行弹道仿真数据进行射击精度评估,精度指标与仿真结果一致,满足射击要求.     

边界扫描测试的数学描述模型

IEEE1149.1边界扫描机制是一种新型的VLSI电路测试及可测试性设计的有效方法,为了高效地应用边界扫描机制对电路系统进行测试,必须对其所涉及的理论方法进行深入探讨。本文应用布尔矩阵理论建立起边界扫描测试的数学描述模型,并基于所建立的模型导出了边界扫描测试中的故障检测条件和故障隔离条件。为边界扫描测试生成算法的深入研究奠定了理论基础。     

线性调频基带数字产生的关键技术研究

介绍超宽带线性调频信号基带的数字产生方法及其实现技术。首先对线性调频信号的两种主要数字产生方法进行了简要阐述和比较，然后根据波形存储直读法提出了一种超宽带线性调频信号产生方案，分析了基带数字产生的主要关键技术，并进行了系统实现和测试。测试结果表明本文所提出的方法是可行的。     

基于IAFSA的四自由度翼伞分段归航设计

为实现翼伞系统的精确空投,需要对其归航轨迹作合理规划。根据翼伞系统自身的运动特性及操纵特性,采用分段归航策略。在四自由度翼伞模型下,利用各轨迹段的几何关系,建立表征轨迹优劣程度的目标函数。基于改进的人工鱼群算法,对目标函数进行参数寻优,进而得到轨迹的设计参数。仿真结果表明,所提出的改进方法能加快算法的收敛速度,所规划的轨迹满足了精确落点和逆风着陆的要求。     

符号执行火控系统诸元解算程序测试用例生成技术

火控系统作为各种武器装备的中枢和大脑,控制着武器系统的运转,其有效性直接关系着射击的成败甚至武器系统的综合效能。诸元解算程序是将各种输入条件依据弹道模型经过多次迭代转换为射击诸元,由于其复杂性,当前软件测试用例只是在几个关键点上进行校验,很难覆盖程序所有分支和路径,存在着测试不充分。针对这个问题,提出了一种基于符号执行的用例自动生成技术,结合解弹道方程组约束条件和程序分支控制变量使用符号执行框架内能够得到覆盖所有可能的执行路径,从而保证测试的充分性。     

A risk function for the stochastic modeling of electric capacity expansion

We present a stochastic optimization model for planning capacity expansion under capacity deterioration and demand uncertainty. The paper focuses on the electric sector, although the methodology can be used in other applications. The goals of the model are deciding which energy types must be installed, and when. Another goal is providing an initial generation plan for short periods of the planning horizon that might be adequately modified in real time assuming penalties in the operation cost. Uncertainty is modeled under the assumption that the demand is a random vector. The cost of the risk associated with decisions that may need some tuning in the future is included in the objective function. The proposed scheme to solve the nonlinear stochastic optimization model is Generalized Benders' decomposition. We also exploit the Benders' subproblem structure to solve it efficiently. Computational results for moderate‐size problems are presented along with comparison to a general‐purpose nonlinear optimization package. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:662–683, 2001     

城市环境下单无人机测向定位航迹优化算法

为解决单架无人机在城市环境中对辐射源目标的定位问题,提出了一种基于环境预测法的单无人机测向定位航迹优化算法。使用交互多模型-扩展卡尔曼滤波进行视距和非视距信号混合环境下的目标估计。结合估计的目标位置和城市地理信息模型,基于视线追踪法求解信号遮挡区域和多径信号干扰区域。在滚动时域控制算法框架下生成无人机预测轨迹,以最大化Fisher信息矩阵行列式为测向定位评价准则,考虑建筑物障碍以及其对信号的遮挡和反射效应对无人机测向定位航迹的影响,控制无人机选择最优航向飞行。仿真结果表明,该方法能够使无人机在存在障碍、信号遮挡和多径干扰的环境下实现对目标的高精度测向定位,为解决城市环境下的单架无人机测向定位问题提供了新思路。     

尾流自导鱼雷射击弹道优化模型

为实现尾流自导鱼雷整个弹道过程的优化,采用几何分析法。首先分析了尾流自导鱼雷射击弹道需满足的约束条件,然后建立了尾流自导鱼雷一次转角射击和二次转角射击两种射击模式下的射击诸元解算模型,最后建立了尾流自导鱼雷射击弹道优化解算模型,并给出了具体的解算流程图。该模型基于尾流自导鱼雷射击的数学原理,兼顾工程实现时的弹道约束,也充分考虑了其作战使用时的实现流程,能够为尾流自导鱼雷有关问题深入研究提供理论支撑。     

飞行器低空突防威胁建模与航迹优化算法

提出了一种飞行器在给定地形和威胁分布的威胁场进行低空突防的航迹优化算法。该方法首先对地形的高程栅格数据进行了图形简化预处理,将各种威胁叠加到地形图上,构成一个包含各种威胁的特定威胁场,再对其建立合理的有向图数学建模,用Dijkstra最短路算法进行航迹优化。航迹优化的过程中考虑了飞行器的过载限制,使优化航迹能够较好地满足飞行器各项性能指标及任务规划的要求,仿真结果显示,该算法简单快速,能很好地进行地形、威胁、障碍物的回避。     

Scheduling jobs and maintenance activities on parallel machines

Most machine scheduling models assume that the machines are available all of the time. However, in most realistic situations, machines need to be maintained and hence may become unavailable during certain periods. In this paper, we study the problem of processing a set of n jobs on m parallel machines where each machine must be maintained once during the planning horizon. Our objective is to schedule jobs and maintenance activities so that the total weighted completion time of jobs is minimized. Two cases are studied in this paper. In the first case, there are sufficient resources so that different machines can be maintained simultaneously if necessary. In the second case, only one machine can be maintained at any given time. In this paper, we first show that, even when all jobs have the same weight, both cases of the problem are NP-hard. We then propose branch and bound algorithms based on the column generation approach for solving both cases of the problem. Our algorithms are capable of optimally solving medium sized problems within a reasonable computational time. We note that the general problem where at most j machines, 1 ≤ j ≤ m, can be maintained simultaneously, can be solved similarly by the column generation approach proposed in this paper. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 145–165, 2000