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. The major contribution of the present paper is a mindful convexification strategy 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 to relax 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, as proven by numerical experiments, hence demonstrating that the proposed relaxation is lossless. Monte Carlo campaigns are carried out to validate the in-flight performance of the attained control policies.
Covariance control for stochastic low-thrust trajectory optimization / Benedikter, Boris; Zavoli, Alessandro; Wang, Zhenbo; Pizzurro, Simone; Cavallini, Enrico. - (2022). (Intervento presentato al convegno AIAA Science and Technology Forum and Exposition, AIAA SciTech Forum 2022 tenutosi a San Diego, CA; USA) [10.2514/6.2022-2474].
Covariance control for stochastic low-thrust trajectory optimization
Benedikter, Boris
;Zavoli, Alessandro;Pizzurro, Simone;Cavallini, Enrico
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. The major contribution of the present paper is a mindful convexification strategy 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 to relax 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, as proven by numerical experiments, hence demonstrating that the proposed relaxation is lossless. Monte Carlo campaigns are carried out to validate the in-flight performance of the attained control policies.File | Dimensione | Formato | |
---|---|---|---|
Benedikter_Covariance_2022.pdf
solo gestori archivio
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
1.45 MB
Formato
Adobe PDF
|
1.45 MB | Adobe PDF | Contatta l'autore |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.