Trajectory Generation Using Genetic and Sequential Quadratic Programming Methods 2001-01-3001

A comparison is made between constrained, two-dimensional, reentry reference trajectories generated by genetic and sequential quadratic programming methods. The objective is to generate a reentry trajectory with minimum control while satisfying constraints on dynamic pressure, heating, lifting, final velocity and altitude. It is shown that the genetic programming method discovered much smoother trajectories that easily satisfy all constraints.