Analysis of Implicit Uncertain Systems. Part II: Constant Matrix Problems and Application to Robust H2 Analysis

This paper introduces an implicit framework for the analysis of uncertain systems, of which the general properties were described in Part I. In Part II, the theory is specialized to problems which admit a finite dimensional formulation. A constant matrix version of implicit analysis is presented, leading to a generalization of the structured singular value μ as the stability measure; upper bounds are developed and analyzed in detail. An application of this framework results in a practical method for robust H2 analysis: computing robust performance in the presence of norm-bounded perturbations and white-noise disturbances

Robust ℋ2 Performance: Guaranteeing Margins for LQG Regulators

This paper shows that ℋ2 (LQG) performance specifications can be combined with structured uncertainty in the system, yielding robustness analysis conditions of the same nature and computational complexity as the corresponding conditions for ℋ∞ performance. These conditions are convex feasibility tests in terms of Linear Matrix Inequalities, and can be proven to be necessary and sufficient under the same conditions as in the ℋ∞ case. With these results, the tools of robust control can be viewed as coming full circle to treat the problem where it all began: guaranteeing margins for LQG regulators

Robust Stability Analysis of Sparsely Interconnected Uncertain Systems

In this paper, we consider robust stability analysis of large-scale sparsely interconnected uncertain systems. By modeling the interconnections among the subsystems with integral quadratic constraints, we show that robust stability analysis of such systems can be performed by solving a set of sparse linear matrix inequalities. We also show that a sparse formulation of the analysis problem is equivalent to the classical formulation of the robustness analysis problem and hence does not introduce any additional conservativeness. The sparse formulation of the analysis problem allows us to apply methods that rely on efficient sparse factorization techniques, and our numerical results illustrate the effectiveness of this approach compared to methods that are based on the standard formulation of the analysis problem.Comment: Provisionally accepted to appear in IEEE Transactions on Automatic Contro

Model-Reference Adaptive Control of Distributed Lagrangian Infinite-Dimensional Systems Using Hamiltons Principle

This paper presents a Hamilton's principle for distributed control of infinite-dimensional systems modeled by a distributed form of the Euler-Lagrange method. The distributed systems are governed by a system of linear partial differential equations in space and time. A generalized potential energy expression is developed that can capture most physical systems including those systems that have no spatial distribution. The Hamilton's principle is applied to derive distributed feedback control methods without resorting to the standard weak-form discretization approach to convert an infinite-dimensional systems to a finite-dimensional systems. It can be shown by the principle of least action that the distributed control synthesized by the Hamilton's principle is a minimum-norm control. A model-reference adaptive control framework is developed for distributed Lagrangian systems in the presence of uncertainty. The theory is demonstrated by an application of adaptive flutter suppression control of a flexible aircraft wing

Sets and Constraints in the Analysis Of Uncertain Systems

This thesis is concerned with the analysis of dynamical systems in the presence of model uncertainty. The approach of robust control theory has been to describe uncertainty in terms of a structured set of models, and has proven successful for questions, like stability, which call for a worst-case evaluation over this set. In this respect, a first contribution of this thesis is to provide robust stability tests for the situation of combined time varying, time invariant and parametric uncertainties. The worst-case setting has not been so attractive for questions of disturbance rejection, since the resulting performance criteria (e.g., ℋ∞,) treat the disturbance as an adversary and ignore important spectral structure, usually better characterized by the theory of stochastic processes. The main contribution of this thesis is to show that the set-based methodology can indeed be extended to the modeling of white noise, by employing standard statistical tests in order to identify a typical set, and performing subsequent analysis in a worst-case setting. Particularly attractive sets are those described by quadratic signal constraints, which have proven to be very powerful for the characterization of unmodeled dynamics. The combination of white noise and unmodeled dynamics constitutes the Robust ℋ2 performance problem, which is rooted in the origins of robust control theory. By extending the scope of the quadratic constraint methodology we obtain a solution to this problem in terms of a convex condition for robustness analysis, which for the first time places it on an equal footing with the ℋ∞ performance measure. A separate contribution of this thesis is the development of a framework for analysis of uncertain systems in implicit form, in terms of equations rather than input-output maps. This formulation is motivated from first principles modeling, and provides an extension of the standard input-output robustness theory. In particular, we obtain in this way a standard form for robustness analysis problems with constraints, which also provides a common setting for robustness analysis and questions of model validation and system identification

System Level Synthesis

This article surveys the System Level Synthesis framework, which presents a novel perspective on constrained robust and optimal controller synthesis for linear systems. We show how SLS shifts the controller synthesis task from the design of a controller to the design of the entire closed loop system, and highlight the benefits of this approach in terms of scalability and transparency. We emphasize two particular applications of SLS, namely large-scale distributed optimal control and robust control. In the case of distributed control, we show how SLS allows for localized controllers to be computed, extending robust and optimal control methods to large-scale systems under practical and realistic assumptions. In the case of robust control, we show how SLS allows for novel design methodologies that, for the first time, quantify the degradation in performance of a robust controller due to model uncertainty -- such transparency is key in allowing robust control methods to interact, in a principled way, with modern techniques from machine learning and statistical inference. Throughout, we emphasize practical and efficient computational solutions, and demonstrate our methods on easy to understand case studies.Comment: To appear in Annual Reviews in Contro