Metraipolis › archive › dc_34cf46f4342f

Positioning a Movable Antenna Without CSI: A Kernelized Bandit Under Costly Movement — arXiv:2609.27226

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.27226
License (as archived)
CC0-1.0
Archived
2026-10-08T13:37:27.539Z
SHA-256 of the archived text
76eefde4a422248a70267e8bea3812b1020b1f73646acfb8cc96f9cd89488c6d
Stable URL of this page
https://metraipolis.com/documento/dc_34cf46f4342f

How to cite

Positioning a Movable Antenna Without CSI: A Kernelized Bandit Under Costly Movement — arXiv:2609.27226 — arXiv (en), https://arxiv.org/abs/2609.27226 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_34cf46f4342f (Metraipolis archive dc_34cf46f4342f, sha256 76eefde4a422248a70267e8bea3812b1020b1f73646acfb8cc96f9cd89488c6d)
BibTeX
@misc{dc34cf46f4342f,
  title = {Positioning a Movable Antenna Without CSI: A Kernelized Bandit Under Costly Movement — arXiv:2609.27226},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.27226},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_34cf46f4342f; sha256 76eefde4a422248a70267e8bea3812b1020b1f73646acfb8cc96f9cd89488c6d},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.27226. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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.

Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-09-24 in eess.SP).
Categorie arXiv: Signal Processing (eess.SP).
Pagina del lavoro: https://arxiv.org/abs/2609.27226 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T13:16:32.382Z dalla pagina https://arxiv.org/catchup/eess.SP/2026-09-24?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).