Global aerodynamic design optimization based on data dimensionality reduction

In aerodynamic optimization, global optimization methods such as genetic algorithms are preferred in many cases because of their advantage on reaching global optimum. However, for complex problems in which large number of design variables are needed, the computational cost becomes prohibitive, and thus original global optimization strategies are required. To address this need, data dimensionality reduction method is combined with global optimization methods, thus forming a new global optimization system, aiming to improve the efficiency of conventional global optimization. The new optimization system involves applying Proper Orthogonal Decomposition (POD) in dimensionality reduction of design space while maintaining the generality of original design space. Besides, an acceleration approach for samples calculation in surrogate modeling is applied to reduce the computational time while providing sufficient accuracy. The optimizations of a transonic airfoil RAE2822 and the transonic wing ONERA M6 are performed to demonstrate the effectiveness of the proposed new optimization system. In both cases, we manage to reduce the number of design variables from 20 to 10 and from 42 to 20 respectively. The new design optimization system converges faster and it takes 1/3 of the total time of traditional optimization to converge to a better design, thus significantly reducing the overall optimization time and improving the efficiency of conventional global design optimization method.     

航天器快捷交会技术分析

快捷交会对航天乘员与飞行任务都是非常有利的。快捷交会的基本原理是减少调相段飞行圈数;为此,需设计可完成一系列交会程序的较短的飞行时间,并获得与飞行时间相匹配的较小的初相角。快捷交会的关键技术包括提高入轨精度,增强追踪飞行器的自主计算与轨道控制能力,扩大地面站覆盖范围,以及对目标飞行器轨道的精准调整。     

旋翼桨叶动力学设计技术

桨叶动力学设计,其实质是求解非线性高维动力学逆问题的具体实施。本文较全面地阐述了这方面的进展情况,提出了切实可行、有效实用的数值方法。     

自行开发的图形组件在航空发动机设计集成系统中的应用

结合具体开发的图例,阐述了自行开发、应用于航空发动机设计集成系统的图形组件的功能、应用情况和关键技术。     

基于遗传算法的地磁匹配搜索策略

为降低导航成本,提出仅利用磁测计和里程计的地磁场匹配定位方法.为解决搜索空间过大的问题,提出以遗传算法在匹配区域搜索可能路径的方法.该方法以相关性度量作为适应度函数,交叉与变异仅针对点列的相对关系完成,提出用局部适应度函数自适应调整交叉概率与变异概率.仿真结果表明,该方法可以有效完成地磁匹配导航中任意形状路径的匹配.     

甚小型卫星发展综述

介绍了立方星(CubeSat)、片上卫星(SpaceChip)、印制电路板卫星(PCBSat)、多芯片组件卫星(MCMSat)4种甚小型卫星的发展情况和技术特点。CubeSat技术最为成熟,已发射多颗此类卫星,但体积固定,成本较高;SpaceChip是卫星小型化的最终目标,它成本最低,集成度最高,体积最小,但通信距离较短;PCBSat的成本和性能居中,设计复杂度低,且元器件有商用现货供应,但功耗较大;MCMSat综合了PCBSat和SpaceChip的技术特点,技术复杂。我国甚小型卫星可选择优先发展PCBSat;重点突破商用现货元器件的筛选,以及空间应用技术、一体化姿态控制技术、新型微推进技术、轻型高效的蓄电池和太阳电池技术等。     

A strategic flight conflict avoidance approach based on a memetic algorithm

Conflict avoidance （CA） plays a crucial role in guaranteeing the airspace safety. The cur- rent approaches, mostly focusing on a short-term situation which eliminates conflicts via local adjust- ment, cannot provide a global solution. Recently, long-term conflict avoidance approaches, which are proposed to provide solutions via strategically planning traffic flow from a global view, have attracted more attentions. With consideration of the situation in China, there are thousands of flights per day and the air route network is large and complex, which makes the long-term problem to be a large-scale combinatorial optimization problem with complex constraints. To minimize the risk of premature convergence being faced by current approaches and obtain higher quality solutions, in this work, we present an effective strategic framework based on a memetic algorithm （MA）, which can markedly improve search capability via a combination of population-based global search and local improve- ments made by individuals. In addition, a specially designed local search operator and an adaptive local search frequency strategy are proposed to improve the solution quality. Furthermore, a fast genetic algorithm （GA） is presented as the global optimization method. Empirical studies using real traffic data of the Chinese air route network and daily flight plans show that our approach outper- formed the existing approaches including the GA .based approach and the cooperative coevolution based approach as well as some well-known memetic algorithm based approaches.     

基于模块度的复杂网络社团结构聚类新算法

针对传统的分裂聚类算法删除连边会影响节点划分的问题,结合K-means算法的思想并加以改进,提出了一种以邻居节点为聚类备选集,所有社团中心节点同时聚类的同步聚类算法。该算法根据节点中心度和最短路变化率确定社团中心节点集,然后以中心节点为社团中心,以邻居节点为聚类备选集合进行聚类,完成社团的划分。将算法应用到Zachary网络中并与GN算法、Top Leader算法进行比较,仿真结果表明该算法对网络有较好的划分。     

单天基平台测向的空间非合作目标跟踪

针对仅含角度测量信息的单个天基平台可观测性较弱的问题,提出了一种含脉冲机动检测的空间非合作目标跟踪算法,并设计了非合作目标实时跟踪数据处理流程.该算法利用抗差估计技术和UKF（Unscented Kalman Filter,无迹卡尔曼滤波）算法构造目标跟踪滤波器,并综合残差多项式拟合和新息分布特征等方法实现目标机动检测,在天基平台观测信息类型有限和观测几何较差的情况下,可以同时排除孤立野值和成片测量野值的影响,实现非合作机动目标的连续稳定跟踪.数值实验验证了算法的可行性和有效性,也表明了跟踪精度和可靠性与测量精度密切相关.     

用于雷达方位超分辨的约束迭代Tikhonov正则化算法

针对Tikhonov正则化算法噪声适应能力差和不便于引进额外的约束对解进行限制等缺点,利用迭代Tik-honov正则化算法对雷达方位超分辨进行研究,证明了迭代Tikhonov正则化反卷积公式的收敛性,分析了迭代Tik-honov正则化算法的频域性质,在存在噪声的情况下,提出相应的噪声抑制方法,得到约束迭代Tikhonov正则化算法。针对不同信噪比情况进行了计算机仿真实验,结果表明,与迭代Tikhonov正则化算法相比,约束迭代Tikhonov正则化算法具有较强的噪声适应能力,与常用的约束迭代方法（CID）算法相比,具有较快的收敛速度,初步验证了算法的有效性。