aiqbench analysis
This research applies online learning frameworks to optimize dynamic configurations in satellite constellations, addressing the challenges posed by continuous orbital movement and maneuvering nodes. The study demonstrates that this approach achieves performance comparable to state-of-the-art offline methods while accommodating constraints without assuming fixed network structures like known orbital planes. By balancing computational complexity per iteration with convergence speed, the work advances the application of machine learning to adaptive space-based network topologies.
Online Learning for Dynamic Constellation Topologies
arXiv:2603.25954v2 Announce Type: replace 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.
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.
Machine Learning (cs.LG); Optimization and Control (math.OC)
arXiv:2603.25954 [cs.LG]
(or arXiv:2603.25954v2 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2603.25954 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 229 words
Related coverage
ASTRA: ADMM-Accelerated Topology Reconfiguration for Dynamic Satellite Constellations
arXiv · Sep 30, 2026
Online Versatile Incremental Learning: Towards Class and Domain-Agnostic Adaptation at Any Time
arXiv · Sep 30, 2026
HiGFRL: Hierarchical Graph Fusion-Driven Reinforcement Learning for Dependency-Aware Task Scheduling in Heterogeneous Cloud
arXiv · Sep 15, 2026
Tactile Sensing-based Secure and Gentle Grasping of Unknown Objects
arXiv · Oct 12, 2026