近程简易控制火箭末修的效率分析

阐述了脉冲控制力实施简易控制的特点,针对某近程单兵火箭建立了其弹道模型,在弹体周向布置两种大小不同的脉冲发动机,采用两种脉冲延时分级控制的控制策略对其实施简易控制,对其控制时刻、转速影响、分档设计等进行了分析证明对该单兵火箭实施简易控制是可行的.     

Optimizing the quality control station configuration

We study unreliable serial production lines with known failure probabilities for each operation. Such a production line consists of a series of stations, existing machines, and optional quality control stations (QCSs). Our aim is to decide on the allocation of the QCSs within the assembly line, so as to maximize the expected profit of the system. In such a problem, the designer has to determine the QCS configuration and the production rate simultaneously. The profit maximization problem is approximated assuming exponentially distributed processing times, Poisson arrival process of jobs into the system, and the existing of holding costs. The novel feature of our model is the incorporation of holding costs that significantly complicated the problem. Our approximation approach uses a branch and bound strategy that employs our fast dynamic programming algorithm for minimizing the expected operational costs for a given production rate as a subroutine. Extensive numerical experiments are conducted to demonstrate the efficiency of the branch and bound procedure for solving large scale instances of the problem and for obtaining some qualitative insights.

相似文献   

Machine maintenance with workload considerations

Machine maintenance is modeled in the setting of a single‐server queue. Machine deterioration corresponds to slower service rates and failure. This leads to higher congestion and an increase in customer holding costs. The decision‐maker decides when to perform maintenance, which may be done pre‐emptively; before catastrophic failures. Similar to classic maintenance control models, the information available to the decision‐maker includes the state of the server. Unlike classic models, the information also includes the number of customers in queue. Considered are both a repair model and a replacement model. In the repair model, with random replacement times, fixed costs are assumed to be constant in the server state. In the replacement model, both constant and variable fixed costs are considered. It is shown in general that the optimal maintenance policies have switching curve structure that is monotone in the server state. However, the switching curve policies for the repair model are not always monotone in the number of customers in the queue. Numerical examples and two heuristics are also presented. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

论火灾对环境的影响

通过火灾燃烧产物及灭火产物对环境的一些负面影响,提出了"绿色消防"的要求。     

坦克炮控系统的反演滑模鲁棒摩擦补偿控制

坦克炮控系统存在低速摩擦,摩擦环节不但造成系统的稳态误差,而且导致极限环振荡、低速爬行等现象。为此提出基于反演理论的滑模鲁棒控制方法,通过Lyapunov稳定理论获得控制量。仿真结果表明该设计方法优于经典设计,为炮控系统实际设计提供了一种可行的方法。     

基于特征结构配置的车辆主动悬架控制器设计

基于特征结构配置参数化方法,提出了车辆主动悬架控制器设计方法,其目的是设计一组状态反馈控制器,使得闭环结构系统具有希望极点和特征向量。该方法提供的自由参数,可用来满足系统的鲁棒性能等指标。该方法直接基于车辆悬架系统的参数矩阵,故便于工程应用。对车辆悬架系统进行仿真分析,结果表明该设计方法简单有效。     

潜艇指控系统技术和发展分析

介绍和分析了国外潜艇指控系统的发展概况和技术特点,然后回顾了国内潜艇指控系统发展。从满足未来海军潜艇作战需求出发,论述了一体化建设对潜艇指挥体系的重要性及下一代潜艇指控系统的能力需求,提出了着重要解决的技术问题。     

高超声速飞行器倾侧转弯耦合控制策略

针对高超声速飞行器倾侧转弯过程中俯仰、偏航和滚动通道间的强烈耦合,提出一种耦合控制策略。针对高超声速飞行器快时变、非线性和强不确定性的控制问题,基于解析形式的非线性最优预测控制方法,采用分层设计思想设计了飞行器姿态控制系统,可较好满足高超声速飞行器的快速性要求;在分析了倾侧转弯飞行控制过程的主要影响因素及其影响规律的基础上,提出一种"降低攻角—快速滚转—拉起攻角"的耦合控制策略。对该控制策略对于高超声速飞行器的适用性进行了仿真分析,结果表明:所提耦合控制策略有效降低了偏航通道的控制需求,降低了倾侧转弯控制过程的失控风险,提高了控制系统的可靠性。     

优越的CCRP算法研究

CCRP是重要的空对地攻击方式,该文以向量三角形描述空对地瞄准,结合弹道回归多项式的三元Honer 处理,提出了一种高精度的CCRP 实时算法。     

Optimal pricing and scheduling control of product shipping

In this article, we seek to understand how a capacity‐constrained seller optimally prices and schedules product shipping to customers who are heterogeneous on willingness to pay (WTP) and willingness to wait (WTW). The capacity‐constrained seller does not observe each customer's WTP and WTW and knows only the aggregate distributions of WTP and WTW. The seller's problem is modeled as an M/M/N_s queueing model with multiclass customers and multidimensional information screening. We contribute to the literature by providing an optimal and efficient algorithm. Furthermore, we numerically find that customers with a larger waiting cost enjoys a higher scheduling priority, but customers with higher valuation do not necessarily get a higher scheduling priority. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 215–227, 2015