The primal-dual interior-point algorithm implemented in G-OPT is a relatively new and efficient way of solving convex optimization problems. Given a prescribed level of accuracy, the convergence to the optimal solution is guaranteed in a predetermined, finite number of iterations. G-OPT Version 1.0 is a flight software implementation written in C. Onboard application of the software enables autonomous, real-time guidance and control that explicitly incorporates mission constraints such as control authority (e.g. maximum thrust limits), hazard avoidance, and fuel limitations. This software can be used in planetary landing missions (Mars pinpoint landing and lunar landing), as well as in proximity operations around small celestial bodies (moons, asteroids, and comets). It also can be used in any spacecraft mission for thrust allocation in six-degrees-of-freedom control.
Implementation of a Point Algorithm for Real-Time Convex Optimization
2007-12-01
Miscellaneous
No indication
English
SOLUTIONS - Software - Implementation of a Point Algorithm for Real-Time Convex Optimization
Online Contents | 2007
A REAL-TIME ALGORITHM FOR NON-CONVEX POWERED DESCENT GUIDANCE
TIBKAT | 2020
|Real-Time Landing Point Redesignation (LPR) Algorithm
AIAA | 2008
|