非线性系统中心差分集员估计方法

用于非线性椭球估计的扩展集员算法在实际应用中存在着实现性差、边界估计相对保守等缺陷.本文提出了一种用于非线性系统状态估计的中心差分集员估计方法,以改善传统非线性集员滤波算法的估计性能.为克服泰勒展开的固有缺陷,采用低阶多维Stirling内插多项式代替泰勒展开实现非线性模型的线性化处理;利用半定规划方法对线性化误差进行外包定界并将其融入过程噪声和量测噪声中,以降低误差定界的保守性;量测更新中,为提高算法的实时性,将量测椭球松弛为多个带的交,依次参与状态椭球的更新,从而实现状态定界椭球的次优估计;同时,对椭球—带交集迭代过程中椭球中心到超平面的归一化距离的计算方法进行了改进,使当前时刻每次迭代的椭球均参与计算并选取最优值,以减小累计误差.仿真结果表明了本文所提出算法的有效性和改进性能.     

基于超平行空间集员滤波的非线性系统状态估计方法

针对噪声有界但未知条件下的非线性系统状态估计问题,提出基于超平行空间集员滤波算法.利用Stirling矩阵将模型进行一阶展开,基于凸差规划完成线性化误差定界,采用超平行空间表示误差边界和状态可行集,求解下一时刻预测状态可行集超平行体.在更新步将观测值分解为多个带,融入观测值的线性化误差并将带依次与超平行体相交,得到该时刻超平行空间描述下的状态可行集更新情况.所提出算法能够避免在求解线性化误差过程中外包误差集合带来的体积扩充,降低非线性集员滤波算法的保守性,仿真示例验证了所提出算法的可行性和有效性.     

基于OBE算法的自适应集员状态估计

研究了具有椭球集合描述的离散时间动态线性系统的状态估计问题.从提高计算的有效性和可实现性的角度出发,通过在不同的更新阶段采用优化定界椭球(OBE)算法,提出了一种新颖的解决状态估计的方法.通过与ROBP(recursive state bounding by parallelotopes)算法和Kalman滤波的仿真比较,验证了本方法的性能.     

模型参数失配有界下的扩展集员估计方法

在非线性模型参数失配下,直接采用滤波算法很难获到理想的估计状态.本文基于扩展集员估计方法,在状态估计中引入参数的不确定信息,提出一种参数失配有界下的状态估计方法.该方法应用区间或集合运算的法则,计算由参数失配引起的偏差范围,并将其用椭球集外包.在状态估计的预测步,通过该偏差椭球集与先验椭球区间的并运算,得到预测椭球区间;在状态估计的更新步,利用观测椭球集对预测椭球区间进行更新,从而得到后验椭球集合以及状态估计值.最后,在数值仿真和发酵模型中的仿真应用验证了算法的有效性.     

改进的全对称多胞形集员状态估计算法

针对带有有界的噪声和参数的非线性离散时间系统, 提出了一种改进的全对称多胞形集员状态估计算法.在算法的时间更新过程中, 采用区间算术的方法计算一个包含系统轨迹的全对称多胞形.在算法的量测更新过程中, 则要首先在状态空间中给出一个集合作为与量测输出相一致的区域的外界描述, 然后计算一个具有最小容积的全对称多胞形作为时间更新全对称多胞形与此集合的交集的外界描述.由于此集合可表示为多个带的交集, 所以需要研究全对称多胞形与带的交集的外界描述方法.在提出改进的外界描述方法之前, 指出了原始外界描述方法的保守性.改进的外界描述方法给出了新的包含二者交集的全对称多胞形族, 然后找到具有最小容积的全对称多胞形作为二者交集的外界描述. 此后证明了改进外界描述方法得到的全对称多胞形不会比原始方法大. 最后, 采用仿真实验来检验不同噪声分布对算法性能的影响.仿真结果表明了改进算法得到的状态估计的均方误差和全对称多胞形的容积比原始算法小, 而且当存在重尾分布噪声时此优势更加明显.     

一种新的基于保证定界椭球算法的非线性集员滤波器

基于未知但有界噪声假设的集员滤波器为传统的概率化滤波方法提供了一种可行的替代选择, 然而其潜在的计算负担和保守性考虑制约了该方法的实际应用. 本文提出一种新的基于保证定界椭球近似的改进集员滤波方法, 用于解决针对非线性系统的状态估计问题,在保证实时性的前提下降低了算法的保守性. 首先,对非线性模型进行线性化处理,采用DC (Difference of convex)规划方法对线性化误差进行外包定界, 并通过椭球近似将其融合到系统噪声中; 在此基础上提出了一种结合了椭球直和计算和基于迭代外定界椭球算法的椭球--带交集计算 所构成的经典预测--更新步骤来估计得到状态的可行椭球集. 与常规的非线性扩展集员滤波方法的仿真比较表明了本文所提出算法的有效性和改进性能.     

基于状态集员估计的主动故障检测

对于现代复杂控制系统, 微小故障往往很难发现. 在系统过程干扰和测量噪声未知但有界的前提下, 提出了一种新的基于状态集员估计的主动故障检测方法. 首先设计全对称多胞形卡尔曼滤波器对系统状态进行估计, 并利用全对称多胞形对受未知干扰影响的状态集合进行描述, 然后设计辅助输入信号使得加入辅助输入信号后正常模型的状态集合与故障模型的状态集合交集为空, 从而实现主动故障检测. 为了使得所设计的辅助输入信号对原系统影响最小, 需要求得最小的辅助输入信号, 本文将最优化问题转化为混合整数二次规划问题进行求解. 最后, 与基于输出集合的辅助输入信号设计方法对比, 仿真验证本文所提出的基于状态集合的主动故障检测方法由于未受下一时刻测量噪声的影响, 所求得的辅助输入信号更小, 保守性更低.     

基于UD分解的自适应扩展集员估计方法

用于非线性椭球估计的扩展集员算法在实际应用中存在着数值稳定性差、计算复杂度高以及滤波器参数难以选择等问题. 本文提出了一种基于 UD 分解的自适应扩展集员估计算法, 用于解决非线性系统时变状态和参数的联合估计和定界问题. 新算法将 UD 分解与序列更新和选择更新策略结合起来, 改进了传统扩展集员算法的数值稳定性和实时性能; 同时, 对滤波器参数进行自适应选择以进一步降低计算复杂度并达到次优估计结果. 仿真实验表明了该算法的有效性和鲁棒性.     

基于未知输入集员滤波器的不确定系统故障诊断

针对一类具有参数不确定性和未知扰动的线性系统,提出了一种新的执行器故障诊断方法.将指定执行器故障视为未知输入,利用全对称多胞形近似状态边界,本文设计了一种未知输入全对称多胞形集员滤波器,以估计测量输出的上下边界.在此基础上,提出了一种利用一组未知输入滤波器的故障检测与分离策略.通过一个飞行控制系统的数值仿真验证了所提出方法的有效性.     

改进强跟踪滤波算法及其在汽车状态估计中的应用

准确实时地获取汽车行驶过程中的状态变量,对汽车底盘控制有着重要的意义,而这些关键状态往往难以直接测量或 者成本较高.结合纵向、侧向和横摆三自由度非线性汽车模型,将改进强跟踪滤波(Improved strong track filter, ISTF)算法应用到汽车的状态估计中,并改进了算 法的稳定性.与扩展卡尔曼滤波(Extended Kalman filter, EKF)算法进行比较分析.通过Carsim和Matlab/Simulink联合仿真和实车双移线实验验证算法,结果 表明,该算法在估计精度、跟踪速度、抑制噪声等方面均优于扩展卡尔曼滤波算法,满足汽车状态估计器的软件性能要求.     

Rescheduling policies for large-scale task allocation of autonomous straddle carriers under uncertainty at automated container terminals

This paper investigates replanning strategies for container-transportation task allocation of autonomous Straddle Carriers (SC) at automated container terminals. The strategies address the problem of large-scale scheduling in the context of uncertainty (especially uncertainty associated with unexpected events such as the arrival of a new task). Two rescheduling policies–Rescheduling New arrival Jobs (RNJ) policy and Rescheduling Combination of new and unexecuted Jobs (RCJ) policy–are presented and compared for long-term Autonomous SC Scheduling (ASCS) under the uncertainty of new job arrival. The long-term performance of the two rescheduling policies is evaluated using a multi-objective cost function (i.e., the sum of the costs of SC travelling, SC waiting, and delay of finishing high-priority jobs). This evaluation is conducted based on two different ASCS solving algorithms–an exact algorithm (i.e., branch-and-bound with column generation (BBCG) algorithm) and an approximate algorithm (i.e., auction algorithm)–to get the schedule of each short-term planning for the policy. Based on the map of an actual fully-automated container terminal, simulation and comparative results demonstrate the quality advantage of the RCJ policy compared with the RNJ policy for task allocation of autonomous straddle carriers under uncertainty. Long-term testing results also show that although the auction algorithm is much more efficient than the BBCG algorithm for practical applications, it is not effective enough, even when employed by the superior RCJ policy, to achieve high-quality scheduling of autonomous SCs at the container terminals.     

An image segmentation approach on improved implicit surface model in straddle strategy

Multimedia Tools and Applications - At present, some experts and scholars do not explicitly mention the static model in the analysis of the straddle strategy, which leads to the research results...     

State estimation of recurrent neural networks with interval time-varying delay: an improved delay-dependent approach

This paper is concerned with the state estimation problem for a class of recurrent neural networks with interval time-varying delay, where time delay includes either slow or fast time-varying delay. A novel delay-dependent criterion, in which the rate–range of time delay is also considered, is established to estimate the neuron states through available output measurements such that, for all admissible time delays, the dynamics of the estimation error system is globally asymptotically stable. The proposed method is based on a new Lyapunov–Krasovskii functional with triple-integral terms and free-weighting matrix approach. Numerical examples are given to illustrate the effectiveness of the method.     

State estimation and filtering in stochastic systems using adequate simplification

The method of order reduction in solving stochastic problems of state estimation and filtering is considered. The method presented concerns the case where mathematical models of objects being studied are defined by systems of nonstationary differential equations. Translated from Kibernetika i Sistemnyi Analiz, No. 5, pp. 98–102, September–October, 1999.     

Tuning of evolutionary particle filtering approach for estimation of trajectory deviation

An autonomous vehicle launched from moving platform is subjected to flexure‐like disturbance and needs to stabilize itself before embarking on the target tracking phase. Control and guidance remains inactive during stabilization phase. Hence, estimating the deviation from the intended trajectory is important in the absence of control and guidance commands for trajectory correction. This estimation problem is here mapped to the misalignment estimation problem, with the intended trajectory data resembling mother data and the followed trajectory data resembling daughter data. The main requirement is fast convergence for early commencement of target tracking phase. Kalman filter and its variants fail to converge due to the inability to model time varying nonlinearities and flexure in the system model. Conventional particle filter converges, but computation time is high. This work explores evolutionary particle filter variants that may provide faster convergence through adaptive tuning of the range from where particle support points are selected. Such heuristics is based on the observed residual trend. Monte Carlo simulation results underline the importance of designing estimator based on adaptive tuned evolutionary particle filter algorithm.     

State estimation via limited capacity noisy communication channels

The paper addresses a state estimation problem involving communication errors and capacity constraints. Discrete-time partially observed linear systems perturbed by stochastic unbounded additive disturbances are studied. Unlike the classic theory, the sensor signals are communicated to the estimator over a limited capacity noisy digital link modeled as a stochastic discrete memoryless channel. It is shown that the capability of the noisy channel to ensure state estimation with a bounded in probability error is identical to its capability to transmit information with as small probability of error as desired. In other words, the classic Shannon capacity of the channel constitutes the boundary of the observability domain. It is shown that whenever the Shannon capacity bound is met, a reliable observation can be ensured by means of a state estimator consuming a bounded (as time progresses) computational complexity and memory per unit time. The corresponding state estimator is constructed explicitly and is based on the classic block coding approach, so that traditional block encoding–decoding procedures can be employed for its implementation. This work was supported by the Australian Research Council and the Russian Foundation for Basic Research grant 06-08-01386.     

Computation of arrival cost for moving horizon estimation via unscented Kalman filtering

Moving horizon estimation alleviates the computational burden of solving a full information estimation problem by considering a finite horizon of the measurement data, however, it is non-trivial to determine the arrival cost. A commonly used approach for computing the arrival cost is to use a first-order Taylor series approximation of the nonlinear model and then apply an extended Kalman filter. In this paper, an approach to compute the arrival cost for moving horizon estimation based on an unscented Kalman filter is proposed. The performance of such a moving horizon estimator is compared with the one based on an extended Kalman filter and illustrated in a case study.     

Routing straddle carriers for the loading operation of containers using a beam search algorithm

This paper discusses how to route straddle carriers during the loading operation of export containers in port container terminals. The objective of the routing is to minimize the total travel distance of straddle carriers in the yard. The routing problem is comprised of the container allocation problem and the carrier routing problem. In the container allocation problem, containers in the yard are divided into multiple classes, each of which will be loaded by a quay crane. The container allocation problem is formulated as a transportation problem. In the carrier routing problem, the sequence of yard-bays that a carrier visits is determined. A beam search algorithm is developed for the carrier routing problem. A numerical experimentation is carried out in order to evaluate the performance of the algorithm.