An incremental approach to the solution of global trajectory optimization problems

Massimiliano Vasile, Matteo Ceriotti, Paolo De Pascale

Research output: Contribution to conferencePaper

Abstract

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.

Conference

ConferenceAdvances in Global Optimization: Methods and Applications
CityMykonos, Greece
Period13/06/0717/06/07

Fingerprint

Trajectories
Gravitation

Keywords

  • trajectory optimization
  • branch and prune
  • multi-gravity assist trajectories

Cite this

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, .
Vasile, Massimiliano ; Ceriotti, Matteo ; De Pascale, Paolo. / An incremental approach to the solution of global trajectory optimization problems. Paper presented at Advances in Global Optimization: Methods and Applications, Mykonos, Greece, .
@conference{b9ac3fedad3542e4aa7a73c579e5aa24,
title = "An incremental approach to the solution of global trajectory optimization problems",
abstract = "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.",
keywords = "trajectory optimization, branch and prune, multi-gravity assist trajectories",
author = "Massimiliano Vasile and Matteo Ceriotti and {De Pascale}, Paolo",
year = "2007",
month = "6",
day = "13",
language = "English",
note = "Advances in Global Optimization: Methods and Applications ; Conference date: 13-06-2007 Through 17-06-2007",

}

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, 13/06/07 - 17/06/07, .

An incremental approach to the solution of global trajectory optimization problems. / Vasile, Massimiliano; Ceriotti, Matteo; De Pascale, Paolo.

2007. Paper presented at Advances in Global Optimization: Methods and Applications, Mykonos, Greece, .

Research output: Contribution to conferencePaper

TY - CONF

T1 - An incremental approach to the solution of global trajectory optimization problems

AU - Vasile, Massimiliano

AU - Ceriotti, Matteo

AU - De Pascale, Paolo

PY - 2007/6/13

Y1 - 2007/6/13

N2 - 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.

AB - 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.

KW - trajectory optimization

KW - branch and prune

KW - multi-gravity assist trajectories

UR - http://www.ise.ufl.edu/cao/ago2007/

M3 - Paper

ER -

Vasile M, Ceriotti M, De Pascale P. An incremental approach to the solution of global trajectory optimization problems. 2007. Paper presented at Advances in Global Optimization: Methods and Applications, Mykonos, Greece, .