Engineering PapersSearch

Engineering topics

Sideris, Athanasios

Publications and source records attributed to Sideris, Athanasios.

Robustness analysis for real parametric uncertainty

Some key results in the literature in the area of robustness analysis for linear feedback systems with structured model uncertainty are reviewed. Some new results are given. Model uncertainty is described as a combination of real uncertain parameters and norm bounded unmodeled dynamics. Here the focus is on the case of parametric uncertainty. An elementary and unified derivation of the celebrated theorem of Kharitonov and the Edge Theorem is presented. Next, an algorithmic approach for robustness analysis in the cases of multilinear and polynomic parametric uncertainty (i.e., the closed loop characteristic polynomial depends multilinearly and polynomially respectively on the parameters) is given. The latter cases are most important from practical considerations. Some novel modifications in this algorithm which result in a procedure of polynomial time behavior in the number of uncertain parameters is outlined. Finally, it is shown how the more general problem of robustness analysis for combined parametric and dynamic (i.e., unmodeled dynamics) uncertainty can be reduced to the case of polynomic parametric uncertainty, and thus be solved by means of the algorithm.

Sideris, Athanasios

A polynomial time algorithm for checking the robust stability of a polytope of polynomials

An efficient algorithm to check the robust stability of a polytope of polynomials is proposed. This problem is equivalent to a zero-exclusion condition at each frequency. It is shown that such a condition has to be checked at only a finite number of frequencies. This problem is formulated as a parametric linear program, which can be solved by the simplex procedure with additional computations between steps, consisting of polynomial evaluations and calculation of positive polynomial roots. The algorithm requires a finite number of steps (corresponding to frequency checks), and, in the important case of the polytope of parameters being a hypercube, this number is at most O(m3n), where n is the degree of the polynomials in the family and m is the number of parameters.

Sideris, Athanasios

Robustness margin calculation with dynamic and real parametric uncertainty

The problem of robust stability in feedback control systems with real uncertain parameters and unmodeled dynamics, where the latter takes the form of one complex block dynamic uncertainty, is considered. A robustness margin Tm is defined with respect to such model uncertainty structure and robust stability is characterized in terms of it. An algorithm to calculate Tm and the closely related multivariable stability margin km and structured singular value mu measures of robust stability is developed. It is shown that other control problems, such as robust performance for real parametric uncertainty, can also be handled in this framework.

Sideris, Athanasios

Fast computation of the multivariable stability margin for real interrelated uncertain parameters

A novel algorithm for computing the multivariable stability margin for checking the robust stability of feedback systems with real parametric uncertainty is proposed. This method eliminates the need for the frequency search involved in another given algorithm by reducing it to checking a finite number of conditions. These conditions have a special structure, which allows a significant improvement on the speed of computations.

Sideris, Athanasios

Robustness with real parametric and structured complex uncertainty

The problem of robust stability and performance in feedback control systems with n real (possibly related) uncertain parameters and structured unmodeled dynamics (the latter taking the form of m complex blocks dynamic uncertainties) is considered. A robustness margin rm is defined with respect to such model uncertainty structure and an algorithm is developed to compute it. Robust stability and performance are characterized in terms of r sub m or the structured singular value mu. An iterative procedure using the above algorithm is given to compute tight bounds on k sub m and mu. These bounds are exact for the case m = 3 or less.

Pena, Ricardo S. Sanchez