S/C and missions will benefit from an increased ability of planning autonomously maneuvers, be it for attitude or trajectory guidance.
Convex optimization includes a set of techniques to obtain the maximum or minimum point of a convex function taking into account dynamics and constraints, ensuring the existence of a feasible solution.
The TFM aims at:
Investigating Convex Optimization techniques
Reviewing existing Convex Optimization solvers
Investigating Convexification techniques, to render a non-convex problem actually convex
Apply convex optimization to a simplified scenario for attitude guidance or Moon landing
Define the problem
Convexify the problem
Implement the convexified problem
Select a solver and use it to solve the problem