Event-triggered near optimal adaptive control of interconnected systems

Increased interest in complex interconnected systems like smart-grid, cyber manufacturing have attracted researchers to develop optimal adaptive control schemes to elicit a desired performance when the complex system dynamics are uncertain. In this dissertation, motivated by the fact that aperiodic event sampling saves network resources while ensuring system stability, a suite of novel event-sampled distributed near-optimal adaptive control schemes are introduced for uncertain linear and affine nonlinear interconnected systems in a forward-in-time and online manner. First, a novel stochastic hybrid Q-learning scheme is proposed to generate optimal adaptive control law and to accelerate the learning process in the presence of random delays and packet losses resulting from the communication network for an uncertain linear interconnected system. Subsequently, a novel online reinforcement learning (RL) approach is proposed to solve the Hamilton-Jacobi-Bellman (HJB) equation by using neural networks (NNs) for generating distributed optimal control of nonlinear interconnected systems using state and output feedback. To relax the state vector measurements, distributed observers are introduced. Next, using RL, an improved NN learning rule is derived to solve the HJB equation for uncertain nonlinear interconnected systems with event-triggered feedback. Distributed NN identifiers are introduced both for approximating the uncertain nonlinear dynamics and to serve as a model for online exploration. Next, the control policy and the event-sampling errors are considered as non-cooperative players and a min-max optimization problem is formulated for linear and affine nonlinear systems by using zero-sum game approach for simultaneous optimization of both the control policy and the event based sampling instants. The net result is the development of optimal adaptive event-triggered control of uncertain dynamic systems --Abstract, page iv

Observer Design for Interconnected Systems and Implementation via Differential-Algebraic Equations

A new approach to the design of observers of nonlinear dynamical systems is presented. Generally, linear or nonlinear control systems are expressed as explicit systems of differential equations and solved either analytically or numerically. If numerically, they are implemented using standard ordinary differential equation (ODE) solvers. In this thesis, a system is decomposed and modeled as an interconnection between two observer subsystems, particularly, as canonical DAE observers. In general, control design engineers may be faced with a formidable problem of solving this system analytically or in obtaining closed-form solutions. To attest to the complexity and complications in treating a system of interconnected DAE observer systems, a scaled-down version of a publication on “Small-Gain Theorem” is included in the appendix for the reader’s perusal. (A brief introduction to “Small-Gain Theorem” can be found in Chapter 4). The premise of this thesis is to demonstrate that, where the design of an observer plays a major role involving output feedback, there may be advantages in formulating a control system as a differential-algebraic equation (DAE), especially in the case of interconnected subsystems. An implicit system of interconnected DAE observers is considered and shown implementable using an existing DAE solver, whose resolution allows one the capability of computing input and output bounds. This is based on fixed or variable timesteps within the operating interval of each subsystem to ensure input-output stability (IOS) and the observability property of the interconnected observer system. The observer design method is based on the extended linearization approach. The basic background is provided for the design process of an interconnected observer system using DAE. Note, the application of the new approach has not been considered previously for the case of an interconnected DAE observer system

Interconnected Observers for Robust Decentralized Estimation with Performance Guarantees and Optimized Connectivity Graph

Motivated by the need of observers that are both robust to disturbances and guarantee fast convergence to zero of the estimation error, we propose an observer for linear time-invariant systems with noisy output that consists of the combination of N coupled observers over a connectivity graph. At each node of the graph, the output of these interconnected observers is defined as the average of the estimates obtained using local information. The convergence rate and the robustness to measurement noise of the proposed observer's output are characterized in terms of $\mathcal{KL}$ bounds. Several optimization problems are formulated to design the proposed observer so as to satisfy a given rate of convergence specification while minimizing the $H_\infty$ gain from noise to estimates or the size of the connectivity graph. It is shown that that the interconnected observers relax the well-known tradeoff between rate of convergence and noise amplification, which is a property attributed to the proposed innovation term that, over the graph, couples the estimates between the individual observers. Sufficient conditions involving information of the plant only, assuring that the estimate obtained at each node of the graph outperforms the one obtained with a single, standard Luenberger observer are given. The results are illustrated in several examples throughout the paper.Comment: The technical report accompanying "Interconnected Observers for Robust Decentralized Estimation with Performance Guarantees and Optimized Connectivity Graph" to be published in IEEE Transactions on Control of Network Systems, 201

An energy-based state observer for dynamical subsystems with inaccessible state variables

This work presents an energy-based state estimation formalism for a class of dynamical systems with inaccessible/ unknown outputs, and systems at which sensor utilization is impractical, or when measurements can not be taken. The power-conserving physical interconnections among most of the dynamical subsystems allow for power exchange through their power ports. Power exchange is conceptually considered as information exchange among the dynamical subsystems and further utilized to develop a natural feedback-like information from a class of dynamical systems with inaccessible/unknown outputs. This information is used in the design of an energybased state observer. Convergence stability of the estimation error for the proposed state observer is proved for systems with linear dynamics. Furthermore, robustness of the convergence stability is analyzed over a range of parameter deviation and model uncertainties. Experiments are conducted on a dynamical system with a single input and multiple inaccessible outputs (Fig. 1) to demonstrate the validity of the proposed energybased state estimation formalism

An Energy-Based State Observer for Dynamical Subsystems with Inaccessible State Variables

This work presents an energy-based state estimation formalism for a class of dynamical systems with inaccessible/ unknown outputs, and systems at which sensor utilization is impractical, or when measurements can not be taken. The power-conserving physical interconnections among most of the dynamical subsystems allow for power exchange through their power ports. Power exchange is conceptually considered as information exchange among the dynamical subsystems and further utilized to develop a natural feedback-like information from a class of dynamical systems with inaccessible/unknown outputs. This information is used in the design of an energybased state observer. Convergence stability of the estimation error for the proposed state observer is proved for systems with linear dynamics. Furthermore, robustness of the convergence stability is analyzed over a range of parameter deviation and model uncertainties. Experiments are conducted on a dynamical system with a single input and multiple inaccessible outputs (Fig. 1) to demonstrate the validity of the proposed energybased state estimation formalism

Time Complexity of Decentralized Fixed-Mode Verification

Given an interconnected system, this note is concerned with the time complexity of verifying whether an unrepeated mode of the system is a decentralized fixed mode (DFM). It is shown that checking the decentralized fixedness of any distinct mode is tantamount to testing the strong connectivity of a digraph formed based on the system. It is subsequently proved that the time complexity of this decision problem using the proposed approach is the same as the complexity of matrix multiplication. This work concludes that the identification of distinct DFMs (by means of a deterministic algorithm, rather than a randomized one) is computationally very easy, although the existing algorithms for solving this problem would wrongly imply that it is cumbersome. This note provides not only a complexity analysis, but also an efficient algorithm for tackling the underlying problem

Mathematical control of complex systems

Copyright © 2013 ZidongWang et al.This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited