  Age of information (AoI) measures information freshness at the receiver. AoI
may provide insights into quality of service in communication systems. For this
reason, it has been used as a cross-layer metric for wireless communication
protocols. In this work, we employ AoI to calculate penalty functions for a
centralized resource scheduling problem. We consider a single wireless link
shared by multiple, heterogeneous control systems where each sub-system has a
time-varying packet loss probability. Sub-systems are competing for network
resources to improve the accuracy of their remote estimation process. In order
to cope with the dynamically changing conditions of the wireless link, we
define a finite horizon age-penalty minimization problem and propose a
scheduler that takes optimal decisions by looking $H$ slots into the future.
The proposed algorithm has a worst-case complexity that grows exponentially
with $H$. However, by narrowing down our search space within the constrained
set of actions, we are able to decrease the complexity significantly without
losing optimality. On the contrary, we show by simulations that the benefit of
increasing $H$ w.r.t. remote state estimation performance diminishes after a
certain $H$ value.
