Messenger (full version)
This trajectory optimisation problem represents a rendezvous mission to Mercury modelled as an MGA-1DSM problem. The selected fly-by sequence and other parameters are compatible with the currently flying Messenger mission. With respect to the problem Messenger (reduced)” the fly-by sequence is more complex and allows for resonant fly-bys at Mercury to lower the arrival DV. As far as chemical propelled interplanetary trajectories go, this particular one is particularly complex and difficult to design. The amount of specialistic knowledge that needs to be used to obtain a successfull design is significant and, before the remarkable results from G. Stracquadanio, A. La Ferla and G. Nicosia (see below) were found, it was hardly believable that a computer, given the fly-by sequence and an ample launch window, could design a good trajectory in complete autonomy without making use of additional problem knowledge.
- MATLAB: use the function messengerfull.m and pass to it the MGAproblem variable contained in messengerfull.mat
- C++: call the function “double messengerfull(const std::vector & x)” provided in the GTOPtoolbox.
- C++ (PaGMO): use the class pagmo::problem::messeger_full
- Python 2.7 (PyGMO): use PyGMO.problem.messeger_full().objfun(x)
The box bounds on each of the decision vector variable are given below.
No other constraints are considered for this problem. The objective function is considered to the precision of meters per second.
The best solutions submitted to this problem are listed below in chronological order.