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.
Fast Autonomous Three-Axis Constrained Attitude Pathfinding and Visualization for Boresight Alignment,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
eess.SY 1years
2021 1verdicts
UNVERDICTED 1representative citing papers
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.