Scalable Ground Station Selection for Large LEO Constellations

• URL: http://arxiv.org/abs/2510.03438v1
• Date: Fri, 03 Oct 2025 18:58:15 GMT
• Title: Scalable Ground Station Selection for Large LEO Constellations
• Authors: Grace Ra Kim, Duncan Eddy, Vedant Srinivas, Mykel J. Kochenderfer,
• Abstract summary: We introduce a scalable, hierarchical framework that decomposes the global selection problem into single-satellite, short time-window subproblems.<n>We evaluate our method's performance on synthetic Walker-Star test cases (1-10 satellites, 1-10 stations), achieving solutions within 95% of the global IP optimum for all test cases.
• Score: 21.666726162280696
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Effective ground station selection is critical for low Earth orbiting (LEO) satellite constellations to minimize operational costs, maximize data downlink volume, and reduce communication gaps between access windows. Traditional ground station selection typically begins by choosing from a fixed set of locations offered by Ground Station-as-a-Service (GSaaS) providers, which helps reduce the problem scope to optimizing locations over existing infrastructure. However, finding a globally optimal solution for stations using existing mixed-integer programming methods quickly becomes intractable at scale, especially when considering multiple providers and large satellite constellations. To address this issue, we introduce a scalable, hierarchical framework that decomposes the global selection problem into single-satellite, short time-window subproblems. Optimal station choices from each subproblem are clustered to identify consistently high-value locations across all decomposed cases. Cluster-level sets are then matched back to the closest GSaaS candidate sites to produce a globally feasible solution. This approach enables scalable coordination while maintaining near-optimal performance. We evaluate our method's performance on synthetic Walker-Star test cases (1-10 satellites, 1-10 stations), achieving solutions within 95% of the global IP optimum for all test cases. Real-world evaluations on Capella Space (5 satellites), ICEYE (40), and Planet's Flock (96) show that while exact IP solutions fail to scale, our framework continues to deliver high-quality site selections.

Related papers

• Quantum-Assisted Design of Space-Terrestrial Integrated Networks [0.11242503819703255]
  We investigate the design and optimization of Space-Terrestrial Integrated Networks (STINs) using a hybrid quantum-classical approach.<n>We formalize three key optimization problems: the Satellite Selection Problem (SSP), the Gateway Selection Problem (GSP), and the Spectrum Assignment Problem (SAP)<n>Using neutral-atom quantum processors, we map the SSP onto a Maximum Weight Independent Set problem, embedding it onto the Aquila platform and solving it via the Quantum Adiabatic Algorithm (QAA)
  arXiv  Detail & Related papers  (2026-02-04T09:18:10Z)
• Scheduling in Quantum Satellite Networks: Fairness and Performance Optimization [12.821638922479899]
  Quantum satellite networks offer a promising solution for achieving long-distance quantum communication.<n>This work formulates and solves the quantum satellite network scheduling problem by optimizing satellite-to-ground station pair assignments.<n>Our framework accounts for limited satellite and ground station resources, fairness, entanglement fidelity thresholds, and real world non-idealities.
  arXiv  Detail & Related papers  (2025-12-08T02:44:14Z)
• Bringing Federated Learning to Space [3.058685580689604]
  Federated learning offers a promising framework to conduct collaborative model training across satellite networks.<n>We introduce a comprehensive "space-ification" framework that adapts terrestrial algorithms to operate under orbital constraints.<n>Our analysis demonstrates that space-adapted FL algorithms efficiently scale to constellations of up to 100 satellites.
  arXiv  Detail & Related papers  (2025-11-18T20:16:07Z)
• Joint AoI and Handover Optimization in Space-Air-Ground Integrated Network [48.485907216785904]
  Low Earth orbit (LEO) satellite constellations offer promising solutions with global coverage and reduced latency.<n>Yet struggle with intermittent coverage and intermittent communication windows due to orbital dynamics.<n>Our three-layer design employs hybrid free-space optical (FSO) links for high-capacity satellite-to-ground communication and reliable radio frequency (RF) links for HAP-to-ground transmission.
  arXiv  Detail & Related papers  (2025-09-16T06:16:56Z)
• Optimal Ground Station Selection for Low-Earth Orbiting Satellites [36.896695278624776]
  This paper presents a solution to the problem of optimal ground station selection for low-Earth orbiting (LEO) space missions.<n>It enables mission operators to precisely design their ground segment performance and costs.
  arXiv  Detail & Related papers  (2024-10-04T22:48:50Z)
• Scalable Scheduling Policies for Quantum Satellite Networks [10.91414940065524]
  We consider the problem of transmission scheduling in quantum satellite networks subject to resource constraints at the satellites and ground stations. We show that the most general problem of assigning satellites to ground station pairs for entanglement distribution is NP-hard. We propose four scalable algorithms and evaluate their performance for Starlink mega constellation.
  arXiv  Detail & Related papers  (2024-05-15T15:58:12Z)
• Collaborative Ground-Space Communications via Evolutionary Multi-objective Deep Reinforcement Learning [113.48727062141764]
  We propose a distributed collaborative beamforming (DCB)-based uplink communication paradigm for enabling ground-space direct communications. DCB treats the terminals that are unable to establish efficient direct connections with the low Earth orbit (LEO) satellites as distributed antennas. We propose an evolutionary multi-objective deep reinforcement learning algorithm to obtain the desirable policies.
  arXiv  Detail & Related papers  (2024-04-11T03:13:02Z)
• Optimal Solutions for Joint Beamforming and Antenna Selection: From Branch and Bound to Machine Learning [47.10315221141495]
  This work revisits the joint beamforming (BF) and antenna selection (AS) problem, as well as its robust beamforming (RBF) version under imperfect channel state information (CSI) The main contribution of this work is threefold. First, an effective it branch and bound (B&B) framework for solving the problems of interest is proposed. Second, to expedite the potentially costly B&B algorithm, a machine learning (ML)-based scheme is proposed to help skip intermediate states of the B&B search tree.
  arXiv  Detail & Related papers  (2022-06-11T17:43:02Z)
• Optimal Entanglement Distribution using Satellite Based Quantum Networks [16.797145253236607]
  Satellite quantum communication can distribute high quality quantum entanglements among ground stations that are geographically separated at very long distances. This work focuses on optimal distribution of bipartite entanglements to a set of pair of ground stations using a constellation of orbiting satellites.
  arXiv  Detail & Related papers  (2022-05-24T20:32:00Z)
• Learning Proximal Operators to Discover Multiple Optima [66.98045013486794]
  We present an end-to-end method to learn the proximal operator across non-family problems. We show that for weakly-ized objectives and under mild conditions, the method converges globally.
  arXiv  Detail & Related papers  (2022-01-28T05:53:28Z)
• Learning Emergent Random Access Protocol for LEO Satellite Networks [51.575090080749554]
  We propose a novel grant-free random access solution for LEO SAT networks, dubbed emergent random access channel protocol (eRACH) eRACH is a model-free approach that emerges through interaction with the non-stationary network environment. Compared to RACH, we show from various simulations that our proposed eRACH yields 54.6% higher average network throughput.
  arXiv  Detail & Related papers  (2021-12-03T07:44:45Z)
• A Maximum Independent Set Method for Scheduling Earth Observing Satellite Constellations [41.013477422930755]
  This paper introduces a new approach for solving the satellite scheduling problem by generating an infeasibility-based graph representation of the problem. It is tested on a scenarios of up to 10,000 requested imaging locations for the Skysat constellation of optical satellites as well as simulated constellations of up to 24 satellites.
  arXiv  Detail & Related papers  (2020-08-15T19:32:21Z)
• Goal Kernel Planning: Linearly-Solvable Non-Markovian Policies for Logical Tasks with Goal-Conditioned Options [54.40780660868349]
  We introduce a compositional framework called Linearly-Solvable Goal Kernel Dynamic Programming (LS-GKDP)<n>LS-GKDP combines the Linearly-Solvable Markov Decision Process (LMDP) formalism with the Options Framework of Reinforcement Learning.<n>We show how an LMDP with a goal kernel enables the efficient optimization of meta-policies in a lower-dimensional subspace defined by the task grounding.
  arXiv  Detail & Related papers  (2020-07-06T05:13:20Z)
• Real-time Localization Using Radio Maps [59.17191114000146]
  We present a simple yet effective method for localization based on pathloss. In our approach, the user to be localized reports the received signal strength from a set of base stations with known locations.
  arXiv  Detail & Related papers  (2020-06-09T16:51:17Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.