Computation of algebraic combinations of uncertainty value sets

Author

Eszter, Edgardo G. ; Pena, Ricardo S.Sanchez

Author_Institution

Dept. of Electr. & Comput. Eng., Massachusetts Univ., Amherst, MA, USA

Volume

39

Issue

11

fYear

1994

fDate

11/1/1994 12:00:00 AM

Firstpage

2315

Lastpage

2318

Abstract

A robust analysis approach based on the computation of boundaries of uncertainty value sets is presented. The idea is to use the strongly connected subsystem separation and the tree structured decomposition (TSD) concept to extend the class of uncertainty structures to be considered. To this end we compute the exact boundaries of regions produced by operations (+, -, ×, ÷) among boundaries of simply connected value sets, in polynomial time, and without incrementing the total amount of input data. Parametric, dynamic or general multiply connected value set descriptions may be accommodated

Keywords

computational complexity; directed graphs; multivariable control systems; set theory; stability criteria; trees (mathematics); digraphs; dynamic uncertainty; exact boundaries; parametric uncertainty; polynomial time; robustness; strongly connected subsystem separation; tree structured decomposition; uncertainty structures; uncertainty value sets; Control system analysis; Control systems; Information analysis; Performance analysis; Polynomials; Robust control; Robust stability; Robustness; Stability analysis; Uncertainty;

fLanguage

English

Journal_Title

Automatic Control, IEEE Transactions on

Publisher

ieee

ISSN

0018-9286

Type

jour

DOI

10.1109/9.333784

Filename

333784