热效应布局下的缓冲器插入时序优化方法

随着集成电路的集成度越来越高,芯片的发热量越来越大且其内部温度呈不均匀分布,这会影响关键路径的传播延时,进而影响基于缓冲器插入的关键路径性能.提出了一种考虑芯片热效应布局优化的缓冲器插入时序优化方法,在版图设计的早期估计芯片的热分布和温度分布并且把其应用到版图布局优化和RC延时模型中.同时利用模拟退火算法基于热分布调整并优化布局,最后在最优布局下利用提出的缓冲器插入模型和快速插入算法进行时序优化.仿真结果表明相对于不考虑温度效应布局优化的缓冲器插入方法,缓冲器插入延时优化方法能有效降低最坏延时和缓冲器插入数目,最坏延时比传统方法降低9%~18%,比文献已经提出的最好方法降低5%~7%,缓冲器插入数比其少10~20个.      

基于动力学递推算法的绳系卫星系统刚柔耦合多体模型

利用动力学递推算法建立了空间绳系卫星系统(TSS)的铰接柔性杆动力学模型.所研究的绳系系统包含两颗刚体绳端卫星和一段连接两颗卫星的柔绳,柔绳离散为一系列球铰连接的弹性杆,考虑杆不均匀的纵向一维形变,并利用球铰的运动模拟柔绳的弯曲和扭转;然后基于递推算法推导得出了该刚柔混合离散模型的动力学方程.数值仿真结果表明:所建立的绳系卫星系统模型能够很好地模拟空间系绳的各向摆振和扭转,此外,递推算法的引入能够有效地减少离散模型动力学方程的维数,从而大幅减少计算量.      

基于涡系相交不稳定性的飞机尾流控制方法

在飞机飞行的过程中尾涡会伴随着升力产生,威胁后机的飞行安全.在简化机翼模型上添加扰流片,通过一个矩形翼以引入一个与主翼尾涡大小不同、方向相反的小涡,构建尾流自消散四涡系统,以期诱发尾涡的Rayleigh-Ludwig相交不稳定性.通过改变扰流片的大小形状,调整模型的攻角和拖曳速度,采用粒子图像速度场仪测量系统定量研究在低雷诺数下单主翼尾涡发展特性以及双涡相互作用特性.研究表明:在未添加扰流片时,尾涡环量在45个翼展内相对于初始环量基本保持不变;在添加扰流片的情况下尾涡的环量衰减可以达到35%~55%,而未添加的基本翼型的尾涡的环量则几乎保持不变,这说明添加适当的扰流片能诱发尾涡的Rayleigh-Ludwig相交不稳定性,加速尾涡的消散,当小涡和主涡的初始环量比为-0.489、初始距离比为0.5时,45个翼展范围内,尾涡环量衰减55.9%.本文系统性的实验结果可以为低尾流机翼的设计提供参考依据.      

基于边缘信息的灰度目标跟踪算法

提出了一种基于边缘信息的跟踪算法,其可以实现对剧烈变化的灰度目标的精确跟踪.首先,利用基于双同心圆窗口算子的非线性边缘检测算法得到高质量的边缘信息;其次,为了解决单一边缘特征空间不能充分表征目标的难题,提出了一种通过组合边缘图像构建特征空间的方法,以便为目标建模提供充分信息;再次,在构建的特征空间中使用核估计方法对目标进行建模;在目标定位阶段,利用Kalman滤波器对目标进行预估后,再由Mean Shift算法在预估位置邻近区域实现目标定位;最后,提出了一种基于形态学的动态模型更新策略,使得算法不仅可以获得精确的目标区域,还可以实现对目标尺寸和形状变化的自适应.实验结果表明,本算法不仅可以有效跟踪剧烈变化的灰度目标,而且跟踪窗口可以实现对目标尺寸和形状的自适应.      

采用改进非支配近邻免疫算法的低轨混合星座设计优化

针对低轨同构星座覆盖资源在纬度上分布不均匀的不足,提出采用低轨混合星座提升覆盖均匀性的设计方案,并推导了满足全球任意点平均每天覆盖一定次数的最小卫星规模估算公式。针对非支配近邻免疫算法（NNIA）约束处理方面的不足,提出基于约束支配的改进非支配近邻免疫算法（Modified NNIA）,并以此设计了一种低轨混合星座优化平台来优化带约束的星座设计问题。仿真结果表明,改进的NNIA算法在收敛速度和多样性上均优于非支配分层遗传算法（NSGA II）和多目标粒子群算法（MOPSO）,可大大提高星座设计的效率。同时优化结果也表明低轨混合星座可提高覆盖的均匀性和大部分区域的覆盖次数,进而减少特定覆盖要求所需的卫星数目。     

多目标融合的冗余空间机械臂碰前轨迹优化

面向在轨对接与装配任务,提出了多目标融合的冗余度空间机械臂碰前轨迹优化方法。通过分析任务特点,阐述了空间机械臂碰前的多重任务目标。针对由空间机械臂连续轨迹跟踪、碰撞姿态控制及碰撞冲量幅值优化三个目标组成的第一类任务,通过设置任务优先级融合多目标并采用基于主任务零空间的方法实现对碰前轨迹的优化;而对由空间机械臂点到点规划、碰撞姿态控制及碰撞冲量幅值优化三个目标组成的第二类任务,通过设置任务权重将多目标融合并采用遗传算法对碰前轨迹进行优化。以典型七自由度机械臂为例开展仿真实验,验证了提出的轨迹优化方法的有效性。     

一种常用两次扫描算法的改进

针对交会对接最后逼近段光学成像敏感器图像处理中的快速连通域标记问题,将标记融合和两次扫描相结合,改进了连通域标记中常用的两次扫描算法,并基于标志灯成像的几何约束和统计约束给出了可完成目标粗识别的连通域标记算法.仿真结果表明这两种改进措施都可提高有效连通域标记的效率.改进后的连通域标记算法处理一幅1 024×1 024的图像,其50次重复运行的平均耗时小于98 ms,具备实时应用的能力.     

Solving Job-Shop Scheduling Problem Based on Improved Adaptive Particle Swarm Optimization Algorithm

An improved adaptive particle swarm optimization(IAPSO)algorithm is presented for solving the minimum makespan problem of job shop scheduling problem(JSP).Inspired by hormone modulation mechanism,an adaptive hormonal factor(HF),composed of an adaptive local hormonal factor(H l)and an adaptive global hormonal factor(H g),is devised to strengthen the information connection between particles.Using HF,each particle of the swarm can adjust its position self-adaptively to avoid premature phenomena and reach better solution.The computational results validate the effectiveness and stability of the proposed IAPSO,which can not only find optimal or close-to-optimal solutions but also obtain both better and more stability results than the existing particle swarm optimization(PSO)algorithms.     

Optimization of geosynchronous satellite constellation for independent regional navigation and positioning in Middle East region

Regional Navigation and positioning systems using geosynchronous satellites are emerging for different parts of the world. Optimal constellation geometry achievement for a set of geosynchronous satellites is a key sector in designing of such systems. Genetic algorithm is applied for optimization of constellations with 6 and 7 satellites which is to be used in Middle East region where these systems have been deprived of. Based on the fact that the coverage criterion is not sufficient enough to guarantee a good navigation service, positioning process by the satellite systems is discussed and the performance of the system on the basis of position dilution of precision is collected as the fitness criterion. Placing the satellites in groups to pass over the same ground track is applied as a constraint to the genetic algorithm. By simulation, performance of the best obtained results and GPS are compared in terms of position dilution of precision, visibility and the required epochs (time span) to resolve the ambiguities with a 99% success rate, in this region. Also, capability of the GA for such problems is demonstrated.     

Simple method for performance evaluation of multistage rockets

Multistage rockets are commonly employed to place spacecraft and satellites in their operational orbits. Performance evaluation of multistage rockets is aimed at defining the maximum payload mass at orbit injection, for specified structural, propulsive, and aerodynamic data of the launch vehicle. This work proposes a simple method for a fast performance evaluation of multistage rockets. The technique at hand is based on three steps: (i) the flight-path angle at each stage separation is guessed, (ii) the spacecraft velocity is maximized at the first and second stage separation, and (iii) for the last stage the thrust direction is obtained through the particle swarm optimization technique, in conjunction with the use of the Euler–Lagrange equations and the Pontryagin minimum principle. The coast duration at the second stage separation is optimized as well. The method at hand is extremely simple and easy-to-implement, but nevertheless it proves to be capable of yielding near-optimal ascending trajectories for a multistage launch vehicle with realistic structural, propulsive, and aerodynamic characteristics. The solutions found with the technique under consideration can be employed either for a rapid evaluation of the multistage rocket performance or as guesses for more refined optimization algorithms.