This paper presents an incremental approach to the solution of multiple gravity assist trajectories (MGA) with deep space maneuvers. The whole problem is decomposed in sub-problems that are solved incrementally. The solution of each sub-problem leads to a progressive reduction of the search space. Unlike other similar methods, the search for solutions of each sub-problem is performed through a stochastic approach. The resulting set of disconnected boxes is transformed into a connected collection of boxes through an affine transformation. For MGA problems, the incremental approach increases both the efficiency and reliability of the optimization process. Two relevant examples will illustrate the effectiveness of the proposed method.
|Publication status||Published - 13 Jun 2007|
|Event||Advances in Global Optimization: Methods and Applications - Mykonos, Greece|
Duration: 13 Jun 2007 → 17 Jun 2007
|Conference||Advances in Global Optimization: Methods and Applications|
|Period||13/06/07 → 17/06/07|
- trajectory optimization
- branch and prune
- multi-gravity assist trajectories
Vasile, M., Ceriotti, M., & De Pascale, P. (2007). An incremental approach to the solution of global trajectory optimization problems. Paper presented at Advances in Global Optimization: Methods and Applications, Mykonos, Greece, .