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 条
  • [21] A robust primal-dual interior-point algorithm for nonlinear programs
    Liu, XW
    Sun, J
    SIAM JOURNAL ON OPTIMIZATION, 2004, 14 (04) : 1163 - 1186
  • [22] Iteration complexity of an interior-point algorithm for nonlinear P*-complementarity problems
    Zhao, YB
    Han, JY
    Xu, ZZ
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1999, 70 (04) : 699 - 715
  • [23] A filter interior-point algorithm with projected Hessian updating for nonlinear optimization
    Gu C.
    Zhu D.
    Journal of Applied Mathematics and Computing, 2009, 29 (1-2) : 67 - 80
  • [24] An interior-point algorithm for matrix games
    Wang, Xin
    Wang, Yong-li
    Zhu, Xiao-rong
    Proceedings of the Second International Conference on Game Theory and Applications, 2007, : 205 - 208
  • [25] Homotopy Interior-Point Method for a General Multiobjective Programming Problem
    Zhao, X.
    Zhang, S. G.
    Liu, Q. H.
    JOURNAL OF APPLIED MATHEMATICS, 2012,
  • [26] A note on the implementation of an interior-point algorithm for nonlinear optimization with inexact step computations
    Frank E. Curtis
    Johannes Huber
    Olaf Schenk
    Andreas Wächter
    Mathematical Programming, 2012, 136 : 209 - 227
  • [27] An infeasible interior-point arc-search algorithm for nonlinear constrained optimization
    Yamashita, Makoto
    Iida, Einosuke
    Yang, Yaguang
    NUMERICAL ALGORITHMS, 2022, 89 (01) : 249 - 275
  • [28] Learning to steer nonlinear interior-point methods
    Kuhlmann, Renke
    EURO JOURNAL ON COMPUTATIONAL OPTIMIZATION, 2019, 7 (04) : 381 - 419
  • [29] Interior-point nonlinear algorithm with complementarity constraints for reactive-power optimization
    Li, Bin
    Wei, Hua
    Li, Peijie
    Dianli Zidonghua Shebei/Electric Power Automation Equipment, 2010, 30 (02): : 53 - 58
  • [30] An infeasible interior-point arc-search algorithm for nonlinear constrained optimization
    Makoto Yamashita
    Einosuke Iida
    Yaguang Yang
    Numerical Algorithms, 2022, 89 : 249 - 275