Deterministic Multistage Constellation Reconfiguration Using Integer Programming and Sequential Decision-Making Methods

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Lee, Hang Woon, Rogers, David O. Williams, Pearl, Brycen D., Chen, Hao, Ho, Koki
Formato: Preprint
Publicado: 2024
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866913948966584320
author Lee, Hang Woon
Rogers, David O. Williams
Pearl, Brycen D.
Chen, Hao
Ho, Koki
author_facet Lee, Hang Woon
Rogers, David O. Williams
Pearl, Brycen D.
Chen, Hao
Ho, Koki
contents In this paper, we address the problem of reconfiguring Earth observation satellite constellation systems through multiple stages. The Multi-stage Constellation Reconfiguration Problem (MCRP) aims to maximize the total observation rewards obtained by covering a set of targets of interest through the active manipulation of the orbits and relative phasing of constituent satellites. In this paper, we consider deterministic problem settings in which the targets of interest are known a priori. We propose a novel integer linear programming formulation for MCRP, capable of obtaining provably optimal solutions. To overcome computational intractability due to the combinatorial explosion in solving large-scale instances, we introduce two computationally efficient sequential decision-making methods based on the principles of a myopic policy and a rolling horizon procedure. The computational experiments demonstrate that the devised sequential decision-making approaches yield high-quality solutions with improved computational efficiency over the baseline MCRP. Finally, a case study using Hurricane Harvey data showcases the advantages of multi-stage constellation reconfiguration over single-stage and no-reconfiguration scenarios.
format Preprint
id arxiv_https___arxiv_org_abs_2401_11567
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Deterministic Multistage Constellation Reconfiguration Using Integer Programming and Sequential Decision-Making Methods
Lee, Hang Woon
Rogers, David O. Williams
Pearl, Brycen D.
Chen, Hao
Ho, Koki
Optimization and Control
Systems and Control
In this paper, we address the problem of reconfiguring Earth observation satellite constellation systems through multiple stages. The Multi-stage Constellation Reconfiguration Problem (MCRP) aims to maximize the total observation rewards obtained by covering a set of targets of interest through the active manipulation of the orbits and relative phasing of constituent satellites. In this paper, we consider deterministic problem settings in which the targets of interest are known a priori. We propose a novel integer linear programming formulation for MCRP, capable of obtaining provably optimal solutions. To overcome computational intractability due to the combinatorial explosion in solving large-scale instances, we introduce two computationally efficient sequential decision-making methods based on the principles of a myopic policy and a rolling horizon procedure. The computational experiments demonstrate that the devised sequential decision-making approaches yield high-quality solutions with improved computational efficiency over the baseline MCRP. Finally, a case study using Hurricane Harvey data showcases the advantages of multi-stage constellation reconfiguration over single-stage and no-reconfiguration scenarios.
title Deterministic Multistage Constellation Reconfiguration Using Integer Programming and Sequential Decision-Making Methods
topic Optimization and Control
Systems and Control
url https://arxiv.org/abs/2401.11567