Accurate approximation of in-ecliptic trajectories for E-sail with constant pitch angle

Propellantless continuous-thrust propulsion systems, such as electric solar wind sails, may be successfully used for new space missions, especially those requiring high-energy orbit transfers. When the mass-to-thrust ratio is sufficiently large, the spacecraft trajectory is characterized by long flight times with a number of revolutions around the Sun. The corresponding mission analysis, especially when addressed within an optimal context, requires a significant amount of simulation effort. Analytical trajectories are therefore useful aids in a preliminary phase of mission design, even though exact solution are very difficult to obtain. The aim of this paper is to present an accurate, analytical, approximation of the spacecraft trajectory generated by an electric solar wind sail with a constant pitch angle, using the latest mathematical model of the thrust vector. Assuming a heliocentric circular parking orbit and a two-dimensional scenario, the simulation results show that the proposed equations are able to accurately describe the actual spacecraft trajectory for a long time interval when the propulsive acceleration magnitude is sufficiently small.     

Flutter analysis of an airfoil with bounded random parameters in incompressible flow via Gegenbauer polynomial approximation

The effects of parameter uncertainty on the flutter characteristics of a two-dimensional airfoil in an incompressible flow were investigated through Gegenbauer polynomial approximation. The uncertain parameters, such as the linear and cubic pitch stiffness coefficients are modeled as bounded random variables with λ-PDFs (probability density functions). With the aid of Gegenbauer polynomial approximation, the two-dimensional stochastic airfoil system is transformed at first into its equivalent deterministic one. Then the Hopf-bifurcation point is determined through the equivalent deterministic system, and the onset of the flutter, together with the flutter frequency against the probability density distribution parameter and the intensity of the random variable is explored. In addition, the ranges of the peak pitch and plunge responses against the flight speed and the PDFs of the peak pitch response are obtained. Numerical results show how the probability density distribution parameters and the intensities of random parameters affect the flutter onset speed, flutter angular frequency, the upper and lower boundaries of peak responses, and the PDFs of peak responses.     

掠海飞行导弹击水概率的仿真研究

本文对掠海导弹的击水概率问题进行了研究,提出了用均匀设计、Monte—Carlo法和逐步回归法建立击水概率预报公式的仿真方法,并结合某型号的反舰导弹进行计算,得到了满意的结果。本文还利用表观频率和表观频谱的概念,建立起飞航导弹的背景干扰——海浪和阵风的数学模型,并用波叠加法进行了数字仿真。     

疲劳裂纹扩展速率试验数据的可靠性分析模型

以指定ΔＫ下的ｄａ／ｄＮ服从对数正态分布为基础，提出３种ｄａ／ｄＮ试验数据统计处理方法；依据一组４０ＣｒＮｉＭｏ材料的ＣＴ试样的试验数据处理结果，对３方法进行了分析对比。     

用于导弹系统性能统计分析的统计线性化伴随法

本文在研究ＳＬＡＭ方法基础上，进行了理论推导和计算方法方面的改进，并将此方法应用于导弹系统性能的统计分析，计算机仿真结果表明该方法与采用ＣＡＤＥＴ方法的结果完全一致。     

直齿渐开线齿轮齿面磨损模拟计算

在初步研究直齿轮齿面磨损的基础上,对磨损机理做了进一步的分析研究,综合考虑了摩擦系数、载荷、齿面曲率及滑动系数等影响磨损量的主要因素,提出了齿面磨损量的计算公式,并运用齿面离散化方法进行齿廓磨损的数值计算。     

弹道导弹制导计算中扰动引力的快速赋值

主动段扰动引力是引起弹道导弹制导方法误差的主要因素。因此,要提高导弹的制导精度,就必须能够在弹上实时计算扰动引力。但现有方法在计算快速性和存储量之间无法得到有效协调。为此,把广义延拓逼近思想引入有限元逼近方法中,将插值单元周围节点的信息也包含到单元内一点扰动引力的计算当中,建立了一种新的数学模型。对所选发射空域,在发射坐标系中进行了直角坐标划分。计算结果表明,这种方法能够更加精确地逼近弹道导弹主动段的扰动引力,在600 km×250 km×6 km的主动段飞行区域内,只需要保存60个节点数据,就能使由逼近误差导致的落点偏差小于10 m,是一般有限元逼近方法精度的4倍以上。     

在非结构网格上求解非线性航空声学问题的高精度有限体积法

介绍了有限体积数值方法,该方法适用于在任意非结构网格上求解线性和非线性的航空声学问题.本方法基于角点-中心的多参数格式,可在笛卡尔网格上达到六阶精度,对于可能的不连续性采用了自适应耗散.通过一系列算例研究了该方法的特性,结果表明:在模拟谐振型管中的噪声抑制中,所提出的方法是很有效的.     

关于Davidson—Lanczos方法的收敛率

本文对文[1]提出的求解大型对称矩阵A的极端(几个最大或最小)特征值及相应特征向量的Davidson—Lanczos方法,用Rayleigh—Ritz逼近理论,研究了该方法的收敛率。证明了由该方法产生的规范正交向量{v_i}_i~m=1是Krylov子空间K_m≡Span(v_1,Av_1,…,A~(m-1)v_1)的一组基。设A的k个最大特征值为又,λ_1>λ_2>…>λ_k,相应的近似特征值为λ_i~(m)(i=1,…,k),得到 这里γ_i(γ_i>1),W_i和W_i~(m)是常数。     

Online scheduling of distributed Earth observation satellite system under rigid communication constraints

This paper focused on online scheduling of distributed Earth observation satellite system in a dynamic environment. The objective was to maximize the total profit of the overall system by efficiently coordinating the different satellites with stochastic arrival of urgent tasks, subject to rigid communication and observation time window constraints. We formulated this problem as a single-task, single-robot, time-extended assignment problem with intra-schedule dependency using the multi-robot task assignment taxonomy and formulated the sub-problem after releasing urgent tasks in a mixed-integer linear programming model. We first described the online scheduling algorithm for a single satellite, then we proposed the modified consensus-based bundle algorithm (m-CBBA) and modified asynchronous consensus-based bundle algorithm (m-ACBBA) with synchronous and asynchronous communication, respectively. Compared with initial versions of CBBA and ACBBA, the modified versions added the communication loop prediction phases to efficiently utilize scarce communication opportunities and reduce the communication requirements. Additionally, we introduce two contract net protocol (CNP)-based algorithms for comparison, respectively SingleItem-CNP-based (SI-CNP) algorithm and Batch-CNP-based (BA-CNP) algorithm. Computational experiments indicated that both the total profit and percentage of scheduled urgent tasks achieved by the m-ACBBA and m-CBBA algorithms were much higher than those achieved by both SI-CNP and BA-CNP. Additionally, the number of communications needed by either m-ACBBA or m-CBBA algorithm was lower than that by SI-CNP. When the communication cost in the system is high, the m-CBBA algorithm is preferred because it balances the profit and the required number of communications. When the communication cost is low, the m-ACBBA algorithm is preferred because it achieves high total profit and high percentage of scheduled urgent tasks.