arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1902.03339eess.SYcs.SYmath.OC
收藏

远程估计不确定源的最坏情况保证

Worst-case Guarantees for Remote Estimation of an Uncertain Source

Mukul Gagrani, Yi Ouyang, Mohammad Rasouli, Ashutosh Nayyar

AI总结:

本文研究了在有限时间范围内,传感器如何通过有限的通信预算将不确定源的状态传输给远程估计器,以最小化最坏情况下的最大瞬时估计误差,提出了一种去中心化的最优化策略。

摘要:

考虑一个远程估计问题,其中传感器需要在有限的时间范围内将不确定源的状态传输给远程估计器。不确定源被建模为具有有界噪声的自回归过程。鉴于传感器有有限的通信预算,传感器必须决定何时将状态传输给估计器,而估计器必须实时估计源状态。本文考虑了寻找传感器的调度策略和估计器的估计策略,以在时间范围内联合最小化最坏情况下的最大瞬时估计误差的问题。这导致了一个去中心化的最优化决策问题。我们获得了该去中心化最优化问题最优策略的完整表征。特别是,我们证明开环通信调度策略是最优的,且最优估计仅依赖于最近接收到的传感器观测值。

英文摘要:

Consider a remote estimation problem where a sensor wants to communicate the state of an uncertain source to a remote estimator over a finite time horizon. The uncertain source is modeled as an autoregressive process with bounded noise. Given that the sensor has a limited communication budget, the sensor must decide when to transmit the state to the estimator who has to produce real-time estimates of the source state. In this paper, we consider the problem of finding a scheduling strategy for the sensor and an estimation strategy for the estimator to jointly minimize the worst-case maximum instantaneous estimation error over the time horizon. This leads to a decentralized minimax decision-making problem. We obtain a complete characterization of optimal strategies for this decentralized minimax problem. In particular, we show that an open loop communication scheduling strategy is optimal and the optimal estimate depends only on the most recently received sensor observation.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑