Parameter-Dependent Lyapunov Functions for Linear Systems With Constant Uncertainties

Robust stability of linear time-invariant systems with respect to structured uncertainties is considered. The small gain condition is sufficient to prove robust stability and scalings are typically used to reduce the conservatism of this condition. It is known that if the small gain condition is satisfied with constant scalings then there is a single quadratic Lyapunov function which proves robust stability with respect to all allowable time-varying perturbations. In this technical note we show that if the small gain condition is satisfied with frequency-varying scalings then an explicit parameter dependent Lyapunov function can be constructed to prove robust stability with respect to constant uncertainties. This Lyapunov function has a rational quadratic dependence on the uncertainties

A new solution approach to polynomial LPV system analysis and synthesis

Based on sum-of-squares (SOS) decomposition, we propose a new solution approach for polynomial LPV system analysis and control synthesis problems. Instead of solving matrix variables over a positive definite cone, the SOS approach tries to find a suitable decomposition to verify the positiveness of given polynomials. The complexity of the SOS-based numerical method is polynomial of the problem size. This approach also leads to more accurate solutions to LPV systems than most existing relaxation methods. Several examples have been used to demonstrate benefits of the SOS-based solution approach

Memory Resilient Gain-scheduled State-Feedback Control of Uncertain LTI/LPV Systems with Time-Varying Delays

The stabilization of uncertain LTI/LPV time delay systems with time varying delays by state-feedback controllers is addressed. At the difference of other works in the literature, the proposed approach allows for the synthesis of resilient controllers with respect to uncertainties on the implemented delay. It is emphasized that such controllers unify memoryless and exact-memory controllers usually considered in the literature. The solutions to the stability and stabilization problems are expressed in terms of LMIs which allow to check the stability of the closed-loop system for a given bound on the knowledge error and even optimize the uncertainty radius under some performance constraints; in this paper, the $\mathcal{H}_\infty$ performance measure is considered. The interest of the approach is finally illustrated through several examples

Gain-scheduled H∞ control via parameter-dependent Lyapunov functions

Synthesising a gain-scheduled output feedback H∞ controller via parameter-dependent Lyapunov functions for linear parameter-varying (LPV) plant models involves solving an infinite number of linear matrix inequalities (LMIs). In practice, for affine LPV models, a finite number of LMIs can be achieved using convexifying techniques. This paper proposes an alternative approach to achieve a finite number of LMIs. By simple manipulations on the bounded real lemma inequality, a symmetric matrix polytope inequality can be formed. Hence, the LMIs need only to be evaluated at all vertices of such a symmetric matrix polytope. In addition, a construction technique of the intermediate controller variables is also proposed as an affine matrix-valued function in the polytopic coordinates of the scheduled parameters. Computational results on a numerical example using the approach were compared with those from a multi-convexity approach in order to demonstrate the impacts of the approach on parameter-dependent Lyapunov-based stability and performance analysis. Furthermore, numerical simulation results show the effectiveness of these proposed techniques

Average-cost based robust structural control

A method is presented for the synthesis of robust controllers for linear time invariant structural systems with parameterized uncertainty. The method involves minimizing quantities related to the quadratic cost (H2-norm) averaged over a set of systems described by real parameters such as natural frequencies and modal residues. Bounded average cost is shown to imply stability over the set of systems. Approximations for the exact average are derived and proposed as cost functionals. The properties of these approximate average cost functionals are established. The exact average and approximate average cost functionals are used to derive dynamic controllers which can provide stability robustness. The robustness properties of these controllers are demonstrated in illustrative numerical examples and tested in a simple SISO experiment on the MIT multi-point alignment testbed

On delayed genetic regulatory networks with polytopic uncertainties: Robust stability analysis

Copyright [2008] IEEE. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Brunel University's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.In this paper, we investigate the robust asymptotic stability problem of genetic regulatory networks with time-varying delays and polytopic parameter uncertainties. Both cases of differentiable and nondifferentiable time-delays are considered, and the convex polytopic description is utilized to characterize the genetic network model uncertainties. By using a Lyapunov functional approach and linear matrix inequality (LMI) techniques, the stability criteria for the uncertain delayed genetic networks are established in the form of LMIs, which can be readily verified by using standard numerical software. An important feature of the results reported here is that all the stability conditions are dependent on the upper and lower bounds of the delays, which is made possible by using up-to-date techniques for achieving delay dependence. Another feature of the results lies in that a novel Lyapunov functional dependent on the uncertain parameters is utilized, which renders the results to be potentially less conservative than those obtained via a fixed Lyapunov functional for the entire uncertainty domain. A genetic network example is employed to illustrate the applicability and usefulness of the developed theoretical results

A review of convex approaches for control, observation and safety of linear parameter varying and Takagi-Sugeno systems

This paper provides a review about the concept of convex systems based on Takagi-Sugeno, linear parameter varying (LPV) and quasi-LPV modeling. These paradigms are capable of hiding the nonlinearities by means of an equivalent description which uses a set of linear models interpolated by appropriately defined weighing functions. Convex systems have become very popular since they allow applying extended linear techniques based on linear matrix inequalities (LMIs) to complex nonlinear systems. This survey aims at providing the reader with a significant overview of the existing LMI-based techniques for convex systems in the fields of control, observation and safety. Firstly, a detailed review of stability, feedback, tracking and model predictive control (MPC) convex controllers is considered. Secondly, the problem of state estimation is addressed through the design of proportional, proportional-integral, unknown input and descriptor observers. Finally, safety of convex systems is discussed by describing popular techniques for fault diagnosis and fault tolerant control (FTC).Peer ReviewedPostprint (published version

Robust Region-of-Attraction Estimation

We propose a method to compute invariant subsets of the region-of-attraction for asymptotically stable equilibrium points of polynomial dynamical systems with bounded parametric uncertainty. Parameter-independent Lyapunov functions are used to characterize invariant subsets of the robust region-of-attraction. A branch-and-bound type refinement procedure reduces the conservatism. We demonstrate the method on an example from the literature and uncertain controlled short-period aircraft dynamics