Optimal low-thrust orbital transfer for servicing multiple satellites in elliptical orbits

This paper addresses the problem of finding the optimal sequence and trajectory for a servicer satellite that has to visit multiple client satellites, minimizing the fuel spent and satisfying Keplerian dynamics and low-thrust propulsion constraints. The cost of each transfer is evaluated through two different functions: an analytical cost function based on Edelbaum’s theory (three orbital elements transfer), and a Q-law based cost function (five orbital elements transfer). The global optimal sequence is found by using mixed integer linear programming. The proposed methodology is demonstrated on two datasets of satellites located in near-circular and high-eccentricity orbits, respectively. The computation results show a high performance in terms of computational time and accuracy. • Solving optimal trajectory planning for low-thrust multi-client servicing missions. • No assumptions on client orbits characteristics; adaptable for elliptical orbits. • Assessing single-target transfer costs using two tailored near-optimal metrics. • Reducing complexity with a minimal Mixed-Integer Linear Programming formulation. • Testing on Medium Earth Orbit datasets to minimize fuel in multi-client trajectories.

Authors

Institutions

Publication Details

Journal
Acta Astronautica
Published
2024-12-24
DOI
https://doi.org/10.1016/j.actaastro.2024.12.030
Citations
6
Primary Topic
Space Satellite Systems and Control
Type
article
Field-Weighted Citation Impact
7.79
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Optimal low-thrust orbital transfer for servicing multiple satellites in elliptical orbits

Riccardo Apa, Jennifer Hudson, Marcello Romano, Isaac Kaminer
6 citations
Acta Astronautica
Space Satellite Systems and Control
7.79
article

Optimal low-thrust orbital transfer for servicing multiple satellites in elliptical orbits

Riccardo Apa, Jennifer Hudson, Marcello Romano, Isaac Kaminer
article en
6 citations

Abstract

This paper addresses the problem of finding the optimal sequence and trajectory for a servicer satellite that has to visit multiple client satellites, minimizing the fuel spent and satisfying Keplerian dynamics and low-thrust propulsion constraints. The cost of each transfer is evaluated through two different functions: an analytical cost function based on Edelbaum’s theory (three orbital elements transfer), and a Q-law based cost function (five orbital elements transfer). The global optimal sequence is found by using mixed integer linear programming. The proposed methodology is demonstrated on two datasets of satellites located in near-circular and high-eccentricity orbits, respectively. The computation results show a high performance in terms of computational time and accuracy. • Solving optimal trajectory planning for low-thrust multi-client servicing missions. • No assumptions on client orbits characteristics; adaptable for elliptical orbits. • Assessing single-target transfer costs using two tailored near-optimal metrics. • Reducing complexity with a minimal Mixed-Integer Linear Programming formulation. • Testing on Medium Earth Orbit datasets to minimize fuel in multi-client trajectories.

Acta AstronauticaVol. 228
Politecnico di Torino (IT), Naval Postgraduate School (US)
Openalex Percentile: Top 3%
Space Satellite Systems and Control
7.79
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Optimal low-thrust orbital transfer for servicing multiple satellites in elliptical orbits — Riccardo Apa, Jennifer Hudson, et al. · Acta Astronautica (2024) | TGRS Research Map | TGRS