基于熵的地磁匹配定位算法

地磁匹配定位是近年来发展起来的新技术,针对地磁匹配定位中的匹配算法问题,引入了熵的概念,定义了地磁信息熵和地磁差异熵,提出了地磁信息熵和地磁差异熵综合的匹配算法,详细分析了其基本原理和实现过程。仿真实验表明,地磁熵算法的匹配误差并不随实时数据测量误差的增加而增加,该算法计算速度快、具有良好的抗测量误差干扰的能力,符合匹配精度和速度的要求。     

Path optimization for the resource‐constrained searcher

We formulate and solve a discrete‐time path‐optimization problem where a single searcher, operating in a discretized three‐dimensional airspace, looks for a moving target in a finite set of cells. The searcher is constrained by maximum limits on the consumption of one or more resources such as time, fuel, and risk along any path. We develop a specialized branch‐and‐bound algorithm for this problem that uses several network reduction procedures as well as a new bounding technique based on Lagrangian relaxation and network expansion. The resulting algorithm outperforms a state‐of‐the‐art algorithm for solving time‐constrained problems and also is the first algorithm to solve multi‐constrained problems. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

武警部队快速机动中最优路径的实现

紧急条件下武警部队快速机动最优路径,是一个多目标多约束随机动态交通网络寻优问题。在分析交通网络拓扑化特点及最短路模型前提下,着重研究道路通行能力带给复杂公路网络道路寻优问题的影响,并结合GIS系统利用改进的Dijkstra算法求解。     

面向多星观测调度的分层迭代算法

提出一种基于分治策略的多星观测分层调度框架,在该框架下,用蚁群优化算法把任务分配至各轨道圈次上,并利用自适应模拟退火算法求解各轨道圈次的调度问题。根据各轨道圈次调度结果的反馈情况,再调整任务分配方案,重复上述过程直到达到算法终止条件。为了提高算法的性能,在设计蚁群算法的启发式信息模型时,应充分考虑卫星调度问题的领域知识;在模拟退火算法中设计两个邻域结构,采用动态选择策略在优化过程中确定最佳邻域搜索结构。仿真实验表明,该方法有效地降低了问题求解的复杂度,尤其在求解大规模多星观测调度问题时表现出优异的性能。     

防空导弹飞行试验的引战配合性能分析方法

提出了一种对防空导弹的引战配合性能进行量化评价的方法。利用飞行试验数据对导弹目标交会及战斗部杀伤目标过程进行了仿真。     

遗传算法在非线性回归模型辨识中的应用

对遗传算法在非线性回归模型辨识中的应用进行了探讨,切削温度回归模型辨识的实例表明,该方法是有效的.     

二次型极小化问题的迭代算法

在新的控制条件下,证明了二次型极小化问题的迭代算法的有效性,所得结果改进了徐洪坤关于二次型优化的最新结果。     

Two‐stage component test plans for testing the reliability of a series system

A system reliability is often evaluated by individual tests of components that constitute the system. These component test plans have advantages over complete system based tests in terms of time and cost. In this paper, we consider the series system with n components, where the lifetime of the i‐th component follows exponential distribution with parameter λ_i. Assuming test costs for the components are different, we develop an efficient algorithm to design a two‐stage component test plan that satisfies the usual probability requirements on the system reliability and in addition minimizes the maximum expected cost. For the case of prior information in the form of upper bounds on λ_i's, we use the genetic algorithm to solve the associated optimization problems which are otherwise difficult to solve using mathematical programming techniques. The two‐stage component test plans are cost effective compared to single‐stage plans developed by Rajgopal and Mazumdar. We demonstrate through several numerical examples that our approach has the potential to reduce the overall testing costs significantly. © 2002 John Wiley & Sons, Inc. Naval Research Logistics, 49: 95–116, 2002; DOI 10.1002/nav.1051     

一种从二维照片反求三维CAD模型的稳健方法

研究了从物体二维照片重构其三维CAD模型的算法。通过物体在不同方位的一组照片 ,选取一定数量的配准点 ,该算法能够计算出照相机的运动参数 ,进而得到物体表面的 3D几何信息及CAD模型。算法充分考虑到了CAD建模的可制造性约束 ,具有精确、稳健的特点 ,在逆向工程建模、计算机视觉、机器人领域有应用前景。     

分块模幂算法

RSA是目前最成熟的一种公钥密码体系 ,RSA加解密算法的速度依赖于模幂算法 ,因而快速模幂算法一直是人们感兴趣的课题。该文提出了一种基于分块的模幂算法 ,对算法复杂性进行了讨论 ,并与其他模幂算法作了比较 ,从理论上论证了它具有更快的模幂速度