Approximation algorithms for capacitated stochastic inventory systems with setup costs

We develop the first approximation algorithm with worst‐case performance guarantee for capacitated stochastic periodic‐review inventory systems with setup costs. The structure of the optimal control policy for such systems is extremely complicated, and indeed, only some partial characterization is available. Thus, finding provably near‐optimal control policies has been an open challenge. In this article, we construct computationally efficient approximate optimal policies for these systems whose demands can be nonstationary and/or correlated over time, and show that these policies have a worst‐case performance guarantee of 4. We demonstrate through extensive numerical studies that the policies empirically perform well, and they are significantly better than the theoretical worst‐case guarantees. We also extend the analyses and results to the case with batch ordering constraints, where the order size has to be an integer multiple of a base load. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 304–319, 2014     

临近空间大型柔性充气囊体结构特性分析

以临近空间平流层飞艇柔性充气囊体为研究对象,根据充气结构设计理论对充气囊体结构的最小压差和应力进行计算,建立平流层飞艇充气囊体结构有限元模型。在模型验证的基础上,采用非线性有限元方法对平流层飞艇充气囊体结构特性进行仿真分析,得到了囊体结构在不同压差和吊舱载荷作用下应力和变形分布及变化规律,并分析了结构加强配置对囊体应力和变形的影响,为平流层飞艇结构设计提供技术支撑和参考依据。     

正规形法在弹箭非线性运动分析中的应用

非线性气动力对弹箭运动特性具有重要影响,而其复杂性和有效分析工具的缺乏往往制约了弹箭非线性运动理论的发展.为探索正规形方法在弹箭非线性运动分析中的应用,构造了考虑二次非线性阻尼和七次非线性静力矩下攻角方程的正规形,进而求得攻角的通用解析解,通过数值积分验证了其在较大攻角范围内的有效性,该解析解也同样适用于无阻尼角运动和...     

一类修正的和积分型算子的点态逼近

研究以Beta为基函数的一类修正的和积分型算子,利用统一光滑模。ω^2φ^λ（f,t）（0≤λ≤1）,得到该算子点态逼近的等价定理．     

基于非线性模型预测的翼伞系统控制研究

翼伞系统在飞行过程中,受外界不确定因素的影响呈现出非线性特性和耦合性．应用非线性模型预测控制理论对翼伞系统飞行控制进行了研究,提出基于非线性模型预测控制的翼伞系统控制律设计方法,并推导出控制律解析式．仿真研究表明,合理地选择泰勒展开级数和预测周期,通过泰勒级数展开并截尾后的翼伞非线性控制系统可以表现出良好的控制性能．     

小波神经网络UCAV飞行控制系统

针对采用H∞控制设计方法需求解难度很大的偏微分方程,而导致工程实现难度大的问题,提出了采用小波神经网络进行无人攻击机(UCAV)飞行控制系统设计的方法,该方法集小波变换和神经网络的优点于一身,简化了网络训练,避免了系统达到局部最优解,使得系统具有更好的逼近精度。通过仿真实验表明,利用小波神经网络进行UCAV控制律设计,使系统具有较好的跟踪性和鲁棒性,避免了精确模型的建立,便于分析系统的稳定性。     

基于数据压缩的LSP参数高效量化算法

文中为解决超长帧编码系统中联合帧数过多导致LSP参数量化性能下降这个问题,将多项式拟合引入超长帧编码系统中,利用多项式拟合压缩LSP参数矩阵,以降低量化时实际联合的帧数。再用分裂矩阵量化器进行量化。仿真结果表明,在120 bps的参数量化速率下,此算法的量化性能优于矩阵量化算法(MQ),平均谱失真比MQ算法降低了0.0719 dB,平均分段信噪比提高了0.1971 dB。     

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     

船舶静态电场跟踪的渐进更新扩展卡尔曼滤波器

为了实现利用船舶静态电场对船舶进行跟踪的目的,针对传统卡尔曼滤波算法中存在的问题,设计一种新的非线性滤波器。建立船舶的状态空间模型,分析传统卡尔曼滤波算法在船舶跟踪中存在的问题;依据渐进贝叶斯思想,利用连续白噪声与离散白噪声序列噪声协方差之间的关系,设计一种新的渐进更新扩展卡尔曼滤波器。仿真结果表明,该滤波器能有效地抑制由于初始误差较大而造成的滤波性能下降和滤波发散,能够有效地跟踪船舶,具有较高的实用价值。     

On efficient algorithms for finding efficient salvo policies

We consider the salvo policy problem, in which there are k moments, called salvos, at which we can fire multiple missiles simultaneously at an incoming object. Each salvo is characterized by a probability p_i: the hit probability of a single missile. After each salvo, we can assess whether the incoming object is still active. If it is, we fire the missiles assigned to the next salvo. In the salvo policy problem, the goal is to assign at most n missiles to salvos in order to minimize the expected number of missiles used. We consider three problem versions. In Gould's version, we have to assign all n missiles to salvos. In the Big Bomb version, a cost of B is incurred when all salvo's are unsuccessful. Finally, we consider the Quota version in which the kill probability should exceed some quota Q. We discuss the computational complexity and the approximability of these problem versions. In particular, we show that Gould's version and the Big Bomb version admit pseudopolynomial time exact algorithms and fully polynomial time approximation schemes. We also present an iterative approximation algorithm for the Quota version, and show that a related problem is NP-complete.