Harmonic-Copuled Riccati Equations and its Applications in Distributed Filtering

The coupled Riccati equations are cosisted of multiple Riccati-like equations with solutions coupled with each other, which can be applied to depict the properties of more complex systems such as markovian systems or multi-agent systems. This paper manages to formulate and investigate a new kind of coupled Riccati equations, called harmonic-coupled Riccati equations (HCRE), from the matrix iterative law of the consensus on information-based distributed filtering (CIDF) algortihm proposed in [1], where the solutions of the equations are coupled with harmonic means. Firstly, mild conditions of the existence and uniqueness of the solution to HCRE are induced with collective observability and primitiviness of weighting matrix. Then, it is proved that the matrix iterative law of CIDF will converge to the unique solution of the corresponding HCRE, hence can be used to obtain the solution to HCRE. Moreover, through applying the novel theory of HCRE, it is pointed out that the real estimation error covariance of CIDF will also become steady-state and the convergent value is simplified as the solution to a discrete time Lyapunov equation (DLE). Altogether, these new results develop the theory of the coupled Riccati equations, and provide a novel perspective on the performance analysis of CIDF algorithm, which sufficiently reduces the conservativeness of the evaluation techniques in the literature. Finally, the theoretical results are verified with numerical experiments.Comment: 14 pages, 4 figure

Controle amostrado ótimo de sistemas lineares com saltos markovianos através de realimentação de estados

Orientador: José Cláudio GeromelTese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Elétrica e de ComputaçãoResumo: Este trabalho é inteiramente dedicado ao desenvolvimento de uma lei de controle ótimo amostrado aplicada a sistemas lineares com saltos markovianos, cujo principal uso são os sistemas controlados através da rede (NCS - Networked Control System). Neste contexto, duas características da rede são consideradas simultaneamente: a limitação da largura de banda, tratada através da existência de sinais amostrados no sistema, e a perda de pacotes, modelada através de uma cadeia de Markov a tempo contínuo. A fim de alcançar este objetivo, a abordagem geral adotada é dividida em quatro etapas: análise de estabilidade e cálculo de norma no contexto da norma H2; análise de estabilidade e cálculo de norma no contexto da norma Hoo; projeto de controle amostrado ótimo que minimiza o índice de desempenho J2 baseado na norma H2, o qual pode ser expresso em uma formulação convexa baseada em LMIs; projeto de controle amostrado ótimo que minimiza um certo índice de desempenho Joo baseado na norma Hoo, o qual também admite uma formulação convexa baseada em LMI, embora uma análise matemática mais aprofundada seja necessária. Cada uma destas etapas possui a mesma estrutura descrita a seguir. Primeiro, os resultados teóricos são matematicamente desenvolvidos e provados. Segundo, alguns casos particulares são derivados a partir destes resultados teóricos. Terceiro, um algoritmo convergente é proposto para resolver cada um dos casos mencionados. As convergências também são provadas. Finalmente, um exemplo teórico ilustra os principais desenvolvimentos em cada caso. A teoria aqui desenvolvida é nova, não havendo resultado similar na literatura atual. Para uma visão prática dos resultados desta dissertação, três exemplos são considerados e adaptados de trabalhos disponíveis: dois deles correspondem a sistemas físicos controlados através de uma rede sendo um originalmente estável e o outro instável, e o terceiro corresponde a um sistema econômico cujas políticas de controle são aplicadas a tempo discretoAbstract: This work is entirely devoted to develop an optimal sampled-data control law applied to Markov jump linear systems, whose main usage is Networked Control Systems (NCS). In this context, two network characteristics are simultaneously considered: the bandwidth limitation addressed by the existence of sampled-data signals in the system, and the packet dropouts modeled by a continuous-time Markov chain. In order to accomplish this goal, the general adopted approach is broken in four steps: stability analysis and norm evaluation based on the H2 norm; stability analysis and norm evaluation in the Hoo context; the optimal sampled-data control design that minimizes a J2 performance index based on the H2 norm, which can be expressed in a convex formulation based on LMIs; the optimal sampled-data control design that minimizes a certain Joo performance index based on the Hoo norm, which also admits a convex formulation based on LMIs, even though a deeper mathematical analysis is required. Each step has the same structure described in the sequel. First, the theoretical results are mathematically developed and proved. Second, some particular cases are derived from these theoretical results. Third, a convergent algorithm is proposed to solve each of the mentioned cases. The convergence of the algorithms are also proved. Finally, a numerical example illustrates the main developments in each step. The theory developed here is new and there is no similar result in the current literature. For a practical view of the outcomes, three practical examples are borrowed and adapted from available works: two of them are physical systems controlled through an NCS, where one is originally stable and the other unstable, and the third one is an economical system whose policy is applied in a discrete-time basisDoutoradoAutomaçãoDoutora em Engenharia Elétrica2012/23634-2FAPES

A gradient-based iterative algorithm for solving coupled Lyapunov equations of continuous-time Markovian jump systems

In this paper, a new gradient-based iterative algorithm is proposed to solve the coupled Lyapunov matrix equations associated with continuous-time Markovian jump linear systems. A necessary and sufficient condition is established for the proposed gradient-based iterative algorithm to be convergent. In addition, the optimal value of the tunable parameter achieving the fastest convergence rate of the proposed algorithm is given explicitly. Finally, some numerical simulations are given to validate the obtained theoretical results

Efficient Numerical Solution of Large Scale Algebraic Matrix Equations in PDE Control and Model Order Reduction

Matrix Lyapunov and Riccati equations are an important tool in mathematical systems theory. They are the key ingredients in balancing based model order reduction techniques and linear quadratic regulator problems. For small and moderately sized problems these equations are solved by techniques with at least cubic complexity which prohibits their usage in large scale applications. Around the year 2000 solvers for large scale problems have been introduced. The basic idea there is to compute a low rank decomposition of the quadratic and dense solution matrix and in turn reduce the memory and computational complexity of the algorithms. In this thesis efficiency enhancing techniques for the low rank alternating directions implicit iteration based solution of large scale matrix equations are introduced and discussed. Also the applicability in the context of real world systems is demonstrated. The thesis is structured in seven central chapters. After the introduction chapter 2 introduces the basic concepts and notations needed as fundamental tools for the remainder of the thesis. The next chapter then introduces a collection of test examples spanning from easily scalable academic test systems to badly conditioned technical applications which are used to demonstrate the features of the solvers. Chapter four and five describe the basic solvers and the modifications taken to make them applicable to an even larger class of problems. The following two chapters treat the application of the solvers in the context of model order reduction and linear quadratic optimal control of PDEs. The final chapter then presents the extensive numerical testing undertaken with the solvers proposed in the prior chapters. Some conclusions and an appendix complete the thesis

Monetary policy with model uncertainty: distribution forecast targeting

We examine optimal and other monetary policies in a linear-quadratic setup with a relatively general form of model uncertainty, so-called Markov jump-linear-quadratic systems extended to include forward-looking variables. The form of model uncertainty our framework encompasses includes : simple i.i.d. model deviations; serially correlated model deviations; estimable regimeswitching models; more complex structural uncertainty about very different models, for instance, backward- and forward-looking models; time-varying central-bank judgment about the state of model uncertainty; and so forth. We provide an algorithm for finding the optimal policy as well as solutions for arbitrary policy functions. This allows us to compute and plot consistent distribution forecasts "fan charts" of target variables and instruments. Our methods hence extend certainty equivalence and "mean forecast targeting" to more general certainty non-equivalence and "distribution forecast targeting." --Optimal policy,multiplicative uncertainty

Discrete Time Systems

Discrete-Time Systems comprehend an important and broad research field. The consolidation of digital-based computational means in the present, pushes a technological tool into the field with a tremendous impact in areas like Control, Signal Processing, Communications, System Modelling and related Applications. This book attempts to give a scope in the wide area of Discrete-Time Systems. Their contents are grouped conveniently in sections according to significant areas, namely Filtering, Fixed and Adaptive Control Systems, Stability Problems and Miscellaneous Applications. We think that the contribution of the book enlarges the field of the Discrete-Time Systems with signification in the present state-of-the-art. Despite the vertiginous advance in the field, we also believe that the topics described here allow us also to look through some main tendencies in the next years in the research area