Direct multiple shooting transcription with polynomial algebra for optimal control problems under uncertainty

Greco, Cristian and Di Carlo, Marilena and Vasile, Massimiliano and Epenoy, Richard (2019) Direct multiple shooting transcription with polynomial algebra for optimal control problems under uncertainty. Acta Astronautica. ISSN 0094-5765 (https://doi.org/10.1016/j.actaastro.2019.12.010)

[thumbnail of Greco-etat-AA-2019-Direct-multiple-shooting-transcription-with-polynomial-algebra]
Preview
 Text. Filename: Greco_etat_AA_2019_Direct_multiple_shooting_transcription_with_polynomial_algebra.pdf
Accepted Author Manuscript
License: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 logo
Download (3MB)| Preview

Abstract

This paper proposes a novel approach to the solution of optimal control problems under uncertainty (OCPUUs). OCPUUs are first cast in a general formulation that allows the treatment of uncertainties of different nature, and then solved with a new direct transcription method that combines multiple shooting with generalised polynomial algebra to model and propagate extended sets. The continuity conditions on extended sets at the boundary of two adjacent segments are directly satisfied by a bounding approach. The Intrusive Polynomial Algebra aNd Multiple shooting Approach (IPANeMA) developed in this work can handle optimal control problems under a wide range of uncertainty models, including nonparametric, epistemic, and imprecise probability ones. In this paper, the approach is applied to the design of a robust low-thrust trajectory to a Near-Earth Object with uncertain initial conditions. It is shown that the new method provides more robust and reliable trajectories than the solution of an analogous deterministic optimal control problem.

ORCID iDs

Greco, Cristian ORCID logoORCID: https://orcid.org/0000-0001-5996-2114, Di Carlo, Marilena ORCID logoORCID: https://orcid.org/0000-0001-5046-3028, Vasile, Massimiliano ORCID logoORCID: https://orcid.org/0000-0001-8302-6465 and Epenoy, Richard;
CORE (COnnecting REpositories)