cs.AINov 2, 2026

Offline Approximate Value Iteration: A Reinforcement Learning Approach for Satellite Constellation Deployment

Authors: Tristan Leuridan, Yiping Fang, Adam Abdin

Organizations: LGI

Abstract

This paper introduces a reinforcement learning-based approximate dynamic programming approach to optimize the deployment of Walker-type satellite constellations under uncertainties, including launch failures and satellite malfunctions. We formulate the problem as a Markov Decision Process that incorporates low-injection orbit launches, continuous low-thrust orbit raising, and variable satellite loads. We adopt the offline approximate value iteration solution method, using linear function approximation with basis functions and action pruning strategies to substantially reduce the computational and memory requirements for finding optimal decision policies. Preliminary results demonstrate convergence to policies with low expected costs and deployment times, both of which are lower than those of a rolling-horizon baseline, showcasing a novel application of approximate dynamic programming in space logistics.

Explore similar work

CardsList
  1. ASTRA: ADMM-Accelerated Topology Reconfiguration for Dynamic Satellite Constellations

    Sep 27, 2026João Norberto, Ricardo Ferreira, Cláudia SoaresDynamic Regret MinimizationWireless Communications

  2. Deep RL for Fast Long-Horizon Operations Scheduling on NASA's Carruthers Geocorona Observatory Mission

    Jun 20, 2026Alex Zhang, Jackson Craig, Lara WaldropReinforcement LearningLong-Horizon Planning

  3. VISTA: An Attention-Based Multi-Agent Reinforcement Learning Architecture for Space Situational Awareness Sensor Tasking

    Sep 20, 2026Miguel Leiva-Vélez, Adalberto Claudio Quiros, Nicolas Gaston Rozado +2Active SensingSpace Situational Awareness