40,027 research outputs found

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

    Get PDF
    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

    Contact variational integrators

    Get PDF
    We present geometric numerical integrators for contact flows that stem from a discretization of Herglotz' variational principle. First we show that the resulting discrete map is a contact transformation and that any contact map can be derived from a variational principle. Then we discuss the backward error analysis of our variational integrators, including the construction of a modified Lagrangian. Throughout the paper we use the damped harmonic oscillator as a benchmark example to compare our integrators to their symplectic analogues

    Signal Reconstruction via H-infinity Sampled-Data Control Theory: Beyond the Shannon Paradigm

    Get PDF
    This paper presents a new method for signal reconstruction by leveraging sampled-data control theory. We formulate the signal reconstruction problem in terms of an analog performance optimization problem using a stable discrete-time filter. The proposed H-infinity performance criterion naturally takes intersample behavior into account, reflecting the energy distributions of the signal. We present methods for computing optimal solutions which are guaranteed to be stable and causal. Detailed comparisons to alternative methods are provided. We discuss some applications in sound and image reconstruction

    On the Benefits of Surrogate Lagrangians in Optimal Control and Planning Algorithms

    Full text link
    This paper explores the relationship between numerical integrators and optimal control algorithms. Specifically, the performance of the differential dynamical programming (DDP) algorithm is examined when a variational integrator and a newly proposed surrogate variational integrator are used to propagate and linearize system dynamics. Surrogate variational integrators, derived from backward error analysis, achieve higher levels of accuracy while maintaining the same integration complexity as nominal variational integrators. The increase in the integration accuracy is shown to have a large effect on the performance of the DDP algorithm. In particular, significantly more optimized inputs are computed when the surrogate variational integrator is utilized
    corecore