Positioning a Movable Antenna Without CSI: A Kernelized Bandit Under Costly Movement
Movable antenna (MA) systems reconfigure the wireless channel by repositioning the antenna within a confined region. The position optimization behind this capability has been studied under the premise that the channel at every candidate position is known. However, acquiring that knowledge is costly: a position can be measured only after the antenna has moved there, which takes many slots at the speed of the actuator, and the channel drifts meanwhile. We formulate MA positioning as a non-stationary kernelized bandit with a reachability constraint, in which exploration, tracking, and the reward lost in transit are coupled through a single physical action. We propose MoveUCB, which addresses the reachability constraint through a global target search, a persistence rule that holds the target across slots, and a transit-aware movement cost term. We prove that MoveUCB attains sublinear dynamic regret under the standard variation-budget condition of non-stationary bandits alone, with the physical parameters entering only through constants. Simulations against a dynamic-programming oracle and movement-unaware baselines show that MoveUCB attains the lowest regret with about half the travel of the closest baseline that moves.