Abstract
This article investigates the problem of sensor scheduling for remotely estimating the states of heterogeneous dynamical systems over resource-limited and lossy wireless channels. Considering the low time complexity and high versatility requirements of schedulers deployed on the transport layer, we propose a lightweight scheduler based on an Age of Information function built with the tight scalar upper bound of the remote estimation error. We show that the proposed scheduler is indexable and suboptimal. We derive an upper and a lower bound of the proposed scheduler and give stability conditions for estimation error. Numerical simulations demonstrate that, compared to existing policies, the proposed scheduler achieves estimation performance very close to the optimal at a much lower computation time.
Original language | English |
---|---|
Pages (from-to) | 1697-1704 |
Number of pages | 8 |
Journal | IEEE Transactions on Automatic Control |
Volume | 69 |
Issue number | 3 |
DOIs | |
Publication status | Published - 1 Mar 2024 |
Bibliographical note
Publisher Copyright:© 1963-2012 IEEE.
Keywords
- Whittle index
- Age of information
- remote state estimation
- sensor scheduling
- lightweight scheduler