This paper outlines a novel approach to the design of optimal space trajectories under significant uncertainty. Finite-horizon covariance control, i.e., the steering of a system from an initial probability distribution to a desired one at a prescribed time, is employed to plan an optimal nominal path along with a robust feedback controller that compensates for exogenous in-flight disturbances. A mindful convexification strategy is devised to recast the nonlinear covariance control problem as a deterministic convex optimization problem. The convexification is based on a convenient change of variables that allows for relaxing the covariance matrix discrete-time propagation into a set of semidefinite cone constraints. While featuring a larger feasible space, the relaxed problem shares the same optimal solution as the original one. The lossless property of the relaxation is analytically proven by leveraging optimal control theory and discussed on the basis of numerical experiments. Monte Carlo campaigns are carried out to validate the in-flight performance of the attained control policies.
Convex approach to covariance control with application to stochastic low-thrust trajectory optimization / Benedikter, B; Zavoli, A; Wang, Zb; Pizzurro, S; Cavallini, E. - In: JOURNAL OF GUIDANCE CONTROL AND DYNAMICS. - ISSN 0731-5090. - 45:11(2022), pp. 2061-2075. [10.2514/1.G006806]
Convex approach to covariance control with application to stochastic low-thrust trajectory optimization
Benedikter, B
;Zavoli, A;Pizzurro, S;Cavallini, E
2022
Abstract
This paper outlines a novel approach to the design of optimal space trajectories under significant uncertainty. Finite-horizon covariance control, i.e., the steering of a system from an initial probability distribution to a desired one at a prescribed time, is employed to plan an optimal nominal path along with a robust feedback controller that compensates for exogenous in-flight disturbances. A mindful convexification strategy is devised to recast the nonlinear covariance control problem as a deterministic convex optimization problem. The convexification is based on a convenient change of variables that allows for relaxing the covariance matrix discrete-time propagation into a set of semidefinite cone constraints. While featuring a larger feasible space, the relaxed problem shares the same optimal solution as the original one. The lossless property of the relaxation is analytically proven by leveraging optimal control theory and discussed on the basis of numerical experiments. Monte Carlo campaigns are carried out to validate the in-flight performance of the attained control policies.File | Dimensione | Formato | |
---|---|---|---|
Benedikter_Convex_2022.pdf
solo gestori archivio
Note: https://arc.aiaa.org/doi/10.2514/1.G006806
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
1.72 MB
Formato
Adobe PDF
|
1.72 MB | Adobe PDF | Contatta l'autore |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.