自回归马尔可夫过程远程估计的最优风险敏感调度策略
Optimal Risk-Sensitive Scheduling Policies for Remote Estimation of Autoregressive Markov Processes
AI总结:
本文研究远程估计中自回归马尔可夫过程的最优风险敏感调度问题,通过将其建模为马尔可夫决策过程,提出了一种基于信道状态和瞬时误差的阈值结构最优策略,以最小化传输功耗与估计误差的指数期望成本。
摘要:
我们设计了在远程估计设置中最小化风险敏感成本准则的调度策略。由于风险敏感成本目标不仅考虑成本的均值,还考虑其概率分布的高阶矩,因此所得策略对底层系统参数的变化具有鲁棒性。该设置包含一个传感器,它观测离散时间自回归马尔可夫过程,并在每个时刻 $t$ 决定是否将这些观测编码为数据包后,通过不可靠的无线通信信道传输给远程估计器。我们将通信信道建模为 Gilbert-Elliott 信道 \cite{10384144}。传感器探测信道 \cite{laourine2010betting},因此在做出调度决策前已知每个时刻 $t$ 的信道状态。调度器须最小化有限时域累积成本指数的期望值,该成本是以下两项之和: 累积传输功耗, 累积平方估计误差。我们将此动态优化问题表述为马尔可夫决策过程(MDP),其中时刻 $t$ 的系统状态由两部分组成: 瞬时误差 $Δ(t):= x(t)-a\hat{x}(t-1)$,其中 $x(t),\hat{x}(t-1)$ 分别为时刻 $t,t-1$ 的系统状态和估计值; 信道状态 $c(t)$。我们证明存在一个具有阈值结构的最优策略,即在每个时刻 $t$,对于每个可能的信道状态 $c$,都存在一个阈值 $\D\ust(c)$,使得若当前信道状态为 $c$,则仅当误差 $\D(t)$ 超过 $\D\ust(c)$ 时才进行传输。
英文摘要:
We design scheduling policies that minimize a risk-sensitive cost criterion for a remote estimation setup. Since risk-sensitive cost objective takes into account not just the mean value of the cost, but also higher order moments of its probability distribution, the resulting policy is robust to changes in the underlying system's parameters. The setup consists of a sensor that observes a discrete-time autoregressive Markov process, and at each time $t$ decides whether or not to transmit its observations to a remote estimator using an unreliable wireless communication channel after encoding these observations into data packets. We model the communication channel as a Gilbert-Elliott channel \cite{10384144}. Sensor probes the channel \cite{laourine2010betting} and hence knows the channel state at each time $t$ before making scheduling decision. The scheduler has to minimize the expected value of the exponential of the finite horizon cumulative cost that is sum of the following two quantities (i) the cumulative transmission power consumed, (ii) the cumulative squared estimator error. We pose this dynamic optimization problem as a Markov decision process (MDP), in which the system state at time $t$ is composed of (i) the instantaneous error $Δ(t):= x(t)-a\hat{x}(t-1)$, where $x(t),\hat{x}(t-1)$ are the system state and the estimate at time $t,t-1$ respectively, and (ii) the channel state $c(t)$. We show that there exists an optimal policy that has a threshold structure, i.e., at each time $t$, for each possible channel state $c$, there is a threshold $\D\ust(c)$ such that if the current channel state is $c$, then it transmits only when the error $\D(t)$ exceeds $\D\ust(c)$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。