arXiv AI

Free-Placement Optimization of Ground Station Locations for Low-Earth Orbit Satellites

arXiv:2606. 12667v1 Announce Type: cross Abstract: Rapidly expanding low Earth orbit satellite constellations are placing increasing demands on terrestrial ground networks, motivating the development of more efficient ground station network designs.

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
Aug 26

Reinforcement Learning-Guided Evolutionary Policy Optimization for Preference-Adjustable Heterogeneous Agile Earth Observation Satellite Scheduling

The paper introduces a reinforcement‑learning‑guided evolutionary policy optimization framework for scheduling heterogeneous agile Earth observation satellites, addressing task selection, satellite assignment, and sequencing under diverse visibility windows, maneuvering constraints, energy use, and storage limits. It combines assignment‑based indirect encoding with decoder‑based cost evaluation to capture satellite‑dependent constraints while integrating task gain, energy savings, and load balance into a single utility metric. The resulting RLOSMEA algorithm uses reinforcement learning to select high‑level search operators, achieving higher weighted utility and more stable convergence than baseline metaheuristics across varied AEOS scenarios.

By He Wang, Junyu Wu, Hui Li, Yanjie Song, Witold Pedrycz, Liang Li
arXiv AI
Sep 15

Deep Tech to Space: Space Data Centers and AI Revolution at the Edge

arXiv:2605.19892v2 Announce Type: replace-cross Abstract: Dramatic cost reductions driven by private sector innovations have led to a rapid increase in the number of satellites in orbit and a corresp...

By Jonas Weiss, Patricia Sagmeister, Gabriel Maiolini Capez, Dinesh Verma, Roberto Garello, Alberto Perotti, Dawid Lazaj, Alicja Musial, Jakub Nalepa, Thomas Morf, Martin Schmatz, Marek Krawczyk, Mateusz Przeliorz, Kevin Roche, Sagar Tayal, Mahalakshmi Lakshminarayanan, Nicolas Long\'ep\'e, Pierre-Philippe Mathieu, Agata Wijata
arXiv Machine Learning
Sep 17

Benchmarking Tabular Foundation Models as Surrogates in Expensive Evolutionary Optimization

The paper evaluates the Tabular Prior-data Fitted Network (TabPFN) as a surrogate model in surrogate‑assisted evolutionary algorithms (SAEAs) for expensive optimization problems. Through extensive experiments in both offline and online settings across a range of problem types—including single‑objective, multi‑objective, constrained, combinatorial, mixed‑variable, and engineering tasks—the study finds that TabPFN’s effectiveness varies strongly with the problem characteristics. The authors conclude that TabPFN should be used selectively, with customized model management and algorithm design tailored to data availability, landscape complexity, and search‑space properties.

By Lu Han, Jin Wang, Yuchen Li, Haoran Gu, Shulei Liu, Ziyang Shi, Wenao Lu, Handing Wang
Hugging Face Trending Papers
Jun 8

Order Matters: Unveiling the Hidden Impact of Macro Placement Sequences via Proxy-Guided LLM Evolution

Macro placement is a fundamental step in modern chip physical design, playing a crucial role in determining the solution quality of high-dimensional combinatorial optimization problems. Despite recent advancements in machine learning for spatial coordinate determination, the temporal dimension of placement sequencing remains largely governed by static heuristics.