Distributed Robustness Analysis of Interconnected Uncertain Systems Using Chordal Decomposition

Large-scale interconnected uncertain systems commonly have large state and uncertainty dimensions. Aside from the heavy computational cost of solving centralized robust stability analysis techniques, privacy requirements in the network can also introduce further issues. In this paper, we utilize IQC analysis for analyzing large-scale interconnected uncertain systems and we evade these issues by describing a decomposition scheme that is based on the interconnection structure of the system. This scheme is based on the so-called chordal decomposition and does not add any conservativeness to the analysis approach. The decomposed problem can be solved using distributed computational algorithms without the need for a centralized computational unit. We further discuss the merits of the proposed analysis approach using a numerical experiment.Comment: 3 figures. Submitted to the 19th IFAC world congres

A structure exploiting SDP solver for robust controller synthesis

In this paper, we revisit structure exploiting SDP solvers dedicated to the solution of Kalman-Yakubovic-Popov semi-definite programs (KYP-SDPs). These SDPs inherit their name from the KYP Lemma and they play a crucial role in e.g. robustness analysis, robust state feedback synthesis, and robust estimator synthesis for uncertain dynamical systems. Off-the-shelve SDP solvers require $O(n^6)$ arithmetic operations per Newton step to solve this class of problems, where $n$ is the state dimension of the dynamical system under consideration. Specialized solvers reduce this complexity to $O(n^3)$. However, existing specialized solvers do not include semi-definite constraints on the Lyapunov matrix, which is necessary for controller synthesis. In this paper, we show how to include such constraints in structure exploiting KYP-SDP solvers.Comment: Submitted to Conference on Decision and Control, copyright owned by iee

Distributed Robust Stability Analysis of Interconnected Uncertain Systems

This paper considers robust stability analysis of a large network of interconnected uncertain systems. To avoid analyzing the entire network as a single large, lumped system, we model the network interconnections with integral quadratic constraints. This approach yields a sparse linear matrix inequality which can be decomposed into a set of smaller, coupled linear matrix inequalities. This allows us to solve the analysis problem efficiently and in a distributed manner. We also show that the decomposed problem is equivalent to the original robustness analysis problem, and hence our method does not introduce additional conservativeness.Comment: This paper has been accepted for presentation at the 51st IEEE Conference on Decision and Control, Maui, Hawaii, 201

Convex Identifcation of Stable Dynamical Systems

This thesis concerns the scalable application of convex optimization to data-driven modeling of dynamical systems, termed system identi cation in the control community. Two problems commonly arising in system identi cation are model instability (e.g. unreliability of long-term, open-loop predictions), and nonconvexity of quality-of- t criteria, such as simulation error (a.k.a. output error). To address these problems, this thesis presents convex parametrizations of stable dynamical systems, convex quality-of- t criteria, and e cient algorithms to optimize the latter over the former. In particular, this thesis makes extensive use of Lagrangian relaxation, a technique for generating convex approximations to nonconvex optimization problems. Recently, Lagrangian relaxation has been used to approximate simulation error and guarantee nonlinear model stability via semide nite programming (SDP), however, the resulting SDPs have large dimension, limiting their practical utility. The rst contribution of this thesis is a custom interior point algorithm that exploits structure in the problem to signi cantly reduce computational complexity. The new algorithm enables empirical comparisons to established methods including Nonlinear ARX, in which superior generalization to new data is demonstrated. Equipped with this algorithmic machinery, the second contribution of this thesis is the incorporation of model stability constraints into the maximum likelihood framework. Speci - cally, Lagrangian relaxation is combined with the expectation maximization (EM) algorithm to derive tight bounds on the likelihood function, that can be optimized over a convex parametrization of all stable linear dynamical systems. Two di erent formulations are presented, one of which gives higher delity bounds when disturbances (a.k.a. process noise) dominate measurement noise, and vice versa. Finally, identi cation of positive systems is considered. Such systems enjoy substantially simpler stability and performance analysis compared to the general linear time-invariant iv Abstract (LTI) case, and appear frequently in applications where physical constraints imply nonnegativity of the quantities of interest. Lagrangian relaxation is used to derive new convex parametrizations of stable positive systems and quality-of- t criteria, and substantial improvements in accuracy of the identi ed models, compared to existing approaches based on weighted equation error, are demonstrated. Furthermore, the convex parametrizations of stable systems based on linear Lyapunov functions are shown to be amenable to distributed optimization, which is useful for identi cation of large-scale networked dynamical systems

Receding-horizon switched linear system design: a semidefinite programming approach with distributed computation

This dissertation presents a framework for analysis and controller synthesis problems for switched linear systems. These are multi-modal systems whose parameters vary within a finite set according to the state of a discrete time automaton; the switching signal may be unconstrained or may be drawn from a language of admissible switching signals. This model of system dynamics and discrete logic has many applications in a number of engineering contexts. A receding-horizon type approach is taken by designing controllers with access to a finite-length preview of future modes and finite memory of past modes; the length of both preview and memory are taken as design choices. The results developed here take the form of nested sequences of SDP feasibility problems. These conditions are exact in that the feasibility of any element of the sequence is sufficient to construct a suitable controller, while the existence of a suitable controller necessitates the feasibility of some element of the sequence. Considered first is the problem of controller synthesis for the stabilization of switched systems. These developments serve both as a control problem of interest and a demonstration of the methods used to solve subsequent switched control problems. Exact conditions for the existence of a controller are developed, along with converse results which rule out levels of closed-loop stability based on the infeasibility of individual SDP problems. This permits the achievable closed-loop performance level to be approximated to arbitrary accuracy. Examined next are two different performance problems: one of disturbance attenuation and one of windowed variance. For each problem, controller synthesis conditions are presented exactly in the form of SDP feasibility problems which may be optimized to determine levels of performance. In both cases, the performance level may be taken as uniform or allowed to vary based on the switching path encountered. The controller synthesis conditions presented here can grow both large and computationally intensive, but they share a common structural sparsity which may be exploited. The last part of this dissertation examines this structure and presents a distributed approach to solving such problems. This maintains the tractability of these results even at large scales, expanding the scope of systems to which these methods can be applied