21,801 research outputs found
Event-Triggered Estimation of Linear Systems: An Iterative Algorithm and Optimality Properties
This report investigates the optimal design of event-triggered estimation for
first-order linear stochastic systems. The problem is posed as a two-player
team problem with a partially nested information pattern. The two players are
given by an estimator and an event-trigger. The event-trigger has full state
information and decides, whether the estimator shall obtain the current state
information by transmitting it through a resource constrained channel. The
objective is to find an optimal trade-off between the mean squared estimation
error and the expected transmission rate. The proposed iterative algorithm
alternates between optimizing one player while fixing the other player. It is
shown that the solution of the algorithm converges to a linear predictor and a
symmetric threshold policy, if the densities of the initial state and the noise
variables are even and radially decreasing functions. The effectiveness of the
approach is illustrated on a numerical example. In case of a multimodal
distribution of the noise variables a significant performance improvement can
be achieved compared to a separate design that assumes a linear prediction and
a symmetric threshold policy
Value of Information in Feedback Control
In this article, we investigate the impact of information on networked
control systems, and illustrate how to quantify a fundamental property of
stochastic processes that can enrich our understanding about such systems. To
that end, we develop a theoretical framework for the joint design of an event
trigger and a controller in optimal event-triggered control. We cover two
distinct information patterns: perfect information and imperfect information.
In both cases, observations are available at the event trigger instantly, but
are transmitted to the controller sporadically with one-step delay. For each
information pattern, we characterize the optimal triggering policy and optimal
control policy such that the corresponding policy profile represents a Nash
equilibrium. Accordingly, we quantify the value of information
as the variation in the cost-to-go of the system given
an observation at time . Finally, we provide an algorithm for approximation
of the value of information, and synthesize a closed-form suboptimal triggering
policy with a performance guarantee that can readily be implemented
Optimal Causal Rate-Constrained Sampling for a Class of Continuous Markov Processes
Consider the following communication scenario. An encoder observes a stochastic process and causally decides when and what to transmit about it, under a constraint on bits transmitted per second. A decoder uses the received codewords to causally estimate the process in real time. The encoder and the decoder are synchronized in time. We aim to find the optimal encoding and decoding policies that minimize the end-to-end estimation mean-square error under the rate constraint. For a class of continuous Markov processes satisfying regularity conditions, we show that the optimal encoding policy transmits a 1-bit codeword once the process innovation passes one of two thresholds. The optimal decoder noiselessly recovers the last sample from the 1-bit codewords and codeword-generating time stamps, and uses it as the running estimate of the current process, until the next codeword arrives. In particular, we show the optimal causal code for the Ornstein-Uhlenbeck process and calculate its distortion-rate function
Performance analysis with network-enhanced complexities: On fading measurements, event-triggered mechanisms, and cyber attacks
Copyright © 2014 Derui Ding 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.Nowadays, the real-world systems are usually subject to various complexities such as parameter uncertainties, time-delays, and nonlinear disturbances. For networked systems, especially large-scale systems such as multiagent systems and systems over sensor networks, the complexities are inevitably enhanced in terms of their degrees or intensities because of the usage of the communication networks. Therefore, it would be interesting to (1) examine how this kind of network-enhanced complexities affects the control or filtering performance; and (2) develop some suitable approaches for controller/filter design problems. In this paper, we aim to survey some recent advances on the performance analysis and synthesis with three sorts of fashionable network-enhanced complexities, namely, fading measurements, event-triggered mechanisms, and attack behaviors of adversaries. First, these three kinds of complexities are introduced in detail according to their engineering backgrounds, dynamical characteristic, and modelling techniques. Then, the developments of the performance analysis and synthesis issues for various networked systems are systematically reviewed. Furthermore, some challenges are illustrated by using a thorough literature review and some possible future research directions are highlighted.This work was supported in part by the National Natural Science Foundation of China under Grants 61134009, 61329301, 61203139, 61374127, and 61374010, the Royal Society of the UK, and the Alexander von Humboldt Foundation of Germany
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
- …