基于MOEA/D的航天器隔振器多目标优化方法研究

由于存在各种高频内部扰动,高精度航天器通常需要进行隔振设计,而被动隔振装置被广泛采用。在被动隔振装置设计中,抑制共振响应峰和隔离中高频振动存在很强的冲突性,需要进行多目标优化设计。首先,建立了隔振系统的动力学模型,提出了以传递函数共振峰幅值和中高频衰减为目标函数的多目标优化模型;其次,提出了基于分解的多目标进化算法（MOEA/D）对单级和两级级隔振装置进行多目标优化的设计方法;最后,对某空间隔振装置进行了数值仿真,结果验证了本文算法的有效性。     

蚁群算法在光电载荷标校中的应用

针对空中平台光电载荷安装误差的梗准问题,提出了一种利用蚁群算法实现动态标校的方法.通过光电裁荷测量得到的目标方位角、俯仰角和平台导航信息,结合GPs转化得到的方位角、俯仰角真值,建立了基于最优估计理论的目标函数,并利用蚁群算法求得了系统的安装误差.通过蒙特卡洛模拟仿真,验证了该方法能够较为准确地标定出安装误差;通过校准,有效避免了由安装误差引起的结果有偏,使得目标跟踪结果收敛至真值附近.     

机房漏水检测与精确定位装置研究

机房漏水是危及精密信息设备长期稳定可靠运行的重大安全隐患。为了解决传统定位装置难以实现漏水点精确定位的问题,从传感电缆的检漏原理出发,利用分压补偿原理,通过STEP7软件编程,设计了一个结合自检、漏水检测和漏水定位3种功能的机房漏水检测与定位装置。在此基础上搭建了实验系统,经测试实验,结果表明短距离定位精度可以达到1．70％,从而证实了该装置检测的有效性和定位的精确性。     

基于遗传算法的陆基导航布站方法研究

陆基导航是一种通过高精度的测距进行定位、定速的系统,其定位、定速精度与布站有密切关系.为优化陆基导航的布站结果,提高惯性+陆基复合导航精度,提出了一种基于遗传算法的陆基导航布站方法.推导了使用惯性+陆基复合导航的Cramer-Rao下界(CRLB),并以其作为遗传算法布站寻优的适应性函数,再结合其他影响布站的因素作为约束条件,形成了基于遗传算法的布站方法.数学仿真表明,通过该方法的布站可得到较为满意的复合导航的精度,在实际工程应用中具有重要意义.     

红外图像强固定模式显著性噪声抑制

针对红外成像设备对天远距离观测中得到的小目标、强固定模式噪声这一类典型数据,提出基于显著性的红外图像强固定模式噪声抑制算法。对此类图像数据进行特性分析,指出图像中目标区域相对于背景固定模式噪声区域是显著的,利用显著性检测算法分离出图像中目标区域及背景,对不同区域分别采取不同处理,仅基于单幅图像信息实现强固定模式噪声的有效抑制。通过大量小目标、强固定模式噪声红外图像对算法性能进行测试。结果表明,本算法能够准确提取出图像中目标区域,实现图像中强固定模式噪声的有效抑制。     

双基地系统收站自主的自适应跟踪算法

本文介绍了双基地系统收站自主的定位原理及跟踪算法WMEKF (WeightedModified Extended Kalman Filter),提出了一种对机动目标的自适应跟踪算法AWMEKF(Adaptive WMEKF),并对典型的机动目标航迹进行了计算机仿真。     

Two‐agent scheduling on a single sequential and compatible batching machine

We study two‐agent scheduling on a single sequential and compatible batching machine in which jobs in each batch are processed sequentially and compatibility means that jobs of distinct agents can be processed in a common batch. A fixed setup time is required before each batch is started. Each agent seeks to optimize some scheduling criterion that depends on the completion times of its own jobs only. We consider several scheduling problems arising from different combinations of some regular scheduling criteria, including the maximum cost (embracing lateness and makespan as its special cases), the total completion time, and the (weighted) number of tardy jobs. Our goal is to find an optimal schedule that minimizes the objective value of one agent, subject to an upper bound on the objective value of the other agent. For each problem under consideration, we provide either a polynomial‐time or a pseudo‐polynomial‐time algorithm to solve it. We also devise a fully polynomial‐time approximation scheme when both agents’ scheduling criteria are the weighted number of tardy jobs.     

基于GA-ML-PMHT的多基站无源协同定位方法

针对无源协同定位系统中低可观测目标的航迹初始及维持问题,提出一种基于遗传算法的极大似然概率多假设的多基站无源协同定位方法。首先,建立多基站无源协同定位系统数学模型。其次,提出基于极大似然概率多假设的无源协同定位航迹初始算法,并首次利用遗传算法解决极大似然概率多假设中的优化求解问题,以提高目标检测跟踪性能。最后,通过滑窗法实现航迹维持。仿真结果表明,所提方法能够有效解决多基站无源协同定位系统中低可观测目标的航迹初始及维持问题。     

基于交叉定位的满足定位精度区域仿真研究

通过雷达组网对空中目标进行交叉定位是现代防空雷达的一个重要发展方向,分析了被动交叉定位抗击干扰目标的定位精度,对作战地域进行网格剖分,仿真得出满足一定精度要求的区域,并且在电子地图上形象地显示出来,便于指挥员进行快速决策。通过实际应用验证了该仿真算法的正确性和实用性。     

A note on equity across groups in facility location

An equity model between groups of demand points is proposed. The set of demand points is divided into two or more groups. For example, rich and poor neighborhoods and urban and rural neighborhoods. We wish to provide equal service to the different groups by minimizing the deviation from equality among groups. The distance to the closest facility is a measure of the quality of service. Once the facilities are located, each demand point has a service distance. The objective function, to be minimized, is the sum of squares of differences between all pairs of service distances between demand points in different groups. The problem is analyzed and solution techniques are proposed for the location of a single facility in the plane. Computational experiments for problems with up to 10,000 demand points and rectilinear, Euclidean, or general ?_p distances illustrate the efficiency of the proposed algorithm. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011