Offline Approximate Value Iteration: A Reinforcement Learning Approach for Satellite Constellation Deployment
Researchers introduce a reinforcement learning-based approximate dynamic programming method to optimize Walker-type satellite constellation deployment under uncertainties like launch failures and satellite malfunctions. The approach uses offline approximate value iteration with linear function approximation and action pruning to reduce computational demands. Preliminary results show lower expected costs and deployment times compared to a rolling-horizon baseline, demonstrating a novel application of approximate dynamic programming in space logistics.
Why it matters: Presents a concrete, novel RL application to a real-world space logistics problem with measurable improvements over baselines.