一种用于星载大气动力下降制导的快速算法
A Fast Algorithm for Onboard Atmospheric Powered Descent Guidance
AI总结:
针对非线性气动力使逐次凸化制导计算量过大的问题,提出结构化线性系统加速与热启动的实时内点法,运行时间较最快公开求解器缩短8/9,并在抗辐射处理器上验证星载可行性。
摘要:
大气动力下降制导可通过逐次凸化求解;然而,其在星载上的应用受到非线性气动力导致计算量急剧增加的阻碍。当忽略气动力时,该问题必须转化为一系列凸子问题,而非单个凸问题。此外,每个子问题都要复杂得多,从而增加了计算量。本工作提出了一种快速实时内点法,用于在星载上求解相关联的凸子问题。主要贡献如下:首先,提出了一种算法,通过利用特定的问题结构来加速线性方程组的求解,而线性方程组在每个迭代步骤中耗费大部分计算量。其次,引入了一种热启动方案,利用前一个子问题的粗略近似解来改进当前子问题的初始值,从而减少每个子问题所需的迭代步数。在用于评估求解器效率的蒙特卡洛仿真中,与所测试的最快公开可用求解器相比,所提出的方法将运行时间缩短了8/9(即降至原来的1/9)。在抗辐射飞行处理器上实现了约0.6秒量级的运行时间,证明了实时星载应用的潜力。
英文摘要:
Atmospheric powered descent guidance can be solved by successive convexification; however, its onboard application is impeded by the sharp increase in computation caused by nonlinear aerodynamic forces. The problem has to be converted into a sequence of convex subproblems instead of a single convex problem when aerodynamic forces are ignored. Besides, each subproblem is significantly more complicated, which increases computation. A fast real-time interior point method was presented to solve the correlated convex subproblems onboard in the work. The main contributions are as follows: Firstly, an algorithm was proposed to accelerate the solution of linear systems that cost most of the computation in each iterative step by exploiting the specific problem structure. Secondly, a warm-starting scheme was introduced to refine the initial value of a subproblem with a rough approximate solution of the former subproblem, which lessened the iterative steps required for each subproblem. The method proposed reduced the run time by a factor of 9 compared with the fastest publicly available solver tested in Monte Carlo simulations to evaluate the efficiency of solvers. Runtimes on the order of 0.6 s are achieved on a radiation-hardened flight processor, which demonstrated the potential of the real-time onboard application.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。