智能搜救机器人在障碍地形的自主构型规划

为了解决带有辅助摆臂的智能搜救机器人自动规划构型以实现自主越障的难题,提出一种能够适应复杂地面形状的搜救机器人越障构型规划新方法,其核心是一种高适应性、高效率的机器人姿态预测算法。通过将地形表示为离散的点集,建立了搜救机器人的单侧姿态预测数学模型;进一步提出了快速求解该问题的算法,每秒可预测1 000～1 500个姿态。基于此,设计了机器人越障过程中状态、动作的评价指标,运用动态规划算法与滚动优化思想构建了具有优化能力的、能够实时运行的构型规划器。仿真与实物实验的结果表明,该方法能够使机器人自主调整构型穿越复杂地形,且相较强化学习算法和人工操作具有更平稳的越障效果。     

流域变换的串行与并行策略研究

流域变换是数字形态学中用于图像分割的一种经典方法,其并行化问题成为近年来研究的重点。首先给出了流域变换的数学模型,并归纳列举了几种离散情况下的形式化定义;其次分类总结了近年来流域变换串行算法研究的新进展,从而在此基础上重点讨论了相应的并行化策略。详细分析了设计并行流域算法需要考虑的几个问题;并比较评价了现有并行算法的性能特点,得出了一些结论;最后提出了有待进一步研究的问题。     

面向癫痫脑电的简化深度学习模型

针对脑电信号随机性强、动态变化迅速等特点,提出了一种简化深度学习模型研究癫痫脑电识别问题。提出的模型以一维卷积神经网络为基础,在结构方面简化了卷积层、池化层等以提高模型效率,在整体框架方面应用了Keras框架,在训练优化算法方面采用RMSProp算法作为模型优化算法,通过预定义的目标函数来进行损失估计,模型设计上加入了批标准化层和全局均值池化层。基于所提模型,从三个方面研究了癫痫脑电识别问题,即:利用经验模态分解,分别选取前三阶、前五阶、前七阶、前八阶的本征模态函数分量,在简化模型上进行对比分析;利用提出模型所具备的深度学习特点,直接识别原始脑电信号而无须特征提取环节;增加了三种不同方法分别提取7类特征,对相同的脑电数据进行对比分析。性能分析结果表明:对于五类不同的脑电信号,前三阶的本征模态函数分量的识别率达到92.1%,比其他几种处理方式识别率高;前八阶的本征模态分量识别率不及原始信号,表明人工数据处理时会给数据带来噪声; 所提出的简化深度学习模型能高效处理癫痫脑电识别问题,具备较高效率和较好性能。     

超低照度下微光图像增强神经网络损失函数设计分析

超低照度下(环境照度小于2×10~(-3)lux)微光图像具有低信噪比、低对比度等特点,使目标难以辨识,严重影响观察效果。为了提高超低照度下微光图像质量,设计了一种用于微光图像增强的卷积自编码深度神经网络,并针对传统的均方误差损失函数不符合人类视觉感知特性等问题,结合现有的全参考图像质量评价指标,研究了包括感知损失在内的几种损失函数,并提出了一种新的可微分损失函数。实验结果表明,在网络结构不发生改变的情况下,所提损失函数具有更好的性能,在提高微光图像信噪比和对比度的同时,能够有效地增强图像内部细节信息。     

基于EMD、遗传算法及神经网络的柴油机故障诊断

研究了将经验模式分解(Empirical Mode Decom position,EMD)、遗传算法及BP神经网络相结合对柴油机振动信号进行故障诊断的方法。首先运用经验模式分解方法对柴油机缸盖表面振动信号进行分解并提取特征参数;然后利用遗传算法对得到的特征参数进行选择,找到对于故障诊断最为敏感的参数;最后建立了BP神经网络模型对柴油机典型故障进行诊断。通过对某型柴油机的验证,表明该方法能够准确识别柴油机供油系统的典型故障。     

Approximation results for min‐max path cover problems in vehicle routing

This article studies a min‐max path cover problem, which is to determine a set of paths for k capacitated vehicles to service all the customers in a given weighted graph so that the largest path cost is minimized. The problem has wide applications in vehicle routing, especially when the minimization of the latest service completion time is a critical performance measure. We have analyzed four typical variants of this problem, where the vehicles have either unlimited or limited capacities, and they start from either a given depot or any depot of a given depot set. We have developed approximation algorithms for these four variants, which achieve approximation ratios of max{3 ‐ 2/k,2}, 5, max{5 ‐ 2/k,4}, and 7, respectively. We have also analyzed the approximation hardness of these variants by showing that, unless P = NP , it is impossible for them to achieve approximation ratios less than 4/3, 3/2, 3/2, and 2, respectively. We have further extended the techniques and results developed for this problem to other min‐max vehicle routing problems.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

新算法在划船和伪划船效应中的应用

划船效应补偿是高精度捷联惯导系统解算的重要环节。通过研究其误差特性,推导了新的通用划船效应补偿公式。同时提出了角振动环境中伪划船效应的存在,对伪划船效应的产生原因、表达方式以及对捷联惯导系统的影响进行了分析。对新的补偿算法在划船效应和伪划船效应下进行了仿真试验。     

等概率抽样群体演化算法的隐含并行性

在等概率抽样群体的条件下,讨论了演化算法的隐合并行性,得到了算法每代隐含处理的模式长度不超过ls（0≤ls≤l）的不同模式期望数的精确表达,并估计了其上下界．     

演化硬件中变异概率对进化算法首次命中时间的影响

在(1+1)EAs中,采用马尔可夫链推移时间分析法,推导出了平均首次命中时间的表达式。从理论上分析了变异概率对平均首次命中时间的影响。结果表明适当的变异概率会缩短平均首次命中时间,加快进化算法的寻优时间。     

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