Midcourse Guidance Trajectory Planning Method Based on Pseudospectral Sequence Convex Programming

A method of course planning based on pseudospectral sequence convex programming is proposed to address the issues of slow generation speed, poor trapezoidal discrete fitting accuracy and the lack of a solution to strong equality terminal constraints in fixed time. This paper employs convex programmi...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2024 IEEE 25th China Conference on System Simulation Technology and its Application (CCSSTA) s. 1 - 6
Hlavní autoři: Zhang, Jinlin, Li, Jiong, Lei, Humin, Zhou, Chijun, He, Yangchao, Ji, Boyang
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 21.07.2024
Témata:
Accuracy
change trust region
fast generation
Fitting
Interpolation
Performance analysis
Planning
pseudospectral discretization
Relaxation methods
sequence convex programming
Systems simulation
terminal relaxation
Time factors
Trajectory
Trajectory planning
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:A method of course planning based on pseudospectral sequence convex programming is proposed to address the issues of slow generation speed, poor trapezoidal discrete fitting accuracy and the lack of a solution to strong equality terminal constraints in fixed time. This paper employs convex programming theory to enhance the efficiency of model solving and variable trust region to reduce the number of iterations. The model is discretized using the pseudo-spectrum method. A relaxation method for terminal constraints is proposed to relax strong equality constraints and constrain them in the performance index, thus ensuring that the trajectory can be generated quickly. The simulation outcomes reveal that the presented approach is capable of swiftly generating midcourse guidance trajectories that adhere to various constraints.
DOI:10.1109/CCSSTA62096.2024.10691746