无信道状态信息下的可移动天线定位：代价移动场景下的核化赌博机
Positioning a Movable Antenna Without CSI: A Kernelized Bandit Under Costly Movement
- Hanyang University（汉阳大学）
- University of Southern California（南加州大学）
机构由 AI 辅助整理，请以论文原文为准。
AI总结：
针对可移动天线无信道状态信息下的定位问题，提出MoveUCB核化赌博机算法，在代价移动约束下实现次线性动态遗憾，且移动距离约为最优移动基线的一半。
AI中文摘要：
可移动天线（MA）系统通过在受限区域内重新定位天线来重新配置无线信道。这一能力背后的位置优化问题，以往的研究均假设每个候选位置的信道是已知的。然而，获取这种知识代价高昂：只有当天线移动到某个位置后才能测量该位置的信道，而移动过程在致动器速度下需要多个时隙，且在此期间信道会发生漂移。我们将可移动天线定位问题建模为具有可达性约束的非平稳核化赌博机，其中探索、跟踪以及传输途中损失奖励通过单一物理动作耦合在一起。我们提出了MoveUCB算法，该算法通过全局目标搜索、跨时隙保持目标的持久性规则以及考虑传输过程的移动代价项来应对可达性约束。我们证明，在非平稳赌博机标准变化预算条件下，MoveUCB仅凭该条件即可实现次线性动态遗憾，物理参数仅通过常数项影响性能。与动态规划最优基准及不考虑移动代价的基线进行仿真对比，结果表明MoveUCB实现了最低的遗憾，且其移动距离约为最接近的移动基线的一半。
英文摘要：
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.
