arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2406.01949math.OC
收藏

用于快速避碰机动设计的递归多项式方法

Recursive Polynomial Method for Fast Collision Avoidance Maneuver Design

Zeno Pavanello, Laura Pirovano, Roberto Armellin

AI总结:

提出一种递归多项式避碰机动设计方法,通过任意阶PoC多项式近似与逐阶线性化,高效求解脉冲、多脉冲及低推力机动,并在多种动力学下验证。

摘要:

本文提出了一种简单可靠的避碰机动(CAM)算法,能够计算脉冲式、多脉冲式和低推力机动。碰撞概率(PoC)被近似为关于控制量的任意阶多项式,从而将CAM设计转化为一个多项式规划问题。求解过程首先通过一阶贪婪优化方法计算CAM,其中控制作用沿PoC梯度方向施加,以最大化其变化。随后,将多项式截断到更高阶,并利用前一阶的解对约束进行线性化。这使得即使对于高度非线性的安全指标和动力学,也能获得精确解。由于优化过程仅包含多项式求值,该方法计算效率高,运行时间通常低于1秒。此外,所考虑的动力学无需受到任何限制;因此,文中给出了开普勒、J2以及圆型限制性三体问题动力学下的结果。

英文摘要:

A simple and reliable algorithm for collision avoidance maneuvers (CAMs), capable of computing impulsive, multi-impulsive, and low-thrust maneuvers, is proposed. The probability of collision (PoC) is approximated by a polynomial of arbitrary order as a function of the control, transforming the CAM designinto a polynomial program. The solution procedure is initiated by computing the CAM via a first-order greedy optimization approach, wherein the control action is applied in the direction of the gradient of PoC to maximize its change. Successively, the polynomial is truncated at higher orders, and the solution of the previous order is used to linearize the constraint. This enables achieving accurate solutions even for highly nonlinear safety metrics and dynamics. Since the optimization process comprises only polynomial evaluations, the method is computationally efficient, with run times typically below 1 s. Moreover, no restrictions on the considered dynamics are necessary; therefore, results are shown for Keplerian, J2, and circular restricted three-body problem dynamics.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑