Optimization of multiple-rendezvous low-thrust missions on general-purpose graphics processing units
Optimization of multiple-rendezvous low-thrust missions on general-purpose graphics processing units
Amassively parallel method for the identification of optimal sequences of targets in multiple-rendezvous low-thrust missions is presented. Given a list of possible targets, a global search of sequences compatible with the mission requirements is performed. To estimate the feasibility of each transfer, a heuristic model based on Lambert's transfers is evaluated in parallel for each target, making use of commonly available general-purpose graphics processing units such as the Nvidia Tesla cards. The resulting sequences are ranked by user-specified criteria such as length or fuel consumption. The resulting preliminary sequences are then optimized to a full low-thrust trajectory using classical methods for each leg. The performance of the method is discussed as a function of various parameters of the algorithm. The efficiency of the general-purpose graphics processing unit implementation is demonstrated by comparing it with a traditional CPU-based branch-and-bound method. Finally, the algorithm is used to compute asteroid sequences used in a solution submitted to the seventh edition of the Global Trajectory Optimization Competition.
80-92
Massari, Mauro
6b6f72d2-7e3a-4394-87c3-9fb0e51b75ec
Wittig, Alexander
3a140128-b118-4b8c-9856-a0d4f390b201
1 July 2016
Massari, Mauro
6b6f72d2-7e3a-4394-87c3-9fb0e51b75ec
Wittig, Alexander
3a140128-b118-4b8c-9856-a0d4f390b201
Massari, Mauro and Wittig, Alexander
(2016)
Optimization of multiple-rendezvous low-thrust missions on general-purpose graphics processing units.
Journal of Aerospace Information Systems, 13 (2), .
(doi:10.2514/1.I010390).
Abstract
Amassively parallel method for the identification of optimal sequences of targets in multiple-rendezvous low-thrust missions is presented. Given a list of possible targets, a global search of sequences compatible with the mission requirements is performed. To estimate the feasibility of each transfer, a heuristic model based on Lambert's transfers is evaluated in parallel for each target, making use of commonly available general-purpose graphics processing units such as the Nvidia Tesla cards. The resulting sequences are ranked by user-specified criteria such as length or fuel consumption. The resulting preliminary sequences are then optimized to a full low-thrust trajectory using classical methods for each leg. The performance of the method is discussed as a function of various parameters of the algorithm. The efficiency of the general-purpose graphics processing unit implementation is demonstrated by comparing it with a traditional CPU-based branch-and-bound method. Finally, the algorithm is used to compute asteroid sequences used in a solution submitted to the seventh edition of the Global Trajectory Optimization Competition.
This record has no associated files available for download.
More information
Published date: 1 July 2016
Identifiers
Local EPrints ID: 419784
URI: http://eprints.soton.ac.uk/id/eprint/419784
PURE UUID: 4f5cb2b0-c0d7-4af2-aa24-f47f03124c7a
Catalogue record
Date deposited: 20 Apr 2018 16:30
Last modified: 16 Mar 2024 04:30
Export record
Altmetrics
Contributors
Author:
Mauro Massari
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics