A new beampattern synthesis formulation is proposed to compute the minimum number of array sensors required. In order to satisfy all the prescribed specifications of the beampattern, the proposed method imposes linear matrix inequality (LMI) constraints on the beampattern as developed by Davidson et al., which remove the need to discretize the beampattern region. As the proposed formulation is ...

We study the boundary of the region of weighted analytic centers for linear matrix inequality constraints. Let be the convex subset of R defined by q simultaneous linear matrix inequalities (LMIs) A(x) := A 0 + n ∑ i=1 xiA (j) i 0, j = 1, 2, . . . , q, where A i are symmetric matrices and x ∈ R. Given a strictly positive vector ω = (ω1, ω2, . . . , ωq), the weighted analytic center xac(ω) is th...

The problem of anti-windup design for PID controllers using linear matrix inequalities is examined. R esum e Dans ce papier, on consid ere la conception d'un contr^ olleur PID \anti-windup" a partir des in egalit es matricielles lin eaires.

This paper deals with the consensus control of a multi-agent system with state and measurement disturbances, and proposes a distributed dynamic output feedback protocol. By defining an appropriate controlled output, the consensus control problem is reformulated as an H∞ control problem. Using H∞ techniques, a sufficient condition in terms of linear matrix inequalities (LMIs) is given to ensure ...

In this paper, we address the dynamic output feedback control problem of continuous time active fault tolerant control system with Markovian parameters (AFTCSMP). We will first derive a necessary and sufficient condition for the exponential stability in the mean square of the AFTCSMP under a dynamic output feedback control, in terms of coupled matrix inequalities, and then we will give an LMI (...

The primary disadvantage of current design techriiques for xriodel predictive control (MPC) is their inability to deal explicitly with plant model uncertainty. In this paper, we present a new approacli for robust MPC synthesis which allows explicit irlcorporation of the description of pla,nt uricertainty in the problem formulation. The uncertainty is expressed both in the time domain and the fr...

The Fisher informatin matrix IX of a random vector X appears as useful information theoretic tool to describe the proppagation of information through systems. For instance, it is directly involved in the derivation of the Entropy Power Inequality (EPI), that describes the evolution of the entropy of random variables (vectors) submitted to linear transformations. The first results about informat...

The problems of testing the feasibility of a system of linear inequalities, or strict inequalities, are wellknown to be the most fundamental problems in the theory and practice of linear programming. From Gordan’s Theorem it follows that Ax < b is feasible if and only if the homogeneous problem ATy = 0, bTy + s = 0, (0, 0) / = (y, s) (0, 0), is infeasible. We prove a stronger result: if Ax < b ...

Control system models must often explicitly incorporate in them “uncertainties”, which model a number of factors, including: dynamics that are neglected to make the model tractable, as with large scale structures; nonlinearities that are either hard to model or too complicated; and parameters that are not known exactly, either because they are hard to measure or because of varying manufacturing...

This paper presents an algorithm for finding feasible solutions of linear matrix inequalities. The algorithm is based on the method of alternating projections (MAP), a classical method for solving convex feasibility problems. Unlike MAP, which is an iterative method that converges asymptotically to a feasible point, the algorithm converges after a finite number of steps. The key computational c...