Pitch Program Optimization via Genetic Algorithm and Sequential Quadratic Programming

摘要

Purpose – This article aims at investigating the effect of different modeling of pitch program on optimizingflight path of a launch vehicle for loading it with the maximum amount of payload in LEO orbit and then determiningwhich program is the optimum pitch program.Design/methodology/approach – Three types of pitch programs havingsquare-linear, square-inverse sine, and linear-constant formats have been investigated. Optimization problem has beensolved in order that optimization parameters existing in each pitch program be identified. The methods adopted to solve theoptimization problem are SQP and Genetic algorithm.Findings – Selecting the model of the optimum pitch programregarding the constraints of the problem for putting the maximum amount of payload in the orbit. Investigation of Geneticalgorithm and SQP methods and comparing their outcomes and choosing the more appropriate method. Practicalimplications – In order that a launch vehicle reaches its target, it should take the best path. Pitch program specificallyindicates the guidance path of a launch vehicle in the direction of reaching the orbit. There are various algorithms for pitchprogram. Investigation of three types of major and practical algorithms in the flight and indicating their differences can beimmensely helpful in finding a more accurate algorithm for pitch program.Originality – This article is innovative anddiffers from previous investigations conducted in this field due to the way optimization parameters have been selected. Theselection of vertical flight time as one of the optimization parameters and comparison of three pitch programs have beenquite rare in other studies. The selection of separation angle at different stages as one of the optimization parameters is oneof the main differences of this work with previous studies.