A sequential convex programming method reformulates non-convex spacecraft pointing objectives into convex cardinality minimization problems to maximize science observation time during a comet flyby under dynamics and fault constraints.
Model Predictive Control in Aerospace Systems: Current State and Opportunities
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Numerical simulations demonstrate that combining extremum-seeking command generation with predictive cost adaptive control enables asymptotic optimization of unknown costs alongside stabilization and disturbance rejection.
citing papers explorer
-
Optimal Science-time Reorientation Policy for the Comet Interceptor Flyby via Sequential Convex Programming
A sequential convex programming method reformulates non-convex spacecraft pointing objectives into convex cardinality minimization problems to maximize science observation time during a comet flyby under dynamics and fault constraints.
-
A Numerical Investigation of Extremum-Seeking-Based Command Generation for Adaptively Controlled Systems
Numerical simulations demonstrate that combining extremum-seeking command generation with predictive cost adaptive control enables asymptotic optimization of unknown costs alongside stabilization and disturbance rejection.