Event-Triggered State Estimation: An Iterative Algorithm and Optimality Properties

Abstract

This paper investigates the optimal design of event-triggered estimation for linear systems. The synthesis approach is posed as a team decision problem where the decision makers are given by the event-trigger and the estimator. The event-trigger decides upon its available measurements whether the estimator shall obtain the current state information by transmitting it through a resource constrained channel. The objective is to find the optimal trade-off between the mean square estimation error and the expected number of transmissions over a finite horizon. After deriving basic characteristics of the optimal solution, we propose an iterative algorithm that alternates between optimizing one decision maker while fixing the other and vice versa. By analyzing the dynamical behavior of the iterative method, it is shown that the algorithm converges to a symmetric threshold policy for first-order systems if the statistics of the uncertainties are even and unimodal. In the case of bimodal distributions, we show numerically that the iterative method may find asymmetric threshold policies that outperform symmetric rules. Index TermsEvent-triggered state estimation, Networked control systems, Distributed decision making, Team optimality A. Molin is with the

Remote Estimation Over a Packet-Drop Channel With Markovian State

“…Several variations of the above model have been considered in the literature. Models with noiseless communication channels have been considered in [1]- [6]. Since the channel is noiseless, these papers assume that there are only two power levels: power level 0, which corresponds to not transmitting; and power level 1, which corresponds to transmitting.…”

Optimal Causal Rate-Constrained Sampling for a Class of Continuous Markov Processes

“…The causal sampling and estimation policies that achieve the optimal tradeoff between the sampling frequency and the distortion have been studied for the following discrete-time processes: the i.i.d process [1]; the Gauss-Markov process [2]; the partially observed Gauss-Markov process [3]; and, the first-order autoregressive Markov process X t+1 = aX t + V t driven by an i.i.d. process {V t } with unimodal and even distribution [4] [5]. The first-order autoregressive Markov process considered in [4][5] represents a discrete-time counterpart of the continuous-time process in (5) with q(t, s) = a t−s , R(t, s, τ ) = X t − a t−s X s .…”

Optimal Causal Rate-Constrained Sampling of the Wiener Process

“…The causal sampling and estimation policies that achieve the optimal tradeoff between the sampling frequency and the distortion have been studied for the following discrete-time processes: the i.i.d process [1]; the Gauss-Markov process [2]; the partially observed Gauss-Markov process [3]; and, the first-order autoregressive Markov process X t+1 = aX t + V t driven by an i.i.d. process {V t } with unimodal and even distribution [4] [5]. The first-order autoregressive Markov process considered in [4][5] represents a discrete-time counterpart of the continuous-time process in (5) with q(t, s) = a t−s , R(t, s, τ ) = X t − a t−s X s .…”

“…process {V t } with unimodal and even distribution [4] [5]. The first-order autoregressive Markov process considered in [4][5] represents a discrete-time counterpart of the continuous-time process in (5) with q(t, s) = a t−s , R(t, s, τ ) = X t − a t−s X s . Chakravorty and Mahajan [4] showed that a threshold sampling policy with two constant thresholds and an innovation-based filter jointly minimize a discounted cost function consisting of the MSE and a transmission cost in the infinite time horizon.…”