Research on Online Flight Path Optimization Algorithm of Aircraft Based on Convex Optimization Method

Flight path optimization is to design an optimal flight path that minimizes an objective function under certain constraints. Because of the existence of many constraints, the objective function is non-convex function and most of the constraints are non-convex constraints, the flight path optimization problem of the aircraft is non-convex optimization problem with high constraints, and it is very difficult to solve the optimal control problem. In this paper, a convex optimization method is used to solve the flight path optimization problem of aircraft. The original non-convex optimization problem is transformed into a convex optimization problem after convex optimization treatment, which has the potential to solve complex optimization problems online and in real time. Simulation results show that the optimal solution can be obtained in a short time by using this method to solve the flight path optimization problem of aircraft. Compared with other optimization algorithms, the optimization time can be increased by more than 90%, which has good adaptability and high engineering application value.