跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2607.04172 · v2

Lower Bound of Networked Control with Multiple Sensors and One Controller And The Application to the Side Information Case

首次提交 2026-07-05 16:40
版本更新 2026-11-19 19:07
雷达观测 2026-11-20 19:57
arXiv ↗PDF ↗

摘要

This paper studies the tradeoff between the communication rate and the control performance for the Linear Quadratic Gaussian(LQG) plant with multiple sensors/encoders and one decoder/controller. Assuming the use of prefix codes for each encoder, we show a causally conditioned directed information lower bound and the sufficiency of a class of linear policies for optimizing this weighted sum lower bound with the full observation condition, reducing it to a finite-dimensional optimization problem. We then apply our analysis to the point-to-point case with side information(SI) at the decoder only, which can be viewed as an extreme case for the multi-encoder setting. We recover the structure result for the sequential rate-distortion function(SRDF) for the point-to-point case with SI. We further present semidefinite programming (SDP) formulations for a broader class of system parameters that recover the past forms as special cases, and show an equivalent single-letter SDP form for the infinite-horizon time-invariant system under certain conditions.

作者备注:partially presented at ISIT 2025,

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

本站首次收录为 v2,暂无更早版本可对照。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v2 · 2026-11-19 19:07 · 最新观测版本

Lower Bound of Networked Control with Multiple Sensors and One Controller And The Application to the Side Information Case

This paper studies the tradeoff between the communication rate and the control performance for the Linear Quadratic Gaussian(LQG) plant with multiple sensors/encoders and one decoder/controller. Assuming the use of prefix codes for each encoder, we show a causally conditioned directed information lower bound and the sufficiency of a class of linear policies for optimizing this weighted sum lower bound with the full observation condition, reducing it to a finite-dimensional optimization problem. We then apply our analysis to the point-to-point case with side information(SI) at the decoder only, which can be viewed as an extreme case for the multi-encoder setting. We recover the structure result for the sequential rate-distortion function(SRDF) for the point-to-point case with SI. We further present semidefinite programming (SDP) formulations for a broader class of system parameters that recover the past forms as special cases, and show an equivalent single-letter SDP form for the infinite-horizon time-invariant system under certain conditions.

查看此版本解读 →查看此版本原文 ↗