Prefix-Free Coding for LQG Control
Prefix-Free Coding for LQG Control
复制标题
LQG 控制的无前缀编码
DOI：
10.48550/arxiv.2204.00588
复制
发表时间：
2022
期刊：
影响因子：
--
通讯作者：
R. Heath
中科院分区：
文献类型：
--
作者：
Travis C. Cuvelier;Takashi Tanaka;R. Heath
在这项工作中，我们开发的量化和可变长度的源编解码器的反馈环节的线性二次高斯（LQG）控制系统。我们证明，对于任何固定的控制性能，我们提出的方法几乎达到了在以前的工作中已经建立的通信成本的下限。特别是，我们改进了对经典可验证性方法的分析，着眼于更实际的细节。值得注意的是，在先前的文献中，用于证明这些下限的（近）可扩展性的源编解码器通常被隐含地假设为是时变的。对于SISO植物，我们证明了它足以考虑时不变量化和源编码。这一结果来自于分析系统的量化测量和重建误差的长期随机行为。据我们所知，这个时不变的可分辨性结果是文献中的第一个。
In this work, we develop quantization and variable-length source codecs for the feedback links in linear–quadratic–Gaussian (LQG) control systems. We prove that for any fixed control performance, the approaches we propose nearly achieve lower bounds on communication cost that have been established in prior work. In particular, we refine the analysis of a classical achievability approach with an eye towards more practical details. Notably, in the prior literature the source codecs used to demonstrate the (near) achievability of these lower bounds are often implicitly assumed to be time-varying. For SISO plants, we prove that it suffices to consider time-invariant quantization and source coding. This result follows from analyzing the long-term stochastic behavior of the system’s quantized measurements and reconstruction errors. To our knowledge, this time-invariant achievability result is the first in the literature.
影响因子：
3.9
作者：
H. Jung;A. Pedram;Travis C. Cuvelier;Takashi Tanaka
通讯作者：
H. Jung;A. Pedram;Travis C. Cuvelier;Takashi Tanaka