M. Chilali

Bio: M. Chilali is an academic researcher from French Institute for Research in Computer Science and Automation. The author has contributed to research in topics: Linear matrix inequality & Linear system. The author has an hindex of 10, co-authored 12 publications receiving 7774 citations.

Multiobjective output-feedback control via LMI optimization

Abstract: This paper presents an overview of a linear matrix inequality (LMI) approach to the multiobjective synthesis of linear output-feedback controllers. The design objectives can be a mix of H/sub /spl infin// performance, H/sub 2/ performance, passivity, asymptotic disturbance rejection, time-domain constraints, and constraints on the closed-loop pole location. In addition, these objectives can be specified on different channels of the closed-loop system. When all objectives are formulated in terms of a common Lyapunov function, controller design amounts to solving a system of linear matrix inequalities. The validity of this approach is illustrated by a realistic design example.

H/sub /spl infin// design with pole placement constraints: an LMI approach

Abstract: This paper addresses the design of state- or output-feedback H/sub /spl infin// controllers that satisfy additional constraints on the closed-loop pole location. Sufficient conditions for feasibility are derived for a general class of convex regions of the complex plane. These conditions are expressed in terms of linear matrix inequalities (LMIs), and the authors' formulation is therefore numerically tractable via LMI optimization. In the state-feedback case, mixed H/sub 2//H/sub /spl infin// synthesis with regional pole placement is also discussed. Finally, the validity and applicability of this approach are illustrated by a benchmark example.

The LMI control toolbox

Abstract: This paper describes a new MATLAB-based toolbox for control design via linear matrix inequality (LMI) techniques. After a brief review of LMIs and of some of their applications to control, the toolbox contents and capabilities are presented. >

Affine parameter-dependent Lyapunov functions and real parametric uncertainty

Abstract: This paper presents new tests to analyze the robust stability and/or performance of linear systems with uncertain real parameters. These tests are extensions of the notions of quadratic stability and performance where the fixed quadratic Lyapunov function is replaced by a Lyapunov function with affine dependence on the uncertain parameters. Admittedly with some conservatism, the construction of such parameter-dependent Lyapunov functions can be reduced to a linear matrix inequality (LMI) problem and hence is numerically tractable. These LMI-based tests are applicable to constant or time-varying uncertain parameters and are less conservative than quadratic stability in the case of slow parametric variations. They also avoid the frequency sweep needed in real-/spl mu/ analysis, and numerical experiments indicate that they often compare favorably with /spl mu/ analysis for time-invariant parameter uncertainty.

Robust pole placement in LMI regions

Abstract: Discusses analysis and synthesis techniques for robust pole placement in linear matrix inequality (LMI) regions, a class of convex regions of the complex plane that embraces most practically useful stability regions. The focus is on linear systems with static uncertainty on the state matrix. For this class of uncertain systems, the notion of quadratic stability and the related robustness analysis tests are generalized to arbitrary LMI regions. The resulting tests for robust pole clustering are all numerically tractable because they involve solving linear matrix inequalities (LMIs) and cover both unstructured and parameter uncertainty. These analysis results are then applied to the synthesis of dynamic output-feedback controllers that robustly assign the closed-loop poles in a prescribed LMI region. With some conservatism, this problem is again tractable via LMI optimization. In addition, robust pole placement can be combined with other control objectives, such as H/sub 2/ or H/sub /spl infin// performance, to capture realistic sets of design specifications. Physically motivated examples demonstrate the effectiveness of this robust pole clustering technique.

Semidefinite programming

Abstract: In semidefinite programming, one minimizes a linear function subject to the constraint that an affine combination of symmetric matrices is positive semidefinite. Such a constraint is nonlinear and nonsmooth, but convex, so semidefinite programs are convex optimization problems. Semidefinite programming unifies several standard problems (e.g., linear and quadratic programming) and finds many applications in engineering and combinatorial optimization. Although semidefinite programs are much more general than linear programs, they are not much harder to solve. Most interior-point methods for linear programming have been generalized to semidefinite programs. As in linear programming, these methods have polynomial worst-case complexity and perform very well in practice. This paper gives a survey of the theory and applications of semidefinite programs and an introduction to primaldual interior-point methods for their solution.

Essentials of Robust Control

Abstract: 1. Introduction. 2. Linear Algebra. 3. Linear Systems. 4. H2 and Ha Spaces. 5. Internal Stability. 6. Performance Specifications and Limitations. 7. Balanced Model Reduction. 8. Uncertainty and Robustness. 9. Linear Fractional Transformation. 10. m and m- Synthesis. 11. Controller Parameterization. 12. Algebraic Riccati Equations. 13. H2 Optimal Control. 14. Ha Control. 15. Controller Reduction. 16. Ha Loop Shaping. 17. Gap Metric and ...u- Gap Metric. 18. Miscellaneous Topics. Bibliography. Index.

Fuzzy Control Systems Design and Analysis: A Linear Matrix Inequality Approach

Abstract: From the Publisher: A comprehensive treatment of model-based fuzzy control systems This volume offers full coverage of the systematic framework for the stability and design of nonlinear fuzzy control systems. Building on the Takagi-Sugeno fuzzy model, authors Tanaka and Wang address a number of important issues in fuzzy control systems, including stability analysis, systematic design procedures, incorporation of performance specifications, numerical implementations, and practical applications. Issues that have not been fully treated in existing texts, such as stability analysis, systematic design, and performance analysis, are crucial to the validity and applicability of fuzzy control methodology. Fuzzy Control Systems Design and Analysis addresses these issues in the framework of parallel distributed compensation, a controller structure devised in accordance with the fuzzy model. This balanced treatment features an overview of fuzzy control, modeling, and stability analysis, as well as a section on the use of linear matrix inequalities (LMI) as an approach to fuzzy design and control. It also covers advanced topics in model-based fuzzy control systems, including modeling and control of chaotic systems. Later sections offer practical examples in the form of detailed theoretical and experimental studies of fuzzy control in robotic systems and a discussion of future directions in the field. Fuzzy Control Systems Design and Analysis offers an advanced treatment of fuzzy control that makes a useful reference for researchers and a reliable text for advanced graduate students in the field.

Multiobjective output-feedback control via LMI optimization

Abstract: This paper presents an overview of a linear matrix inequality (LMI) approach to the multiobjective synthesis of linear output-feedback controllers. The design objectives can be a mix of H/sub /spl infin// performance, H/sub 2/ performance, passivity, asymptotic disturbance rejection, time-domain constraints, and constraints on the closed-loop pole location. In addition, these objectives can be specified on different channels of the closed-loop system. When all objectives are formulated in terms of a common Lyapunov function, controller design amounts to solving a system of linear matrix inequalities. The validity of this approach is illustrated by a realistic design example.

Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization

Abstract: In the first part of this thesis, we introduce a specific class of Linear Matrix Inequalities (LMI) whose optimal solution can be characterized exactly. This family corresponds to the case where the associated linear operator maps the cone of positive semidefinite matrices onto itself. In this case, the optimal value equals the spectral radius of the operator. It is shown that some rank minimization problems, as well as generalizations of the structured singular value ($mu$) LMIs, have exactly this property. In the same spirit of exploiting structure to achieve computational efficiency, an algorithm for the numerical solution of a special class of frequency-dependent LMIs is presented. These optimization problems arise from robustness analysis questions, via the Kalman-Yakubovich-Popov lemma. The procedure is an outer approximation method based on the algorithms used in the computation of hinf norms for linear, time invariant systems. The result is especially useful for systems with large state dimension. The other main contribution in this thesis is the formulation of a convex optimization framework for semialgebraic problems, i.e., those that can be expressed by polynomial equalities and inequalities. The key element is the interaction of concepts in real algebraic geometry (Positivstellensatz) and semidefinite programming. To this end, an LMI formulation for the sums of squares decomposition for multivariable polynomials is presented. Based on this, it is shown how to construct sufficient Positivstellensatz-based convex tests to prove that certain sets are empty. Among other applications, this leads to a nonlinear extension of many LMI based results in uncertain linear system analysis. Within the same framework, we develop stronger criteria for matrix copositivity, and generalizations of the well-known standard semidefinite relaxations for quadratic programming. Some applications to new and previously studied problems are presented. A few examples are Lyapunov function computation, robust bifurcation analysis, structured singular values, etc. It is shown that the proposed methods allow for improved solutions for very diverse questions in continuous and combinatorial optimization.