Nonlinear homotopy interior-point algorithm for 6-DoF powered landing guidance

被引:3
|
作者
Chen, Kai [1 ]
Zhang, Duo [1 ]
Wang, Kexin [1 ]
Shao, Zhijiang [1 ]
Biegler, Lorenz T. [2 ]
机构
[1] Zhejiang Univ, Coll Control Sci & Engn, Hangzhou 310027, Peoples R China
[2] Carnegie Mellon Univ, Dept Chem Engn, Pittsburgh, PA 15213 USA
关键词
Homotopy method; Interior -point method; Nonlinear optimization; 6-DoF powered landing; TRAJECTORY OPTIMIZATION; VERTICAL TAKEOFF; FRAMEWORK; DESCENT; MODELS;
D O I
10.1016/j.ast.2022.107707
中图分类号
V [航空、航天];
学科分类号
08 ; 0825 ;
摘要
The six-degree-of-freedom (6-DoF) powered landing guidance problem usually is difficult to solve for several reasons. First, this problem coupled with low-frequency translational and high-frequency rotational equations of motion is naturally large-scale. Second, the constraints enforced into the problem are highly coupled, nonlinear and non-convex, which makes the problem quite sensitive to the initial value guesses. Third, the initial position, velocity and attitude of the landing vehicle is quite difficult to forecast due to the complex endo-atmospheric environment, thus the traditional guidance methods are difficult to obtain a predetermined trajectory. In this paper, for the first time we proposed a nonlinear homotopy interior-point optimization algorithm (NHOPT) for solving the 6-DoF powered landing guidance problem. Different from general external homotopy strategies, we embed the concept of homotopy methods into the barrier line-search interior-point method. Using vertical landing without position and velocity offset, it is easy to provide initial guesses, which we define as the initial homotopy subproblem. Then a class of related homotopy subproblems is solved along a homotopy path using the algorithm until the original problem is converged. Numerical results demonstrate that the algorithm has high performance in terms of convergence and computational efficiency.(c) 2022 Elsevier Masson SAS. All rights reserved.
引用
收藏
页数:12
相关论文
共 50 条
  • [1] A Homotopy-based Nonlinear Interior-Point Method for NMPC
    Zanelli, Andrea
    Quirynen, Rien
    Jerez, Juan
    Diehl, Moritz
    IFAC PAPERSONLINE, 2017, 50 (01): : 13188 - 13193
  • [2] An Interior-Point Algorithm for Nonconvex Nonlinear Programming
    Robert J. Vanderbei
    David F. Shanno
    Computational Optimization and Applications, 1999, 13 : 231 - 252
  • [3] An interior-point algorithm for nonconvex nonlinear programming
    Vanderbei, RJ
    Shanno, DF
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 1999, 13 (1-3) : 231 - 252
  • [4] An Interior-Point Algorithm for Nonlinear Minimax Problems
    Obasanjo, E.
    Tzallas-Regas, G.
    Rustem, B.
    JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2010, 144 (02) : 291 - 318
  • [5] An Interior-Point Algorithm for Nonlinear Minimax Problems
    E. Obasanjo
    G. Tzallas-Regas
    B. Rustem
    Journal of Optimization Theory and Applications, 2010, 144 : 291 - 318
  • [7] A Combined Homotopy Infeasible Interior-Point Method for Convex Nonlinear Programming
    杨轶华
    吕显瑞
    刘庆怀
    NortheasternMathematicalJournal, 2006, (02) : 188 - 192
  • [8] A POSITIVE INTERIOR-POINT ALGORITHM FOR NONLINEAR COMPLEMENTARITY PROBLEMS
    马昌凤
    梁国平
    陈新美
    AppliedMathematicsandMechanics(EnglishEdition), 2003, (03) : 355 - 362
  • [9] Globally Convergent Interior-Point Algorithm for Nonlinear Programming
    I. Akrotirianakis
    B. Rustem
    Journal of Optimization Theory and Applications, 2005, 125 : 497 - 521
  • [10] A positive interior-point algorithm for nonlinear complementarity problems
    Ma, CF
    Liang, GP
    Chen, XM
    APPLIED MATHEMATICS AND MECHANICS-ENGLISH EDITION, 2003, 24 (03) : 355 - 362