区间模糊集理论及其运算法则(英文)

在区间模糊集概念及其性质的基础上,针对区间模糊集的3个理论尚未得到有效证明的现状,首先对区间模糊集的知识表示及其运算法则进行了研究,然后提出了基于区间模糊集的截集概念。并在此基础之上进一步研究了基于区间模糊集的分解定理、表现定理和扩展定理,并通过实例说明了传统模糊集是区间模糊集的一个特例,区间模糊集是传统模糊集的有效扩展。     

一种单自由度振动系统动态载荷识别方法

航天器在飞行过程中经历了复杂的力学环境,但是目前又无法直接测量出这种复杂力学载荷函数。针对这一问题,提出了一种应用力学载荷识别方法确定航天器所经受力学载荷的新方法,针对单自由度振动系统模型,以二次多项式为基函数,推导建立了基于Duhamel积分的动态载荷识别模型。仿真分析结果表明,该方法具有很高的识别精度,且不存在误差积累问题。该方法为下一步试验验证和工程应用提供了理论基础和技术支撑。     

基于可达集方法的结冰飞机着陆阶段安全风险评估

飞机在着陆过程中极易发生结冰的现象,结冰对飞行安全造成的危害极为严重。结冰导致飞机发生危险的原因是由于机翼或尾翼被冰层覆盖后空气动力学行为发生改变,飞机受力异常难以控制。为分析结冰后飞机的稳定性以保证飞行安全,以飞机纵向动力学系统为分析对象,将飞机结冰后状态的描述以可达集的形式进行,直观地判断飞机状态是否可控,以此确定飞机是否处于安全状态。以求解所得的可达集为基础,利用极值定理分析结冰飞机的风险概率模型,由模型计算不同情况下飞机的风险概率,最终得到飞机着陆阶段的安全风险评估结果,并由评估结果指导驾驶员操纵,从而保证飞机的安全飞行。     

基于临界折射纵波法的CFRP应力检测

研究了不同纤维方向与应力方向对复合材料声弹性关系的影响。为了在材料内部激励临界折射纵波,本文根据斯涅耳定律设计了超声入射楔块,并搭建了声时差检测系统。并使用搭建的系统分别测量了0°、45°单向铺设的两种试样在0°、45°和90°方向的声时差变化,得到了不同加载方向和纤维方向组合情况下,由CFRP材料内部应力与声时差表征的声弹性关系。     

On Lambert’s problem and the elliptic time of flight equation: A simple semi-analytical inversion method

In the two-body model, time of flight between two positions can be expressed as a single-variable function and a variety of formulations exist. Lambert’s problem can be solved by inverting such a function. In this article, a method which inverts Lagrange’s flight time equation and supports the problematic 180°$180°$ transfer is proposed. This method relies on a Householder algorithm of variable order. However, unlike other iterative methods, it is semi-analytical in the sense that flight time functions are derived analytically to second order vs. first order finite differences. The author investigated the profile of Lagrange’s elliptic flight time equation and its derivatives with a special focus on their significance to the behaviour of the proposed method and the stated goal of guaranteed convergence. Possible numerical deficiencies were identified and dealt with. As a test, 28 scenarios of variable difficulty were designed to cover a wide variety of geometries. The context of this research being the orbit determination of artificial satellites and debris, the scenarios are representative of typical such objects in Low-Earth, Geostationary and Geostationary Transfer Orbits. An analysis of the computational impact of the quality of the initial guess vs. that of the order of the method was also done, providing clues for further research and optimisations (e.g. asteroids, long period comets, multi-revolution cases). The results indicate fast to very fast convergence in all test cases, they validate the numerical safeguards and also give a quantitative assessment of the importance of the initial guess.     

基于融合伽马变换全卷积神经网络的火星地貌分割方法

为了让火星巡视器在有限的寿命内能获得更多的科学产出,需要提高巡视器在火星表面的自主通过能力,而火星表面地貌类型是评估巡视器可通过性的重要信息。因此,提出了融合伽马变换的全卷积神经网络(FCN)火星表面地貌分割算法。首先,考虑对巡视器通过性的影响,确认地貌分类的类型,基于好奇号拍摄的火星地表图像Mars32K数据库,构建地貌分割数据集;其次,使用自适应伽马变换(AGT)对灰度单一的火星图像进行预处理,减弱了光照等因素干扰;最后,利用数据集训练一个FCN,以实现对火星表面地貌的分割预测。仿真结果表明:网络测试准确率达到83.03%,地形分割预测结果可靠,验证了方法的可行性。     

一类具有分布时滞和离散时滞中立型积分微分方程周期解

考虑了具有分布和离散时滞的方程tt dd t x(t)(-)B(t,s)x(s)ds =C(t,s)x(s)ds +i=l(t,x(t -(t)))+b(t) ∫-∞ A(t,x(t))x(t)+ ∫-∞ ∑giτi周期解的存在性问题。文章通过利用线性系统的指数二分性和 Krasnoselskii不动点定理得到了1上述方程周期解存在唯一的充分条件,结论推广和改进了已有文献的结果,并通过一个例子说明该结果的优越性。     

Broad-search algorithms for the spacecraft trajectory design of Callisto–Ganymede–Io triple flyby sequences from 2024 to 2040, Part II: Lambert pathfinding and trajectory solutions

Triple-satellite-aided capture employs gravity-assist flybys of three of the Galilean moons of Jupiter in order to decrease the amount of ΔV$\mathrm{\Delta }V$ required to capture a spacecraft into Jupiter orbit. Similarly, triple flybys can be used within a Jupiter satellite tour to rapidly modify the orbital parameters of a Jovicentric orbit, or to increase the number of science flybys. In order to provide a nearly comprehensive search of the solution space of Callisto–Ganymede–Io triple flybys from 2024 to 2040, a third-order, Chebyshev's method variant of the p-iteration solution to Lambert's problem is paired with a second-order, Newton–Raphson method, time of flight iteration solution to the _V∞$V_{\infty }$-matching problem. The iterative solutions of these problems provide the orbital parameters of the Callisto–Ganymede transfer, the Ganymede flyby, and the Ganymede–Io transfer, but the characteristics of the Callisto and Io flybys are unconstrained, so they are permitted to vary in order to produce an even larger number of trajectory solutions. The vast amount of solution data is searched to find the best triple-satellite-aided capture window between 2024 and 2040.     

基于公共余数最优估计的多通道干涉SAR高程重建方法

针对多通道干涉SAR高程重建方法计算效率较低的问题,提出了一种基于公共余数最优估计的多通道干涉SAR快速高程重建方法。该算法首先对干涉相位去除平地效应后,得出每幅干涉图像任意一个像素对应的缠绕干涉相位,构造出关于干涉相位模糊数的同余方程组;然后利用最优估计法求解出带噪声余数的公共余数的最优估计值,求解出各目标的高程值;最后再利用改进措施得到更高精度的高程重建结果。试验数据处理结果表明,该方法使得多通道干涉SAR高程重建的计算效率有了显著提升。