Markov Decision Processes for Satellite Maneuver Planning and Collision Avoidance

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Kuhl, William, Wang, Jun, Eddy, Duncan, Kochenderfer, Mykel
Formato: Preprint
Publicado: 2025
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866912178033917952
author Kuhl, William
Wang, Jun
Eddy, Duncan
Kochenderfer, Mykel
author_facet Kuhl, William
Wang, Jun
Eddy, Duncan
Kochenderfer, Mykel
contents This paper presents a decentralized, online planning approach for scalable maneuver planning for large constellations. While decentralized, rule-based strategies have facilitated efficient scaling, optimal decision-making algorithms for satellite maneuvers remain underexplored. As commercial satellite constellations grow, there are benefits of online maneuver planning, such as using real-time trajectory predictions to improve state knowledge, thereby reducing maneuver frequency and conserving fuel. We address this gap in the research by treating the satellite maneuver planning problem as a Markov decision process (MDP). This approach enables the generation of optimal maneuver policies online with low computational cost. This formulation is applied to the low Earth orbit collision avoidance problem, considering the problem of an active spacecraft deciding to maneuver to avoid a non-maneuverable object. We test the policies we generate in a simulated low Earth orbit environment, and compare the results to traditional rule-based collision avoidance techniques.
format Preprint
id arxiv_https___arxiv_org_abs_2501_02667
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Markov Decision Processes for Satellite Maneuver Planning and Collision Avoidance
Kuhl, William
Wang, Jun
Eddy, Duncan
Kochenderfer, Mykel
Robotics
Systems and Control
This paper presents a decentralized, online planning approach for scalable maneuver planning for large constellations. While decentralized, rule-based strategies have facilitated efficient scaling, optimal decision-making algorithms for satellite maneuvers remain underexplored. As commercial satellite constellations grow, there are benefits of online maneuver planning, such as using real-time trajectory predictions to improve state knowledge, thereby reducing maneuver frequency and conserving fuel. We address this gap in the research by treating the satellite maneuver planning problem as a Markov decision process (MDP). This approach enables the generation of optimal maneuver policies online with low computational cost. This formulation is applied to the low Earth orbit collision avoidance problem, considering the problem of an active spacecraft deciding to maneuver to avoid a non-maneuverable object. We test the policies we generate in a simulated low Earth orbit environment, and compare the results to traditional rule-based collision avoidance techniques.
title Markov Decision Processes for Satellite Maneuver Planning and Collision Avoidance
topic Robotics
Systems and Control
url https://arxiv.org/abs/2501.02667