21 research outputs found
Structural Completeness of a Multi-channel Linear System with Dependent Parameters
It is well known that the "fixed spectrum" {i.e., the set of fixed modes} of
a multi-channel linear system plays a central role in the stabilization of such
a system with decentralized control. A parameterized multi-channel linear
system is said to be "structurally complete" if it has no fixed spectrum for
almost all parameter values. Necessary and sufficient algebraic conditions are
presented for a multi-channel linear system with dependent parameters to be
structurally complete. An equivalent graphical condition is also given for a
certain type of parameterization
On the interaction structure of linear multi-input feedback control systems
The closely-related problems of designing reliable feedback stabilization strategy and coordinating decentralized feedbacks are considered. Two approaches are taken. A geometric characterization of the structure of control interaction (and its dual) was first attempted and a concept of structural homomorphism developed based on the idea of 'similarity' of interaction pattern. The idea of finding classes of individual feedback maps that do not 'interfere' with the stabilizing action of each other was developed by identifying the structural properties of nondestabilizing and LQ-optimal feedback maps. Some known stability properties of LQ-feedback were generalized and some partial solutions were provided to the reliable stabilization and decentralized feedback coordination problems. A concept of coordination parametrization was introduced, and a scheme for classifying different modes of decentralization (information, control law computation, on-line control implementation) in control systems was developed
Optimization-based Robustness and Stabilization in Decentralized Control
This dissertation pertains to the stabilization, robustness, and optimization of Finite Dimensional Linear Time Invariant (FDLTI) decentralized control systems. We study these concepts for FDLTI systems subject to decentralizations that emerge from imposing sparsity constraints on the controller. While these concepts are well-understood in absence of an information structure, they continue to raise fundamental interesting questions regarding an optimal controller, or on suitable notions of robustness in presence of information structures.
Two notions of stabilizability with respect to decentralized controllers are considered. First, the seminal result of Wang & Davison in 1973 regarding internal stabilizability of perfectly decentralized system and its connection to the decentralized fixed-modes of the plant is revisited. This seminal result would be generalized to any arbitrary sparsity-induced information structure by providing an inductive proof that verifies and shows that those mode of the plant that are fixed with respect to the static controllers would remain fixed with respect to the dynamic ones. A constructive proof is also provided to show that one can move any non-fixed mode of the plant to any arbitrary location within desired accuracy provided that they remain symmetric in the complex plane. A synthesizing algorithm would then be derived from the inductive proof.
A second stronger notion of stability referred to as "non-overshooting stability" is then addressed. A key property called "feedthrough consistency" is derived, that when satisfied, makes extension of the centralized results to the decentralized case possible.
Synthesis of decentralized controllers to optimize an H_Infinity norm for model-matching problems is considered next. This model-matching problem corresponds to an infinite-dimensional convex optimization problem. We study a finite-dimensional parametrization, and show that once the poles are chosen for this parametrization, the remaining problem of coefficient optimization can be cast as a semidefinite program (SDP). We further demonstrate how to use first-order methods when the SDP is too large or when a first-order method is otherwise desired. This leaves the remaining choice of poles, for which we develop and discuss several methods to better select the most effective poles among many candidates, and to systematically improve their location using convex optimization techniques.
Controllability of LTI systems with decentralized controllers is then studied. Whether an LTI system is controllable (by LTI controllers) with respect to a given information structure can be determined by testing for fixed modes, but this gives a binary answer with no information about robustness. Measures have already been developed to determine how far a system is from having a fixed mode when one considers complex or real perturbations to the state-space matrices. These measures involve intractable minimizations of a non-convex singular value over a power-set, and hence cannot be computed except for the smallest of the plants. We replace these problem by equivalent optimization problems that involve a binary vector rather than the power-set minimization and prove their equality. Approximate forms are also provided that would upper bound the original metrics, and enable us to utilize MINLP techniques to derive scalable upper bounds. We also show that we can formulate lower bounds for these measures as polynomial optimization problems,and then use sum-of-squares methods to obtain a sequence of SDPs, whose solutions would lower bound these metrics
Optimal control with structure constraints and its application to the design of passive mechanical systems
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Mechanical Engineering; and, (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2002.Page 214 blank.Includes bibliographical references.Structured control (static output feedback, reduced-order control, and decentralized feedback) is one of the most important open problems in control theory and practice. In this thesis, various techniques for synthesis of structured controllers are surveyed and investigated, including H2 optimization, H[infinity] optimization, L1 control, eigenvalue and eigenstructure treatment, and multiobjective control. Unstructured control-full- state feedback and full-order control-is also discussed. Riccati-based synthesis, linear matrix inequalities (LMI), homotopy methods, gradient- and subgradientbased optimization are used. Some new algorithms and extensions are proposed, such as a subgradient-based method to maximize the minimal damping with structured feedback, a multiplier method for structured optimal H2 control with pole regional placement, and the LMI-based H2/H[infinity]/pole suboptimal synthesis with static output feedback. Recent advances in related areas are comprehensively surveyed and future research directions are suggested. In this thesis we cast the parameter optimization of passive mechanical systems as a decentralized control problem in state space, so that we can apply various decentralized control techniques to the parameter design which might be very hard traditionally. More practical constraints for mechanical system design are considered; for example, the parameters are restricted to be nonnegative, symmetric, or within some physically-achievable ranges. Marginally statable systems and hysterically damped systems are also discussed. Numerical examples and experimental results are given to illustrate the successful application of decentralized control techniques to the design of passive mechanical systems, such as multi-degree-of-freedom tuned-mass dampers, passive vehicle suspensions, and others.by Lei Zuo.S.M
Optimal Control with Information Pattern Constraints
Despite the abundance of available literature that starts with the seminal paper of Wang and Davison almost forty years ago, when dealing with the problem of decentralized control for linear dynamical systems, one faces a surprising lack of
general design methods, implementable via computationally tractable algorithms.
This is mainly due to the fact that for decentralized control configurations, the classical control theoretical framework falls short in providing a systematic analysis
of the stabilization problem, let alone cope with additional optimality criteria.
Recently, a significant leap occurred through the theoretical machinery developed in Rotkowitz and Lall, IEEE-TAC, vol. 51, 2006, pp. 274-286 which unifies and consolidates many previous results, pinpoints certain tractable decentralized control structures, and outlines the most general known class of convex problems in
decentralized control. The decentralized setting is modeled via the structured sparsity constraints paradigm, which proves to be a simple and effective way to formalize many decentralized configurations where the controller feature a given sparsity pattern. Rotkowitz and Lall propose a computationally tractable algorithm for the design of H2 optimal, decentralized controllers for linear and time invariant systems, provided that the plant is strongly stabilizable. The method is built on the assumption that the sparsity constraints imposed on the controller satisfy a certain
condition (named quadratic invariance) with respect to the plant and that some decentralized, strongly stablizable, stabilizing controller is available beforehand.
For this class of decentralized feedback configurations modeled via sparsity constraints, so called quadratically invariant, we provided complete solutions to several open problems. Firstly, the strong stabilizability assumption was removed via
the so called coordinate free parametrization of all, sparsity constrained controllers.
Next we have addressed the unsolved problem of stabilizability/stabilization via sparse controllers, using a particular form of the celebrated Youla parametrization.
Finally, a new result related to the optimal disturbance attenuation problem in the presence of stable plant perturbations is presented. This result is also valid for quadratically invariant, decentralized feedback configurations. Each result provides a computational, numerically tractable algorithm which is meaningful in the
synthesis of sparsity constrained optimal controllers
Recommended from our members
The approximate determinantal assignment problem
The Determinantal Assignment Problem (DAP) is one of the central problems of Algebraic Control Theory and refers to solving a system of non-linear algebraic equations to place the critical frequencies of the system to specied locations. This problem is decomposed into a linear and a multi-linear subproblem and the solvability of the problem is reduced to an intersection of a linear variety with the Grassmann variety. The linear subproblem can be solved with standard methods of linear algebra, whereas the intersection problem is a problem within the area of algebraic geometry. One of the methods to deal with this problem is to solve the linear problem and then and which element of this linear space is closer - in terms of a metric - to the Grassmann variety. If the distance is zero then a solution for the intersection problem is found, otherwise we get an approximate solution for the problem, which is referred to as the approximate DAP. In this thesis we examine the second case by introducing a number of new tools for the calculation of the minimum distance of a given parametrized multi-vector that describes the linear variety implied by the linear subproblem, from the Grassmann variety as well as the decomposable vector that realizes this least distance, using constrained optimization techniques and other alternative methods, such as the SVD properties of the so called Grassmann matrix, polar decompositions and mother tools. Furthermore, we give a number of new conditions for the appropriate nature of the approximate polynomials which are implied by the approximate solutions based on stability radius results. The approximate DAP problem is completely solved in the 2-dimensional case by examining uniqueness and non-uniqueness (degeneracy) issues of the decompositions, expansions to constrained minimization over more general varieties than the original ones (Generalized Grassmann varieties), derivation of new inequalities that provide closed-form non-algorithmic results and new stability radii criteria that test if the polynomial implied by the approximate solution lies within the stability domain of the initial polynomial. All results are compared with the ones that already exist in the respective literature, as well as with the results obtained by Algebraic Geometry Toolboxes, e.g., Macaulay 2. For numerical implementations, we examine under which conditions certain manifold constrained algorithms, such as Newton's method for optimization on manifolds, could be adopted to DAP and we present a new algorithm which is ideal for DAP approximations. For higher dimensions, the approximate solution is obtained via a new algorithm that decomposes the parametric tensor which is derived by the system of linear equations we mentioned before
Stability of periodic systems and Floquet Theory
Una breve analisi della stabilitĂ di un sistema periodico e del Teorema di Floque
Technology for large space systems: A bibliography with indexes (supplement 10)
The bibliography lists 408 reports, articles and other documents introduced into the NASA scientific and technical information system to provide helpful information to the researcher, manager, and designer in technology development and mission design in the area of large space system technology. Subject matter is grouped according to systems, interactive analysis and design, structural and thermal analysis and design, structural concepts and control systems, electronics, advanced materials, assembly concepts, propulsion, and solar power satellite systems