基于动态时间规整算法的车辆目标分类研究

将动态时间规整(Dynamic Time Warping)算法应用于地面车辆目标的分类识别中。基于微多普勒效应原理,建立了轮式车辆和履带式车辆雷达回波模型,对两种车辆目标微多普勒信号的差异性进行了分析,并结合实测数据,验证了理论分析的正确性。在杂波抑制及速度归一化处理的基础上,利用动态时间规整算法,将提取出的车辆目标的累积失真距离作为目标分类识别的依据,实现了轮式车辆和履带式车辆的自动分类。基于实测数据的实验结果表明,该方法在不同信噪比条件下都具有较好的分类性能。     

一种基于蚁群算法的准动态防空武器分配算法

武器目标分配问题是一个典型的限制组合优化问题,旨在得到在整个防御阶段中针对目标函数的最优武器分配方案。分配算法主要分为静态和动态两大类。针对传统静态分配模型中存在的几点问题,提出了基于时间窗的准动态武器目标分配算法,该算法综合考虑拦截概率、拦截时间和武器耗费多个优化指标,并将该算法推广至多类防空武器的优化分配中。通过大量实验验证,该算法在性能、时间复杂度等方面均有较大优势,并且能较好地适应战场态势的变化,及时调整分配方案,具有很好的实用性。     

坦克底盘角振动对火炮射击精度影响机理研究

实车试验表明,在行进间射击试验时,当车辆超过一定车速(行进间射击车速)时,射击精度或射击命中率会发生大幅度的下降。针对这个问题,建立了坦克底盘角振动导致的射击偏差的数学模型;并结合实车试验数据,对射击延迟时间内底盘角振动造成的火炮射击偏差进行了全面分析。分析研究表明:在相同的行驶车速条件下,车辆底盘角速度、姿态角变化量随着射击延迟时间的增大而增大;在相同的射击延迟时间内,车辆底盘角速度、姿态角变化量与射角偏差随着行驶车速的增大而增大;其中射角偏差引起的目标距离偏差是弹丸横向速度导致的目标距离偏差的3倍~5倍。因此,随着行驶车速增加而增加的射角偏差增大是行进间射击车速受限的主要原因。     

基于FPGA的高速图像处理系统设计

针对坦克图像处理中存在的系统集成度不高、处理速度较慢等问题,设计了一种基于FPGA的高速图像处理系统。该系统通过在FPGA上配置Nios Ⅱ软核处理器以及图像采集、处理和显示等功能模块来实现其主要硬件电路,并结合系统的软件设计实现了多路图像信号的采集以及图像的放大/缩小、裁剪和叠加显示等功能。由于采用了可编程芯片和并行处理技术,该系统具有集成度高、维修性好、图像处理速度快和实时性强等优点。     

一种自适应方向性技术在生命探测仪中的应用

基于声波／振动探测原理的地震生命探测系统的研制在我国灾害生命搜索救助领域中占有重要位置。提出了一种有效的自适应噪声抵消方法,该方法通过自适应的改变增益值代替改变部分样本的时延值而使系统零点自适应的移动。当信号和噪声同时存在时,能保证零点总是朝向噪声方向。该自适应算法能在硬件中实时实现,在声波／振动生命探测仪中可作为噪声削减和信号增强的实际工具。     

基于ARM的嵌入式指纹图像处理技术研究

研究了特征提取方法和匹配算法;设计了基于ARM的嵌入式指纹处理核心模块,并将其应用于综合业务平台的用户身份认证系统中;具有自主版权的认证加载模式实现了对登录平台的用户身份验证,识别率达到了99.3%.结果表明,该方法能确保平台系统的安全.     

基于波达方向矩阵的矢量水听器方位频率联合估计

提出了一种新的基于单个矢量水听器的方位频率联合估计方法--波达方向矩阵法.利用矢量水听器的时延数据,构造了两个相同的子阵,通过对波达方向矩阵的特征分解,实现了对目标信号的波达方向估计,并同时得到了目标的频率特征.计算机仿真实验表明,该方法具有较好的估计精度.     

Network design for time‐constrained delivery

To meet customer demand, delivery companies are offering an increasing number of time‐definite services. In this article, we examine the strategic design of delivery networks which can efficiently provide these services. Because of the high cost of direct connections, we focus on tree‐structured networks. As it may not be possible to identify a tree‐structured network that satisfies all of the delivery guarantees, we allow these guarantees to be violated but seek to minimize the sum of the violations. We establish the complexity of the problem and exploit an empirically identified solution structure to create new neighborhoods which improve solution values over more general neighborhood structures. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Scheduling parallel machines with inclusive processing set restrictions

We consider the problem of assigning a set of jobs to different parallel machines of the same processing speed, where each job is compatible to only a subset of those machines. The machines can be linearly ordered such that a higher‐indexed machine can process all those jobs that a lower‐indexed machine can process. The objective is to minimize the makespan of the schedule. This problem is motivated by industrial applications such as cargo handling by cranes with nonidentical weight capacities, computer processor scheduling with memory constraints, and grades of service provision by parallel servers. We develop an efficient algorithm for this problem with a worst‐case performance ratio of + ε, where ε is a positive constant which may be set arbitrarily close to zero. We also present a polynomial time approximation scheme for this problem, which answers an open question in the literature. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Strategic capacity decision‐making in a stochastic manufacturing environment using real‐time approximate dynamic programming

In this study, we illustrate a real‐time approximate dynamic programming (RTADP) method for solving multistage capacity decision problems in a stochastic manufacturing environment, by using an exemplary three‐stage manufacturing system with recycle. The system is a moderate size queuing network, which experiences stochastic variations in demand and product yield. The dynamic capacity decision problem is formulated as a Markov decision process (MDP). The proposed RTADP method starts with a set of heuristics and learns a superior quality solution by interacting with the stochastic system via simulation. The curse‐of‐dimensionality associated with DP methods is alleviated by the adoption of several notions including “evolving set of relevant states,” for which the value function table is built and updated, “adaptive action set” for keeping track of attractive action candidates, and “nonparametric k nearest neighbor averager” for value function approximation. The performance of the learned solution is evaluated against (1) an “ideal” solution derived using a mixed integer programming (MIP) formulation, which assumes full knowledge of future realized values of the stochastic variables (2) a myopic heuristic solution, and (3) a sample path based rolling horizon MIP solution. The policy learned through the RTADP method turned out to be superior to polices of 2 and 3. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 2010