状态—参数联合估计方法及其在液体火箭发动机健康监控中的应用

基于传统的扩展卡尔曼滤波器（ＥＫＦ）,本文提出了一种带次优渐消因子的ＥＫＦ用于非线性时变随机动态系统状态与参数的联合估计。应用于液体火箭发动机健康监控算法的仿真研究表明,本文所提出的联合估计器具有较好的收敛性、实时性和动态跟踪能力。此外,文中还讨论了联合估计器应用于实际系统的有关问题。     

一类半线性抛物型方程组解的爆破速率估计

研究了一类具有不同类型反应项的半非线性抛物型方程组初边值问题,这类模型主要描述两种物质燃烧过程中的热传递规律。通过运用古典计算技巧和偏微分方程的定性分析手法,得到了这类半非线性抛物型方程组初边值问题解的爆破速率估计。     

基于截断函数的有限时间滑模控制方法

针对一类二阶不确定非线性系统的鲁棒控制问题,提出一种基于截断函数的有限时间滑模控制算法。该算法具有以下特点:系统状态可在期望的有限时刻收敛为零;受控系统对外部扰动和参数不确定性具有全局鲁棒特性;系统状态的动态响应可解析预测;通过选择不同的截断函数可以实现对控制器性能的调节。仿真结果验证了所提算法的有效性。     

Aggregating courier deliveries

We consider the problem of efficiently scheduling deliveries by an uncapacitated courier from a central location under online arrivals. We consider both adversary‐controlled and Poisson arrival processes. In the adversarial setting we provide a randomized (3βΔ/2δ ? 1) ‐competitive algorithm, where β is the approximation ratio of the traveling salesman problem, δ is the minimum distance between the central location and any customer, and Δ is the length of the optimal traveling salesman tour overall customer locations and the central location. We provide instances showing that this analysis is tight. We also prove a 1 + 0.271Δ/δ lower‐bound on the competitive ratio of any algorithm in this setting. In the Poisson setting, we relax our assumption of deterministic travel times by assuming that travel times are distributed with a mean equal to the excursion length. We prove that optimal policies in this setting follow a threshold structure and describe this structure. For the half‐line metric space we bound the performance of the randomized algorithm in the Poisson setting, and show through numerical experiments that the performance of the algorithm is often much better than this bound.     

OFDM系统中高功率放大器预失真技术研究

针对正交频分复用(OFDM)系统中高功率放大器(HPA)固有的非线性特性导致频谱再生和邻道干扰等问题,介绍了一种高功率放大器的自适应预失真技术,该技术采用查表法对信号进行预失真。本文用M AT-LAB仿真研究分析了基于查表法自适应基带预失真算法的有效性。仿真实验表明:该预失真算法可以有效地降低放大器所带来的OFDM信号频谱再生等非线性失真,提高了系统的性能。     

Approximation methods for the analysis of a multicomponent,multiproduct assemble‐to‐order system

In this article, we consider the performance evaluation of a multicomponent, multiproduct assemble‐to‐order (ATO) system. Each component is managed independently using a base‐stock policy at a supply facility with limited production capacity and an infinite buffer. The arrivals of demands follow a multivariate Poisson process and unfilled demands are backlogged. Because exact analysis of the proposed system is not feasible, we propose two approximation methods which provide upper and lower bounds for various performance measures such as fill rate, average waiting time, and average number of backorders of the proposed system. Our computational experiments demonstrate the effectiveness of the two approximation methods under various system settings. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

粒子滤波在误差配准中的应用

系统偏差严重影响了多部雷达航迹的互联和目标状态的融合,因此如何解决误差配准成为一个关键问题。因为系统偏差和雷达的量测之间是一种非线性关系,所以无法直接使用Kal-man等线性滤波直接进行系统偏差的估计。为解决这一问题,利用非线性的粒子滤波器(PF),对目标状态和系统偏差的估计进行了探讨,为了对比其性能,设计了一种扩展Kalman滤波算法。仿真结果表明PF在误差配准中的应用是可行的,性能高于扩展Kalman滤波。     

提高惯导系统Unscented卡尔曼滤波实时性技术

Unscented卡尔曼滤波(UKF)通过构造一组,具有与给定状态估计相同的一、二阶矩,也可能是高阶矩的样本点,实现对非线性系统的状态估计,因此其计算效率取决于能够捕获这些数字特征的样本点数目.通过构造n 2个样本点来捕获n维状态变量的均值和方差,提出了将这种方法应用于惯性导航的初始对准.仿真结果表明在同等滤波精度的情况下,该方法比UKF计算效率更高,实时性更好.     

Parallel machine scheduling with job assignment restrictions

In the classical multiprocessor scheduling problem independent jobs must be assigned to parallel, identical machines with the objective of minimizing the makespan. This article explores the effect of assignment restrictions on the jobs for multiprocessor scheduling problems. This means that each job can only be processed on a specific subset of the machines. Particular attention is given to the case of processing times restricted to one of two values, 1 and λ, differing by at most 2. A matching based polynomial time ε‐approximation algorithm is developed that has a performance ratio tending to . This algorithm is shown to have the best possible performance, tending to 3/2, for processing times 1 and 2. For the special case of nested processing sets, i.e., when the sets of machines upon which individual jobs may be assigned are non‐overlapping, the behavior of list scheduling algorithms is explored. Finally, for assignment restrictions determined by just one characteristic of the machines, such as disc storage or memory constraint in the case of high performance computing, we contribute an algorithm that provides a 3/2 worst case bound and runs in time linear in the number of jobs. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

火炮射表数据处理方法评述

主要介绍火炮射表数据处理方法,对国内目前较为流行的两种射表逼近方法进行了全面、系统的分析与比较,指出了逐步回归射表逼近方法存在的缺陷和不足。对国外近几年采用的插值法文中也进行了比较详细的讨论,并指出了未来的研究问题。