为A最优状态估计最大化每比特的利用
Making Every Bit Count for $A$-Optimal State Estimation
AI总结:
本文研究如何在有限通信带宽下分配异构量化传感器测量的比特数,通过A最优设计准则优化误差协方差矩阵的迹,采用非凸优化方法并提出高效求解策略,通过数值实验验证了分析梯度对两种方法的关键作用。
摘要:
我们研究如何控制有限通信带宽预算在异构量化传感器测量中的分配。性能标准是线性最小均方误差(LMMSE)状态估计器的误差协方差矩阵的迹,即A最优设计准则。在比特预算约束下最小化该准则导致一个非凸优化问题。我们推导出一个公式,将每次梯度评估减少到单次Cholesky分解。这使得通过投影自由Frank-Wolfe方法(具有可计算的收敛证书)和基于问题连续松弛的内点法结合L-BFGS海森矩阵近似进行高效优化成为可能。最大余数取整过程能够以有界质量恢复整数比特分配。在IEEE电力系统测试用例中,最多300个节点的数值实验比较了两种求解器,并展示了分析梯度对两种方法的关键计算作用。此外,异构比特分配在500个节点的IEEE电力系统测试用例中与标准均匀比特分配进行了比较。
英文摘要:
We study the problem of controlling how a limited communication bandwidth budget is allocated across heterogeneously quantized sensor measurements. The performance criterion is the trace of the error covariance matrix of the linear minimum mean square error (LMMSE) state estimator, i.e., an $A$-optimal design criterion. Minimizing this criterion with a bit budget constraint yields a nonconvex optimization problem. We derive a formula that reduces each evaluation of the gradient to a single Cholesky factorization. This enables efficient optimization by both a projection-free Frank--Wolfe method (with a computable convergence certificate) and an interior point method with L-BFGS Hessian approximation over the problem's continuous relaxation. A largest remainder rounding procedure recovers integer bit allocations with a bound on the quality of the rounded solution. Numerical experiments in IEEE power grid test cases with up to 300 buses compare both solvers and demonstrate that the analytic gradient is the key computational enabler for both methods. Additionally, the heterogeneous bit allocation is compared to standard uniform bit allocation on the 500 bus IEEE power grid test case.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。