ASTRA: ADMM-Accelerated Topology Reconfiguration for Dynamic Satellite Constellations
Not on the map. Why?
Abstract (arXiv)
Dynamic topology reconfiguration is central to the reliability and efficiency of large satellite constellations, yet many existing approaches rely on idealized assumptions such as full constellation deployment or uniform orbital spacing. We present Adaptive Satellite Topology via Regret-Aware learning (ASTRA), a theoretically-grounded framework for dynamic satellite topology reconfiguration that builds on an online learning formulation and makes it computationally practical. ASTRA combines an ADMM-based offline solver with efficient online updates for both online gradient descent and online conditional gradient, yielding markedly cheaper constrained updates than generic optimization pipelines. On the theory side, we show that for a relevant class of entry-wise nonzero utility matrices, the objective is strongly convex, which yields logarithmic static regret for online gradient descent, and we further instantiate known dynamic-regret guarantees under inexact ADMM inner loops. Empirically, ASTRA matches or improves topology quality, presenting a good trade-off with computational time on synthetic constellations, and it remains effective on real Starlink data under partial deployment and non-uniform spacing, where idealized structural assumptions break down. These results position ASTRA as an efficient and theoretically grounded approach to topology reconfiguration in realistic Low Earth Orbit networks.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 20 of its 53 references that are in the map. First posted on arXiv 27 Sep 2026.
Builds on
20 of 53 references.
References · 20
- 2021Convex optimizationcited by 2,515
- 2019Introduction to Online Convex Optimizationcited by 803
- 2019Online Learning: A Modern Introduction Using Convex Optimizationcited by 417
- 2018Adaptive Online Learning in Dynamic Environmentscited by 133
- 2020Dynamic Regret of Convex and Smooth Functionscited by 90
- 2020Faster Projection-free Online Learningcited by 40
- 2020Adaptive Regret for Control of Time-Varying Dynamicscited by 38
- 2018Online Learning with Inexact Proximal Online Gradient Descent Algorithmscited by 22
- 2020Inter-Plane Inter-Satellite Connectivity in Dense LEO Constellationscited by 12
- 2021Boosting for Online Convex Optimizationcited by 11
- 2014Convergence Rates with Inexact Non-expansive Operatorscited by 10
- 2023Dynamic Routing for Integrated Satellite-Terrestrial Networks: A Constrained Multi-Agent Reinforcement Learning Approachcited by 9
8 more
- 2022Rate-Optimal Online Convex Optimization in Adaptive Linear Controlcited by 5
- 2023Projection-Free Online Convex Optimization via Efficient Newton Iterationscited by 4
- 2023Laser Inter-Satellite Link Setup Delay: Quantification, Impact, and Tolerable Valuecited by 2
- 2025Time-Dependent Network Topology Optimization for LEO Satellite Constellationscited by 2
- 2025Resilience of Mega-Satellite Constellations: How Node Failures Impact Inter-Satellite Networking Over Time?cited by 2
- 2024Online convex optimization for constrained control of nonlinear systemscited by 1
- 2026LEO Topology Design Under Real-World Deployment Constraintscited by 1
- 2026Online Learning for Dynamic Constellation Topologiescited by 1
Built on by
Not cited yet.