面向弹道导弹防御的快速最优拦截弹道规划

Translated title of the contribution: Rapid Optimal Intercept Trajectory Planning for Ballistic Missile Defense

Yaxuan Li*, Yan Wang*, Xinfu Liu*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

A rapid optimal intercept trajectory planning method based on neural network is proposed for solving the intercept trajectory planning problem of ballistic missile defense. Firstly,the optimal intercept trajectory cluster is generated by optimizing the trajectory of the powered phase. Then,the optimal intercept point and intercept trajectory with respect to the maximum intercept velocity are determined based on the optimal intercept trajectory cluster. To improve the efficiency,the neural networks are used to establish the mapping relationships between the intercept point and the intercept velocity,intercept time,and trajectory parameters. For the trajectory optimization problem of the powered phase,a trajectory optimization algorithm based on nonlinearity-kept convexification is proposed. This paper integrate the nonlinearity of dynamics by using the Taylor formula,properly preserve the nonlinearity by defining new variables and introducing new constraints,and then linearize an obtained control-affine system to get linear dynamics. This method effectively improves the convergence of the algorithm,and the convergence issue caused by directly linearizing dynamics can be avoided. Simulation results demonstrate that the proposed method has good reliability and real-time performance.

Translated title of the contributionRapid Optimal Intercept Trajectory Planning for Ballistic Missile Defense
Original languageChinese (Traditional)
Pages (from-to)1931-1943
Number of pages13
JournalYuhang Xuebao/Journal of Astronautics
Volume45
Issue number12
DOIs
Publication statusPublished - Dec 2024

Fingerprint

Dive into the research topics of 'Rapid Optimal Intercept Trajectory Planning for Ballistic Missile Defense'. Together they form a unique fingerprint.

Cite this