针对Witsenhausen反例的确定性退火方法
A Deterministic Annealing Approach to Witsenhausen's Counterexample
AI总结:
本文提出基于信息论思想的数值方法,解决一类分布式控制问题。以Witsenhausen反例为例,通过引入香农熵约束,将零延迟映射随机化为概率映射,从而在确定性退火过程中获得改进的最优解结构和总成本。
摘要:
本文提出了一种基于信息论思想的数值方法,用于解决一类分布式控制问题。作为特定测试案例,考虑了广为人知且数值上“过度开采”的分布式控制与隐含通信问题,即Witsenhausen反例。该方法在该基准问题上提供了比现有最佳数值结果略小的改进。关键思想是通过在问题 formulations 中引入香农熵约束,将零延迟映射随机化为“软”的概率映射,在确定性退火过程中进行优化。通过控制并逐渐降低映射的熵至零,以获得确定性映射,同时避免陷入较差的局部极小值。所提出的方法获得了新的映射,揭示了最优解的结构,并在该问题的数值方法状态上实现了总成本的小幅改进。
英文摘要:
This paper proposes a numerical method, based on information theoretic ideas, to a class of distributed control problems. As a particular test case, the well-known and numerically "over-mined" problem of decentralized control and implicit communication, commonly referred to as Witsenhausen's counterexample, is considered. The method provides a small improvement over the best numerical result so far for this benchmark problem. The key idea is to randomize the zero-delay mappings. which become "soft", probabilistic mappings to be optimized in a deterministic annealing process, by incorporating a Shannon entropy constraint in the problem formulation. The entropy of the mapping is controlled and gradually lowered to zero to obtain deterministic mappings, while avoiding poor local minima. Proposed method obtains new mappings that shed light on the structure of the optimal solution, as well as achieving a small improvement in total cost over the state of the art in numerical approaches to this problem.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。