New H∞ control design for polytopic systems with mixed time-varying delays in state and input

This paper concerns with the problem of state-feedback H∞ control design for a class of linear systems with polytopic uncertainties and mixed time-varying delays in state and input. Our approach can be described as follows. We first construct a state-feedback controller based on the idea of parameter-dependent controller design. By constructing a new parameter-dependent Lyapunov-Krasovskii functional (LKF), we then derive new delay-dependent conditions in terms of linear matrix inequalities ensuring the exponential stability of the corresponding closed-loop system with a H∞ disturbance attenuation level. The effectiveness and applicability of the obtained results are demonstrated by practical examples

H? robust memory controllers for networked control systems: uncertain sampling rates and time delays in polytopic domains

In this paper, the problem of controller design for networked control systems with time-varying sampling rates and time delays is investigated. By using a memory at the feedback loop, a digital robust controller that minimizes an upper bound to the Hinfin performance of the closed loop system is determined. The design conditions are obtained from the Finsler\u27s Lemma combined with the Lyapunov theory and expressed in terms of bilinear matrix inequalities. Extra variables introduced by the Finsler\u27s Lemma are explored in order to provide a better system behavior. The time-varying uncertainties are modelled using polytopic domains. The controller is obtained by the solution of an optimization problem formulated only in terms of the vertices of the polytope, avoiding grids in the parametric space. Numerical examples illustrate the efficiency of the proposed approach

Robust control of uncertain systems: H2/H∞ control and computation of invariant sets

This thesis is mainly concerned with robust analysis and control synthesis of linear time-invariant systems with polytopic uncertainties. This topic has received considerable attention during the past decades since it offers the possibility to analyze and design controllers to cope with uncertainties. The most common and simplest approach to establish convex optimization procedures for robust analysis and synthesis problems is based on quadratic stability results, which use a single (parameter-independent) Lyapunov function for the entire uncertainty polytope. In recent years, many researchers have used parameter-dependent Lyapunov functions to provide less conservative results than the quadratic stability condition by working with parameterized Linear Matrix Inequalities (LMIs), where auxiliary scalar parameters are introduced. However, treating the scalar parameters as optimization variables leads to large computational complexity since the scalar parameters belong to an unbounded domain in general. To address this problem, we propose three distinct iterative procedures for H2 and H∞state feedback control, which are all based on true LMIs (without any scalar parameter). The first and second procedures are proposed for continuous-time and discrete-time uncertain systems, respectively. In particular, quadratic stability results can be used as a starting point for these two iterative procedures. This property ensures that the solutions obtained by our iterative procedures with one step update are no more conservative than the quadratic stability results. It is important to emphasize that, to date, for continuous-time systems, all existing methods have to introduce extra scalar parameters into their conditions in order to include the quadratic stability conditions as a special case, while our proposed iterative procedure solves a convex/LMI problem at each update. The third approach deals with the design of robust controllers for both continuous-time and discrete-time cases. It is proved that the proposed conditions contain the many existing conditions as special cases. Therefore, the third iterative procedure can compute a solution, in one step, which is at least as good as the optimal solution obtained using existing methods. All three iterative procedures can compute a sequence of non-increasing upper bounds for H2-norm and H∞-norm. In addition, if no feasible initial solution for the iterative procedures is found for some uncertain systems, we also propose two algorithms based on iterative procedures that offer the possibility of obtaining a feasible initial solution for continuous-time and discrete-time systems, respectively. Furthermore, to address the problem of analysis of H∞-norm guaranteed cost computation, a generalized problem is firstly proposed that includes both the continuous-time and discrete-time problems as special cases. A novel description of polytopic uncertainties is then derived and used to develop a relaxation approach based on the S-procedure to lift the uncertainties, which yields an LMI approach to compute H∞-norm guaranteed cost by incorporating slack variables. In this thesis, one of the main contributions is to develop convex iterative procedures for the original non-convex H2 and H∞ synthesis problems based on the novel separation result. Nonlinear and non-convex problems are general in nature and occur in other control problems; for example, the computation of tightened invariant tubes for output feedback Model Predictive Control (MPC). We consider discrete-time linear time-invariant systems with bounded state and input constraints and subject to bounded disturbances. In contrast to existing approaches which either use pre-defined control and observer gains or optimize the volume of the invariant sets for the estimation and control errors separately, we consider the problem of optimizing the volume of these two sets simultaneously to give a less conservative design.Open Acces

H? robust memory controllers for networked control systems: uncertain sampling rates and time delays in polytopic domains

In this paper, the problem of controller design for networked control systems with time-varying sampling rates and time delays is investigated. By using a memory at the feedback loop, a digital robust controller that minimizes an upper bound to the Hinfin performance of the closed loop system is determined. The design conditions are obtained from the Finsler\u27s Lemma combined with the Lyapunov theory and expressed in terms of bilinear matrix inequalities. Extra variables introduced by the Finsler\u27s Lemma are explored in order to provide a better system behavior. The time-varying uncertainties are modelled using polytopic domains. The controller is obtained by the solution of an optimization problem formulated only in terms of the vertices of the polytope, avoiding grids in the parametric space. Numerical examples illustrate the efficiency of the proposed approach

Robust model predictive control for linear systems subject to norm-bounded model Uncertainties and Disturbances: An Implementation to industrial directional drilling system

Model Predictive Control (MPC) refers to a class of receding horizon algorithms in which the current control action is computed by solving online, at each sampling instant, a constrained optimization problem. MPC has been widely implemented within the industry, due to its ability to deal with multivariable processes and to explicitly consider any physical constraints within the optimal control problem in a straightforward manner. However, the presence of uncertainty, whether in the form of additive disturbances, state estimation error or plant-model mismatch, and the robust constraints satisfaction and stability, remain an active area of research. The family of predictive control algorithms, which explicitly take account of process uncertainties/disturbances whilst guaranteeing robust constraint satisfaction and performance is referred to as Robust MPC (RMPC) schemes. In this thesis, RMPC algorithms based on Linear Matrix Inequality (LMI) optimization are investigated, with the overall aim of improving robustness and control performance, while maintaining conservativeness and computation burden at low levels. Typically, the constrained RMPC problem with state-feedback parameterizations is nonlinear (and nonconvex) with a prohibitively high computational burden for online implementation. To remedy this issue, a novel approach is proposed to linearize the state-feedback RMPC problem, with minimal conservatism, through the use of semidefinite relaxation techniques and the Elimination Lemma. The proposed algorithm computes the state-feedback gain and perturbation online by solving an LMI optimization that, in comparison to other schemes in the literature is shown to have a substantially reduced computational burden without adversely affecting the tracking performance of the controller. In the case that only (noisy) output measurements are available, an output-feedback RMPC algorithm is also derived for norm-bounded uncertain systems. The novelty lies in the fact that, instead of using an offline estimation scheme or a fixed linear observer, the past input/output data is used within a Robust Moving Horizon Estimation (RMHE) scheme to compute (tight) bounds on the current state. These current state bounds are then used within the RMPC control algorithm. To reduce conservatism, the output-feedback control gain and control perturbation are both explicitly considered as decision variables in the online LMI optimization. Finally, the aforementioned robust control strategies are applied in an industrial directional drilling configuration and their performance is illustrated by simulations. A rotary steerable system (RSS) is a drilling technology that has been extensively studied over the last 20 years in hydrocarbon exploration and is used to drill complex curved borehole trajectories. RSSs are commonly treated as dynamic robotic actuator systems, driven by a reference signal and typically controlled by using a feedback loop control law. However, due to spatial delays, parametric uncertainties, and the presence of disturbances in such an unpredictable working environment, designing such control laws is not a straightforward process. Furthermore, due to their inherent delayed feedback, described by delay differential equations (DDE), directional drilling systems have the potential to become unstable given the requisite conditions. To address this problem, a simplified model described by ordinary differential equations (ODE) is first proposed, and then taking into account disturbances and system uncertainties that arise from design approximations, the proposed RMPC algorithm is used to automate the directional drilling system.Open Acces

Robust model predictive control: robust control invariant sets and efficient implementation

Robust model predictive control (RMPC) is widely used in industry. However, the online computational burden of this algorithm restricts its development and application to systems with relatively slow dynamics. We investigate this problem in this thesis with the overall aim of reducing the online computational burden and improving the online efficiency. In RMPC schemes, robust control invariant (RCI) sets are vitally important in dealing with constraints and providing stability. They can be used as terminal (invariant) sets in RMPC schemes to reduce the online computational burden and ensure stability simultaneously. To this end, we present a novel algorithm for the computation of full-complexity polytopic RCI sets, and the corresponding feedback control law, for linear discrete-time systems subject to output and initial state constraints, performance bounds, and bounded additive disturbances. Two types of uncertainty, structured norm-bounded and polytopic uncertainty, are considered. These algorithms are then extended to deal with systems subject to asymmetric initial state and output constraints. Furthermore, the concept of RCI sets can be extended to invariant tubes, which are fundamental elements in tube based RMPC scheme. The online computational burden of tube based RMPC schemes is largely reduced to the same level as model predictive control for nominal systems. However, it is important that the constraint tightening that is needed is not excessive, otherwise the performance of the MPC design may deteriorate, and there may even not exist a feasible control law. Here, the algorithms we proposed for RCI set approximations are extended and applied to the problem of reducing the constraint tightening in tube based RMPC schemes. In order to ameliorate the computational complexity of the online RMPC algorithms, we propose an online-offline RMPC method, where a causal state feedback structure on the controller is considered. In order to improve the efficiency of the online computation, we calculate the state feedback gain offline using a semi-definite program (SDP). Then we propose a novel method to compute the control perturbation component online. The online optimization problem is derived using Farkas' Theorem, and then approximated by a quadratic program (QP) to reduce the online computational burden. A further approximation is made to derive a simplified online optimization problem, which results in a large reduction in the number of variables. Numerical examples are provided that demonstrate the advantages of all our proposed algorithms over current schemes.Open Acces

Enlarging the domain of attraction of MPC controllers

This paper presents a method for enlarging the domain of attraction of nonlinear model predictive control (MPC). The usual way of guaranteeing stability of nonlinear MPC is to add a terminal constraint and a terminal cost to the optimization problem such that the terminal region is a positively invariant set for the system and the terminal cost is an associated Lyapunov function. The domain of attraction of the controller depends on the size of the terminal region and the control horizon. By increasing the control horizon, the domain of attraction is enlarged but at the expense of a greater computational burden, while increasing the terminal region produces an enlargement without an extra cost. In this paper, the MPC formulation with terminal cost and constraint is modified, replacing the terminal constraint by a contractive terminal constraint. This constraint is given by a sequence of sets computed off-line that is based on the positively invariant set. Each set of this sequence does not need to be an invariant set and can be computed by a procedure which provides an inner approximation to the one-step set. This property allows us to use one-step approximations with a trade off between accuracy and computational burden for the computation of the sequence. This strategy guarantees closed loop-stability ensuring the enlargement of the domain of attraction and the local optimality of the controller. Moreover, this idea can be directly translated to robust MPC.Ministerio de Ciencia y Tecnología DPI2002-04375-c03-0