路径约束的时间最短多脉冲交会全局优化

不同于现有的多脉冲最优交会研究多集中于交会时间固定的最省燃料优化,研究了路径约束和脉冲受限的多脉冲最短时间交会问题。综合考虑了交会测量视场角、脉冲总量和脉冲作用时刻等约束,基于Lam-bert交会算法,建立了多脉冲交会最短时间优化的非线性规划模型。为了高效获得全局最优解,采用了模拟退火算法用于非线性优化问题的求解。最后,通过解决一个寻的三脉冲交会问题验证了模型和算法的有效性。该研究方法可寻找满足特定约束条件的最优交会轨道。     

航天器多约束交会的仅测角导航最优多目标闭环制导

研究了航天器多约束交会的仅测角导航最优多目标闭环制导问题,优化目标包括交会时间、燃耗和仅测角导航可观性指标,并考虑了视觉传感器视场角、推力器推力幅度和最小安全距离等各种约束条件,建立了多约束、多目标优化下的仅测角导航和闭环制导问题的数学模型,分析了仅测角导航和闭环制导之间的耦合关系。最后,通过Matlab遗传算法工具箱中的多目标优化函数,求解得到了该多目标优化模型的Pareto最优解集,结果显示交会时间、燃耗和仅测角导航可观性指标不能同时达到最优,存在相互制约关系,即提高其中一种优化目标的性能会降低其他优化目标的性能。     

考虑潜在威胁区的航天器最优规避机动策略

随着一系列轨道转移飞行器的工程化实施,航天器可能面临的非合作交会威胁日趋严重。针对该问题,根据交会机动的特点定义了新的规避机动指标——潜在威胁区,相较于传统的相对距离和碰撞概率等规避指标,潜在威胁区更适合航天器在面对非合作交会追踪器时进行规避机动,能够有效提升航天器的抗交会能力。首先,建立追踪器多脉冲最优交会模型,以此为基础给出潜在威胁区的定义与计算方法;然后,以潜在威胁区弧长为优化目标,建立了目标器最优规避模型,采用遗传算法进行目标优化;最后,根据所建立的双层优化模型进行数值仿真,以初始相距100km为初始条件进行仿真并计算得到了使潜在威胁区为零所需规避脉冲值,验证了文中模型的正确性,结果显示所定义的潜在威胁区弧长随着规避脉冲的增大呈严格的单调递减关系。研究为在轨航天器在面对非合作交会时提供了有效的规避策略,提升了航天器的空间生存能力。     

交会对接寻的段水平双脉冲交会轨道精确求解

基于考虑摄动影响的精确轨道动力学模型,对交会对接寻的段水平双脉冲交会轨道的精确求解方法进行了研究。提出了将控制脉冲的俯仰角近似转化为控制时刻的轨道幅角,从而调整脉冲控制时刻以消除径向速度增量的方法,精确求解首末水平双脉冲的启控时刻;引入导引终点位置偏差的比例控制方法,精确求解水平双脉冲的精确控制量。仿真结果表明,2轮整体迭代可获得首末水平脉冲控制时刻和控制量的精确值,脉冲水平特性达到俯仰角小于1°,导引终点相对位置精度达到10m,验证了该方法的正确性。     

基于非线性规划的空空导弹水平转弯轨迹优化

基于空空导弹的质点动力学方程建立了轨迹优化模型,并根据非线性规划优化算法的特点,对优化模型中的积分变量进行替换。采用一种改进的多重打靶法将轨迹优化问题转化为约束非线性规划问题,在此基础上采用广义乘子法和变尺度法求解满足各种约束条件的最优转弯轨迹。仿真结果表明,该轨迹优化方法实现了导弹在约束条件下的最短时间转弯,且所得结果符合运动学规律,对于离轴发射以及越肩发射的转弯问题具有一定意义。     

Robust reliable control for autonomous spacecraft rendezvous with limited-thrust

This paper investigates the problem of robust reliable control for the spacecraft rendezvous with limited-thrust. Based on the Clohessy–Wiltshire (C–W) equations and by considering the uncertainties and the possible failures, the dynamic model for spacecraft rendezvous is proposed, and the orbital transfer control problem is transformed into a stabilization problem. Then, by a Lyapunov approach, the existence conditions for admissible controllers are formulated in the form of linear matrix inequalities (LMIs), and the controller design is cast into a convex feasibility problem subject to LMI constraints. With the obtained controllers, the rendezvous can be accomplished with the limited-thrust in spite of the possible thruster failures. The effectiveness of the proposed approach is illustrated by simulation examples.     

Optimal robust linearized impulsive rendezvous

The optimization of time-fixed linearized impulsive rendezvous with control uncertainty is investigated. One performance index related to the variances of the terminal state error is defined as the performance index of robustness which is calculated by linear covariance method. The two-objective optimization problem of minimizing the total characteristic velocity and the performance index of robustness is formulated based on the Clohessy–Wiltshire (C-W) system and solved by the nondominated sorting genetic algorithm. The Pareto-optimal solution sets of one homing rendezvous mission are provided and the Pareto optimality is verified by comparing with the fuel-optimal and the robustness-optimal solutions. It is shown that the proposed approach can quickly investigate the relation between the fuel cost and the trajectory robustness, besides evaluate different rendezvous maneuver schemes.     

基于速度增量的空间绳系机器人中距离逼近过程最优轨迹规划

针对空间绳系机器人中距离逼近过程最优轨迹规划问题,提出了基于速度增量的多目标逼近轨迹优化方法,优化指标为总速度增量及逼近时间。首先建立逼近过程相对动力学模型及最优逼近轨迹优化模型,然后利用改进型非劣分类遗传算法得到相对逼近距离1.5 km内逼近轨迹的Pareto最优解。仿真结果表明,该方法可以揭示空间绳系机器人逼近距离1.5 km内逼近时间、燃料消耗、相对目标的面内视界角及速度增量次数之间的相互关系,能满足针对不同任务需求提供相应最优轨迹的要求。     

Spacecraft optimal rendezvous controller design using simulated annealing

A new global approach for rendezvous Linear Quadratic controller design is presented in this paper. Instead of solving the algebraic Riccati equation, a continuous simulated annealing (SA) algorithm is used to design rendezvous LQ controller. Optimization of one automatic rendezvous controller with 18 design parameters is illustrated. The results show that the SA algorithm can locate the global solution effectively and robust, besides a great number of global solutions have been obtained by the SA. The SA has demonstrated better performance than other optimization algorithms such as floating-coded Genetic Algorithm, Simplex method and Powell algorithm.     

Robust control for constant thrust rendezvous under thrust failure

A robust constant thrust rendezvous approach under thrust failure is proposed based on the relative motion dynamic model. Firstly, the design problem is cast into a convex optimization problem by introducing a Lyapunov function subject to linear matrix inequalities. Secondly, the robust controllers satisfying the requirements can be designed by solving this optimization problem.Then, a new algorithm of constant thrust fitting is proposed through the impulse compensation and the fuel consumption under the theoretical continuous thrust and the actual constant thrust is calculated and compared by using the method proposed in this paper. Finally, the proposed method having the advantage of saving fuel is proved and the actual constant thrust switch control laws are obtained through the isochronous interpolation method, meanwhile, an illustrative example is provided to show the effectiveness of the proposed control design method.     

基于混合粒子群算法的上升段交会弹道快速优化设计

基于梯度搜索的高效性和粒子群搜索的随机性,提出了一种混合粒子群算法,并应用该算法研究了运载火箭上升段交会弹道快速优化设计问题.以运载火箭与目标飞行器在交会时刻的距离最小为目标函数,设计了运载火箭飞行程序,建立了运载火箭上升段交会弹道优化模型,同时分别采用混合粒子群算法、遗传算法和粒子群算法进行求解.仿真结果表明:基于本文算法对运载火箭上升段交会弹道进行优化设计,平均交会位置误差为4.137m,较遗传算法减少了17.940m,平均优化耗时488.922s,较粒子群算法缩短了2342.125s.混合粒子群算法搜索速度较快,收敛精度较高,可用于运载火箭上升段交会弹道的快速优化设计.      

Optimal Terminal Rendezvous as a Stochastic Differential Game Problem

The optimal terminal rendezvous of two satellites in orbit about the Earth is studied using a stochastic model and formulating the rendezvous as a game problem. Each satellite has noise-corrupted output measurements and uses a Kalman filter to generate the best estimate of the states describing the rendezvous. The optimal control for the satellites is determined. A comparison is made in terms of dimensionality and complexity to a deterministic solution of the rendezvous problem.     

考虑性能及成本的固体火箭发动机多学科设计优化

为综合考虑固体火箭发动机的燃烧室、药柱、内弹道、喷管及成本等学科影响,梳理学科间耦合关系,并建立了以总冲最大、成本最小为优化目标的固体火箭发动机多学科设计优化（MDO）模型。为降低MDO问题的计算成本,提出一种基于Kriging代理模型的多目标自适应优化方法（KRG-MAOM）。优化过程中,分别对目标与约束构建Kriging模型,并采用多目标优化算法求解,在伪Pareto解中综合考虑支配关系与分布特性选取新增样本点,引导优化快速收敛。算例结果表明,KRG-MAOM算法在全局收敛性与优化效率方面具有显著优势。最后,采用KRG-MAOM算法求解该MDO问题,得到可行的Pareto解集方案,与初始方案相比,同性能情况下成本节省约3.36%;同成本情况下性能提升约10.93%,从而验证MDO模型合理性与KRG-MAOM算法有效性。     

非合作目标交会的双层MPC全局轨迹规划控制

针对空间非合作目标近距离视线交会中的全局最优鲁棒轨迹规划与控制问题,提出了基于高斯伪谱方法（GPM）和线性时变模型预测控制（LTVMPC）的双层模型预测控制（MPC）算法。在轨迹规划方面,以视线坐标系下的相对轨道动力学为模型、能量最少和控制精度最优为性能指标构建最优控制问题,利用GPM精度高、收敛速度快的特点将最优控制问题转化为易于求解的全局非线性规划问题,在MPC框架下求解得到全局最优的标称轨迹,克服了传统的MPC不适用于全局大范围非线性规划的缺点;在轨迹跟踪控制方面,考虑预测时域内状态转移矩阵的时变特性,设计了LTVMPC算法对标称轨迹进行追踪,避免了存在不确定性时轨迹的重规划,从而降低在线计算量,保证算法在线自主实施,并且采用滚动优化的策略使算法对不确定性具有鲁棒性。由于规划层和控制层考虑的约束相同,因此规划的轨迹是可控、可达的。数字仿真表明,在燃料消耗和交会时间等方面,提出的方法均显著优于传统的MPC方法,相较于传统的MPC方法,新算法的交会时间减少50%左右,燃料消耗降低30%以上。     

基于可行域调整的多相材料结构拓扑优化设计

针对多相材料结构柔顺度拓扑优化问题及其存在多个局部优化解的情况,提出一种新的多相材料结构柔顺度拓扑优化问题的求解方法, 并研究其获得多个局部优化解及寻找较好的优化解的能力。基于材料属性有理近似 （RAMP）模型,引入可行域调整技术,构建多相材料结构拓扑优化模型及近似优化模型。提出一种改进的交替主动相算法,该算法将多相材料结构拓扑近似优化模型分解为多个含2个主动相材料体积约束的系列二元相拓扑优化子模型,并利用光滑化对偶算法进行优化求解。与现有方法相比,采用多个不同的优化初始拓扑,提出的方法可找到更优的多相材料结构拓扑, 且为多相材料结构拓扑优化的多样性设计提供了一种有价值的思路与方法。     

交会对接远程导引轨道控制状态规划与优化算法

对空间交会对接远程导引段轨道控制问题进行了研究。在简单介绍交会对接远程导引轨道控制实时规划模型的基础上,提出了基于近圆偏差方程、序列二次规划算法和目标权重函数等在不同控制目标模式下的状态规划与优化算法。仿真结果表明,该算法收敛速度快,能较好地满足交会对接远程导引段的轨道控制要求,具有一定的工程实用价值。     

载人登月着陆器奔月窗口搜索方法

对环月轨道共面交会的载人登月任务中,着陆器(LM)奔月零窗口与轨道参数精确快速设计方法进行了研究。任务采用人货分离奔月模式,着陆器于载人飞船到达环月轨道前抵达环月共面交会轨道,着陆器近月点一次共面减速完成近月制动。提出一种三层快速精确奔月窗口搜索方法:第一层采用地心二体轨道理论解析计算月窗口及奔月轨道参数初值,作为正确性基本参考;第二层采用改进的双二体解析动力学模型求解月窗口内奔月轨道参数变化规律;第三层采用高精度轨道动力学模型和SQP_Snopt优化求解奔月零窗口及轨道参数精确解。仿真结果表明,本文提出的三层逐级奔月窗口搜索方法能快速精确求解载人登月任务中着陆器奔月窗口及精确轨道参数,也揭示了影响着陆器奔月窗口的主次因素和规律,为中国未来载人登月工程提供参考。     

基于罚函数序列凸规划的多无人机轨迹规划

多无人机（UAVs）轨迹规划是具有非线性运动约束和非凸路径约束的最优控制问题。引入序列凸规划思想,将非凸最优控制问题近似为一系列凸优化子问题,并利用成熟的凸优化算法进行求解,以更好地权衡最优性和时效性。首先,建立了多无人机协同轨迹规划的非凸最优控制模型。然后,利用离散化和凸近似方法将其转换为凸优化问题,包括对无人机运动模型的线性化,以及对威胁规避约束和无人机碰撞约束的凸化。同时,提出了一种离散点间的威胁规避方法,保证无人机在离散轨迹点间的飞行安全。在凸优化模型的基础上,给出了基于罚函数序列凸规划求解多无人机轨迹规划的具体框架。最后,通过数值仿真验证了方法的有效性,结果表明该方法在多机轨迹规划结果的最优性和时效性都要优于伪谱法,而且优势随编队数量的增加而增大。     

Index allocation for a reusable LOX/CH4 rocket engine

Reusable rocket engines are the core components of reusable launch vehicles, and have thus become a major focus of aerospace engineering research in recent years. In practice, subsystem design is based on the overall index allocation of an engine; therefore, a multidisciplinary optimization approach is necessary. In this study, design of a reusable methane/liquid oxygen (LOX/CH4) rocket engine with a gas generator cycle was investigated using multidisciplinary optimization. Two parameters were chosen as design variables: pressure and fuel mix ratio of the main combustion chamber. Optimization objectives were specific impulse, structural mass, and life cycle cost of the reusable rocket engine, and constraints were assigned to each discipline according to rocket design requirements. Then, an optimization model was developed, and optimal design parameters were acquired for the LOX/CH4 rocket engine. The proposed method is effective for designing the index allocation of reusable rocket engines and takes into account the multidisciplinary nature of complex systems.     

高超声速飞行器再入轨迹多目标优化

针对飞行器再入轨迹多目标优化问题,提出了一种基于粒子群算法与层次分析法的综合求解策略。首先,根据飞行器的动力学模型以及再入约束条件,建立了飞行器多目标优化模型;然后,考虑到粒子群算法只能求解无约束单目标问题,采用罚函数处理飞行过程中的约束条件和优化目标;最后,针对不同约束及目标的权重对再入轨迹的影响,利用层次分析法建立包含主观评估信息的优化模型,采用粒子群算法优化求解满足相应约束条件的再入轨迹问题。仿真结果表明,该方法所生成的优化轨迹具有较高的精度和计算效率,并对设计者的主观需求有良好的体现。