Metraipolis › archive › dc_0922192f78ee

Risk-Sensitive Mission Planning for Multi-Target On-Orbit Inspection via Distributional Reinforcement Learning — arXiv:2610.41647

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.41647
License (as archived)
CC0-1.0
Archived
2026-11-03T08:01:35.847Z
SHA-256 of the archived text
6a22f71ce98b57d3a29d2bda04ed859f30c265ce22d57d7a9bfbb4ad39c6db34
Stable URL of this page
https://metraipolis.com/documento/dc_0922192f78ee

How to cite

Risk-Sensitive Mission Planning for Multi-Target On-Orbit Inspection via Distributional Reinforcement Learning — arXiv:2610.41647 — arXiv (en), https://arxiv.org/abs/2610.41647 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_0922192f78ee (Metraipolis archive dc_0922192f78ee, sha256 6a22f71ce98b57d3a29d2bda04ed859f30c265ce22d57d7a9bfbb4ad39c6db34)
BibTeX
@misc{dc0922192f78ee,
  title = {Risk-Sensitive Mission Planning for Multi-Target On-Orbit Inspection via Distributional Reinforcement Learning — arXiv:2610.41647},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.41647},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_0922192f78ee; sha256 6a22f71ce98b57d3a29d2bda04ed859f30c265ce22d57d7a9bfbb4ad39c6db34},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.41647. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Multi-target on-orbit servicing missions require planning tools that can adapt to evolving operational conditions while accounting for the outcome variability inherent to safety-critical spaceflight. This paper presents an adaptive planning approach for multi-target servicing campaigns in low Earth orbit and applies it to inspection missions flown by a low-thrust servicer. The approach is based on Distributional Reinforcement Learning, which learns the full distribution of mission returns and thereby supports explicit risk-sensitive decision-making at each planning step. Specifically, a Quantile-Regression Deep Q-Network (QR-DQN) agent selects which target to inspect next by jointly considering the expectation and the variance of the predicted return through a mean-variance criterion. The mission environment models circular orbits with a spread in inclination and uses Edelbaum's combined-manoeuvre low-thrust transfer estimates. The observation comprises the orbital elements, the visit history, the observed risk state of each target and the remaining mission-time budget. The risk state of each target changes stochastically during the campaign, making the outcome of an inspection uncertain and creating operationally meaningful distinctions between risk-neutral and risk-averse planning strategies. Because the mission-time budget generally admits only a subset of the candidate targets, the planner must also select which targets to inspect. Numerical experiments on scenarios with five target satellites show that one risk-aversion weight moves the policy across a range of mean return and return variance, over an unchanged environment and reward. Risk-averse agents reduce the variance of the episodic return by approximately one half relative to risk-neutral agents and lower the probability of a mission loss, at a cost in mean return. To validate the learned policies, the efficient frontier, which gives the highest mean return attainable at each level of return variance, is computed exactly by enumerating the admissible visit orders. At equal variance, the learned policies lie close to this frontier in mean return, and the risk-averse policies have a lower probability of a mission loss than the frontier policies.

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/2610.41647 — 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-03T07:59:38.728Z dalla pagina https://arxiv.org/list/cs.AI/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).