Incremental planning of multi-gravity assist trajectories

Massimiliano Vasile, Juan Manuel Romero Martin, Luca Masi, Edmondo Minisci, Richard Epenoy, Vincent Martinot, Jordi Fontdecaba Baig

Research output: Contribution to journalArticle

12 Citations (Scopus)
104 Downloads (Pure)

Abstract

Abstract The paper presents a novel algorithm for the automatic planning and scheduling of multi-gravity assist trajectories (MGA). The algorithm translates the design of a MGA transfer into a planning and scheduling process in which each planetary encounter is seen as a scheduled task. All possible transfers form a directional graph that is incrementally built and explored simultaneously forward from the departure planet to the arrival one and backward from the arrival planet to the departure one. Nodes in the graph (or tree) represent tasks (or planetary encounters). Backward and forward generated transfers are then matched during the construction of the tree to improve both convergence and exploration. It can be shown, in fact, that the multi-directional exploration of the tree allows for better quality solutions for the same computational cost. Unlike branch and prune algorithms that use a set of deterministic branching and pruning heuristics, the algorithm proposed in this paper progressively builds a probabilistic model over all the possible tasks that form a complete trajectory. No branch is pruned but the probability of selecting one particular task increases as the algorithm progresses in the search for a solution. The effectiveness of the algorithm is demonstrated on the design optimization of the trajectory of Marco Polo, JUICE and MESSENGER missions.

Original languageEnglish
Pages (from-to)407-421
Number of pages15
JournalActa Astronautica
Volume115
Early online date4 Jun 2015
DOIs
Publication statusPublished - Oct 2015
Event65th International Astronautical Congress (IAC 2014) - Metro Toronto Convention Centre, Toronto, Canada
Duration: 29 Sep 20143 Oct 2014

Fingerprint

Gravitation
Trajectories
Planning
Planets
Scheduling
Costs

Keywords

  • combinatorial optimization
  • discrete optimization
  • interplanetary trajectory design
  • multi-gravity assist
  • physarum
  • planning

Cite this

Vasile, Massimiliano ; Romero Martin, Juan Manuel ; Masi, Luca ; Minisci, Edmondo ; Epenoy, Richard ; Martinot, Vincent ; Baig, Jordi Fontdecaba. / Incremental planning of multi-gravity assist trajectories. In: Acta Astronautica. 2015 ; Vol. 115. pp. 407-421.
@article{aa0d9a9039da4f429ba7380750131901,
title = "Incremental planning of multi-gravity assist trajectories",
abstract = "Abstract The paper presents a novel algorithm for the automatic planning and scheduling of multi-gravity assist trajectories (MGA). The algorithm translates the design of a MGA transfer into a planning and scheduling process in which each planetary encounter is seen as a scheduled task. All possible transfers form a directional graph that is incrementally built and explored simultaneously forward from the departure planet to the arrival one and backward from the arrival planet to the departure one. Nodes in the graph (or tree) represent tasks (or planetary encounters). Backward and forward generated transfers are then matched during the construction of the tree to improve both convergence and exploration. It can be shown, in fact, that the multi-directional exploration of the tree allows for better quality solutions for the same computational cost. Unlike branch and prune algorithms that use a set of deterministic branching and pruning heuristics, the algorithm proposed in this paper progressively builds a probabilistic model over all the possible tasks that form a complete trajectory. No branch is pruned but the probability of selecting one particular task increases as the algorithm progresses in the search for a solution. The effectiveness of the algorithm is demonstrated on the design optimization of the trajectory of Marco Polo, JUICE and MESSENGER missions.",
keywords = "combinatorial optimization, discrete optimization, interplanetary trajectory design, multi-gravity assist, physarum, planning",
author = "Massimiliano Vasile and {Romero Martin}, {Juan Manuel} and Luca Masi and Edmondo Minisci and Richard Epenoy and Vincent Martinot and Baig, {Jordi Fontdecaba}",
year = "2015",
month = "10",
doi = "10.1016/j.actaastro.2015.05.033",
language = "English",
volume = "115",
pages = "407--421",
journal = "Acta Astronautica",
issn = "0094-5765",

}

Incremental planning of multi-gravity assist trajectories. / Vasile, Massimiliano; Romero Martin, Juan Manuel; Masi, Luca; Minisci, Edmondo; Epenoy, Richard; Martinot, Vincent; Baig, Jordi Fontdecaba.

In: Acta Astronautica, Vol. 115, 10.2015, p. 407-421.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Incremental planning of multi-gravity assist trajectories

AU - Vasile, Massimiliano

AU - Romero Martin, Juan Manuel

AU - Masi, Luca

AU - Minisci, Edmondo

AU - Epenoy, Richard

AU - Martinot, Vincent

AU - Baig, Jordi Fontdecaba

PY - 2015/10

Y1 - 2015/10

N2 - Abstract The paper presents a novel algorithm for the automatic planning and scheduling of multi-gravity assist trajectories (MGA). The algorithm translates the design of a MGA transfer into a planning and scheduling process in which each planetary encounter is seen as a scheduled task. All possible transfers form a directional graph that is incrementally built and explored simultaneously forward from the departure planet to the arrival one and backward from the arrival planet to the departure one. Nodes in the graph (or tree) represent tasks (or planetary encounters). Backward and forward generated transfers are then matched during the construction of the tree to improve both convergence and exploration. It can be shown, in fact, that the multi-directional exploration of the tree allows for better quality solutions for the same computational cost. Unlike branch and prune algorithms that use a set of deterministic branching and pruning heuristics, the algorithm proposed in this paper progressively builds a probabilistic model over all the possible tasks that form a complete trajectory. No branch is pruned but the probability of selecting one particular task increases as the algorithm progresses in the search for a solution. The effectiveness of the algorithm is demonstrated on the design optimization of the trajectory of Marco Polo, JUICE and MESSENGER missions.

AB - Abstract The paper presents a novel algorithm for the automatic planning and scheduling of multi-gravity assist trajectories (MGA). The algorithm translates the design of a MGA transfer into a planning and scheduling process in which each planetary encounter is seen as a scheduled task. All possible transfers form a directional graph that is incrementally built and explored simultaneously forward from the departure planet to the arrival one and backward from the arrival planet to the departure one. Nodes in the graph (or tree) represent tasks (or planetary encounters). Backward and forward generated transfers are then matched during the construction of the tree to improve both convergence and exploration. It can be shown, in fact, that the multi-directional exploration of the tree allows for better quality solutions for the same computational cost. Unlike branch and prune algorithms that use a set of deterministic branching and pruning heuristics, the algorithm proposed in this paper progressively builds a probabilistic model over all the possible tasks that form a complete trajectory. No branch is pruned but the probability of selecting one particular task increases as the algorithm progresses in the search for a solution. The effectiveness of the algorithm is demonstrated on the design optimization of the trajectory of Marco Polo, JUICE and MESSENGER missions.

KW - combinatorial optimization

KW - discrete optimization

KW - interplanetary trajectory design

KW - multi-gravity assist

KW - physarum

KW - planning

UR - http://www.scopus.com/inward/record.url?scp=84933503244&partnerID=8YFLogxK

U2 - 10.1016/j.actaastro.2015.05.033

DO - 10.1016/j.actaastro.2015.05.033

M3 - Article

VL - 115

SP - 407

EP - 421

JO - Acta Astronautica

JF - Acta Astronautica

SN - 0094-5765

ER -