多特征的UAV快速目标识别算法仿真

针对UAV(Unmanned Aerial Vehicle)侦察图像快速目标识别问题,重点展开基于多特征的UAV快速目标识别算法的仿真研究。算法结合图像的不变矩特征和SIFT特征,首先用不变矩特征构造适应度函数并利用遗传算法的全局搜索能力,在侦察图像中进行搜索,快速提取出可能包含目标的感兴趣区域(ROI,Region of Interest);然后采用尺度不变特征变换算法(SIFT,Scale Invariant Feature Transform)在ROI区域中进行匹配识别,从而确定目标的精确位置。仿真结果表明:算法具有较强的鲁棒性,能有效地识别飞机目标并显著减少识别时间,为UAV系统提供了一种近实时的目标识别方法。     

多属性融合的坦克分队作战效能评估

现代条件下战场情况复杂,影响作战效能的因素众多且具有不确定性,为了获得对作战效能更为准确,可靠的评价,构建了一种新的基于多属性融合的坦克分队作战效能评估模型。结合已有的证据理论改进算法,给出了一种新的解决冲突证据的组合规则,并提出了一种新的组合策略,将其应用于评估模型中定性指标的融合;通过线性与非线性综合加权的方法求得评价的综合分值,得出了最终的评估结果。通过实例表明,该模型符合评估实际,对多属性模型的评估具有一定的借鉴意义。     

改进的前向信息修补算法及其应用

前向信息修补算法可以对离散动态贝叶斯网络的缺失数据进行预测,该算法只适用于所有观测节点是相互独立的网络,却不能处理观测节点有依赖关系网络的缺失数据。针对该算法的这一缺陷,提出了改进的前向信息修补算法,在分析离散动态贝叶斯网络的缺失数据具有二种基本形式的基础上,推导出了每种形式的相应预测公式。继而构建了用于识别威胁源离散动态贝叶斯网络的模型。仿真实验验证了改进的前向信息修补算法的有效性。     

拓展TOPSIS的地面目标关联算法

地面战场复杂的背景环境和目标的强机动性,使得传统关联方法所必需的先验信息不易获得,且传统关联方法仅利用状态信息进行关联,导致关联信息量不足,从而关联正确率不高。针对上述问题,采用无需任何先验假设的TOPS IS,在状态信息的基础上引入属性信息,作为拓展TOPS IS的评价指标,利用熵权确定各指标权重,最后用相对贴近度确定关联排序。仿真结果表明,该算法有效地提高了关联正确率,且能够满足实时性要求。     

As-IPDA算法的天波超视距雷达目标跟踪研究

天波超视距雷达(OTHR)具有低数据率、低检测概率和低量测精度特征对目标跟踪提出挑战.针对OTHR在低检测概率下跟踪目标存在失跟率高的问题,将As-IPDA算法应用到OTHR目标跟踪中,通过大量的仿真实例验证了As-IPDA算法在超视距雷达目标跟踪应用中的可行性,并分析了平滑步长、航迹存在性转移参数、目标检测概率对算法性能的影响,给出了算法参数选择建议,为工程应用提供理论参考.     

A partial characterization of the optimal ordering/rationing policy for a periodic review system with two demand classes and backordering

We consider a finite horizon periodic review, single product inventory system with a fixed setup cost and two stochastic demand classes that differ in their backordering costs. In each period, one must decide whether and how much to order, and how much demand of the lower class should be satisfied. We show that the optimal ordering policy can be characterized as a state dependent (s,S) policy, and the rationing structure is partially obtained based on the subconvexity of the cost function. We then propose a simple heuristic rationing policy, which is easy to implement and close to optimal for intensive numerical examples. We further study the case when the first demand class is deterministic and must be satisfied immediately. We show the optimality of the state dependent (s,S) ordering policy, and obtain additional rationing structural properties. Based on these properties, the optimal ordering and rationing policy for any state can be generated by finding the optimal policy of only a finite set of states, and for each state in this set, the optimal policy is obtained simply by choosing a policy from at most two alternatives. An efficient algorithm is then proposed. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

基于禁忌退火算法的巡航导弹航迹规划

针对巡航导弹航迹规划这个复杂的优化问题,一个禁忌退火混合优化算法被提出.首先,该算法是以基本模拟退火算法为基础.其次,为了加快该模拟退火算法的收敛速度,在恶化解的接受判断过程中,增加了一定动态的约束条件.最后,为了使最优解能够跳出局部最优的陷阱,使用了一个动态的禁忌表.仿真结果验证了该禁忌退火混合优化算法能够取得目标函数更优的航迹规划路径,从而有效提高巡航导弹的作战效能.     

一种运用遗传算法确定船舶航向控制模糊规则的方法

为了克服船舶航向控制模糊规则确定过程中的盲目性,引入一种与之相适应的遗传算法,以使结果成为某种意义下的最优解,从而从根本上解决这一重要问题.文中运用Matlab的C语言MEX-文件技术,将遗传算法源代码与Matlab直接结合起来,利用后者的强大建模能力,建立起完整的仿真模型.仿真结果表明,船舶的航向控制能力得到明显改善.     

An integer decomposition algorithm for solving a two‐stage facility location problem with second‐stage activation costs

We study a stochastic scenario‐based facility location problem arising in situations when facilities must first be located, then activated in a particular scenario before they can be used to satisfy scenario demands. Unlike typical facility location problems, fixed charges arise in the initial location of the facilities, and then in the activation of located facilities. The first‐stage variables in our problem are the traditional binary facility‐location variables, whereas the second‐stage variables involve a mix of binary facility‐activation variables and continuous flow variables. Benders decomposition is not applicable for these problems due to the presence of the second‐stage integer activation variables. Instead, we derive cutting planes tailored to the problem under investigation from recourse solution data. These cutting planes are derived by solving a series of specialized shortest path problems based on a modified residual graph from the recourse solution, and are tighter than the general cuts established by Laporte and Louveaux for two‐stage binary programming problems. We demonstrate the computational efficacy of our approach on a variety of randomly generated test problems. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

一类线性规划模型的求解方法

应用矩阵理论知识得到了一类特殊的线性规划模型的相关定理,给出了一种简便求解方法,讨论了求解方法的推广问题.