Solar sail trajectory cost estimation with transfer learning

Many future space missions will require evaluating a large number of orbital transfers to determine an optimal combination thereof (for instance for asteroid exploration or debris removal), likely using low-thrust propulsion such as solar sailing. Optimising individual trajectories is already a non-trivial process so evaluating millions for a multi-target mission can become prohibitively computationally expensive. This cost is further amplified if the spacecraft model changes as the mission design progresses, meaning that a previously computed set of trajectories may need to be re-evaluated. Artificial neural networks are often used to approximate the cost of optimal trajectories with a very fast inference time, but require upfront computational, including generating pre-optimised trajectories for training. This paper considers a scenario where two solar sail models need to be evaluated, and ANNs are trained to approximate the duration of minimum-time transfers. It is shown that an ANN does not need to be trained afresh (requiring an extensive training database) for both models—rather, an ANN trained to a good accuracy on one model can be fine-tuned on a smaller training database for the other model (and arbitrarily many others), saving a significant amount of time on database generation.

Authors

Institutions

Publication Details

Journal
Advances in Space Research
Published
2026-04-01
DOI
https://doi.org/10.1016/j.asr.2026.03.108
Primary Topic
Spacecraft Dynamics and Control
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Solar sail trajectory cost estimation with transfer learning

Colin R. McInnes, Matteo Ceriotti, Edward Tomanek-Volynets
Advances in Space Research
Spacecraft Dynamics and Control
article

Solar sail trajectory cost estimation with transfer learning

Colin R. McInnes, Matteo Ceriotti, Edward Tomanek-Volynets
article en

Abstract

Many future space missions will require evaluating a large number of orbital transfers to determine an optimal combination thereof (for instance for asteroid exploration or debris removal), likely using low-thrust propulsion such as solar sailing. Optimising individual trajectories is already a non-trivial process so evaluating millions for a multi-target mission can become prohibitively computationally expensive. This cost is further amplified if the spacecraft model changes as the mission design progresses, meaning that a previously computed set of trajectories may need to be re-evaluated. Artificial neural networks are often used to approximate the cost of optimal trajectories with a very fast inference time, but require upfront computational, including generating pre-optimised trajectories for training. This paper considers a scenario where two solar sail models need to be evaluated, and ANNs are trained to approximate the duration of minimum-time transfers. It is shown that an ANN does not need to be trained afresh (requiring an extensive training database) for both models—rather, an ANN trained to a good accuracy on one model can be fine-tuned on a smaller training database for the other model (and arbitrarily many others), saving a significant amount of time on database generation.

Advances in Space Research
University of Glasgow (GB)
European Space Agency, Royal Academy of Engineering, Engineering and Physical Sciences Research Council, Department for Science, Innovation and Technology
Openalex Percentile: Top 11%
Spacecraft Dynamics and Control
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.