An optimisation approach for stability analysis and controller synthesis of linear hyperbolic systems

International audienceIn this paper, we consider the problems of stability analysis and control synthesis for first-order hyperbolic linear Partial Differential Equations (PDEs) over a bounded interval with spatially varying coefficients. We propose Linear Matrix Inequalities (LMI) conditions for the stability and for the design of boundary and distributed control for the system. These conditions involve an infinite number of LMI to solve. Hence, we show how to overapproximate these constraints using polytopic embeddings to reduce the problem to a finite number of LMI. We show the effectiveness of the overapproximation with several examples and with the Saint-Venant equations with friction

Robust control of quasi-linear parameter-varying L2 point formation flying with uncertain parameters

Robust high precision control of spacecraft formation flying is one of the most important techniques required for high-resolution interferometry missions in the complex deep-space environment. The thesis is focussed on the design of an invariant stringent performance controller for the Sun-Earth L2 point formation flying system over a wide range of conditions while maintaining system robust stability in the presence of parametric uncertainties. A Quasi-Linear Parameter-Varying (QLPV) model, generated without approximation from the exact nonlinear model, is developed in this study. With this QLPV form, the model preserves the transparency of linear controller design while reflecting the nonlinearity of the system dynamics. The Polynomial Eigenstructure Assignment (PEA) approach used for Linear Time-Invariant (LTI) and Linear Parameter-Varying (LPV ) models is extended to use the QLPV model to perform a form of dynamic inversion for a broader class of nonlinear systems which guarantees specific system performance. The resulting approach is applied to the formation flying QLPV model to design a PEA controller which ensures that the closed-loop performance is independent of the operating point. Due to variation in system parameters, the performance of most closed-loop systems are subject to model uncertainties. This leads naturally to the need to assess the robust stability of nonlinear and uncertain systems. This thesis presents two approaches to this problem, in the first approach, a polynomial matrix method to analyse the robustness of Multiple-Input and Multiple-Output (MIMO) systems for an intersectingD-region,which can copewith time-invariant uncertain systems is developed. In the second approach, an affine parameterdependent Lyapunov function based Linear Matrix Inequality (LMI) condition is developed to check the robust D-stability of QLPV uncertain systems.EThOS - Electronic Theses Online ServiceGBUnited Kingdo

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

Local convex directions for Hurwitz stable polynomials

A new condition for a polynomial p(s) to be a local convex direction for a Hurwitz stable polynomial q(s) is derived. The condition is in terms of polynomials associated with the even and odd parts of p(s) and q(s), and constitutes a generalization of Rantzer's phase-growth condition for global convex directions. It is used to determine convex directions for certain subsets of Hurwitz stable polynomials

Convex inner approximations of nonconvex semialgebraic sets applied to fixed-order controller design

We describe an elementary algorithm to build convex inner approximations of nonconvex sets. Both input and output sets are basic semialgebraic sets given as lists of defining multivariate polynomials. Even though no optimality guarantees can be given (e.g. in terms of volume maximization for bounded sets), the algorithm is designed to preserve convex boundaries as much as possible, while removing regions with concave boundaries. In particular, the algorithm leaves invariant a given convex set. The algorithm is based on Gloptipoly 3, a public-domain Matlab package solving nonconvex polynomial optimization problems with the help of convex semidefinite programming (optimization over linear matrix inequalities, or LMIs). We illustrate how the algorithm can be used to design fixed-order controllers for linear systems, following a polynomial approach