具有自适应噪声边界的Tube可达集鲁棒预测控制

针对过程噪声设定边界与真实噪声边界失配的有界干扰离散线性不确定系统,提出一种具有自适应噪声边界的Tube可达集鲁棒模型预测控制方法.首先,该算法引入基于MIT规则的自适应集员滤波在线估计系统状态和噪声边界.其次,基于估计值,通过迭代自适应集员滤波的时间更新部分计算出预测时域内闭环不确定系统状态的可达集.最后,用可达集代替不变集并根据Tube鲁棒模型预测控制策略,给出了实际不确定系统的控制律,确保系统状态鲁棒渐近稳定,并收敛于终端干扰不变集.仿真结果验证了该控制方法的有效性.     

基于随机有限集的信息物理系统状态估计北大核心CSCD

状态估计一直是信息物理系统(CPS)的基本问题之一。目前,状态估计主要采用以卡尔曼滤波及其扩展形式等为代表的随机过程方法。不同于已有研究,从信息融合的角度,提出了一种基于随机有限集的状态估计方法。通过将系统状态和传感器观测分别建模为随机有限集,并采用集贝叶斯滤波器及其粒子实现迭代求解,实现了对CPS状态的精确估计。最后,仿真结果验证了所提方法的可行性。     

离散时间线性时变系统的传感器故障估计滤波器设计

针对一类离散时间线性时变系统提出了一种传感器故障诊断方法.本文首先通过状态增广的方式将被研究的系统转化为描述系统的形式,并且基于该描述系统模型,采用方差最小化原则设计了一种能够同时估计系统状态和传感器故障的故障估计滤波器,然后利用一组故障估计滤波器提出了一种故障诊断方法.本文的主要贡献在于针对离散线性时变系统提出了一种不需要对故障动态进行假设的传感器故障诊断方法.所提出方法的另一个优点是该方法能够在存在过程和测量噪声的情况下实现故障检测、分离与估计.仿真结果说明了所提出方法的有效性.     

鲁棒镇定受到干扰的非线性微分包含系统

研究带有干扰的非线性微分包含系统的镇定问题. 基于凸锥Lyapunov函数方法, 首先, 对于无干扰的这类系统, 设计可使闭环系统全局镇定的连续反馈控制律. 其次, 通过状态反馈, 对于受到两类有界干扰的这类微分包含系统的可达集进行了估计. 最后, 通过一个仿真例子说明所提出的设计方法的有效性.     

双线性状态空间系统的状态观测器设计

针对受过程噪声和量测噪声干扰的双线性状态空间系统,研究其状态估计算法.借助双线性系统的特殊结构,将其等价表示为线性时变模型,推导基于Kalman滤波的状态估计算法.针对线性时变模型中存在的未知变量,基于辅助模型辨识思想,通过构造一个辅助模型,将未知变量用该模型的输出代替,提出基于辅助模型的双线性系统状态估计算法.构造双线性状态观测器,引入delta算子极小化状态估计误差协方差矩阵,从而得到最优状态估计增益,并提出基于delta算子的双线性系统状态估计算法.所提出的算法能够避免线性化过程带来的估计精度差的问题,提高双线性系统的状态估计精度.通过仿真实验验证了所提出算法的有效性,并对比分析了不同噪声情况下所提出算法的估计效果.     

基于多面体可达集的时间最优模型预测控制

针对有界状态干扰下的线性时变系统, 提出一种新的时间最优模型预测控制算法. 在离线情况下通过求解一系列的线性优化问题确定次优的多面体N 步可达集, 根据这些可达集在线优化计算得到的输入量使系统状态尽快收敛到稳定区域. 离线求解多面体可达集的方法可处理非对称约束, 相比于以往的方法避免了在N 增加时顶点数可能呈指数增多的问题, 同时省去了过多复杂的多面体间的运算, 因而便于在实际问题中应用.

     

基于鲁棒正不变集的传感器故障区间估计

针对具有传感器故障和未知扰动与测量噪声的线性离散系统, 提出了一种传感器故障区间估计方法. 将传感器故障视为增广状态, 原始系统转化为一个等效的广义系统. 为了得到故障的点估计同时抑制扰动和噪声的影响, 基于有界实引理设计了一个针对广义系统的鲁棒状态观测器. 然后, 通过中心对称多胞体技术实现对故障的区间估计并基于鲁棒正不变集给出了一种降低区间估计计算量的方法. 最后, 通过一个垂直起降(Vertical take-off and landing, VTOL)飞行器线性化模型的仿真算例验证了所提出方法的有效性与优越性.     

基于状态观测器的双模控制方法

对于状态不可测的输入受限线性时不变系统,提出一种基于状态观测器的控制方法. 该方法采用双模控制策略,将不变椭圆集概念同时应用于观测器的状态方程和误差方程,给出 估计状态不变性和控制输入可行性条件并给出了闭环系统的稳定性定理.仿真结果表明了所提 方法的有效性.     

一体化执行器饱和线性矩阵不等式跟踪容错控制器设计

针对一类执行器幅值饱和的不确定非线性系统,提出了基于线性矩阵不等式的一体化主动容错控制器设计方法.考虑执行器传感器同时故障情形,采用系统增维方法,将原系统等效转化为仅含执行器故障虚拟系统,简化了容错控制器设计.其次采用凸组合法对执行器饱和非线性进行描述,确保控制输入始终在幅值范围以内.在此基础上,设计了集自适应估计律与控制器于一体的主动容错控制器,并将控制器增益解算方法,转化线性矩阵不等式约束下的优化问题.最后通过飞机数值算例验证了设计方法的有效性.     

连续系统下的一种容偏估计策略

目标跟踪系统中为降低系统复杂度和保证估计的平稳性常常选择尽可能低阶次的模型, 当目标出现较高阶次的机动时, 则很容易丢失目标. 在假定目标的机动时间与强度均有限时, 提出了容偏估计的思想, 将稳态误差系数约束连同区域极点、估计误差方差上界指标一起构成估计系统的约束指标集, 寻求使得稳态误差系数尽可能小的滤波器, 以使得对机动目标跟踪的系统偏差尽可能小. 通过将约束指标集转化为一组双线性矩阵不等式(BMIs),并利用迭代求解线性矩阵不等式(LMIs)近似BMIs的方法, 得到了满足给定指标约束要求的容偏估计策略, 所设计的容偏估计策略可同时保证估计的准确性和精确性的要求, 从而保证了在目标出现机动时, 估计输出具有尽可能小的系统偏差. 最后数值算例对所提出的结论进行了说明.     

Zonotopic reachable set estimation for linear discrete‐time systems with time delay

This article studies reachable set estimation for linear discrete‐time systems with time delay, which are influenced by unknown but bounded disturbances. We propose a novel reachable set estimation method based on zonotopes for the considered systems. The proposed method can estimate real‐time reachable set under nonzero initial conditions. In order to increase estimation accuracy, we propose an iterative method to reduce the conservatism caused by the couplings between reachable sets at different instants. The effectiveness of the proposed method is illustrated by three numerical simulations.     

Reachable Set Estimation for Discrete‐Time Singular Systems

This paper is concerned with the problem of reachable set estimation for discrete‐time singular systems with bounded input disturbances. Based on the Lyapunov method, a new sufficient condition is established in terms of linear matrix inequality (LMI) to guarantee that the reachable set of discrete‐time singular system is bounded by the intersection of ellipsoids. Then the result is extended to the problem for discrete‐time singular systems with time‐varying delay by utilizing the delay‐dependent approach and free weighting matrices. Two numerical examples are provided to demonstrate the effectiveness of the obtained results proposed in this paper.     

Further result on reachable set bounding for linear uncertain polytopic systems with interval time-varying delays

The problem of reachable set estimation of linear uncertain polytopic time-varying delay systems subject to bounded peak inputs is studied in this paper. The delays considered in this paper are assumed to be non-differentiable and vary within an interval where the lower and upper bounds are known. Based on the Lyapunov–Krasovskii method and delay decomposition technique, a sufficient condition for the existence of a ball that bounds the reachable set of the system is proposed in terms of matrix inequalities containing only one scalar which can be solved by using an one-dimensional search method and Matlab’s LMI Toolbox and allow us to find the smallest radius. A numerical example is given to illustrate the effectiveness of the proposed result.     

Reachable set estimation for discrete‐time linear systems with time delays

This paper is concerned with the reachable set estimation problem for discrete‐time linear systems with multiple constant delays and bounded peak inputs. The objective is to check whether there exists a bounded set that contains all the system states under zero initial conditions. First, delay‐dependent conditions for the solvability of the addressed problem are derived by employing a novel Lyapunov–Krasovskii functional. The obtained conditions are expressed in terms of matrix inequalities, which are linear when only one scalar variable is fixed. On the basis of these conditions, an ellipsoid containing the reachable set of the considered system is obtained. An approach for determining the smallest ellipsoid is also provided. Second, the approach and results developed in the first stage are generalized to the case of systems with polytopic parameter uncertainties, and delay‐dependent conditions are given in the form of relaxed matrix inequalities. Finally, two numerical examples are provided to demonstrate the effectiveness of the proposed methods. Copyright © 2013 John Wiley & Sons, Ltd.     

Under-estimates of reachable sets for linear control systems

A new algorithm is presented for providing under-estimates of the reachable set from the origin for a class ofn-dimensional linear systems with bounded controls. This algorithm is based on the novel approach of choosing a feedback control which makes all the eigenvalues of the closed loop system unstable. Results from feedback control and Liapunov stability theory are then used to formulate the problem as the minimization of a nonlinear function subject to constraints on certain matrices. The solution of this optimization problem provides an under-estimate of the reachable set in the form of ann-dimensional ellipsoid. Examples of both continuous and discrete-time systems are presented to illustrate the method. Comparison with existing exact results for some 2-dimensional systems shows that the method provides good approximations in these cases.     

Reachable set estimation for discrete‐time switched system with application to time‐delay system

This paper addresses the problem of reachable set estimation and synthesis for a class of discrete‐time switched linear systems with time delay and bounded peak disturbance. Combined with the feature of mode‐dependent average dwell time switching, a new algorithm is developed to estimate the reachable set of switched system, which is both quasi‐time‐dependent and mode‐dependent. Then, the proposed method is applied to time‐delay system and a sufficient condition is presented to guarantee the asymptotic stability and estimate the bounding ellipsoid. Furthermore, the quasi‐time‐dependent controller is designed to stabilize the system and restrict the closed‐loop system states to an ellipsoidal bound. Examples are presented to illustrate the effectiveness and advantages of the obtained theorems.     

Reachable set estimation for switched positive systems

This paper focuses on the problem of reachable set estimation for discrete-time switched positive systems under two possible classes of exogenous disturbance. The multiple linear copositive Lyapunov function approach is applied to determine the bounding hyper-pyramids for the reachable set. Based on some Lyapunov-based inequalities and the linear version of the S-procedure technique, the bounding hyper-pyramids for the reachable set can be determined by solving a set of inequalities. Two optimisation methods are adopted to make the bounding hyper-pyramids as small as possible. Genetic Algorithm (GA) is utilised to search for the optimal value of the decision variables in the obtained inequalities. Finally, numerical examples are given to illustrate the effectiveness of the theoretical findings.     

一种求解线性控制系统可达集的数值方法

针对线性控制系统,研究应用常微分方程数值方法和优化技术相结合的近似可达集的方法.首先,用常微分方程数值方法对系统进行离散化.然后,提出基于优化技术的外部投影法来近似离散系统的可达集.外部投影法构造有限多个投影问题,每个都对应一个凸优化问题,通过求解这些凸优化问题最终可以得到可达集的近似描述.最后,通过数值仿真结果验证了所提出方法的有效性.与文献中已有的方法相比,在求解相同数量凸优化问题的情况下,外部投影法的近似精度更高.     

基于多面体包含的非线性混成系统可达性分析

针对一类非线性混成系统的可达性问题,提出了一种基于多面体包含的分析方法。首先介绍了混成系统及其可达性,讨论了如何应用多面体包含对多项式混成系统进行线性近似,并采用量词消去和非线性优化方法来构造相应的线性混成系统,然后运用验证工具SpaceEx求得原非线性混成系统的过近似可达集,并应用于验证系统的安全性。     

Reachability of linear switched systems: Differential geometric approach

The paper investigates the structure of the reachable set of linear switched systems. The structure of the reachable set is determined using techniques from classical nonlinear systems theory, namely, the theory of orbits developed by H. Sussman and the realization theory for nonlinear systems developed by B. Jakubczyk.