分段供电切换传感器的在线故障诊断方法

分段供电切换传感器是多段直线电机控制系统的重要部件。针对其故障检测与定位的问题,提出一种切换传感器故障的在线诊断方法。对采集的传感器信号数据进行压缩,以提高计算的效率;研究切换传感器信号根据次级运动的变化规律,定义标准信号集合;给出计算传感信号差异度的方法,作为分析信号相似程度的量化指标;将问题表示为基于有向图的搜索问题,并根据问题的特点缩小搜索的范围;由此提出搜索算法,可以根据测量的传感信号时序估计传感系统的状态变迁过程;给出故障定位流程,利用算法估计的结果,根据系统标准信号集合进行故障定位。为了说明算法与预期结果的一致性,给出3个命题并进行证明;通过实验验证了故障诊断方法的有效性。     

What you should know about approximate dynamic programming

Approximate dynamic programming (ADP) is a broad umbrella for a modeling and algorithmic strategy for solving problems that are sometimes large and complex, and are usually (but not always) stochastic. It is most often presented as a method for overcoming the classic curse of dimensionality that is well‐known to plague the use of Bellman's equation. For many problems, there are actually up to three curses of dimensionality. But the richer message of approximate dynamic programming is learning what to learn, and how to learn it, to make better decisions over time. This article provides a brief review of approximate dynamic programming, without intending to be a complete tutorial. Instead, our goal is to provide a broader perspective of ADP and how it should be approached from the perspective of different problem classes. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009     

关于装备建设保障性目标的思考——兼论装备的执行任务能力

根据近年来装备保障的实践和国外的发展，从装备作战使用的角度辨析了装备保障的定义，界定了其范围，重点提出了装备保障性目标总要求，阐述了其内涵和任务能力的关系，简述了其确定过程及关键技术，基于装备任务能力与装备执行任务能力对装备保障性进行了系统分析。     

基于协方差矩阵估计的稳健Capon波束形成算法

常规Capon波束形成器性能对模型误差或失配非常敏感,尤其是当期望信号包含在训练数据中,导向矢量失配将引起性能急剧下降。为解决这一问题,提出了一种采用干扰噪声协方差矩阵和导向矢量联合估计的稳健波束形成算法。该方法通过对Capon空间谱在非目标信号的方位区域内的积分,实现对干扰噪声协方差矩阵的估计,解决数据协方差矩阵包含有目标信号时引起信号自相消问题;其次为了克服导向矢量失配的影响,通过最大化输出功率,并增加二次型约束防止估计的导向矢量接近于干扰导向矢量,实现对导向矢量的估计。仿真实验表明:该算法能获得近似最优的输出信干噪比,与现有算法相比稳健性更强。     

飞机图像导航数据库系统的设计与开发

运用图像导航原理,设计并实现了一套飞机图像导航数据库系统.系统将导航所需的信息和若干地区的地面图预先存放在数据库中的特定位置.用户只需在系统的可视化界面中进行少量的操作,该系统就能够在飞机航行的过程中实时地显示拍摄到地面图像,并将该图像与数据库中的相关图像进行特征匹配,从而获取并提供给用户飞机当时的位置、航速快慢及航向误差等导航信息.     

基于多项式设计法的小推力轨迹设计

形状逼近法是小推力轨迹设计中的一种有效方法,然而现有的方法大都假定运动轨迹为某一特定的形状,而且没有考虑推力加速度的约束限制。针对小推力轨道交会问题,提出一种基于多项式的轨迹设计方法。结合极坐标系,建立基于多项式的三自由度轨迹运动模型,将轨迹设计问题转化为求解多项式的系数问题;根据运动模型推导轨迹的动力学特性,建立约束方程,并以消耗燃料最少作为性能指标,采用序列二次规划的方法对多项式的系数进行寻优计算。该方法不仅能求解多个形状设计参数不确定性问题,而且还能满足推力加速度的约束限制。仿真验证了该方法的正确性和可用性,该方法可为任务设计初步阶段的轨迹设计和燃料消耗预估提供一定的技术参考。     

飞航导弹齐射发射时间的一种快速规划算法

多发飞航导弹齐射时,各发导弹之间存在碰撞或者相互干扰的可能,为了保证导弹飞行安全,需要对各发导弹的飞行管道进行分析,以此规划各发导弹发射时间.为此在对飞航导弹初段航迹分析的基础上,建立了一种发射时间的快速规划算法,实现了以较小的计算量规划发射时间,并且通过仿真计算证实了该算法是正确的.     

Inventory policies for a make‐to‐order system with a perishable component and fixed ordering cost

We consider a make‐to‐order production system where two major components, one nonperishable (referred to as part 1) and one perishable (part 2), are needed to fulfill a customer order. In each period, replenishment decisions for both parts need to be made jointly before demand is realized and a fixed ordering cost is incurred for the nonperishable part. We show that a simple (s_n,S,S) policy is optimal. Under this policy, S along with the number of backorders at the beginning of a period if any and the availability of the nonperishable part (part 1) determines the optimal order quantity of the perishable part (part 2), while (s_n,S) guide when and how much of part 1 to order at each state. Numerical study demonstrates that the benefits of using the joint replenishment policy can be substantial, especially when the unit costs are high and/or the profit margin is low. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

器材保障资源管理中GIS技术应用研究

针对我军器材保障资源管理的特点和要求,并以现有的器材保障资源数据库为基础,结合GIS技术应用,探讨了器材保障资源管理中GIS技术的应用途径和方式,提出了应用GIS技术的器材保障资源管理系统的实现方法。     

Optimizing barge utilization in hinterland container transportation

In hinterland container transportation the use of barges is getting more and more important. We propose a real‐life operational planning problem model from an inland terminal operating company, in which the number of containers shipped per barge is maximized and the number of terminals visited per barge is minimized. This problem is solved with an integer linear program (ILP), yielding strong cost reductions, about 20%, compared to the method used currently in practice. Besides, we develop a heuristic that solves the ILP in two stages. First, it decides for each barge which terminals to visit and second it assigns containers to the barges. This heuristic produces almost always optimal solutions and otherwise near‐optimal solutions. Moreover, the heuristic runs much faster than the ILP, especially for large‐sized instances.