Relaxation Method

Author: Tianjiang Shuo

Website: https://cislunarspace.cn

Definition

A strategy within direct methods that relaxes nonconvex dynamics or operational constraints into convex ones, transforming the original problem into a tractable convex optimization problem. A typical application is second-order cone programming relaxation in Mars powered descent guidance.

Application Value

在轨道设计阶段，该方法可用于求解低能量转移轨道，减少推进剂消耗。该优化方法计算效率高，适合处理带约束的轨迹优化问题。

Related Concepts

• Hill Sphere Radius
• Pseudospectral Convex Optimization
• Poincaré Map Representation
• Minimum Norm Targeting

References

• You and Dai, 2022, JGCD, doi:10.2514/1.G006815