Indirect Sequential Convex Programming for Mars Entry Trajectory Planning
摘要
This chapter proposes indirect sequential convex programming (ISCP) to maximize the Mars entry terminal altitude.