最小信息量卡尔曼-布西滤波的连续时间信道增益控制
Continuous-Time Channel Gain Control for Minimum-Information Kalman-Bucy Filtering
摘要:
我们考虑的问题估计的连续时间高斯-马尔可夫源过程观察通过矢量高斯信道与可调信道增益矩阵。对于一个给定的(通常是时变的)信道增益矩阵,我们提供公式来计算(i)的均方估计误差可达到的经典卡尔曼-布西滤波器,和(ii)之间的互信息的源过程和它的卡尔曼-布西估计。然后,我们制定了一个新的“最优信道增益控制问题”的目标是控制信道增益矩阵的战略,以尽量减少这两个性能指标的加权和。为了深入了解最优解,我们首先考虑在有限时间间隔内控制时变信道增益的问题。基于庞特里亚金极小值原理,导出了最优性的必要条件.对于标量系统,我们证明了最佳信道增益是一个分段常数信号,最多有两个开关。我们还考虑了设计最优时不变增益的问题,以最小化在无限时间范围内的平均成本。提出了一种新的半定规划(SDP)启发式算法,并讨论了其解的精确性。
英文摘要:
We consider the problem of estimating a continuous-time Gauss-Markov source process observed through a vector Gaussian channel with an adjustable channel gain matrix. For a given (generally time-varying) channel gain matrix, we provide formulas to compute (i) the mean-square estimation error attainable by the classical Kalman-Bucy filter, and (ii) the mutual information between the source process and its Kalman-Bucy estimate. We then formulate a novel "optimal channel gain control problem" where the objective is to control the channel gain matrix strategically to minimize the weighted sum of these two performance metrics. To develop insights into the optimal solution, we first consider the problem of controlling a time-varying channel gain over a finite time interval. A necessary optimality condition is derived based on Pontryagin's minimum principle. For a scalar system, we show that the optimal channel gain is a piece-wise constant signal with at most two switches. We also consider the problem of designing the optimal time-invariant gain to minimize the average cost over an infinite time horizon. A novel semidefinite programming (SDP) heuristic is proposed and the exactness of the solution is discussed.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。