paperIEEE Xplore·1 Nov 2026·Xijun Wang, Shuying Gan, Yanzhi Huang, Xiaoyu Zhao, Chao Xu
Partially Observable Restless Bandits for Age-Optimal Scheduling Over Markov Channels
Models scheduling over Markov channels as a partially observable restless bandit problem to minimize the age of information.
Abstract
IEEE Transactions on Mobile Computing