Optimal low thrust trajectories to the moon

被引:102
作者
Betts, JT
Erb, SO
机构
[1] Boeing Co, Math & Comp Technol, Seattle, WA 98124 USA
[2] Univ Stuttgart, Inst Flugmech & Flugregelung, D-70550 Stuttgart, Germany
关键词
optimal control; sparse nonlinear programming; orbit transfer;
D O I
10.1137/S1111111102409080
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The direct transcription or collocation method has demonstrated notable success in the solution of trajectory optimization and optimal control problems. This approach combines a sparse nonlinear programming algorithm with a discretization of the trajectory dynamics. A challenging class of optimization problems occurs when the spacecraft trajectories are characterized by thrust levels that are very low relative to the vehicle weight. Low thrust trajectories are demanding because realistic forces, due to oblateness, and third-body perturbations often dominate the thrust. Furthermore, because the thrust is so low, significant changes to the orbits require very long duration trajectories. When a collocation method is applied to a problem of this type, the resulting nonlinear program is very large, because the trajectories are long, and very nonlinear because of the perturbing forces. This paper describes the application of the transcription method to compute an optimal low thrust transfer from an Earth orbit to a specified lunar mission orbit. It is representative of the SMART-1 or "Small Missions for Advanced Research in Technology" of the ESA scientific program [J. Schoenmaekers, J. Pulido, and R. Jehn, Tech. report S1-ESC-RP-5001, European Space Agency, 1998]. The spacecraft is deployed from an Ariane-5 into an elliptic Earth centered park orbit. The goal is to insert the spacecraft into a lunar orbit that is polar and elliptic and has its pericenter above the south pole. The spacecraft utilizes a solar electric propulsion system. The goal is to compute the optimal steering during the orbit transfer, which takes over 200 days, so that the fuel consumption is minimized. The vehicle dynamics are defined using a modified set of equinoctial coordinates, and the trajectory modeling is described using these dynamics. A solution is presented that requires the solution of a sparse optimization problem with 211031 variables and 146285 constraints. The trajectory we present requires two very long thrust arcs, and, consequently, the overall mission duration is much shorter than multiburn trajectories. Issues related to the numerical conditioning and problem formulation are discussed.
引用
收藏
页码:144 / 170
页数:27
相关论文
共 21 条
[1]  
BATTIN RH, 1987, INTR MATH METHODS AS
[2]  
Betts J., 1994, INT SERIES NUMERICAL, V115, P3
[3]  
BETTS JT, 1993, INT S NUM M, P115
[4]   PATH-CONSTRAINED TRAJECTORY OPTIMIZATION USING SPARSE SEQUENTIAL QUADRATIC-PROGRAMMING [J].
BETTS, JT ;
HUFFMAN, WP .
JOURNAL OF GUIDANCE CONTROL AND DYNAMICS, 1993, 16 (01) :59-68
[5]  
BETTS JT, 1993, J ASTRONAUT SCI, V41, P349
[6]  
BETTS JT, 1994, J ASTRONAUT SCI, V42, P247
[7]  
BETTS JT, 2001, ADV DES CONTROL, V3
[8]  
*BOEING INF SUPP S, 2001, MCTTECH01014 BOEING
[9]  
Broucke R. A., 1972, Celestial Mechanics, V5, P303, DOI 10.1007/BF01228432
[10]  
EDELBAUM TN, 1973, P AIAA 10 EL PROP C