Publication Date:
2019-07-13
Description:
A decomposition algorithm is presented that optimizes complex missions by partitioning the trajectory into natural segments such as ascent or entry. Each segment defines a full-rank targeting subproblem. These are solved sequentially using the Newton-Raphson algorithm. The master problem, representing the complete mission, is to determine subproblem targets and master-problem controls that optimize the mission objective subject to intersegment constraints. The gradient projection algorithm solves this problem using derivatives obtained analytically from finite-difference subproblem sensitivities. Thus, the mission is optimized by coordinating the solution of tractible subproblems. Computational results for a synchronous equatorial mission are included.
Keywords:
ASTRODYNAMICS
Type:
AAS PAPER 75-054
,
Astrodynamics Specialist Conference; Jul 28, 1975 - Jul 30, 1975; Nassau; Bahamas
Format:
text
Permalink