外弹道数据融合实时算法研究

信息融合技术可以大大减轻指挥决策的工作量,增加信息置信度,减少模糊性,改善系统可靠性.针对靶场实时测控数据处理中急待解决的成片野值干扰等难题,在实时环境中采用数据融合处理方法,讨论了外弹道数据融合实时算法所面临的关键技术,并通过分析与论证得出可行性结论.结论对进一步的系统设计与软件实现具有指导意义.     

星载高光谱图像实时处理系统

为适应星载高光谱成像仪输出数据率越来越高的需求,设计了一种基于模块化的、软硬件结合的高光谱图像实时处理系统。该系统由一个主控模块(MM)和若干个实时高光谱图像处理子模块(SM)组成,对软硬件处理流程进行了合理划分。在充分考虑系统所需选用的DSP和FPGA芯片下,给出了主控模块与子模块的设计方法及原理框图。该系统可等效为一个二维网孔型并行模型,具有很高的并行性和加速比,具有实现实时高光谱图像处理的能力。并且该系统具有很强的适应能力,可满足不同星载高光谱成像仪的需求。     

基于实时递阶控制的智能坦克火控系统结构分析

为适应坦克火控系统的智能化发展需求,保证智能坦克火控系统研究工作的顺利开展,提出了坦克火控系统智能控制结构的设计原则,并综合功能型和行为型控制结构的优点,构建了系统智能实时递阶控制的总体结构,对各个智能控制层的内部结构和功能进行了分析。最后基于实时递阶控制结构对系统的稳定性进行了分析,对智能坦克火控系统的后续研究设计工作具有一定的指导作用。     

一种捷联惯导系统姿态测量新算法的应用研究

为改进捷联惯导系统姿态矩阵的解算、实时计算等问题,本文引入四元数三阶泰勒展开递推式作为捷联惯导系统的姿态更新算法,着重解决了使用三阶泰勒展开递推式进行姿态计算的方法,并对某陆地捷联惯导系统的量测数据,用C语言进行了相应的仿真.本文的工作为改进捷联惯导系统算法提供了参考依据.     

Benders' cuts guided large neighborhood search for the traveling umpire problem

This article introduces the use of Benders' cuts to guide a large neighborhood search to solve the traveling umpire problem, a sports scheduling problem inspired by the real‐life needs of the officials of a sports league. At each time slot, a greedy matching heuristic is used to construct a schedule. When an infeasibility is recognized first a single step backtracking is tried to resolve the infeasibility. If unsuccessful, Benders' cuts are generated to guide a large neighborhood search to ensure feasibility and to improve the solution. Realizing the inherent symmetry present in the problem, a large family of cuts are generated and their effectiveness is tested. The resulting approach is able to find better solutions to many instances of this problem. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Polynomial‐time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time

In this article, we consider the concurrent open shop scheduling problem to minimize the total weighted completion time. When the number of machines is arbitrary, the problem has been shown to be inapproximable within a factor of 4/3 ‐ ε for any ε > 0 if the unique games conjecture is true in the literature. We propose a polynomial time approximation scheme for the problem under the restriction that the number of machines is fixed. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Batch scheduling on a two‐machine jobshop with machine‐dependent setup times

The problem of minimum makespan on an m machine jobshop with unit execution time (UET) jobs (m ≥ 3) is known to be strongly NP‐hard even with no setup times. We focus in this article on the two‐machine case. We assume UET jobs and consider batching with batch availability and machine‐dependent setup times. We introduce an efficient \begin{align*}(O(\sqrt{n}))\end{align*} algorithm, where n is the number of jobs. We then introduce a heuristic for the multimachine case and demonstrate its efficiency for two interesting instances. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

A genetic algorithm with neighborhood search for the resource‐constrained project scheduling problem

The resource‐constrained project scheduling problem (RCPSP) consists of a set of non‐preemptive activities that follow precedence relationship and consume resources. Under the limited amount of the resources, the objective of RCPSP is to find a schedule of the activities to minimize the project makespan. This article presents a new genetic algorithm (GA) by incorporating a local search strategy in GA operators. The local search strategy improves the efficiency of searching the solution space while keeping the randomness of the GA approach. Extensive numerical experiments show that the proposed GA with neighborhood search works well regarding solution quality and computational time compared with existing algorithms in the RCPSP literature, especially for the instances with a large number of activities. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

飞行器试验多测控目标发射零点应急处理方法

飞行器飞行试验任务中,发射零点T0是整个测控系统启动运行的基准点,是保证测控系统有条不紊正常工作的关键因素。特别是执行多个测控目标连射飞行试验任务,多个发射零点的正确处理更是关乎试验任务的成败。在分析发射零点形成机制基础上,对发射零点在指控系统实时测控软件中的处理方法进行了研究,提出了一种实时测控软件重启后重新获得多测控目标正确发射零点的应急处理方法,解决了试验过程中一旦实时测控软件因重大软件故障导致初始发射零点丢失的问题,保障了试验任务的顺利进行。     

Single batch machine scheduling with deliveries

We consider the problem of scheduling a set of n jobs on a single batch machine, where several jobs can be processed simultaneously. Each job j has a processing time p_j and a size s_j. All jobs are available for processing at time 0. The batch machine has a capacity D. Several jobs can be batched together and processed simultaneously, provided that the total size of the jobs in the batch does not exceed D. The processing time of a batch is the largest processing time among all jobs in the batch. There is a single vehicle available for delivery of the finished products to the customer, and the vehicle has capacity K. We assume that K = rD, where and r is an integer. The travel time of the vehicle is T; that is, T is the time from the manufacturer to the customer. Our goal is to find a schedule of the jobs and a delivery plan so that the service span is minimized, where the service span is the time that the last job is delivered to the customer. We show that if the jobs have identical sizes, then we can find a schedule and delivery plan in time such that the service span is minimum. If the jobs have identical processing times, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most 11/9 times the optimal service span. When the jobs have arbitrary processing times and arbitrary sizes, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most twice the optimal service span. We also derive upper bounds of the absolute worst‐case ratios in both cases. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 470–482, 2015