Control of large-scale dynamic systems by aggregation
TL;DR: Using the quantitative definition of weak coupling proposed by Milne, a suboptimal control policy for the weakly coupled system is derived and questions of performance degradation and of stability of such suboptimally controlled systems are answered.
Abstract: A method is proposed to obtain a model of a dynamic system with a state vector of high dimension. The model is derived by "aggregating" the original system state vector into a lower-dimensional vector. Some properties of the aggregation method are investigated in the paper. The concept of aggregation, a generalization of that of projection, is related to that of state vector partition and is useful not only in building a model of reduced dimension, but also in unifying several topics in the control theory such as regulators with incomplete state feedback, characteristic value computations, model controls, and bounds on the solution of the matrix Riccati equations, etc. Using the quantitative definition of weak coupling proposed by Milne, a suboptimal control policy for the weakly coupled system is derived. Questions of performance degradation and of stability of such suboptimally controlled systems are also answered in the paper.
Citations
More filters
28 Apr 1995
TL;DR: In the first part a full Pade approximation method for interval system is presented, where as in the second part stable Pades approximation is discussed.
Abstract: This paper presents model reduction of linear interval system using Pade approximation method. In the first part a full Pade approximation method for interval system is presented, where as in the second part stable Pade approximation is discussed. A numerical example illustrates the procedure.
22 citations
TL;DR: It is shown that it is possible to retain the predominant eigenvalues of the exact system in the lower order model that possesses the property that its state is an aggregation of the state variables of the original system.
Abstract: A method for reducing the order of a linear time-invariant dynamic system is presented. It is shown that it is possible to retain the predominant eigenvalues (or any other set of eigenvalues) of the exact system in the lower order model that possesses the property that its state is an aggregation of the state variables of the original system. Also it is shown that the output of the reduced order model can be constrained to contain all the modes of the exact output and to be close to the actual output of the original system within a specified tolerance. The performance of the original system is investigated for an optimal output regulator problem, when it is controlled on the assumption that its behavior is governed by that of the lower order model. Relations are obtained for the performance degradation that results with the above suboptimal control policy. Numerical examples show that the suboptimal control can be used in practice to lessen the computational complexity required for the higher order optimal control. The stability of the suboptimal control is not guaranteed; however, it is reasonable to expect it to be asymptotically stable when the order of reduction is not excessively high, because the outputs of the exact and lower order models are tolerably close.
22 citations
04 Dec 2001
TL;DR: This paper results in a hierarchy of linear abstractions that are equivalent from a stabilizability point of view as high level controller designs are guaranteed to have lower level implementations.
Abstract: Hierarchical decompositions of control systems are important for reducing the analysis and design of large scale systems. Such decompositions depend on the notion of abstraction: given a large scale system and a desired property, one tries to extract an abstracted model with equivalent properties, while ignoring details that are irrelevant. Checking the property on the abstraction should be equivalent to checking the property on the original system. In this paper, we focus on large scale linear systems and the property of stabilizability. This results in a hierarchy of linear abstractions that are equivalent from a stabilizability point of view. This is important as high level controller designs are guaranteed to have lower level implementations.
22 citations
Cites methods from "Control of large-scale dynamic syst..."
...This differentiates abstraction from more traditional model reduction techniques [1] which maintain the same input in the reduction process....
[...]
TL;DR: A method of system simplification by aggregation is proposed, based on the hypothesis of non-observability of conserved modes on the output error, which leads to a simple combinatorial algorithm of optimization.
21 citations
TL;DR: In this article, a multistage design scheme for determining an optimal control-moment-gyro momentum management and attitude-control system for the Space Station Freedom is presented.
Abstract: This paper presents a multistage design scheme for determining an optimal control-moment-gyro momentum-management and attitude-control system for the Space Station Freedom. The Space Station equations of motion are linearized and block-decomposed into two block-decoupled subsystems using the matrix-sign algorithm. A sequential procedure is utilized for designing a linear-quadratic regulator for each subsystem, which optimally places the eigenvalues of the closed-loop subsystem in the region of an open sector, bounded by lines inclined at + or - pi/2k (for k = 2 or 3) from the negative real axis, and the left-hand side of a line parallel to the imaginary axis in the s-plane. Simulation results are presented to compare the resultant designs.
21 citations
References
More filters
TL;DR: A technique is presented for the decomposition of a linear program that permits the problem to be solved by alternate solutions of linear sub-programs representing its several parts and a coordinating program that is obtained from the parts by linear transformations.
Abstract: A technique is presented for the decomposition of a linear program that permits the problem to be solved by alternate solutions of linear sub-programs representing its several parts and a coordinating program that is obtained from the parts by linear transformations. The coordinating program generates at each cycle new objective forms for each part, and each part generates in turn from its optimal basic feasible solutions new activities columns for the interconnecting program. Viewed as an instance of a “generalized programming problem” whose columns are drawn freely from given convex sets, such a problem can be studied by an appropriate generalization of the duality theorem for linear programming, which permits a sharp distinction to be made between those constraints that pertain only to a part of the problem and those that connect its parts. This leads to a generalization of the Simplex Algorithm, for which the decomposition procedure becomes a special case. Besides holding promise for the efficient computation of large-scale systems, the principle yields a certain rationale for the “decentralized decision process” in the theory of the firm. Formally the prices generated by the coordinating program cause the manager of each part to look for a “pure” sub-program analogue of pure strategy in game theory, which he proposes to the coordinator as best he can do. The coordinator finds the optimum “mix” of pure sub-programs using new proposals and earlier ones consistent with over-all demands and supply, and thereby generates new prices that again generates new proposals by each of the parts, etc. The iterative process is finite.
2,281 citations
01 Jan 1960
TL;DR: In this article, the authors considered the problem of least square feedback control in a linear time-invariant system with n states, and proposed a solution based on the concept of controllability.
Abstract: THIS is one of the two ground-breaking papers by Kalman that appeared in 1960—with the other one (discussed next) being the filtering and prediction paper. This first paper, which deals with linear-quadratic feedback control, set the stage for what came to be known as LQR (Linear-Quadratic-Regulator) control, while the combination of the two papers formed the basis for LQG (Linear-Quadratic-Gaussian) control. Both LQR and LQG control had major influence on researchers, teachers, and practitioners of control in the decades that followed. The idea of designing a feedback controller such that the integral of the square of tracking error is minimized was first proposed by Wiener [17] and Hall [8], and further developed in the influential book by Newton, Gould and Kaiser [12]. However, the problem formulation in this book remained unsatisfactory from a mathematical point of view, but, more importantly, the algorithms obtained allowed application only to rather low order systems and were thus of limited value. This is not surprising since it basically took until theH2-interpretation in the 1980s of LQG control before a satisfactory formulation of least squares feedback control design was obtained. Kalman’s formulation in terms of finding the least squares control that evolves from an arbitrary initial state is a precise formulation of the optimal least squares transient control problem. The paper introduced the very important notion of c ntrollability, as the possibility of transfering any initial state to zero by a suitable control action. It includes the necessary and sufficient condition for controllability in terms of the positive definiteness of the Controllability Grammian, and the fact that the linear time-invariant system withn states,
1,451 citations
TL;DR: A method is proposed for reducing large matrices by constructing a matrix of lower order which has the same dominant eigenvalues and eigenvectors as the original system.
Abstract: Often it is possible to represent physical systems by a number of simultaneous linear differential equations with constant coefficients, \dot{x} = Ax + r but for many processes (e.g., chemical plants, nuclear reactors), the order of the matrix A may be quite large, say 50×50, 100×100, or even 500×500. It is difficult to work with these large matrices and a means of approximating the system matrix by one of lower order is needed. A method is proposed for reducing such matrices by constructing a matrix of lower order which has the same dominant eigenvalues and eigenvectors as the original system.
614 citations
TL;DR: In this article, a constructive design procedure for the problem of estimating the state vector of a discrete-time linear stochastic system with time-invariant dynamics when certain constraints are imposed on the number of memory elements of the estimator is presented.
Abstract: The paper presents a constructive design procedure for the problem of estimating the state vector of a discrete-time linear stochastic system with time-invariant dynamics when certain constraints are imposed on the number of memory elements of the estimator. The estimator reconstructs the state vector exactly for deterministic systems while the steady-state performance in the stochastic case may be comparable to that obtained by the optimal (unconstrained) Wiener-Kalman filter.
68 citations
67 citations