Large-Scale Continual Scheduling and Execution for Dynamic Distributed Satellite Constellation Observation Allocation

• URL: http://arxiv.org/abs/2601.06188v1
• Date: Thu, 08 Jan 2026 00:10:45 GMT
• Title: Large-Scale Continual Scheduling and Execution for Dynamic Distributed Satellite Constellation Observation Allocation
• Authors: Itai Zilberstein, Steve Chien,
• Abstract summary: Deploying autonomy to satellites requires efficient computation and communication.<n>We present the Dynamic Multi-Satellite Constellation Observation Scheduling Problem (DCOSP)<n>We also present the Dynamic Incremental Neighborhood Search algorithm (D-NSS)
• Score: 1.3467991712339638
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: The size and capabilities of Earth-observing satellite constellations are rapidly increasing. Leveraging distributed onboard control, we can enable novel time-sensitive measurements and responses. However, deploying autonomy to satellites requires efficient computation and communication. This work tackles the challenge of efficiently scheduling observations for hundreds of satellites in a dynamic, large-scale problem with millions of variables. We present the Dynamic Multi-Satellite Constellation Observation Scheduling Problem (DCOSP), a new formulation of Dynamic Distributed Constraint Optimization Problems (DDCOP) that models integrated scheduling and execution. DCOSP has a novel optimality condition for which we construct an omniscient offline algorithm for its computation. We also present the Dynamic Incremental Neighborhood Stochastic Search algorithm (D-NSS), an incomplete online decomposition-based DDCOP algorithm that repairs and solves sub-problems when problem dynamics occur. We show through simulation that D-NSS converges to near-optimal solutions and outperforms DDCOP baselines in terms of solution quality, computation time, and message volume. As part of the NASA FAME mission, DCOSP and D-NSS will be the foundation of the largest in-space demonstration of distributed multi-agent AI to date.

Related papers

• OptiVote: Non-Coherent FSO Over-the-Air Majority Vote for Communication-Efficient Distributed Federated Learning in Space Data Centers [68.73273027298625]
  megaconstellations are driving the long-term vision of space data centers (SDCs)<n>AirComp is an in-network aggregation framework for learning free-space (FSO)<n>AirVote integrates sign gradient (SGD) with a majority-signposition modulation (PPM), where each satellite conveys local gradient by activating PPM time slots.<n>OptiVote mitigates phase-sensitive field superposition into phase-agnostic optical intensity combining.
  arXiv  Detail & Related papers  (2025-12-30T16:40:02Z)
• 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)
• AI-Driven Collaborative Satellite Object Detection for Space Sustainability [29.817805350971366]
  The growing density of satellites in low-Earth orbit (LEO) presents serious challenges to space sustainability.<n>Traditional ground-based tracking systems are constrained by latency and coverage limitations.<n>We propose a novel satellite clustering framework that enables the collaborative execution of deep learning (DL)-based space object detection tasks across multiple satellites.
  arXiv  Detail & Related papers  (2025-08-01T16:31:55Z)
• Low-altitude UAV Friendly-Jamming for Satellite-Maritime Communications via Generative AI-enabled Deep Reinforcement Learning [72.23178920029957]
  This paper presents a satellite-maritime communication system assisted by low-altitude unmanned aerial vehicle (UAV) friendly-jamming.<n>We formulate a secure satellite-maritime communication multi-objective optimization problem (SSMCMOP)<n>In order to solve the dynamic and long-term optimization problem, we reformulate it into a Markov decision process.<n>We then propose a transformer-enhanced soft actor-critic (TransSAC) algorithm, which is a generative artificial intelligence-enabled deep reinforcement learning approach.
  arXiv  Detail & Related papers  (2025-01-26T10:13:51Z)
• Efficient High-Resolution Visual Representation Learning with State Space Model for Human Pose Estimation [60.80423207808076]
  Capturing long-range dependencies while preserving high-resolution visual representations is crucial for dense prediction tasks such as human pose estimation.<n>We propose the Dynamic Visual State Space (DVSS) block, which augments visual state space models with multi-scale convolutional operations.<n>We build HRVMamba, a novel model for efficient high-resolution representation learning.
  arXiv  Detail & Related papers  (2024-10-04T06:19:29Z)
• A Distance Similarity-based Genetic Optimization Algorithm for Satellite Ground Network Planning Considering Feeding Mode [53.71516191515285]
  The low transmission efficiency of the satellite data relay back mission has become a problem that is currently constraining the construction of the system. We propose a distance similarity-based genetic optimization algorithm (DSGA), which considers the state characteristics between the tasks and introduces a weighted Euclidean distance method to determine the similarity between the tasks.
  arXiv  Detail & Related papers  (2024-08-29T06:57:45Z)
• Monte Carlo Tree Search Satellite Scheduling Under Cloud Cover Uncertainty [0.0]
  This paper addresses the multi-satellite collection scheduling problem (m-SatCSP) It aims to optimize task scheduling over a constellation of satellites under uncertain conditions such as cloud cover.
  arXiv  Detail & Related papers  (2024-05-31T15:50:46Z)
• Quantum Optimization Methods for Satellite Mission Planning [0.3252295747842729]
  The ever-growing amount of satellites in orbit underscores the need to operate them efficiently. Current classical algorithms often fail to find the global optimum or take too long to execute. Here, we approach the problem from a quantum computing point of view, which offers a promising alternative.
  arXiv  Detail & Related papers  (2024-04-08T13:36:29Z)
• Entanglement Distribution in Satellite-based Dynamic Quantum Networks [10.445684354981847]
  Low Earth Orbit (LEO) satellites present a compelling opportunity for the establishment of a global quantum information network. Existing works often do not account for satellite movement over time when distributing entanglement and/or often do not permit entanglement distribution along inter-satellite links. We first define a system model which considers both satellite movement over time and inter-satellite links.
  arXiv  Detail & Related papers  (2023-06-15T06:56:26Z)
• 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)
• Decentralized MCTS via Learned Teammate Models [89.24858306636816]
  We present a trainable online decentralized planning algorithm based on decentralized Monte Carlo Tree Search. We show that deep learning and convolutional neural networks can be employed to produce accurate policy approximators.
  arXiv  Detail & Related papers  (2020-03-19T13:10:20Z)

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.