Numerical approximation of the data-rate limit for state estimation under communication constraints

From MaRDI portal
Publication:2633355

DOI10.1016/J.JMAA.2019.01.022zbMATH Open1415.93017arXiv1804.04432OpenAlexW2963415188WikidataQ128583479 ScholiaQ128583479MaRDI QIDQ2633355FDOQ2633355

Christoph Kawan, Sigurdur Hafstein

Publication date: 8 May 2019

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Abstract: In networked control, a fundamental problem is to determine the smallest capacity of a communication channel between a dynamical system and a controller above which a prescribed control objective can be achieved. Often, a preliminary task of the controller, before selecting the control input, is to estimate the state with a sufficient accuracy. For time-invariant systems, it has been shown that the smallest channel capacity C0 above which the state can be estimated with an arbitrarily small error, depending on the precise formulation of the estimation objective, is given by the topological entropy or a quantity named restoration entropy, respectively. In this paper, we propose an algorithm that computes rigorous upper bounds of C0, based on previous analytical estimates.


Full work available at URL: https://arxiv.org/abs/1804.04432




Recommendations




Cites Work


Cited In (13)

Uses Software





This page was built for publication: Numerical approximation of the data-rate limit for state estimation under communication constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2633355)