基于HLA的舰载多传感器信息融合系统仿真

建立具有舰载多传感器信息融合系统功能的C3I系统是目前和未来C3I系统的首要发展方向.应用HLA仿真技术进行舰载多传感器信息融合系统试验仿真,对于增强系统的通用性、灵活性、重用性和互操作性,实现复杂C3I系统集成具有重要的现实意义.首先提出了基于高层体系结构(HLA)的舰载信息融合系统的设计框架,其次阐述了系统设计思想和舰载多传感器信息融合仿真系统组成及功能,并针对作战想定背景进行了对象类和交互类的开发,最后给出了联邦仿真流程,实现功能模型和物理模型的建模.     

基于HLA的军事信息系统网仿真体系架构研究

分布式仿真系统的体系架构对于整个系统的功能实现和运行性能起着决定性的影响,为能充分利用仿真系统测试和评估军事信息系统网的性能,该文首先介绍了军事信息系统网(Military Information System Network:MISN)的组成和特点,并在分析基于数据库的仿真系统和基于HLA(高层体系架构)单联邦仿真系统局限性的基础上,得到了基于HLA的军事信息系统网分布式仿真多联邦体系框架,实现了联邦间功能转换所需的桥接联邦.该体系框架较好地完成了多通信网系的分布式交互仿真.     

舰载指火控系统人机界面信息显示研究

阐述了现海军舰载指火控系统信息显示界面的不足,列举了界面信息显示的普遍原则.以对海作战为例对舰载指火控系统进行作战的分层显示以及编队、联合和协同作战的显示内容进行了研究.针对现海军舰载指火控系统信息显示界面的不足,提出了以虚拟环境为主页面,从舰载指火控系统的的操作信息、状态信息和过程信息三个方面对信息显示进行了充分的描述.最后呼应不足,提出了11条舰载指火控系统信息显示的原则.     

基于云重心评判法的指挥自动化系统效能评估

针对指挥自动化系统效能评估问题,运用云理论对其进行了探索.给出了一种综合评判法--云重心评判法,在对云重心评判法理论介绍的同时详细地给出了其实现步骤,最后用加权偏离度()来衡量系统与理想状态的偏离程度,以表征系统性能的优良,并结合算例验证了此方法的有效性和实用性.此方法简单易行可操作性强,对指挥自动化系统的效能评估提供了有效的方法和途径.     

GPS/INS复合制导技术

近年来随着制导技术的发展,国外许多新型的武器装备都采用了GPS/INS复合制导技术。介绍了国外GPS/INS复合制导技术的发展和应用,重点分析了惯性导航系统和全球定位系统的优缺点,综述了GPS/INS复合制导的工作原理和关键技术。文中列举了美国GPS/INS系统的小型化,以及GPS/INS复合制导系统在SM-3导弹、洲际导弹等多种导弹制导过程中发挥的作用。由此可见,掌握国外复合制导体系的发展动态对我国GPS/INS复合制导技术的发展将起到重要的借鉴和启示作用。     

跳频电台自动测试系统设计

目前跳频电台的最好的检测方式是采取综合测试系统代替传统的测试仪器。以采样定理为基础,通过对三种跳频电台采样方案的比较得出结论,黑盒中频数字化方法是目前最合理的选择。给出了基于PCI总线构建跳频电台自动测试系统的硬件平台和软件测试方法。跳频电台自动测试系统可以完成对跳频电台指标的测试,并具有通用性。     

Non‐greedy heuristics and augmented neural networks for the open‐shop scheduling problem

In this paper we propose some non‐greedy heuristics and develop an Augmented‐Neural‐Network (AugNN) formulation for solving the classical open‐shop scheduling problem (OSSP). AugNN is a neural network based meta‐heuristic approach that allows integration of domain‐specific knowledge. The OSSP is framed as a neural network with multiple layers of jobs and machines. Input, output and activation functions are designed to enforce the problem constraints and embed known heuristics to generate a good feasible solution fast. Suitable learning strategies are applied to obtain better neighborhood solutions iteratively. The new heuristics and the AugNN formulation are tested on several benchmark problem instances in the literature and on some new problem instances generated in this study. The results are very competitive with other meta‐heuristic approaches, both in terms of solution quality and computational times. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Short‐term capacity allocation problem with tool and setup constraints

We consider a short‐term capacity allocation problem with tool and setup constraints that arises in the context of operational planning in a semiconductor wafer fabrication facility. The problem is that of allocating the available capacity of parallel nonidentical machines to available work‐in‐process (WIP) inventory of operations. Each machine can process a subset of the operations and a tool setup is required on a machine to change processing from one operation to another. Both the number of tools available for an operation and the number of setups that can be performed on a machine during a specified time horizon are limited. We formulate this problem as a degree‐constrained network flow problem on a bipartite graph, show that the problem is NP‐hard, and propose constant factor approximation algorithms. We also develop constructive heuristics and a greedy randomized adaptive search procedure for the problem. Our computational experiments demonstrate that our solution procedures solve the problem efficiently, rendering the use of our algorithms in real environment feasible. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

Scheduling a production–distribution system to optimize the tradeoff between delivery tardiness and distribution cost

We consider a make‐to‐order production–distribution system with one supplier and one or more customers. A set of orders with due dates needs to be processed by the supplier and delivered to the customers upon completion. The supplier can process one order at a time without preemption. Each customer is at a distinct location and only orders from the same customer can be batched together for delivery. Each delivery shipment has a capacity limit and incurs a distribution cost. The problem is to find a joint schedule of order processing at the supplier and order delivery from the supplier to the customers that optimizes an objective function involving the maximum delivery tardiness and the total distribution cost. We first study the solvability of various cases of the problem by either providing an efficient algorithm or proving the intractability of the problem. We then develop a fast heuristic for the general problem. We show that the heuristic is asymptotically optimal as the number of orders goes to infinity. We also evaluate the performance of the heuristic computationally by using lower bounds obtained by a column generation approach. Our results indicate that the heuristic is capable of generating near optimal solutions quickly. Finally, we study the value of production–distribution integration by comparing our integrated approach with two sequential approaches where scheduling decisions for order processing are made first, followed by order delivery decisions, with no or only partial integration of the two decisions. We show that in many cases, the integrated approach performs significantly better than the sequential approaches. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

状态机嵌入DEVS的组合建模方法研究

DEVS提供了模块化、层次化的系统建模和仿真执行框架,但是缺乏对于系统行为的抽象建模能力。状态图扩展了原有的FSM,通过可视化的、灵活的状态迁移图描述系统的复杂行为。提出将状态图嵌入DEVS的组合建模方法,互为补充,以建立复杂的离散控制系统。DEVS作为系统的建模框架并提供执行逻辑支持,状态图扩展DEVS的事件交互机制和时间推进机制,描述系统的行为逻辑。详细介绍了状态图和DEVS的语法语义,重点阐述状态图嵌入DEVS的实现机制。结合一个应用实例,说明嵌入状态图的DEVS用于建立离散控制系统模型的优势。