Trajectory optimization for aerodynamically controlled missiles by chance-constrained sequential convex programming

Peng Zhang

doi:10.1016/j.ast.2024.109464

2024-10-01

PRE

Peng Zhang

Wu, D

Shengping Gong *

DOI：10.1016/j.ast.2024.109464

原文链接

原文求助

摘要

En 中文

The flight environment of aerodynamically controlled missiles is full of complexity and uncertainty. To cope with the uncertainty more effectively and enhance the convergence performance in trajectory optimization problems for aerodynamically controlled missiles simultaneously, the chance-constrained sequential convex programming (CC-SCP) algorithm is proposed in this paper. The uncertainty is regarded as the chance constraint, and a smooth and differential approximation function is designed to transform this chance constraint into the constraint that the convex optimization method can handle. Subsequently, the originally non-convex trajectory optimization problem is reformulated into a series of convex optimization subproblems, in which an initial reference trajectory guess generation strategy is proposed, and a theoretical proof of the exact convex relaxation is given to enhance the algorithm's convergence performance and theoretical value, respectively. Numerical simulations are provided to verify the convergence and effectiveness of the CC-SCP algorithm, and the advantages of using the CC-SCP algorithm to cope with the uncertainty are illustrated. Furthermore, comparative simulation examples show that the proposed algorithm possesses a low conservatism, which means the proposed algorithm can obtain a bigger convergence region and a better solution than other current methods when handling the same chance constraints. Finally, the robustness of the algorithm is discussed.

Keyword:

Convex optimization

Chance constraints

SCP

Aerodynamically controlled missile