![]() |
GTOP Database - MGA-1DSM problems GOTP is a database containing the exact definition of some global optimisation spacecraft trajectory problems and their best putative solutions. |
The MGA-1DSM Global Optimisation Problem Should any research group find better solution than the ones reported here, they are encouraged to submit them to us ( |
|
Problems "TandEM-Atlas501" (Note: 50 instances) Tandem fall under the European Space Agency's "Cosmic Visions" umbrella, containing missions that are designed to tackle some of the big scientific questions concerning the evolution of the Solar System and our place in it. The mission is designed to follow in the footsteps of Cassini-Huygens in the Saturnian system, with the ultimate destination of Titan, via Enceladus. The particular problem instance we propose is to maximise the final mass injected in a high eccentricity Saturn orbit, starting from a launch with Atlas501 and using 25 different fly-by sequences. This creates 25 different problem instances. A constraint on the total flight duration (ten years) can also be included so that the total number of problems is here 50. The problem is transcribed into a maximization problem where the final mass is the objective. |
|
Problem "Messenger Full " (Note: difficult version) This trajectory optimisation problem represents a rendezvous mission to Mercury modelled as an MGA-1DSM problem. It includes the final resonant fly-bys, and seeks to minimse the on-board propellant consumption. Note that with respect to the 'easy' version of the problem also the objective function changes as here we consider the spacecraft DV, while in the 'easy' version the total DV is minimised. To compare the results in the two problem one needs to add (or subtract) the VINF to the objective function found. |
|
Problem "Messenger" (Note: easy version) This trajectory optimisation problem represents a rendezvous mission to Mercury modelled as an MGADSM problem. The selected fly-by sequence is the same used in the first part of the real Messenger mission, but no resonant fly-bys are modelled as to simplify the problem structure. A larger bound is, though, considered on launch date. |
|
Problem "Cassini2" Here we consider a different model for the Cassini trajectory with respect to the "Cassini1" case: deep space maneuvers are allowed between each one of the planets. This leads to a higher dimensional problem and to a higher complexity. We also consider, in the objective function evaluation, the final DV as a rendezvous rather than as an orbital insertion as in the "Cassini1" case. |
|
Problem "Rosetta" The problem presented in this section is a MGA-1DSM problem relative to a mission to the comet 67P/Churyumov-Gerasimenko. The fly-by sequence selected is similar to the one planned for the spacecraft Rosetta. The objective function considered is the total mission deltaV , including the launcher capabilities. |
|
Problem "SAGAS" In this trajectory problem we design what is commonly called a deltaV-EGA manouvre to then fly-by Jupiter and reach 50AU. The objective function considered is the overall mission length and has to be minimsed. This creates an MGADSM problem where two more variables need to be added to the decision vector in order to be able to evaluate the keplerian orbit reached after the last fly-by. |
|
Credits These web pages have been created by Dario Izzo and Tamas Vinko. Credits for all the code made here available goes to Dario Izzo, Tamas Vinko and Marco del Rey Zapatero. |








