基于最小衰减率多面体不变集的鲁棒模型预测控制

针对一类具有输入输出约束的多胞体结构线性变参数系统,提出了一种基于最小衰减率多面体不变集的鲁棒模型预测控制算法,算法分为在线和离线两个部分.为增强系统控制效果,提高系统响应速度,离线算法首先采用寻求状态变量的最小衰减率的方法优化出一系列状态变量及相应的状态反馈控制律,然后构建出相应的多面体不变集序列;在线算法根据当前实测状态变量,在多面体不变集序列内确定状态变量所处的最小多面体不变集,通过在线优化得出系统的控制输入.给出了鲁棒模型预测控制算法的详细步骤和系统的闭环稳定性证明.仿真结果验证了本算法的有效性,表明本算法使系统的闭环响应更为快速和稳定.     

基于Tube不变集的鲁棒模型预测控制北大核心CSCD

针对具有持续有界扰动的线性变参数系统,设计一种基于Tube不变集的鲁棒模型预测控制算法。离线算法结合系统多胞体模型参数变化的影响,构建系统的Tube不变集。在对应标称模型状态变量的多面体不变集算法基础上,得到系统的多面体状态允许不变集序列。在线算法通过强控制优化得到标称模型系统的控制量,以得到符合实际控制过程的系统控制量,给出本算法的详细步骤和系统稳定性证明。仿真结果验证了本算法的有效性,表明本算法将持续有界扰动对系统的影响限制在Tube不变集中,实现了系统的快速稳定控制。     

持续有界扰动系统的嵌套不变椭圆集鲁棒控制

为了抑制外部持续有界扰动和模型不确定性对系统稳定性控制的影响,通过不变集理论,采用嵌套不变椭圆集鲁棒控制算法实现系统的快速稳定控制。控制算法分为离线算法和在线算法两部分。离线时根据公式得到一维状态变量序列,通过线性矩阵不等式方法优化得到嵌套不变椭圆集。在线时,根据系统状态变量在嵌套不变椭圆集的位置,构建新的不变椭圆集并计算得到系统的控制律。给出新的不变椭圆集满足系统控制要求的理论证明。通过与不变单椭圆集控制算法进行仿真比较,结果验证了上述算法的有效性,为持续有界扰动下模型不确定性系统的稳定控制,提供一种有效的控制方法。     

基于容许集的多胞不确定系统三模RMPC

针对输入和状态受约束的多胞不确定线性系统,提出了基于容许集的扩大吸引域三模鲁棒模型预测控制方法.在多面体不变集离线模型预测控制算法的基础上引入容许集,以多面体不变集序列的并集作为模态1,基于N步容许集的控制容许集作为模态2,并利用离线设计和在线优化的控制策略,设计了三模变终端约束鲁棒模型预测控制算法,以实现系统渐近稳定.该算法不仅降低了在线运算量,而且扩大了吸引域.最后的仿真结果验证了所提出算法的有效性.     

基于多面体不变集的变终端约束集RMPC

针对一类状态和输入受约束的多胞不确定线性时变系统,提出了一种基于多面体不变集的变终端约束集鲁棒模型预测控制算法.首先采用基于状态反馈增益的多面体不变集计算方法,给出了一种新的控制不变集序列构造方法,然后以控制不变集序列的并集作为终端约束集,结合在线优化和增益切换,实施变终端约束集双模鲁棒预测控制.该算法不仅有效地扩大了...     

多胞约束LPV系统多面体不变集RMPC算法

针对一类输入和输出受约束且具有多胞结构的离散LPV 系统, 提出一种基于多面体不变集的鲁棒模型预测控制(RMPC) 算法. 选取一系列收敛于原点的离散状态点, 计算每个状态的反馈控制率, 构建相应的多面体不变集. 在每一个采样时刻, 确定包含当前状态的最小多面体不变集, 通过计算与相邻两个多面体不变集的位置关系, 执行连续的状态反馈控制率. 仿真结果表明, 相比椭圆不变集离线RMPC算法, 所提出算法扩大了系统的稳定区域, 取得了保守性较小的结果.

     

基于多椭圆集序列的鲁棒模型预测优化控制

在工业过程的模型预测控制中,离线算法和在线算法是基于线性矩阵不等式的鲁棒模型预测算法的两个部分,离线得到的椭圆集序列是在线算法的基础.为了得到合适的控制规律,使系统的响应快速稳定,离线时根据状态变量的每个一维子空间得到相应的多个椭圆集序列.在线时,每个采样周期根据当前测量的状态变量值,在多个椭圆集序列中选择一个合适椭圆集序列,确定状态变量位于其中的两个椭圆集之间,并用优化的方式精确定位状态变量的位置,并得到系统控制量,使在线优化得到了证明.通过和传统算法的仿真比较,验证了所提出算法对系统的响应更迅速.     

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

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

     

基于多面体不变集的离线鲁棒预测控制器综合

提出一种基于多面体不变集的离线鲁棒预测控制器综合算法.该算法离线确定一组反馈控制律及其对应的不变集,在线控制时根据当前状态所处的位置选择相应的控制律,不仅扩大了初始可行域,还能在一定程度上改善控制性能.仿真结果表明了采用多面体不变集的优越性.     

基于容许集的变终端约束MPC控制

针对一类输入和状态受约束的离散线性系统,提出一种基于Ⅳ步容许集的变终端约束集模型预测控制方法.首先给出多面体不变集序列作为终端约束集的离线模型预测控制算法,扩大了终端约束集.为进一步扩大初始状态可镇定区域,引入N步容许集,设计了基于容许集的变终端约束集模型预测控制方法.该算法采用离线设计、在线优化方法,实现了系统渐近稳定,不仅降低了在线运算量,而且扩大了初始状态可镇定区域.仿真结果表明了算法的有效性.     

鲁棒模型预测控制在变风量空调系统中的应用

在变风量空调系统中二次泵压差控制可以有效地减少空调能耗,为克服二次泵模型的不确定性,提高二次泵变频调速控制的响应速度和精度,采用基于线性矩阵不等式的鲁棒预测控制策略。算法分为离线和在线两个部分,离线时首先用传统算法得出目标函数上界,以此为已知量重新优化得到一系列较大的渐近稳定的不变椭圆集。在线时,每个采样周期用三个相邻的椭圆集优化来对状态变量进行精确定位,并给出控制量。给出在线优化的理论证明。通过和传统算法的仿真比较,表明该算法的有效性。二次泵压差控制的实验表明该算法可得到较大的可行域,系统响应快,控制效果好。     

Distributed stochastic MPC for systems with parameter uncertainty and disturbances

A distributed stochastic model predictive control algorithm is proposed for multiple linear subsystems with both parameter uncertainty and stochastic disturbances, which are coupled via probabilistic constraints. To handle the probabilistic constraints, the system dynamics is first decomposed into a nominal part and an uncertain part. The uncertain part is further divided into 2 parts: the first one is constrained to lie in probabilistic tubes that are calculated offline through the use of the probabilistic information on disturbances, whereas the second one is constrained to lie in polytopic tubes whose volumes are optimized online and whose facets' orientations are determined offline. By permitting a single subsystem to optimize at each time step, the probabilistic constraints are then reduced into a set of linear deterministic constraints, and the online optimization problem is transformed into a convex optimization problem that can be performed efficiently. Furthermore, compared to a centralized control scheme, the distributed stochastic model predictive control algorithm only requires message transmissions when a subsystem is optimized, thereby offering greater flexibility in communication. By designing a tailored invariant terminal set for each subsystem, the proposed algorithm can achieve recursive feasibility, which, in turn, ensures closed‐loop stability of the entire system. A numerical example is given to illustrate the efficacy of the algorithm.     

Grid k-d tree approach for point location in polyhedral data sets – application to explicit MPC

ABSTRACT

Explicit model predictive control (EMPC) moves the online computational burden of linear model predictive control (MPC) to offline computation by using multi-parametric programming which produces control laws defined over a set of polyhedral regions in the state space. The online computation of EMPC is to find the corresponding control law according to a given state, this is called the point location problem. This paper deals with efficient point location in larger polyhedral data sets. The authors propose a hybrid data structure, grid k-d tree (GKDT), which is constructed by the k-dimensional tree (k-d tree), hash table and binary search tree (BST). The main part of GKDT is a multiple branch tree which constructs subtrees by splitting the polyhedral region into several equal grids based on the k-d tree and is traversed by the hash function on each level. GKDT has a high search efficiency, even though it needs much more storage memory. A complexity analysis of the approach in the runtime and storage requirements is provided. Advantages of the method are supported by two examples in the paper.     

An off-line robust MPC algorithm for uncertain polytopic discrete-time systems using polyhedral invariant sets

In this paper, an off-line synthesis approach to robust model predictive control (MPC) using polyhedral invariant sets is presented. Most of the computational burdens are moved off-line by computing a sequence of state feedback control laws corresponding to a sequence of polyhedral invariant sets. At each sampling time, the smallest polyhedral invariant set that the currently measured state can be embedded is determined. The corresponding state feedback control law is then implemented to the process. The controller design is illustrated with two examples. Comparisons between the proposed algorithm and an ellipsoidal off-line robust MPC algorithm have been undertaken. The proposed algorithm yields a substantial expansion of the stabilizable region. Therefore, it can achieve less conservative result as compared to an ellipsoidal off-line robust MPC algorithm.     

Using hash tables to manage the time-storage complexity in a point location problem: Application to explicit model predictive control

The online computational burden of linear model predictive control (MPC) can be moved offline by using multi-parametric programming, so-called explicit MPC. The solution to the explicit MPC problem is a piecewise affine (PWA) state feedback function defined over a polyhedral subdivision of the set of feasible states. The online evaluation of such a control law needs to determine the polyhedral region in which the current state lies. This procedure is called point location; its computational complexity is challenging, and determines the minimum possible sampling time of the system. A new flexible algorithm is proposed which enables the designer to trade off between time and storage complexities. Utilizing the concept of hash tables and the associated hash functions, the proposed method solves an aggregated point location problem that overcomes prohibitive complexity growth with the number of polyhedral regions, while the storage–processing trade-off can be optimized via scaling parameters. The flexibility and power of this approach is supported by several numerical examples.