Guidance for six-degrees-of-freedom powered descent is more challenging due to its stronger nonlinearity compared to three-degrees-of-freedom. The standard convex programming algorithm has been difficult to effectively address this problem. To enhance the performance of successive convex programming in terms of both optimality and accuracy, an adaptive pseudospectral successive convex optimization algorithm is proposed in this paper. First, it transforms the nonlinear optimal control problem into a convex subproblem by integrating global pseudospectral discretization with local linearization. Second, a parameter-adaptive successive convexification algorithm is proposed, which adaptively adjusts the trust region size based on the update rate of the optimal trajectory. Last, the global error and local error are accurately calculated based on the pseudospectral method. To tackle the issue of excessively large local errors caused by nonlinearity, an adaptive grid method is proposed to refine the mesh grid. Simulation results demonstrate the efficacy of the proposed pseudospectral convex optimization method and adaptive mesh grid method in reducing local errors and improving solution accuracy. Furthermore, the proposed parameter-adaptive successive convex optimization algorithm exhibits adaptability and optimality across different initial conditions, while also improving solution accuracy.

Adaptive pseudospectral successive convex optimization for six-degree-of-freedom powered descent guidance / Gao, Duozhi; Gong, Youmin; Li, Chuanjiang; Guo, Yanning; Fadda, Edoardo; Brandimarte, Paolo. - In: AEROSPACE SCIENCE AND TECHNOLOGY. - ISSN 1270-9638. - 155:(2024), pp. 1-21. [10.1016/j.ast.2024.109544]

Adaptive pseudospectral successive convex optimization for six-degree-of-freedom powered descent guidance

Fadda, Edoardo;Brandimarte, Paolo
2024

Abstract

Guidance for six-degrees-of-freedom powered descent is more challenging due to its stronger nonlinearity compared to three-degrees-of-freedom. The standard convex programming algorithm has been difficult to effectively address this problem. To enhance the performance of successive convex programming in terms of both optimality and accuracy, an adaptive pseudospectral successive convex optimization algorithm is proposed in this paper. First, it transforms the nonlinear optimal control problem into a convex subproblem by integrating global pseudospectral discretization with local linearization. Second, a parameter-adaptive successive convexification algorithm is proposed, which adaptively adjusts the trust region size based on the update rate of the optimal trajectory. Last, the global error and local error are accurately calculated based on the pseudospectral method. To tackle the issue of excessively large local errors caused by nonlinearity, an adaptive grid method is proposed to refine the mesh grid. Simulation results demonstrate the efficacy of the proposed pseudospectral convex optimization method and adaptive mesh grid method in reducing local errors and improving solution accuracy. Furthermore, the proposed parameter-adaptive successive convex optimization algorithm exhibits adaptability and optimality across different initial conditions, while also improving solution accuracy.
File in questo prodotto:
File Dimensione Formato  
1-s2.0-S1270963824006746-main.pdf

non disponibili

Tipologia: 2a Post-print versione editoriale / Version of Record
Licenza: Non Pubblico - Accesso privato/ristretto
Dimensione 2.97 MB
Formato Adobe PDF
2.97 MB Adobe PDF   Visualizza/Apri   Richiedi una copia
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11583/2992305