← 研踪 PaperTrailarXiv:2611.02809 · v1
Offline Approximate Value Iteration: A Reinforcement Learning Approach for Satellite Constellation Deployment
首次提交 2026-11-02 17:17
版本更新 2026-11-02 17:17
雷达观测 2026-11-04 23:42
摘要
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.
期刊信息：3rd Conference on AI in and for Space (SPAICE 2026), European Space Agency (ESA), Oct 2026, Noordwijk, Netherlands
观测到的版本
相邻记录可能跳过中间版本；首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-02 17:17 · 最新观测版本
Offline Approximate Value Iteration: A Reinforcement Learning Approach for Satellite Constellation Deployment
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.
查看此版本解读 →查看此版本原文 ↗