Exact Minimum Number of Bits to Stabilize a Linear System

DOI10.1109/TAC.2021.3126679MaRDI QIDQ6077115zbMATH OpenOpenAlexFDO

Authors Victoria Kostina, Gireeja Ranade, Yuval Peres, Mark Sellke

Publication date 24 September 2023

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

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

zbMATH Keywords

data rate theoremlinear stochastic controlsource coding

Mathematics Subject Classification ID

Systems theory; control (93-XX)

Abstract: We consider an unstable scalar linear stochastic system, $X_{n+1}=a{X}_n+Z_n-U_n$, where $ageq1$ is the system gain, $Z_n$'s are independent random variables with bounded $alpha$-th moments, and $U_n$'s are the control actions that are chosen by a controller who receives a single element of a finite set $1,ldots,M$ as its only information about system state $X_i$. We show new proofs that $M>a$ is necessary and sufficient for $$-moment stability, for any $$. Our achievable scheme is a uniform quantizer of the zoom-in / zoom-out type that codes over multiple time instants for data rate efficiency; the controller uses its memory of the past to correctly interpret the received bits. We analyze its performance using probabilistic arguments. We show a simple proof of a matching converse using information-theoretic techniques. Our results generalize to vector systems, to systems with dependent Gaussian noise, and to the scenario in which a small fraction of transmitted messages is lost.

This page was built for publication: Exact Minimum Number of Bits to Stabilize a Linear System

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