H∞ Mixed Sensitivity Minimization for Stable Infinite-Dimensional Plants Subject to Convex Constraints

نویسندگان

  • Oguzhan Cifdaloz
  • Armando A. Rodriguez
چکیده

This paper shows how convex optimization may be used to design near-optimal finite-dimensional compensators for stable linear time invariant (LTI) infinite dimensional plants. The infinite dimensional plant is approximated by a finite dimensional transfer function matrix. The Youla parameterization is used to parameterize the set of all stabilizing LTI controllers and formulate a weighted mixedsensitivity H∞ optimization that is convex in the Youla QParameter. A finite-dimensional (real-rational) stable basis is used to approximate the Q-parameter. By so doing, we transform the associated optimization problem from an infinite dimensional optimization problem involving a search over stable real-rational transfer function matrices in H∞ to a finite-dimensional optimization problem involving a search over a finite-dimensional space. In addition to solving weighted mixed sensitivity H∞ control system design problems, it is shown how subgradient concepts may be used to directly accommodate time-domain specifications (e.g. peak value of control action) in the design process. As such, we provide a systematic design methodology for a large class of infinitedimensional plant control system design problems. In short, the approach taken permits a designer to address control system design problems for which no direct method exists. Illustrative examples are provided.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Title Stable H ∞ Controller Design for Infinite - Dimensional Systemsvia Interpolation

H∞ control is well appreciated as a powerful design methodology against system uncertainty. It has been playing an important role in the field of robust control. For infinite-dimensional systems such as time-delay systems, H∞ control problems have been under extensive study since the mid-1980s. On the other hand, stable controller design known as strong stabilization is also an important issue ...

متن کامل

Computation of H ∞ controllers for infinite dimensional plants using numerical linear algebra

The mixed sensitivity minimization problem is revisited for a class of single-input-single-output unstable infinite dimensional plants with low order weights. It is shown that H1 controllers can be computed from the singularity conditions of a parameterized matrix whose dimension is the same as the order of the sensitivity weight. The result is applied to the design of H1 controllers with integ...

متن کامل

Convex Generalized Semi-Infinite Programming Problems with Constraint Sets: Necessary Conditions

 We consider generalized semi-infinite programming problems in which the index set of the inequality constraints depends on the decision vector and all emerging functions are assumed to be convex. Considering a lower level constraint qualification, we derive a formula for estimating the subdifferential of the value function. Finally, we establish the Fritz-John necessary optimality con...

متن کامل

A Hamiltonian-based solution to the mixed sensitivity optimization problem for stable pseudorational plants

This paper considers the mixed sensitivity optimization problem for a class of infinite-dimensional stable plants. This problem is reducible to a twoor one-block H∞ control problem with structured weighting functions. We first show that these weighting functions violate the genericity assumptions of existing Hamiltonian-based solutions such as the well-known Zhou–Khargonekar formula. Then, we d...

متن کامل

Subdifferentials of Value Functions and Optimality Conditions for Some Classes of Dc and Bilevel Infinite and Semi-infinite Programs

The paper concerns the study of new classes of parametric optimization problems of the so-called infinite programming that are generally defined on infinite-dimensional spaces of decision variables and contain, among other constraints, infinitely many of inequality constraints. These problems reduce to semi-infinite programs in the case of finite-dimensional spaces of decision variables. We foc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005