Online Learning for Dynamic Constellation Topologies
Published in SPAICE 2026, 2026
Recommended citation: João Norberto, Ricardo N. Ferreira, Claudia Soares, "Online Learning for Dynamic Constellation Topologies." SPAICE 2026, 2026. https://openreview.net/forum?id=QbHeWRNwGa
Abstract
The use of satellite networks has increased significantly in recent years due to their advantages over purely terrestrial systems, such as higher availability and coverage. However, to effectively provide these services, satellite networks must cope with the continuous orbital movement and maneuvering of their nodes and the impact on the network's topology. In this work, we address the problem of (dynamic) network topology configuration under the online learning framework. As a byproduct, our approach does not assume structure about the network, such as known orbital planes (that could be violated by maneuvering satellites). We empirically demonstrate that our problem formulation matches the performance of state-of-the-art offline methods. Importantly, we demonstrate that our approach is amenable to constrained online learning, exhibiting a trade-off between computational complexity per iteration and convergence to a final strategy.
BibTeX
@inproceedings{spaice2026QbHeWRNwGa,
author = "Norberto, João and Ferreira, Ricardo N. and Soares, Claudia",
title = "Online Learning for Dynamic Constellation Topologies",
booktitle = "SPAICE 2026",
year = "2026",
month = "oct",
day = "21",
url = "https://openreview.net/forum?id=QbHeWRNwGa",
abstract = "The use of satellite networks has increased significantly in recent years due to their advantages over purely terrestrial systems, such as higher availability and coverage. However, to effectively provide these services, satellite networks must cope with the continuous orbital movement and maneuvering of their nodes and the impact on the network's topology. In this work, we address the problem of (dynamic) network topology configuration under the online learning framework. As a byproduct, our approach does not assume structure about the network, such as known orbital planes (that could be violated by maneuvering satellites). We empirically demonstrate that our problem formulation matches the performance of state-of-the-art offline methods. Importantly, we demonstrate that our approach is amenable to constrained online learning, exhibiting a trade-off between computational complexity per iteration and convergence to a final strategy.",
note = "Accepted for poster presentation"
}