用结构自适应前馈网络解算多目标导弹攻击区

多目标导弹攻击区的实时解算是机载多目标攻击武器系统得以技术实现的中心环节。阐述了“多目标导弹攻击区”的概念 ,探索了其解算的技术途径 ,提出了“实时、高精度和低存储”的解算要求。根据上述技术要求 ,设计了基于网络灵敏度统计分析的多层前馈网络结构自适应算法 ,以用于训练合适规模的多层前馈网络逼近器。在此基础上 ,进行了系统仿真研究 ,研究的结果表明了该方案的应用前景。     

多传感器多目标定位与跟踪技术研究

针对炮兵打击目标的特性和获取目标信息所采用的侦察设施 ,研究了多传感器多目标定位和跟踪问题。在闭圆和聚类概念的基础上 ,提出了一种多传感器多目标融合算法 ,并给出了状态估计的最优解。仿真结果证明了这种算法的有效性。这一模型的物理实现正在进一步研究之中。     

多目标数据关联的神经网络方法

数据关联是多目标跟踪的关键问题。基于 Hopfield神经网络的 JPDA是解决这一关键问题的有效方法之一 ,但此方法的难点在于优化系数的整定。提出一种改进算法 ,用于解决优化系数在线自适应整定问题。首先重新构造了李雅普诺夫能量函数 ,接着引入变化的优化系数因子 ,并给出了优化系数求解的迭代公式 ;最后对已有和改进的算法进行了仿真研究。结果表明改进的方法和原有的方法相比 ,一方面具有在线整定优化系数的功能 ,另一方面可以获得和原有算法非常接近的估计误差。     

Algorithms for the multi‐item multi‐vehicles dynamic lot sizing problem

We consider a two‐stage supply chain, in which multi‐items are shipped from a manufacturing facility or a central warehouse to a downstream retailer that faces deterministic external demand for each of the items over a finite planning horizon. The items are shipped through identical capacitated vehicles, each incurring a fixed cost per trip. In addition, there exist item‐dependent variable shipping costs and inventory holding costs at the retailer for items stored at the end of the period; these costs are constant over time. The sum of all costs must be minimized while satisfying the external demand without backlogging. In this paper we develop a search algorithm to solve the problem optimally. Our search algorithm, although exponential in the worst case, is very efficient empirically due to new properties of the optimal solution that we found, which allow us to restrict the number of solutions examined. Second, we perform a computational study that compares the empirical running time of our search methods to other available exact solution methods to the problem. Finally, we characterize the conditions under which each of the solution methods is likely to be faster than the others and suggest efficient heuristic solutions that we recommend using when the problem is large in all dimensions. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006.     

The stochastic joint replenishment problem: A new policy,analysis, and insights

In this study, we propose a new parsimonious policy for the stochastic joint replenishment problem in a single‐location, N‐item setting. The replenishment decisions are based on both group reorder point‐group order quantity and the time since the last decision epoch. We derive the expressions for the key operating characteristics of the inventory system for both unit and compound Poisson demands. In a comprehensive numerical study, we compare the performance of the proposed policy with that of existing ones over a standard test bed. Our numerical results indicate that the proposed policy dominates the existing ones in 100 of 139 instances with comparably significant savings for unit demands. With batch demands, the savings increase as the stochasticity of demand size gets larger. We also observe that it performs well in environments with low demand diversity across items. The inventory system herein also models a two‐echelon setting with a single item, multiple retailers, and cross docking at the upper echelon. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

基于改进卡尔曼滤波方法的机动目标跟踪研究

针对在机动目标跟踪中当目标作高度机动飞行时卡尔曼滤波可能会出现严重发散的情况,提出利用BP神经网络校正其滤波结果,并将遗传算法应用于BP网络的训练过程,以解决BP网络训练速度慢的缺陷,提高算法的实时性。仿真表明该方法是可行的、有效的。     

面向应用的分布式多机联合计算的系统设计问题

随着计算机应用向分布和异构发展，如何建立一个具有良好性能价格比的分布式多机联合计算系统是当前计算机应用开发者遇到的重要课题。文中结合分布式仿真应用实例，对多计算机联合计算的系统划分、数据通讯机制和高性能并行计算问题进行了论述。     

单机攻击多目标逻辑的遗传优化求解

攻击逻辑的优化决策对于机载多目标攻击武器系统具有重要意义。本文建立了单机多目标攻击逻辑的解算模型 ,提出了解算要求 ,给出了采用遗传算法求解多目标攻击逻辑的应用方案。在此基础上 ,采用该方案进行大量的试探性仿真研究 ,对仿真结果进行了分析 ,并选择了合适的遗传算法参数。文章最后阐述了用遗传算法求解多目标攻击逻辑问题的发展前景     

多传感器融合系统航迹号管理方法

多目标杂波环境下 ,多传感器探测形成的航迹之间呈现错综复杂的关系 ,多传感器系统融合中心航迹管理成了迫切需要解决的问题。在原有单航迹号分配方法的基础上 ,提出多航迹号分配方法 ,并扩展到立体图航迹号管理方法。尤其是航迹号立体图的引入 ,为航迹管理提供了一个新的思路。     

嵌入式微处理器的多层次可配置仿真工具

为了适应嵌入式定制微处理器的开发的需要 ,克服现有微处理器仿真工具的某些不足 ,文中介绍了微处理器的仿真验证工具———VCPU的设计和实现方法。同其它微处理器仿真工具相比 ,该工具具有多层次 ,可配置 ,功能全面的特点。利用该工具 ,设计者可在设计早期进行系统集成验证 ,缩短设计周期并减少设计错误。该工具已经在嵌入式微处理器开发过程中得到成功应用