Standard

Remote state estimation problem: Towards the data-rate limit along the avenue of the second Lyapunov method. / Kawan, Christoph; Матвеев, Алексей Серафимович; Погромский, Александр.

в: Automatica, Том 125, 109467, 03.2021.

Результаты исследований: Научные публикации в периодических изданияхстатьяРецензирование

Harvard

APA

Vancouver

Author

BibTeX

@article{f19b69c7da324ad4b33a6c6222d732de,
title = "Remote state estimation problem: Towards the data-rate limit along the avenue of the second Lyapunov method",
abstract = "In the context of control and estimation under information constraints, restoration entropy measures the minimal required data rate above which the state of a system can be estimated so that the estimation quality does not degrade over time and, conversely, can be improved. The remote observer here is assumed to receive its data through a communication channel of finite bit-rate capacity. In this paper, we provide a new characterization of the restoration entropy which does not require to compute any temporal limit, i.e., an asymptotic quantity. Our new formula is based on the idea of finding a specific Riemannian metric on the state space which makes the metric-dependent upper estimate of the restoration entropy as tight as one wishes.",
keywords = "Entropy, Finite bit-rates, First and second Lyapunov methods, Nonlinear systems, Remote state estimation",
author = "Christoph Kawan and Матвеев, {Алексей Серафимович} and Александр Погромский",
note = "Publisher Copyright: {\textcopyright} 2021 The Authors",
year = "2021",
month = mar,
doi = "10.1016/j.automatica.2020.109467",
language = "English",
volume = "125",
journal = "Automatica",
issn = "0005-1098",
publisher = "Elsevier",

}

RIS

TY - JOUR

T1 - Remote state estimation problem: Towards the data-rate limit along the avenue of the second Lyapunov method

AU - Kawan, Christoph

AU - Матвеев, Алексей Серафимович

AU - Погромский, Александр

N1 - Publisher Copyright: © 2021 The Authors

PY - 2021/3

Y1 - 2021/3

N2 - In the context of control and estimation under information constraints, restoration entropy measures the minimal required data rate above which the state of a system can be estimated so that the estimation quality does not degrade over time and, conversely, can be improved. The remote observer here is assumed to receive its data through a communication channel of finite bit-rate capacity. In this paper, we provide a new characterization of the restoration entropy which does not require to compute any temporal limit, i.e., an asymptotic quantity. Our new formula is based on the idea of finding a specific Riemannian metric on the state space which makes the metric-dependent upper estimate of the restoration entropy as tight as one wishes.

AB - In the context of control and estimation under information constraints, restoration entropy measures the minimal required data rate above which the state of a system can be estimated so that the estimation quality does not degrade over time and, conversely, can be improved. The remote observer here is assumed to receive its data through a communication channel of finite bit-rate capacity. In this paper, we provide a new characterization of the restoration entropy which does not require to compute any temporal limit, i.e., an asymptotic quantity. Our new formula is based on the idea of finding a specific Riemannian metric on the state space which makes the metric-dependent upper estimate of the restoration entropy as tight as one wishes.

KW - Entropy

KW - Finite bit-rates

KW - First and second Lyapunov methods

KW - Nonlinear systems

KW - Remote state estimation

UR - http://www.scopus.com/inward/record.url?scp=85099157849&partnerID=8YFLogxK

UR - https://www.mendeley.com/catalogue/f831fb49-184a-352c-b61f-19fec1c1d5d7/

U2 - 10.1016/j.automatica.2020.109467

DO - 10.1016/j.automatica.2020.109467

M3 - Article

VL - 125

JO - Automatica

JF - Automatica

SN - 0005-1098

M1 - 109467

ER -

ID: 87315703