一类不匹配不确定非线性系统鲁棒变结构控制

针对一类具有不匹配非参数化不确定性的非线性系统 ,设计出一种鲁棒变结构控制器。该控制器能够保证当时间 t趋于无穷时 ,闭环控制系统的输出跟踪误差趋于零。仿真实例说明了该控制器具有满意的控制效果     

寿命试验持续时间的预测

工程界中诸多电子元器件的寿命都可以看作或近似看作是服从指数分布的,只有经寿命试验掌握各类电子元器件寿命的分布情况,才能对整个电子系统的可靠度有较充分的认识,从而对整个电子系统中的电子设备进行合理布局,优化控制,使其在实际应用中最大程度地发挥其作用。分别给出服从单参数指数分布的样本在寿命试验的早期结果上预测寿命试验的总持续时间的精确与近似方法的证明,并对两种预测方法在不同情况下的预测结果进行比较。     

亚音速轴流风扇静转子相互作用线谱噪声预报

静转子相互作用线谱噪声是亚音速轴流风扇主要噪声源之一,快速预报该噪声对风扇设计初期的叶片选型和参数设计具有重要意义.因此在叶栅响应函数理论的基础上考虑静转子叶片的相互作用,采用叶片经验尾流模型模拟转子尾流,推导得到静转子叶栅相互作用线谱辐射声功率半经验半理论计算公式.通过与NASA已有的试验模型和计算模型结果对比,验证...     

融合地面多传感器信息引导无人机着陆

针对无人机自主着陆过程中卫星导航系统易被干扰的问题,提出了一种基于地基多传感器融合的无人机自主着陆引导方法。采用主动式激光照射的方式,获取机载反射棱镜的近红外成像,在红外图像中对无人机目标进行识别;通过坐标转换将识别结果映射到可见光图像中,在可见光图像中选择的感兴趣区域进行可见光目标识别,从而在降低计算量的基础上获得更加精确的无人机相对角度信息;利用距离测量信息和引导系统角度信息可以获得精确的无人机相对位置。无人机着陆引导试验结果表明,该方法能够提供精确的无人机位置信息,能有效适应于复杂背景下的无人机自主着陆引导。     

基于事务级模型的火控计算机建模研究

在对系统进行高层次建模和验证时,事务级模型得到越来越广泛的应用。在SystemC语言的基础上构建了火控计算机的事务级模型,并通过事务级的仿真,对模型的功能进行了验证,为下一步的软硬划分和硬件设计打好基础。     

武器握把舒适度量化研究

以手枪的握持舒适度试验为依据，分析影响握把舒适度的因素，提取舒适度量化特征点，并在试验结果的基础上，给出舒适度量化特征值。     

喷嘴结构对高压水射流影响及结构参数优化设计

喷嘴是产生高压水射流的关键部件,其结构形式对射流动力学性能有很大影响。以圆柱形喷嘴为对象,进行喷嘴结构对高压水射流的影响分析及结构参数优化设计。采用两相流计算流体力学模型进行喷嘴内外的射流流场分析。为节省计算资源,在优化设计时引入Kriging代理模型替代计算流体力学模型。分别采用改进的非劣分类遗传算法和基于分解的多目标进化算法进行单目标和多目标优化设计。研究结果表明:直线型喷嘴总体性能较优,凹型喷嘴的次之,凸型喷嘴性能最差。以直线型喷嘴为设计对象,以射流初始段长度和流量为目标,得到了单目标和多目标优化设计结果。单目标优化时,两个指标较基准外形分别提高14.71%和27.56%。多目标优化时,优化得到的半锥角处于[15.4°,89.8°]区间内。运用代理模型和进化算法的全局优化方法在进行喷嘴的优化设计时是有效的。     

A stochastic gradual cover location problem

Covering models assume that a point is covered if it is within a certain distance from a facility and not covered beyond that distance. In gradual cover models it is assumed that a point is fully covered within a given distance from a facility, then cover gradually declines, and the point is not covered beyond a larger distance. Gradual cover models address the discontinuity in cover which may not be the correct approach in many situations. In the stochastic gradual cover model presented in this article it is assumed that the short and long distances employed in gradual cover models are random variables. This refinement of gradual cover models provides yet a more realistic depiction of actual behavior in many situations. The maximal cover model based on the new concept is analyzed and the single facility location cover problem in the plane is solved. Computational results illustrating the effectiveness of the solution procedures are presented. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Adaptive random search for continuous simulation optimization

We present, analyze, and compare three random search methods for solving stochastic optimization problems with uncountable feasible regions. Our adaptive search with resampling (ASR) approach is a framework for designing provably convergent algorithms that are adaptive and may consequently involve local search. The deterministic and stochastic shrinking ball (DSB and SSB) approaches are also convergent, but they are based on pure random search with the only difference being the estimator of the optimal solution [the DSB method was originally proposed and analyzed by Baumert and Smith]. The three methods use different techniques to reduce the effects of noise in the estimated objective function values. Our ASR method achieves this goal through resampling of already sampled points, whereas the DSB and SSB approaches address it by averaging observations in balls that shrink with time. We present conditions under which the three methods are convergent, both in probability and almost surely, and provide a limited computational study aimed at comparing the methods. Although further investigation is needed, our numerical results suggest that the ASR approach is promising, especially for difficult problems where the probability of identifying good solutions using pure random search is small. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

The one‐warehouse multiretailer problem with an order‐up‐to level inventory policy

We consider a two‐level system in which a warehouse manages the inventories of multiple retailers. Each retailer employs an order‐up‐to level inventory policy over T periods and faces an external demand which is dynamic and known. A retailer's inventory should be raised to its maximum limit when replenished. The problem is to jointly decide on replenishment times and quantities of warehouse and retailers so as to minimize the total costs in the system. Unlike the case in the single level lot‐sizing problem, we cannot assume that the initial inventory will be zero without loss of generality. We propose a strong mixed integer program formulation for the problem with zero and nonzero initial inventories at the warehouse. The strong formulation for the zero initial inventory case has only T binary variables and represents the convex hull of the feasible region of the problem when there is only one retailer. Computational results with a state‐of‐the art solver reveal that our formulations are very effective in solving large‐size instances to optimality. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010