On the computation of convex robust control invariant sets for nonlinear systems

In this paper we provide a method to compute robust control invariant sets for nonlinear discrete-time systems. A simple criterion to evaluate if a convex set in state space is a robust control invariant set for a nonlinear uncertain system is presented. The criterion is employed to design an algorithm for computing a polytopic robust control invariant set. The method is based on the properties of DC functions, i.e. functions which can be expressed as the difference of two convex functions. Since the elements of a wide class of nonlinear functions have DC representation or, at least, admit an arbitrarily close approximation, the method is quite general. The algorithm requires relatively low computational resources.     

Robust MPC of constrained discrete-time nonlinear systems based on approximated reachable sets

A robust MPC for constrained nonlinear systems with uncertainties is presented. Outer bounds of the reachable sets of the system are used to predict the evolution of the system under uncertainty. A method that uses zonotopes to represent the approximated reachable sets is proposed. The closed-loop system is ultimately bounded thanks to a contractive constraint that drives the system to a robust invariant set.     

A linear programming algorithm for invariant polyhedral sets of discrete-time linear systems

In this paper we formulate necessary and sufficient conditions for an arbitrary polyhedral set to be a positively invariant set of a linear discrete-time system. Polyhedral cones and linear subspaces are included in the analysis. A linear programming algorithm is presented that enables practical application of the results stated in this paper.     

Nonlinear model predictive control with polytopic invariant sets

Ellipsoidal invariant sets have been widely used as target sets in model predictive control (MPC). These sets can be computed by constructing appropriate linear difference inclusions together with additional constraints to ensure that the ellipsoid lies within a given inclusion polytope. The choice of inclusion polytope has a significant effect on the size of the target ellipsoid, but the optimal inclusion polytope cannot in general be computed systematically. This paper shows that use of polytopic invariant sets overcomes this difficulty, allowing larger stabilizable sets without loss of performance. In the interests of online efficiency, consideration is focused on interpolation-based MPC.     

Stability analysis of piecewise-affine systems using controlled invariant sets

This paper presents new stability conditions for closed-loop piecewise-affine (PWA) systems. The result is based on controlled invariant sets for PWA systems, which are defined by extending the notion of semi-ellipsoidal invariant sets for constrained linear systems reported in previous research. The paper shows that by proper use of the control input, concatenations of semi-ellipsoidal sets can be made invariant for the trajectories of PWA systems. Furthermore, based on these controlled invariant sets, the paper presents a result for stability of a closed-loop PWA system which is less conservative than existing approaches in the literature. In this result, it is shown that a PWA system is stable inside the intersection of any level set for a local Lyapunov function and the design set where the function is defined, provided the flow points inwards at the boundaries of the intersection. This result is less conservative than previous approaches and it enables the designer to have an estimation of a much larger region of exponential stability then it would be possible using previous results. A numerical example is presented, in which it is made clear by comparison with previous approaches that the estimated region of stability can be made significantly larger using the new stability conditions developed in this paper.     

Robust stabilization for multivariable systems with constrained control: Frequency domain approach

In this paper, robust stabilization conditions based on theH ^∞-norm are derived for multivariable feedback systems under perturbations and constrained control. The parametrized controller of Youlaet al. is employed to treat this problem. In addition, a necessary and sufficient condition is derived for the solvability of the synthesis problem for a controller which achieves robust stability. Finally, a design procedure is proposed for selecting the parameters of the robust controller, and an illustrative example is given.     

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

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

     

Implicit improved vertex control for uncertain,time-varying linear discrete-time systems with state and control constraints

The problem of regulating an uncertain and/or time-varying linear discrete-time system with state and control constraints to the origin is addressed. It is shown that feasibility and a robustly asymptotically stable closed loop can be achieved using an interpolation technique. The design method can be seen as an alternative to optimization-based control schemes such as Robust Model Predictive Control. Especially for problems requiring complex calculations to find the optimal solution, the present method can provide a straightforward suboptimal solution. A simulation demonstrates the performance of this class of constrained controllers.     

Reference governors and maximal output admissible sets for linear periodic systems

ABSTRACT

In this paper, we consider the problem of constraint management in Linear Periodic (LP) systems using Reference Governors (RG). First, we introduce the periodic-invariant maximal output admissible sets for LP systems. We extend the earlier results in the literature to Lyapunov stable LP systems with output constraints, which arise in RG applications. We show that, while the invariant sets for these systems may not be finitely determined, a finitely-determined inner approximation, which is periodically invariant, can be obtained by constraint tightening. We then analyze the geometric and algebraic relationship between these sets and show that these sets are related via simple transformations, implying that it suffices to compute only one of them for real-time applications. This greatly reduces the memory burden of RG (or other similar constraint management strategies), at the expense of an increase in processing requirements. We present a thorough analysis of this trade-off. In the second part of this paper, we present two RG formulations, and discuss their properties and algorithms for their computation. Numerical simulations demonstrate the efficacy of the approach.     

切换系统不变集的输出反馈镇定

利用一个非负函数V (x), 推广了小时间状态模可观测和大时间状态模可观测的定义, 提出了小时间V (x)可观测和大时间V (x)可观测的概念. 利用V (x)可观测的概念, 讨论了子系统无源的切换系统不变集的有界输出反馈镇定及动态输出反馈镇定. 利用多Lyapunov函数证明了闭环系统渐近稳定. 仿真例子验证了文中结论正确性.     

Isochronous sets of invariant control systems

Let G be a connected Lie group with Lie algebra g and Σ=(G,D) a controllable invariant control system. A subset A⊂G is said to be isochronous if there exists a uniform time T_A>0 such that any two arbitrary elements in A can be connected by a positive orbit of Σ at exact time T_A. In this paper, we search for classes of Lie groups G such that any Σ has the following property: there exists an increasing sequence of open neighborhoods (V_n)_n≥0 of the identity in G such that the group can be decomposed in isochronous rings W_n=V_n+1−V_n. We characterize this property in algebraic terms and we show that three classes of Lie groups satisfy this property: completely solvable simply connected Lie groups, semisimple Lie groups and reductive Lie groups.     

Robust observer-based controller design for state constrained uncertain systems: attractive ellipsoid method

ABSTRACT

This study focuses in the output feedback stabilisation of constrained linear systems affected by uncertainties and noisy output measurements. The system states are restricted inside a given polytope and a classical Luenberger observer is used to reconstruct the unmeasurable states from output observations. Based on the observed states, a state feedback is proposed as the control input. The stability analysis and the control design are done using an extended version of the attractive ellipsoid method (AEM) approach. To avoid the violation of state constraints, this work proposes a barrier Lyapunov function (BLF) based analysis. The control parameters are obtained throughout the solution of some optimisation problems such that the BLF ensures an approximation of the constraints by a maximal ellipsoidal set and the AEM provides the characterisation of a minimal ultimately bounded set for the closed-loop system solutions. Numerical simulations show the advantages using the BFL-AEM methodology against classical sub-optimal controllers in academic second order and third order examples. Then, the proposed control strategy is applied over a Buck DC-DC converter. In all the cases, the method proposed here prevails over the other controllers.     

Robust one-step receding horizon control for constrained systems

This paper proposes a robust receding horizon control scheme for discrete-time uncertain linear systems with input and state constraints. The control scheme is based on the minimization of the worst-case one-step finite horizon cost with a finite terminal weighting matrix. It is shown that the proposed receding horizon control robustly asymptotically stabilizes uncertain constrained systems under some matrix inequality conditions on the terminal weighting matrices. This robust receding horizon control scheme has a larger feasible initial-state set and a more general structure than existing robust receding horizon controls for uncertain constrained systems under the same design parameters. The proposed controller is obtained using semidefinite programming. Copyright © 1999 John Wiley & Sons, Ltd.     

Switched systems with multiple invariant sets

This paper explores dwell time constraints on switched systems with multiple, possibly disparate invariant limit sets. We show that, under suitable conditions, trajectories globally converge to a superset of the limit sets and then remain in a second, larger superset. We show the effectiveness of the dwell-time conditions by using examples of switching limit cycles commonly found in robotic locomotion and flapping flight.     

Componentwise ultimate bound and invariant set computation for switched linear systems

We present a novel ultimate bound and invariant set computation method for continuous-time switched linear systems with disturbances and arbitrary switching. The proposed method relies on the existence of a transformation that takes all matrices of the switched linear system into a convenient form satisfying certain properties. The method provides ultimate bounds and invariant sets in the form of polyhedral and/or mixed ellipsoidal/polyhedral sets, is completely systematic once the aforementioned transformation is obtained, and provides a new sufficient condition for practical stability. We show that the transformation required by our method can easily be found in the well-known case where the subsystem matrices generate a solvable Lie algebra, and we provide an algorithm to seek such transformation in the general case. An example comparing the bounds obtained by the proposed method with those obtained from a common quadratic Lyapunov function computed via linear matrix inequalities shows a clear advantage of the proposed method in some cases.     

线性控制系统的无界多面体不变集

本文利用非光滑分析方法,讨论了线性控制系统的无界多面体不变集问题.当无界多面体的极方向满足一定条件时,得到了该无界多面体为一类线性控制系统弱不变集的判别方法.然后在更一般的线性控制系统下给出了无界多面体为强不变集的充分条件.最后给出两个应用实例.     

On efficient computation of low-complexity controlled invariant sets for uncertain linear systems

A method is presented for determining invariant low-complexity polytopic sets and associated linear feedback laws for linear systems with polytopic uncertainty. Conditions based on the relationship between 2- and ∞-norms are used to define an initial invariant low-complexity polytope as the solution of a semi-definite program. The problem of computing a maximal controlled invariant low-complexity polytopic set is then formulated as a bilinearly constrained problem, and a relaxation of this problem is derived as an iterative sequence of convex programs. The proposed method scales linearly with the state dimension, which allows the possibility of determining low-complexity robust controlled invariant sets for high-order systems.     

On the algebraic characterization of invariant sets of switched linear systems

In this paper, a suitable LaSalle principle for continuous-time linear switched systems is used to characterize invariant sets and their associated switching laws. An algorithm to determine algebraically these invariants is proposed. The main novelty of our approach is that we require no dwell time conditions on the switching laws. By not focusing on restricted control classes we are able to describe the asymptotic properties of the considered switched systems. Observability analysis of a flying capacitor converter is proposed as an illustration.     

Robust model predictive control for constrained continuous-time nonlinear systems

In this paper, a robust model predictive control (MPC) is designed for a class of constrained continuous-time nonlinear systems with bounded additive disturbances. The robust MPC consists of a nonlinear feedback control and a continuous-time model-based dual-mode MPC. The nonlinear feedback control guarantees the actual trajectory being contained in a tube centred at the nominal trajectory. The dual-mode MPC is designed to ensure asymptotic convergence of the nominal trajectory to zero. This paper extends current results on discrete-time model-based tube MPC and linear system model-based tube MPC to continuous-time nonlinear model-based tube MPC. The feasibility and robustness of the proposed robust MPC have been demonstrated by theoretical analysis and applications to a cart-damper springer system and a one-link robot manipulator.     

More efficient predictive control

An approach for constrained predictive control of linear systems (or uncertain systems described by polytopic uncertainty models) is presented. The approach consists of (in general non-convex, but often convex) offline optimization, and very efficient online optimization. Two examples, one being a laboratory experiment, compare the approach to existing approaches, revealing both advantages and disadvantages.