基于动力学模型的柔性加工设备机电系统状态监测与故障预警

在建立的加工设备机电系统精确动力学模型及对模型参数实时辨识的基础上［１］，建立柔性加工设备机电系统的状态监测模型，包括ＢＡＹＥＳ故障检测、突发故障检测及故障分析与定位等；同时利用Ｋｕｌ－ｂａｃｋ信息距离和多层递阶ＡＲ模型实现系统的状态与故障预警。在加工设备上的实验表明模型可行有效，它能排除柔性多变工况、时变性及随机干扰对监测与预警功能的影响，提高其鲁棒性和自适应能力。     

递进优化技术在汽油机工作过程优化计算中的应用

采用数学规化的方法优化汽油机的工作过程,可以在限制发动机热负荷、机械负荷、氧化氮排放和不爆震的条件下,使发动机在运行过程中经济性最好.但是要求得比较精确的优化解,一般要进行大量计算,花费较多机时.本文提出了一种分段、分层、分级的递进优化方法,应用于汽油机工作过程的优化计算中,取得了较好的效果.     

求解跨音速流动时物面边界条件的处理方法

用时间相关法求解跨音速流动时,合理而有效地处理物面边界条件是十分重要的。本文提出几种物面边界条件的处理方法,并对几个例子进行了数值试验,对其结果进行了讨论。     

爆轰波在可压缩金属板面上斜反射初始参数的计算

本文计算了爆轰波在可压缩金属板面上斜反射时的初始参数。计算中选用的五种炸药是TNT(p_0为1.64g/cm~3,1.45g/cm~3)、RDX(p_0为1.59g/cm~3,1.76g/cm~3,1.80g/cm~3)、RDX/TNT(77/23)(p_0为1.75g/cm~3)、Pentolite(p_0为1.65g/cm~3,1.68g/cm~3)和B 炸药(p_0为1.71g/cm~3);三种介质是铁、铜和铝。     

Minimizing sums and products of linear fractional functions over a polytope

In this paper, we develop efficient deterministic algorithms for globally minimizing the sum and the product of several linear fractional functions over a polytope. We will show that an elaborate implementation of an outer approximation algorithm applied to the master problem generated by a parametric transformation of the objective function serves as an efficient method for calculating global minima of these nonconvex minimization problems if the number of linear fractional terms in the objective function is less than four or five. It will be shown that the Charnes–Cooper transformation plays an essential role in solving these problems. Also a simple bounding technique using linear multiplicative programming techniques has remarkable effects on structured problems. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 583–596, 1999     

Probabilistic analysis of an asymptotically optimal solution for the completion time variance problem

Scheduling a set of n jobs on a single machine so as to minimize the completion time variance is a well‐known NP‐hard problem. In this paper, we propose a sequence, which can be constructed in O(n log n) time, as a solution for the problem. Our primary concern is to establish the asymptotical optimality of the sequence within the framework of probabilistic analysis. Our main result is that, when the processing times are randomly and independently drawn from the same uniform distribution, the sequence is asymptotically optimal in the sense that its relative error converges to zero in probability as n increases. Other theoretical results are also derived, including: (i) When the processing times follow a symmetric structure, the problem has 2^{⌊(n−1)/2⌋} optimal sequences, which include our proposed sequence and other heuristic sequences suggested in the literature; and (ii) when these 2^{⌊(n−1)/2⌋} sequences are used as approximate solutions for a general problem, our proposed sequence yields the best approximation (in an average sense) while another sequence, which is commonly believed to be a good approximation in the literature, is interestingly the worst. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 373–398, 1999     

Coordinated replenishments from multiple suppliers with price discounts

In this study we present an integer programming model for determining an optimal inbound consolidation strategy for a purchasing manager who receives items from several suppliers. The model considers multiple suppliers with limited capacity, transportation economies, and quantity discounts. We propose an integrated branch and bound procedure for solving the model. This procedure, applied to a Lagrangean dual at every node of the search tree, combines the subgradient method with a primal heuristic that interact to change the Lagrangean multipliers and tighten the upper and lower bounds. An enhancement to the branch and bound procedure is developed using surrogate constraints, which is found to be beneficial for solving large problems. We report computational results for a variety of problems, with as many as 70,200 variables and 3665 constraints. Computational testing indicates that our procedure is significantly faster than the general purpose integer programming code OSL. A regression analysis is performed to determine the most significant parameters of our model. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 579–598, 1998     

平台式惯导系统初始对准最佳可观性分析

首先应用线性系统的奇异值分解理论对静基座初始对准的可观性及可观度进行了深入地分析.给出了不同奇异值下系统状态可观性状况的直方图,并且计算出不同状态组合时系统奇异值的大小及对可观性的影响.理论分析表明选取(△)N、(△)E、εE为不可观测时,系统的估计效果最好.其次采用卡尔曼滤波器对可观阵的秩为7的三种状态组合进行最优估计,仿真结果验证这种论断的正确性.最后从误差分析的角度阐述了这种论断的合理性.     

多UCAV协同控制中的任务分配模型及算法

任务分配是多UCAV协同控制的核心和有效保证。分析了影响目标价值毁伤、UCAV损耗、任务消耗时间等三项关键战技指标的因素,综合考虑实战中多UCAV同时攻击同一目标和使用软杀伤武器这两种典型情况对UCAV执行任务的影响,建立了针对攻击任务的多UCAV协同任务分配模型,并应用粒子群算法求解。仿真结果验证了模型的合理性和算法的有效性。     

2K-H 行星传动的极限传动比

在行星轮系机构综合中,研究行星轮数目与极限传动比的关系有着极其重要的意义。本文根据２Ｋ─Ｈ行星轮系机构的同心条件、安装条件和邻接条件,采用统一的符号,对满足上述条件的所有（六种）２Ｋ─Ｈ行星轮系机构,导出了行星轮个数与极限传动比的统一关系式,得到了所有２Ｋ─Ｈ行星轮系机构的极限传动比计算公式,为２Ｋ─Ｈ行星轮系机构的综合提供了理论根据。