Optimal Scheduling for Remote State Estimation over Hybrid Channels

We study optimal scheduling for remote state estimation over a network with two heterogeneous communication channels: a fast but unreliable channel and a slow but reliable channel.

To capture temporal correlations in packet losses, we model the unreliable channel as a Gilbert-Elliott (GE) channel.

The remote estimation setup consists of a source, a sensor, and a remote estimator.

The source evolves as a discrete-time autoregressive (AR) process, and the sensor decides at each time whether to use the fast unreliable channel or the slow reliable channel.

We formulate the scheduling problem faced by the sensor as a Markov decision process (MDP) with a continuous state-space and consider minimizing the infinite horizon average cost criterion, where the cost consists of the squared estimation error and the transmission energy consumed.

We establish the existence of an optimal stationary policy.

We then characterize the structure of an optimal policy, and show that it has a threshold structure with respect to the estimation error.

An optimal policy chooses from amongst the two channels based on whether the error exceeds certain thresholds, where the threshold value depends upon the GE channel state.

When the system parameters are unknown, we propose an actor-critic (AC) learning algorithm that exploits the threshold structure of an optimal policy.

Numerical results demonstrate that the proposed AC algorithm learns the policy structure effectively and achieves performance close to that of the optimal policy computed using the relative value iteration (RVI).