arXiv:2611.02809v1 Announce Type: new
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.
arxiv
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.
Presents a concrete, novel RL application to a real-world space logistics problem with measurable improvements over baselines.
Comments & Questions (0)
No comments yet
Be the first to comment!