基于Gauss伪谱法的有限推力轨道转移优化

研究了Gauss伪谱法在有限推力轨道转移优化问题中的应用。首先在消除奇点的拟春分点轨道要素的非奇异摄动方程基础上,选取性能指标为能量最优,控制变量为有限推力发动机加速度的3个分量;然后,利用Gauss伪谱法将最优控制问题转化为非线性规划问题,避开了求解两点边值问题的困难;最后给出了2个算例,分别计算了同面转移轨道和异面转移轨道的能量最优化转移。计算过程及结果表明本文所用方法对初值猜测敏感度较小,且平稳收敛,具有一定的鲁棒性,转移轨道平稳光滑,能够满足各种约束条件,便于对发动机进行控制,且在零倾角零偏心率轨道情况下不产生奇异。因此,Gauss伪谱法可用来求解轨道转移优化问题。     

应用非线性规划求解异面最优轨道转移问题

研究了一种应用非线性规化求解有限推力作用下异面最优轨道转移问题的方法。采用改进春分点根素形式的高斯行星方程，从庞德里亚金极小值原理出发，将有限推力作用下异面最优轨道转移问题转化为两点边值问题；在考虑边界条件、横截条件及开关函数的前提下，将两点边值问题转化为针对协状态初值等的参数优化问题；最后应用非线性规划方法求解形成的参数优化问题。本方法特点是能得到开关函数从而得到最优发动机开关机逻辑。文章最后通过一个仿真计算，演示了完整的求解过程，验证了方法的有效性。     

小推力最优轨迹协态估计的高效机器学习方法

针对变比冲小推力轨迹间接优化中的协态变量初值猜测问题,提出了一种基于机器学习的协态变量初值高精度高效估计方法。首先,基于标称最优轨迹延拓,建立了状态量边值高扰动上限情形下的数据集生成方法,并分析了扰动上限对求解效率的影响。然后,构建了基于位置速度、轨道根数和改进春分点轨道根数多形式状态量组合输入的人工神经网络(ANN)映射关系,分析并优化了神经网络结构。将提出的方法应用于深空探测小推力转移场景,仿真结果表明该方法相对于标称轨迹直接扰动的数据集生成方法及单一形式状态量输入的人工神经网络映射方法,均有效地提升了求解收敛率,能够高效高精度地估计协态变量初值,实现轨迹快速优化。     

基于伪光谱方法的有限推力轨道转移优化设计

研究了伪光谱方法在空间飞行器有限推力轨道转移最优化问题中的应用。首先给出了空间飞行器轨道转移最优化控制问题模型,其中运动方程为三自由度模型,性能指标选为轨道转移过程中燃料消耗最小,控制变量为推力攻角。终端状态受到航迹角、高度和速度的约束。然后,应用伪光谱方法将最优控制问题离散化为非线性规划问题,即将动态优化问题转化为静态参数最优化问题。选取各配点上的状态量和控制量作为优化参数。最后应用基于Matlab语言的SNOPT软件包对参数最优化问题进行求解,该软件包对于求解大型非线性规划问题具有很好的收敛性。仿真结果表明伪光谱方法对于空间飞行器转移轨道初始参数取值不敏感,具有一定的鲁棒性,生成的轨道能够较好地满足各种约束条件。因此,伪光谱方法对于空间飞行器有限推力轨道转移问题的求解是可行的。     

采用SDRE方法的无径向推力最优轨道控制

针对无径向推力作用的两航天器轨道交会和编队卫星队形重构任务,采用状态依赖Riccati方程(SDRE)方法求解了其最优轨道控制问题。首先考虑J2摄动和推力仅存在于追踪航天器的周向和法向,推导了状态依赖配点(SDC)形式的非线性相对运动方程。然后针对终端状态为零的轨道交会问题,采用SDRE方法得到了最优反馈控制律,并给出了状态依赖Riccati微分方程的近似求解策略和数值求解策略。接着扩展了SDRE方法并将其用于终端状态不为零的编队卫星队形重构问题,并给出了相应的数值求解策略。相比于伪谱法等优化方法,本文提出的方法不需要初始猜测值。此外,数值仿真表明,解析求解Riccati微分方程方法对于近圆轨道具有较高的精度,数值计算方法对即使偏心率为0.3的椭圆轨道,其最优性偏差仍小于6%。     

基于解析梯度的经典Lambert问题迭代求解方法

针对现有求解模型复杂、收敛速度慢等问题,在将经典Lambert转移问题转化为超越方程的基础上,提出一种基于解析梯度的Lambert问题迭代求解算法。选择转移轨道的真近点角为迭代变量,导出转移时间关于真近点角的解析梯度,构造一种基于解析梯度的牛顿迭代算法,降低了算法计算复杂度。理论分析表明该算法具有二阶以上的收敛速度。依据偏心率向量与转移轨道形状的关系,通过几何方法分析得到转移轨道在初始位置处的速度约束条件,推导转移轨道真近点角的最大值和最小值的解析表达式,并采用线性插值方法确定迭代初值,进一步提高了迭代算法的收敛速度。数学仿真结果表明在各种转移条件下算法均能快速收敛,采用所给出的初值选取方法初值确定精度高,进而能够加快收敛速度,而与较割线法相比较收敛速度快、计算量小,验证了所提出算法的有效性。     

基于序列二次规划算法的再入轨迹优化研究

介绍了序列二次规划算法在飞行器再入轨迹优化问题中的应用.首先引入了能量替代变量对无量纲运动方程进行推导,使得运动方程和优化问题易于处理,考虑严格的过程约束和终端约束,以攻角和倾侧角为控制变量,总加热量最小为性能指标;然后通过直接配点法将最优控制问题转化为非线性规划问题,选取各节点的状态量和控制量作为优化参数;最后应用序列二次规划算法对非线性规划问题进行求解.针对多约束的再入飞行器的轨迹优化时对初值敏感的问题,提出一种参考轨迹快速规划算法,提高了优化速度.仿真结果表明提出的方法能够较快地搜索到最优轨迹,满足所有约束且落点精度高.     

地球-火星的燃料最省小推力转移轨道的设计与优化

小推力转移轨道的设计与优化一直是深空探测轨道设计方面的难点。针对这些问题，提出了一种基于等高线图的初始发射机会搜索方法，该方法通过绘制探测器一火星距离的等高线图寻找满足任务约束的小推力转移轨道发射机会；同时，本文还给出了一种小推力轨道的直接优化算法，该算法通过将连续的控制变量参数化，把轨道优化问题转化为参数优化问题，然后基于所提搜索方法，采用逐次二次规划方法进行求解。数值计算验证了该发射机会初值猜测方法和优化算法的有效性。     

基于SQP方法的常推力月球软着陆轨道优化方法

月球软着陆是未来月球探测中的一项关键技术。针对这项技术，本文给出了一种基于SQP方法的常推力月球软着陆轨道优化方法。该方法通过将常推力月球软着陆轨道离散化，利用离散点处状态连续作为约束条件，把常推力月球软着陆轨道优化问题归结为一个非线性规划问题，对于此问题的求解，其初值均为有物理意义的状态和控制量，从而避免了采用传统优化方法在解决此优化问题时对没有物理意义变量初值的猜测。最后，利用SQP方法求解了此轨道优化问题。仿真计算结果表明这种离散化的方法应用于此轨道优化问题可以避免传统轨道优化方法对初值敏感的问题。     

航天器近距离视觉制导自主机动轨道优化

研究具有视觉导引路径约束的航天器近距离机动轨道优化数值计算问题。首先,给出了带路径约束的椭圆参考轨道航天器近距离轨道机动最优化问题数学模型。利用高斯伪谱法将上述最优化问题转化为非线性规划问题,优化参数为配点上的状态量和控制量。然后,利用MATLAB的SNOPT软件包对非线性规划问题进行求解。最后通过数值仿真验证了方法的有效性和鲁棒性。     

Optimization of Multi-Orbit Transfers between Noncoplanar Elliptic Orbits

Using the maximum principle formalism, the problem of optimizing interorbital transfer between two noncoplanar elliptic orbits is reduced to solution of a boundary value problem for a system of ordinary differential equations. In order to solve the resulting boundary value problem numerically, the numerical homotopic method or modified Newton's method is used. When solving the boundary value problem, the right-hand sides of differential equations of motion are averaged numerically. Efficient software is developed, and a large number of optimal trajectories are calculated using it. As a result of analysis of these numerical data, new high-quality results are obtained. Specifically, a bifurcation of optimal solutions is found, the existence of critical inclination is demonstrated, and a partial classification of the structure of optimal control is performed.     

有限推力下相对绕飞轨道的直接形成

提出了一种有限推力下主动航天器在完成轨道转移的同时形成相对目标航天器绕飞的方法。根据以改进春分点轨道根数表示的非奇异轨道摄动方程,用变分方法将问题转化为经典的最优控制,由相对运动动力学获得主动航天器实现绕飞须满足的终端约束条件,再用非线性规划求解。给出了求解模型。理论分析和仿真结果表明,该方法理论上可行,但为减少干扰产生的偏差,还需对绕飞形成过程中的导引率进行研究。     

Optimal ballistically captured Earth–Moon transfers

The optimality of a low-energy Earth–Moon transfer terminating in ballistic capture is examined for the first time using primer vector theory. An optimal control problem is formed with the following free variables: the location, time, and magnitude of the transfer insertion burn, and the transfer time. A constraint is placed on the initial state of the spacecraft to bind it to a given initial orbit around a first body, and on the final state of the spacecraft to limit its Keplerian energy with respect to a second body. Optimal transfers in the system are shown to meet certain conditions placed on the primer vector and its time derivative. A two point boundary value problem containing these necessary conditions is created for use in targeting optimal transfers. The two point boundary value problem is then applied to the ballistic lunar capture problem, and an optimal trajectory is shown. Additionally, the problem is then modified to fix the time of transfer, allowing for optimal multi-impulse transfers. The tradeoff between transfer time and fuel cost is shown for Earth–Moon ballistic lunar capture transfers.     

Approximate solutions to minimax optimal control problems for aeroassisted orbital transfer

This paper considers minimax problems of optimal control arising in the study of aeroassisted orbital transfer. The maneuver considered involves the coplanar transfer from a high planetary orbit to a low planetary orbit. An example is the HEO-to-LEO transfer of a spacecraft, where HEO denotes high Earth orbit and LEO denotes low Earth orbit. In particular, HEO can be GEO, a geosynchronous Earth orbit.The basic idea is to employ the hybrid combination of propulsive maneuvers in space and aerodynamic maneuvers in the sensible atmosphere. Hence, this type of flight is also called synergetic space flight. With reference to the atmospheric part of the maneuver, trajectory control is achieved by means of lift modulation. The presence of upper and lower bounds on the lift coefficient is considered.The following minimax problems of optimal control are investigated: (i) minimize the peak heating rate, problem P1; and (ii) minimize the peak dynamic pressure, problem P2. It is shown that problems P1 and P2 are approximately equivalent to the following minimax problem of optimal control: (iii) minimize the peak altitude drop occurring in the atmospheric portion of the trajectory, problem P3.Problems P1–P3 are Chebyshev problems of optimal control, which can be converted into Bolza problems by suitable transformations. However, the need for these transformations can be bypassed if one reformulates problem P3 as a two-subarc problem of optimal control, in which the first subarc connects the initial point and the point where the path inclination is zero, and the second subarc connects the point where the path inclination is zero and the final point: (iv) minimize the altitude drop achieved at the point of junction between the first subarc and the second subarc, problem P4. Note that problem P4 is a Bolza problem of optimal control.Numerical solutions for problems P1–P4 are obtained by means of the sequential gradient-restoration algorithm for optimal control problems. Numerical examples are presented, and their engineering implications are discussed. In particular, it is shown that, from an engineering point of view, it is desirable to solve problem P3 or P4, rather than problems P1 and P2.     

有限推力交会的最省燃料轨迹

给出了航天器有限推力交会的最省燃料轨迹。首先应用三角变换技术将推力约束 转化为没有任何约束的虚拟控制,进而利用直接优化方法,应用参数化控制方法以及强化技 术将控制向量表示为分段常值函数,将上述最优控制问题转化为非线性规划问题。应用经典 的参数优化方法即可求得最优控制律的一个近似解,通过增加参数个数,重复优化得到逼近 连续最优解的参数化解。仿真结果表明提出的控制方案是行之有效的。
     

半直接配点法在航天器追逃问题求解中的应用

采用半直接配点法求解时间固定两航天器追逃问题，提出一种新的数值求解追逃双方最优控制策略的方式，避免了求解非线性两点边值问题。在两航天器均为连续小推力假设条件下，以终端距离为支付函数，给出了半直接配点法求解此追逃问题的过程。在此数值方法中，根据半直接转换将微分对策问题转化为一个最优控制问题，由Gauss-Lobbato配点法最终将此最优问题转化为非线性规划问题，继而通过序列二次规划方法求解。这种半直接配点法避免微分对策问题最优策略的必要条件(两点边值问题)求解，并且数值稳定性好。数值仿真给出了追逃双发的最优控制策略和相应的追逃轨迹。     

Optimization of interplanetary trajectories for spacecraft with ideally regulated engines using the continuation method

The problem of optimization of interplanetary trajectories is considered for spacecraft with a small-thrust ideally regulated engine. When the maximum principle is used, determination of the optimal trajectory is reduced to solution of a two-point boundary value problem for a system of ordinary differential equations. In order to solve this boundary value problem, the method of continuation in parameter is used, and with the help of it the formal reduction of the boundary value problem to a Cauchy problem is performed. Different variants of the continuation method are considered, including the method of continuation in the gravitational parameter which allows one to find extreme trajectories with a preset angular distance. The issues of numerical realization of the continuation method are discussed, and numerical examples of its use for solving the problems of optimization of interplanetary trajectories are presented.