分散控制中的隐式与显式通信
Implicit and explicit communication in decentralized control
AI总结:
研究在分散控制中如何协同使用隐式和显式通信来降低控制成本,提出基于分箱的策略,其性能可任意优于已知最佳策略,并在渐近无限长版本中达到常数因子最优。
摘要:
最近在理解纯隐式信号传递的玩具问题方面取得了实质性进展。这些问题中,信源和信道是隐式的——消息由系统内生生成,且系统本身被用作信道。在本文中,我们探讨如何协同使用隐式和显式通信来降低控制成本。该设置是Witsenhausen反例的扩展,其中一条速率受限的外部信道连接两个控制器。利用问题的半确定版本,我们提出了一种基于分箱的策略,其性能可以任意优于已知最佳策略。我们还证明,对于问题的渐近无限长版本,我们的基于分箱的策略在所有问题参数和外部信道所有速率下,都能在常数因子内达到最优成本。对于标量情况,尽管我们的结果对每个固定速率给出了近似最优性,但我们无法证明在所有速率上的一致近似最优性。
英文摘要:
There has been substantial progress recently in understanding toy problems of purely implicit signaling. These are problems where the source and the channel are implicit -- the message is generated endogenously by the system, and the plant itself is used as a channel. In this paper, we explore how implicit and explicit communication can be used synergistically to reduce control costs. The setting is an extension of Witsenhausen's counterexample where a rate-limited external channel connects the two controllers. Using a semi-deterministic version of the problem, we arrive at a binning-based strategy that can outperform the best known strategies by an arbitrarily large factor. We also show that our binning-based strategy attains within a constant factor of the optimal cost for an asymptotically infinite-length version of the problem uniformly over all problem parameters and all rates on the external channel. For the scalar case, although our results yield approximate optimality for each fixed rate, we are unable to prove approximately-optimality uniformly over all rates.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。