Results 1  10
of
52
Applications Of Quantifier Elimination Theory To Control System Design
 IN 4TH IEEE MEDITERRANEAN SYMPOSIUM ON CONTROL AND AUTOMATION
, 1996
"... In this paper we show how a number of interesting linear control system analysis and design problems can be reduced to Quantifier Elimination (QE) problems. We assume a fixed structure for the compensator, with design parameters q i . The problems considered are problems that currently have no gene ..."
Abstract

Cited by 21 (4 self)
 Add to MetaCart
In this paper we show how a number of interesting linear control system analysis and design problems can be reduced to Quantifier Elimination (QE) problems. We assume a fixed structure for the compensator, with design parameters q i . The problems considered are problems that currently have no general solution. However, the problems must be of modest complexity if existing QE software packages are to produce answers. The software package QEPCAD is used to solve some numerical design examples.
Positive Polynomials and Robust Stabilization with FixedOrder Controllers
 IEEE Transactions on Automatic Control
, 2002
"... Recent results on positive polynomials are used to obtain a convex inner approximation of the stability domain in the space of coe#cients of a polynomial. An application to the design of fixedorder controllers robustly stabilizing a linear system subject to polytopic uncertainty is then proposed ..."
Abstract

Cited by 20 (13 self)
 Add to MetaCart
Recent results on positive polynomials are used to obtain a convex inner approximation of the stability domain in the space of coe#cients of a polynomial. An application to the design of fixedorder controllers robustly stabilizing a linear system subject to polytopic uncertainty is then proposed, based on LMI optimization.
An LMI Condition for Robust Stability of Polynomial Matrix Polytopes
, 2000
"... A sufficient LMI condition is proposed for checking robust stability of a polytope of polynomial matrices. It hinges upon two recent results: a new approach to polynomial matrix stability analysis and a new robust stability condition for convex polytopic uncertainty. Numerical experiments illustrate ..."
Abstract

Cited by 11 (9 self)
 Add to MetaCart
A sufficient LMI condition is proposed for checking robust stability of a polytope of polynomial matrices. It hinges upon two recent results: a new approach to polynomial matrix stability analysis and a new robust stability condition for convex polytopic uncertainty. Numerical experiments illustrate that the condition narrows significantly the unavoidable gap between conservative tractable quadratic stability results and exact NPhard robust stability results. Keywords Polynomial matrix, Parametric uncertainty, Robust stability, Quadratic stability, LMI. This work has been supported by the Barrande Project No. 97/00597/026, by the Grant Agency of the Czech Republic under contract No. 102/99/1368 and by the Ministry of Education of the Czech Republic under contract No. VS97/034. y Corresponding author. Email henrion@laas.fr. FAX 33 5 61 33 69 69. Introduction Polynomial matrices appear as a key tool for studying systems control. Dynamics of many systems (e.g. lightly damped st...
Ellipsoidal Approximation of the Stability Domain of a Polynomial
 Proceedings of the European Control Conference
, 2000
"... The stability region in the space of coefficients of a polynomial is a nonconvex region in general. In this paper, we propose a new convex ellipsoidal inner approximation of this region derived via optimization over linear matrix inequalities. As a byproduct, we obtain new simple sufficient cond ..."
Abstract

Cited by 8 (8 self)
 Add to MetaCart
The stability region in the space of coefficients of a polynomial is a nonconvex region in general. In this paper, we propose a new convex ellipsoidal inner approximation of this region derived via optimization over linear matrix inequalities. As a byproduct, we obtain new simple sufficient conditions for stability that may prove useful in robust control design. Keywords Polynomial, Stability, LMI. 1 Introduction Consider an nth degree monic polynomial x(s) = x 0 + x 1 s + \Delta \Delta \Delta + x n\Gamma1 s n\Gamma1 + s n : The problem of finding simple conditions in the ndimensional Euclidean space of real coefficients x 0 ; x 1 ; : : : ; x n\Gamma1 under which the roots of x(s) are located in a given region 1 Corresponding author. FAX: +33 5 61 33 69 69. Email: henrion@laas.fr 2 Laboratoire d'Analyse et d'Architecture des Syst`emes, Centre National de la Recherche Scientifique, 7 Avenue du Colonel Roche, 31 077 Toulouse, cedex 4, France. 3 Center for Applied Cy...
On inverse halftoning: computational complexity and interval computations
 John Hopkins University
, 2005
"... Abstract — We analyze the problem of inverse halftoning. This problem is a particular case of a class of difficulttosolve problems: inverse problems for reconstructing piecewise smooth images. We show that this general problem is NPhard. We also propose a new idea for solving problems of this ty ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Abstract — We analyze the problem of inverse halftoning. This problem is a particular case of a class of difficulttosolve problems: inverse problems for reconstructing piecewise smooth images. We show that this general problem is NPhard. We also propose a new idea for solving problems of this type, including the inverse halftoning problem. Need for halftoning I.
Fault diagnosis and fault tolerant control using set–membership approaches: application to real case studies
 Int. J. Appl. Math. Comput. Sci
"... This paper reviews the use of setmembership methods in fault diagnosis (FD) and fault tolerant control (FTC). Setmembership methods use a deterministic unknownbutbounded description of noise and parametric uncertainty (interval models). These methods aims at checking the consistency between obser ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
This paper reviews the use of setmembership methods in fault diagnosis (FD) and fault tolerant control (FTC). Setmembership methods use a deterministic unknownbutbounded description of noise and parametric uncertainty (interval models). These methods aims at checking the consistency between observed and predicted behaviour by using simple sets to approximate the exact set of possible behaviour (in the parameter or the state space). When an inconsistency is detected between the measured and predicted behaviours obtained using a faultless system model, a fault can be indicated. Otherwise, nothing can be stated. The same principle can be used to identify interval models for fault detection and to develop methods for fault tolerance evaluation. Finally, some real applications will be used to illustrate the usefulness and performance of setmembership methods for FD and FTC.
Robust stability of positive continuoustime linear systems with delays
 International Journal of Applied Mathematics and Computer Science 20(4): 665– 670, DOI
, 2010
"... The paper is devoted to the problem of robust stability of positive continuoustime linear systems with delays with structured perturbations of state matrices. Simple necessary and sufficient conditions for robust stability in the general case and in the case of systems with a linear uncertainty str ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
The paper is devoted to the problem of robust stability of positive continuoustime linear systems with delays with structured perturbations of state matrices. Simple necessary and sufficient conditions for robust stability in the general case and in the case of systems with a linear uncertainty structure in two subcases: (i) a unity rank uncertainty structure and (ii) nonnegative perturbation matrices are established. The problems are illustrated with numerical examples.
Robust SPR synthesis for loworder polynomial segments and interval polynomials
 Proceedings of the American Control Conference (ACC 2001), Crystal Gateway Marriott
, 2001
"... Abstract: We prove that, for loworder (n ≤ 4) stable polynomial segments or interval polynomials, there always exists a fixed polynomial such that their ratio is SPRinvariant, thereby providing a rigorous proof of Anderson’s claim on SPR synthesis for the fourthorder stable interval polynomials. ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Abstract: We prove that, for loworder (n ≤ 4) stable polynomial segments or interval polynomials, there always exists a fixed polynomial such that their ratio is SPRinvariant, thereby providing a rigorous proof of Anderson’s claim on SPR synthesis for the fourthorder stable interval polynomials. Moreover, the relationship between SPR synthesis for loworder polynomial segments and SPR synthesis for loworder interval polynomials is also discussed.
Symbolic Computation in Value Sets of Plants with Uncertain Parameters
 UKACC International conference on control '98
, 1998
"... This paper addresses the computation of frequency responses of plants with uncertain parameters using symbolic computation. A computationally tractable procedure is developed based on a Jocobianlike technique where a general uncertain structure including nonlinear can be dealt with. This proced ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
This paper addresses the computation of frequency responses of plants with uncertain parameters using symbolic computation. A computationally tractable procedure is developed based on a Jocobianlike technique where a general uncertain structure including nonlinear can be dealt with. This procedure is applied to computing the frequency responses of a vehicle clutch system and the longitudinal dynamics of an aircraft where the underlying uncertain parameters perturb both plants nonlinearly. The developed procedure is also compared with the currently widely used parameter gridding method. 1 Introduction It has long been identified that the solution of the generic problem of calculating the roots of an uncertain polynomial for all possible perturbation vectors, would be a break through in the analysis and design of uncertain systems. This motivates the computation of the value set of uncertain polynomials. Considerable attention has recently been attracted and many significant r...
On Applications Of Approximation Theory To Identification, Control And Classification
, 1995
"... iii List of Tables vii List of Figures viii Chapter 1. Introduction 1 1.1 Overview : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 1 Chapter 2. A Constructive Algorithm 4 2.1 Introduction : : : : : : : : : : : : : : : : : : : : : ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
iii List of Tables vii List of Figures viii Chapter 1. Introduction 1 1.1 Overview : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 1 Chapter 2. A Constructive Algorithm 4 2.1 Introduction : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 4 2.2 The algorithm : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 5 Chapter 3. Classifiers on Relatively Compact Sets 7 3.1 Introduction : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 7 3.2 Classification theorem : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 7 3.2.1 Comments : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 8 3.2.2 Example of C 0 : : : : : : : : : : : : : : : : : : : :...