TY - GEN

T1 - Using genetic algorithms for the construction of a space mission automaton

AU - Chilan, Christian M.

AU - Conway, Bruce A.

PY - 2009/11/25

Y1 - 2009/11/25

N2 - Many interesting problems in numerical optimization are hybrid optimal control problems. Hybrid optimal control (HOC) problems include both continuousvalued variables and categorical variables in the problem formulation. For the types of problems envisioned here the categorical variables will specify the structure or sequence of events that qualitatively describes the trajectory or mission. Continuous variables are used in the modeling of the continuous dynamics. In this work, the mission planning problem is of interest. The problem is qualitatively different from the typical interception of multiple targets as the discrete variables now represent events like impulses, coast and thrust arcs that change the structure of the problem. In addition, the number of events in the categorical sequence is not fixed. For the dynamical assembly of events required for the solution of the mission planning problem, a scheme that defines events as modules consisting of parameters and constraints is presented. The method assembles the respective events one next to the other in time according to the given mission structure. For the generation of the initial guess, two new methods were developed that approximate optimal low-thrust trajectories. The first method, based on genetic algorithms (GA), handles the rendezvous constraints explicitly using a conditional penalty function. The second method, Feasible Region Analysis (FRA), is based on GA and nonlinear programming (NLP), which allows taking advantage of the GA capabilities in finding a global optimum and NLP ability in handling constraints. A rendezvous problem with known solution is solved.

AB - Many interesting problems in numerical optimization are hybrid optimal control problems. Hybrid optimal control (HOC) problems include both continuousvalued variables and categorical variables in the problem formulation. For the types of problems envisioned here the categorical variables will specify the structure or sequence of events that qualitatively describes the trajectory or mission. Continuous variables are used in the modeling of the continuous dynamics. In this work, the mission planning problem is of interest. The problem is qualitatively different from the typical interception of multiple targets as the discrete variables now represent events like impulses, coast and thrust arcs that change the structure of the problem. In addition, the number of events in the categorical sequence is not fixed. For the dynamical assembly of events required for the solution of the mission planning problem, a scheme that defines events as modules consisting of parameters and constraints is presented. The method assembles the respective events one next to the other in time according to the given mission structure. For the generation of the initial guess, two new methods were developed that approximate optimal low-thrust trajectories. The first method, based on genetic algorithms (GA), handles the rendezvous constraints explicitly using a conditional penalty function. The second method, Feasible Region Analysis (FRA), is based on GA and nonlinear programming (NLP), which allows taking advantage of the GA capabilities in finding a global optimum and NLP ability in handling constraints. A rendezvous problem with known solution is solved.

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

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

U2 - 10.1109/CEC.2009.4983229

DO - 10.1109/CEC.2009.4983229

M3 - Conference contribution

AN - SCOPUS:70449885940

SN - 9781424429592

T3 - 2009 IEEE Congress on Evolutionary Computation, CEC 2009

SP - 2316

EP - 2323

BT - 2009 IEEE Congress on Evolutionary Computation, CEC 2009

T2 - 2009 IEEE Congress on Evolutionary Computation, CEC 2009

Y2 - 18 May 2009 through 21 May 2009

ER -