Back to Search
Start Over
Maximum Divert for Planetary Landing Using Convex Optimization.
- Source :
-
Journal of Optimization Theory & Applications . Sep2014, Vol. 162 Issue 3, p975-995. 21p. - Publication Year :
- 2014
-
Abstract
- This paper presents a real-time solution method of the maximum divert trajectory optimization problem for planetary landing. In mid-course, the vehicle is to abort and retarget to a landing site as far from the nominal as physically possible. The divert trajectory must satisfy velocity constraints in the range and cross range directions and a total speed constraint. The thrust magnitude is bounded above and below so that once on, the engine cannot be turned off. Because this constraint is not convex, it is relaxed to a convex constraint and lossless convexification is proved. A transformation of variables is introduced in the nonlinear dynamics and an approximation is made so that the problem becomes a second-order cone problem, which can be solved to global optimality in polynomial time whenever a feasible solution exists. A number of examples are solved to illustrate the effectiveness and efficiency of the solution method. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00223239
- Volume :
- 162
- Issue :
- 3
- Database :
- Academic Search Index
- Journal :
- Journal of Optimization Theory & Applications
- Publication Type :
- Academic Journal
- Accession number :
- 97412612
- Full Text :
- https://doi.org/10.1007/s10957-013-0501-7