Iteratively feasible optimal spacecraft guidance with non-convex path constraints using convex optimization

Keyphrases

• Obstacle Avoidance 100%
• Nonconvex 100%
• Convex Optimization 100%
• Path Constraints 100%
• Spacecraft Guidance 100%
• Guidance Problem 100%
• Proposed Methodology 50%
• Computational Resources 50%
• Optimization Approach 50%
• Programming Approaches 50%
• Convex Programming 50%
• Linear Dynamics 50%
• Real-time Operation 50%
• Monotonic Convergence 50%
• Optimal Guidance 50%
• Sequential Convex Programming 50%
• Polynomial Trajectory 50%
• Fuel-optimal 50%
• Sum-of-squares Programming 50%
• Keep-out Zone 50%
• Wiltshire 50%
• Unexpected Situations 50%
• Plume Impingement 50%
• Inner Convex Approximation 50%
• Convex Obstacle 50%
• Convex-concave Procedure 50%

Computer Science

• Convex Optimization 100%
• Obstacle Avoidance 100%
• Path Constraint 100%
• Approximation (Algorithm) 50%
• Quality Solution 50%
• Objective Function 50%
• Convex Programming 50%
• Sum-of-Squares Programming 50%

Engineering

• Obstacle Avoidance 100%
• Spacecraft Guidance 100%
• Objective Function 50%
• Spacecraft Relative 50%
• Solution Convergence 50%