arXiv Machine Learning

Online Learning for Dynamic Constellation Topologies

The paper proposes an online learning framework for configuring dynamic constellation topologies in satellite networks, addressing the challenges posed by continuous orbital movement and node maneuvering. It does not rely on predefined orbital plane structures, making it robust to changes caused by satellite maneuvers. Experiments show that the method performs comparably to state‑of‑the‑art offline techniques and can be adapted to constrained online learning, balancing per‑iteration computational cost against convergence speed.

arXiv Machine Learning
5d ago

Traffic Engineering in Large-scale Networks with Generalizable Graph Neural Networks

The paper introduces TELGEN, a traffic engineering algorithm that uses graph neural networks to predict an optimal TE algorithm rather than a direct solution. TELGEN generalizes across diverse network topologies and traffic patterns, achieving less than a 3% optimality gap on networks up to 5,000 nodes and 3.6 million links, while reducing solving time by up to 84% and training time by up to 79.6% compared to existing methods.

By Fangtong Zhou, Xiaorui Liu, Ruozhou Yu, Guoliang Xue
arXiv Machine Learning
Aug 5

FedRings: A Scalable and Topology-Aware Federated Learning Framework for LEO Satellite Constellations

arXiv:2608. 03436v1 Announce Type: cross Abstract: Federated learning over low Earth orbit (LEO) satellite networks is limited by frequent link changes, short contact times, and a highly dynamic topology, making centralized or synchronized training inefficient and hard to scale.

By Ziwu Liu, In\^es Pinto Gouveia, Rehana Yasmin, Paulo Esteves-Verissimo, Ali Shoker
arXiv AI
Sep 2

FractalNet-Based Heterogeneous Federated Learning for Orbital Edge Intelligence in Satellite Mega-Constellations: A Wildfire Case Study

The paper introduces a heterogeneous federated learning approach using the FractalNet architecture tailored for satellite mega‑constellations. It formalizes contact‑window‑constrained, depth‑heterogeneous optimization and proposes a distributed path scheduler that assigns model depth based on satellite SWAP‑C constraints, predicted contacts, and training statistics. The framework includes periodic update pooling and a three‑tier agentic control plane, and is validated through a wildfire detection case study across LEO, MEO, and GEO/HEO shells, demonstrating improvements in convergence, communication efficiency, energy adaptation, and robustness.

By Sai Puppala, Koushik Sinha
arXiv AI
Jul 29

Distributed Constraint Optimization via Online Learning and Iterative Pricing with Application to Large-Scale Satellite Scheduling

arXiv:2607. 25835v1 Announce Type: new Abstract: Distributed constraint optimization problems (DCOPs) provide a popular framework for distributed decision making under limited communication, but many real-world instances are too large to solve monolithically.

By Itai Zilberstein, Pranav Rajbhandari, Steve Chien, Tuomas Sandholm
arXiv AI
Aug 24

Online design of dynamic networks

arXiv:2410.08875v3 Announce Type: replace Abstract: Designing a network (e.g., a telecommunication or transport network) is mainly done offline, in a planning phase, prior to the operation of the net...

By Duo Wang, Andrea Araldo, Mounim El Yacoubi
arXiv Machine Learning
1d ago

Universal Observatory Graphs for Distributed Sky Coverage and Artificial Intelligence Based Interplanetary Routing

The paper introduces the Universal Observatory Graph (UOG), an AI‑driven framework that models autonomous observatories at L2 Lagrange points as nodes in a weighted graph, with edges defined by interplanetary distance, latency, transmission power, and reliability. Using a six‑observatory Solar System configuration (Earth, Mars, Jupiter, Saturn, Uranus, Neptune), the authors evaluate instantaneous sky coverage with three methods, all showing complete network union coverage and modest overlap. They formulate communication routing as a finite‑horizon Markov decision process solved via tabular Q‑learning, identifying the Earth‑Saturn‑Uranus‑Neptune path as the highest‑return route among 41 feasible simple paths under a four‑hop constraint.

By Mohammed Abdel Razek
arXiv Machine Learning
Aug 27

AERIS: Offline Policy Improvement for Multi-UAV Integrated Sensing and Communication

AERIS is an offline policy improvement framework for multi-UAV integrated sensing and communication (ISAC) that learns from fixed flight logs using centralized training and decentralized execution. It introduces STAR-CRDT, an offline multi-agent RL algorithm that rectifies local actions and distills trusted improvements into decentralized actors, providing an offline-support policy improvement guarantee. Experiments demonstrate that STAR-CRDT boosts the main ISAC objective return by 29.3% and improves communication sum rate, sensing pass rate, and sensing margin while reducing collision-risk events by 54.2%.

By Ziyuan Wang (Steven), Yifan Sui (Steven), Wei Wei (Steven), Wenjie Xin (Steven), Zekai Zhang (Steven), Xiangwang Hou (Steven), Xiao-Ping (Steven), Zhang