A linear matrix inequality solution to the input covariance constraint control problem (original) (raw)
Related papers
Journal of Dynamic Systems, Measurement, and Control, 2015
In this paper, the input covariance constraint (ICC) control problem is solved by convex optimization subject to linear matrix inequalities (LMIs) constraints. The ICC control problem is an optimal control problem that is concerned to obtain the best output performance subject to multiple constraints on the input covariance matrices. The contribution of this paper is the characterization of the control synthesis LMIs used to solve the ICC control problem. Both continuous- and discrete-time problems are considered. To validate our scheme in real-world systems, ICC control based on convex optimization approach was used to control the position of an electronic throttle plate. The controller performance compared experimentally with a well-tuned base-line proportional-integral-derivative (PID) controller. Comparison results showed that not only better performance has been achieved but also the required control energy for the ICC controller is lower than that of the base-line controller.
Robust Input Covariance Constraint Control for Uncertain Polytopic Systems
Asian Journal of Control, 2015
In this paper, the robust input covariance constraint (ICC) control problem with polytopic uncertainty is solved using convex optimization with linear matrix inequality (LMI) approach. The ICC control problem is an optimal control problem that optimizes the output performance subjected to multiple constraints on the input covariance matrices. This control problem has significant practical implications when hard constraints need to be satisfied on control actuators. The contribution of this paper is the characterization of the control synthesis LMIs used to solve the robust ICC control problem for polytopic uncertain systems. Both continuous-and discrete-time systems are considered. Parameter-dependent and independent Lyapunov functions have been used for robust ICC controller synthesis. Numerical design examples are presented to illustrate the effectiveness of the proposed approach.
2015
In this paper, we study the minimal cost constrained input-output (I/O) and control configuration co-design problem. Given a linear time-invariant plant, where a collection of possible inputs and outputs is known a priori, we aim to determine the collection of inputs, outputs and communication among them incurring in the minimum cost, such that desired control performance, measured in terms of arbitrary pole-placement capability of the closed-loop system, is ensured. We show that this problem is NP-hard in general (in the size of the state space). However, the subclass of problems, in which the dynamic matrix is irreducible, is shown to be polynomially solvable and the corresponding algorithm is presented. In addition, under the same assumption, the same algorithm can be used to solve the minimal cost constrained I/O selection problem, and the minimal cost control configuration selection problem, individually. In order to illustrate the main results of this paper, some simulations are also provided.
Multiobjective output-feedback control via LMI optimization
Automatic Control, IEEE …, 1997
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 1 performance, H 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.
A two-step procedure for optimal constrained stabilization of linear continuous-time systems
21st Mediterranean Conference on Control and Automation, 2013
This paper considers the problem of constrained stabilization of linear continuous-time systems when a quadratic cost criterion is imposed in the design of the state feedback control law. The linear quadratic regulator (LQR) is solved under positivity constraint, which means that the resulting closed-loop systems are not only optimally stable, but also positive. We focus on the class of linear continuous-time positive systems (Metzlerian systems) and use the interesting properties of Metzler matrices to provide the necessary ingredients for the main results of the paper. A two-step procedure is proposed to solve the problem. First, some necessary and sufficient conditions are presented for the existence of controllers satisfying the Metzlerian constraint, and the constrained stabilization is solved using linear programming (LP) or linear matrix inequality (LMI). Second, a sufficient condition is outlined for the existence of a solution to maintain the positivity of the first step while achieving the optimality of LQR. Finally, the robustness of the design is analyzed and possible extension of the design is proposed for an uncertain interval systems. A numerical example is included to illustrate the procedure.
Computer algebra tailored to matrix inequalities in control
International Journal of Control, 2006
A major advance in linear systems theory over the last decade has been a formalism for converting systems problems to matrix inequalities. In this tutorial paper we describe computer algebra algorithms, methodology, and implementation which allows users to convert many systems problems to Linear Matrix Inequalities (LMIs). We shall focus on computer algebra methodology which can assist with user in producing LMIs for control design. We provide a step-by-step computer derivation of LMI formulas for the design of linear time-invariant dynamic controllers that achieve a prespecified performance measured by the H ∞ norm of a certain closed loop transfer function.