基于等效模型和多时间尺度扩展卡尔曼滤波的锂离子电池SOC预测

荷电状态(SOC)和最大可用电量估计是锂离子电池寿命预测中的两个最重要部分;然而与快速时变的SOC比较,最大可用电量的参数变化缓慢;文章提出了一个基于等效模型和多时间尺度的扩展卡尔曼滤波(EKF)预测算法对SOC和最大可用容量分别在不同时间尺度上进行估计,在宏观尺度上利用了SOC估计值作为观测量,更新最大可用电量;针对NCA/C卫星锂离子电池实验数据的仿真结果表明,提出的多时间尺度EKF预测算法与EKF联合估计算法相比,SOC和最大可用电量估计准确度更高,同时提高了计算效率。     

基于输出反馈的一类时滞系统鲁棒H∞容错控制

针对状态具有多个时滞的线性不确定性系统,基于李雅普诺夫稳定性理论,矩阵不等式及线性矩阵不等式方法,设计带有多个时滞记忆的输出反馈鲁棒H∞容错控制器.研究了在执行器发生故障的情况下,多时滞不确定性系统的鲁棒H∞容错控制的问题.首先给出了多个时滞记忆的输出反馈鲁棒H∞容错控制器的综合分析,进一步给出参数不确定项的多时滞系统的渐近稳定的充分条件,以及满足给定性能指标鲁棒H∞容错控制器的设计方法.仿真结果证明了该方法的有效性和可行性.     

一类非线性相对转动系统的混沌运动及多时滞反馈控制

建立一类含非线性粘滑摩擦力的两质量非线性相对转动系统的动力学方程. 研究此非线性相对转动系统在外激励作用下的混沌运动及多时滞反馈控制. 当系统在外激励作用下处于混沌状态时, 考虑引入多时滞反馈对系统的混沌运动进行控制. 应用Melnikov理论给出系统在Smale意义下的混沌临界条件, 研究了多时滞反馈对系统运动及混沌临界值的影响规律. 并结合系统相图、Poincare截面图和功率谱分析多时滞反馈参数对系统混沌运动的控制作用. 关键词： 多时滞 相对转动 控制 数值仿真     

协调多时次差分格式及其稳定性

提出对求解常微分方程的各种数值算法，可以建立与之相协调的多时次差分格式.并从数学 上给出了一个其计算稳定性的充分条件，同时提出了一种改进的最小二乘法来拟合自忆系数 ，以期在实际计算过程中既可以改善计算效果，同时也可使其稳定性得以保障. 关键词： 协调多时次差分格式 计算稳定性 最小二乘法     

多变量时滞n阶非线性非自治微分方程周期解存在性

该文利用重合度理论，研究多变时滞n阶非自治微分方程的周期解的存在性，给出了这 类方程存在周期解的两个充分性判据，推广了文［5,8］的主要结果。     

非线性时间序列的动力结构突变检测的研究

基于非线性时间序列分析方法——动力学相关因子指数，提出一种新的动力结构突变的检测方法——动力学指数分割算法.通过理想时间序列试验，验证了该方法检测动力结构突变的有效性，同时发现相对少量的尖峰噪声对该方法的影响较小，但连续分布的随机白噪声对其具有一定的影响，并与传统的滑动T检验法和Yamamoto法进行比较，进而讨论它们各自的优缺点. 关键词： 动力学相关因子指数 动力学指数分割算法 噪声 滑动T检验 Yamamoto法     

On a discrete evasion game of Isaacs

The discrete evasion game with a three-move lag, formulated over thirty years ago, was one of the earliest games with time-lag complications. This game remains unsolved, even though it is well-known that the game has a value. By considering the bomber-battleship duel and by constructing an explicit strategy for the bomber, we bound the value from below as 0.28648. This is believed to be the best lower bound known.     

On-line two-machine open shop scheduling with time lags

We analyze the performance of the greedy algorithm for the on-line two-machine open shop scheduling problem of minimizing makespan, in which time lags exist between the completion time of the first and the start time of the second operation of any job. The competitive ratio for the greedy algorithm is 2, and it can be reduced to 5/3 if the maximum time lag is less than the minimum positive processing time of any operation. These ratios are tight. We also prove that no on-line non-delay algorithm can have a better competitive ratio.     

Multi-timescale investigation of radiation damage near TiO2 rutile grain boundaries

To understand the interactions between defects and grain boundaries (GBs) in oxides, two atomistic modeling methods were used to examine the role of GBs in a model system, rutile TiO₂, in modifying radiation-induced defect production and annealing. Molecular dynamics was used to investigate defect production near a symmetric tilt GB at both 300?K and 1000?K. The damage production is found to be sensitive to the initial distance of the primary knock-on atom from the GB. We find three distinct regimes in which GBs have different effects. Similar to GBs in metals, the GB absorbs more interstitials than vacancies at certain distances while this behavior of biased loading of interstitials diminishes at other distances. Further, we obtain the statistics of both interstitial and vacancy clusters produced in collision cascades in terms of their compositions at two temperatures. Perfectly stoichiometric defect clusters represent a small fraction of the total clusters produced. Moreover, a significant reduction in the number of interstitial clusters at 1000?K compared to 300?K is thought to be a consequence of enhanced migration of interstitials towards the GB. Finally, the kinetic properties of certain defect clusters were investigated with temperature accelerated dynamics, without any a priori assumptions of migration mechanisms. Small interstitial clusters become mobile at high temperatures while small vacancy clusters do not. Multiple migration pathways exist and are typically complex and non-intuitive. We use this kinetic information to explain experimental observations and predict their long-time migration behavior near GBs.     

Shifting representation search for hybrid flexible flowline problems

This paper considers the hybrid flexible flowline scheduling problem with a set of additional restrictions and generalizations that are common in practice. These include precedence constraints, sequence dependent setup times, time lags, machine eligibility and release times. There are many potential solution representations for this problem, ranging from simple and compact, to more complex and complete. Typically, when choosing the degree of detail of the solution representation, a tradeoff can be found between efficiency of the algorithm and the size of the search space. Several adaptations of existing methods are introduced (memetic algorithm, iterated local search, iterated greedy), as well as a novel algorithm called shifting representation search (SRS). This new method starts with an iterated greedy algorithm applied to a permutation version of the problem and at a given time, switches to an iterated local search on the full search space. As far as we know, this shift of the solution representation is new in the scheduling literature. Experimental results and statistical tests clearly prove the superiority of SRS compared with classical and existing methods.