Metraipolis › archive › dc_fc09f97262a3
Offline Approximate Value Iteration: A Reinforcement Learning Approach for Satellite Constellation Deployment — arXiv:2611.02809
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.02809
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T10:32:58.134Z
- SHA-256 of the archived text
32abc6059e4eece1839a616e9a59c31593b917a26e68b1741c03a49091f9bc08- Stable URL of this page
https://metraipolis.com/documento/dc_fc09f97262a3
How to cite
Offline Approximate Value Iteration: A Reinforcement Learning Approach for Satellite Constellation Deployment — arXiv:2611.02809 — arXiv (en), https://arxiv.org/abs/2611.02809 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fc09f97262a3 (Metraipolis archive dc_fc09f97262a3, sha256 32abc6059e4eece1839a616e9a59c31593b917a26e68b1741c03a49091f9bc08)
BibTeX
@misc{dcfc09f97262a3,
title = {Offline Approximate Value Iteration: A Reinforcement Learning Approach for Satellite Constellation Deployment — arXiv:2611.02809},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.02809},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fc09f97262a3; sha256 32abc6059e4eece1839a616e9a59c31593b917a26e68b1741c03a49091f9bc08},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.02809. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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. Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.AI, nuovi lavori del giorno). Categorie arXiv: Artificial Intelligence (cs.AI) ; Optimization and Control (math.OC). Pagina del lavoro: https://arxiv.org/abs/2611.02809 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-03T10:29:48.594Z dalla pagina https://arxiv.org/list/cs.AI/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).