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.     

Technical note: Finite-time regret analysis of Kiefer-Wolfowitz stochastic approximation algorithm and nonparametric multi-product dynamic pricing with unknown demand

We consider the problem of nonparametric multi-product dynamic pricing with unknown demand and show that the problem may be formulated as an online model-free stochastic program, which can be solved by the classical Kiefer-Wolfowitz stochastic approximation (KWSA) algorithm. We prove that the expected cumulative regret of the KWSA algorithm is bounded above by where κ₁, κ₂ are positive constants and T is the number of periods for any T = 1, 2, … . Therefore, the regret of the KWSA algorithm grows in the order of , which achieves the lower bounds known for parametric dynamic pricing problems and shows that the nonparametric problems are not necessarily more difficult to solve than the parametric ones. Numerical experiments further demonstrate the effectiveness and efficiency of our proposed KW pricing policy by comparing with some pricing policies in the literature.     

高动态GNSS信号多普勒模拟任意阶直接数字合成器设计

为高精度模拟高动态条件下GNSS信号的多普勒特性,提出一种任意阶直接数字合成信号合成器的设计方法。设计任意阶直接数字合成信号合成器的结构;通过理论分析,推导各级累加器相位初值的计算公式;给出字长选择方法。经仿真验证,该方法能精确模拟GNSS信号的多普勒特性。此外,提出的直接数字合成器设计方法不受阶数的限制,可普遍应用于各类信号模拟器的设计。     

弹道导弹威胁估计模型构建

简要分析了弹道导弹飞行3个阶段的不同特点及各阶段导弹预警探测手段的侧重点,结合威胁估计的特征构建了弹道导弹威胁估计模型结构框架,运用多阶段贝叶斯网络理论,构造了主动段、自由段和再入段威胁估计模型,并明确了三阶段间的转换时机。采用动态贝叶斯方法对弹道导弹作战全过程进行威胁估计仿真推理,仿真结果能够反映导弹在飞行过程中威胁程度的变化特点,为反导指挥员作出辅助决策提供智力支持。     

基于激励机制的装备采办风险总量控制

针对装备采办中的风险总量控制,提出一种激励方式来提高承包商的积极性。在单目标风险控制模型的基础上,建立了多目标风险控制模型,推导出了激励机制下风险控制的最优合同公式。对激励机制中存在的两类错误进行了理论分析和实例验证,得出了两类错误对收益的影响,并在成本控制中得到了应用,有效地提高了装备采办的质量和效率,为军方决策者在装备采办中提供了合理的参考依据。     

动态滑翔运动建模、机理分析与航迹优化

信天翁凭借动态滑翔的飞行技巧从梯度风中获取能量,从而在几乎不拍翅膀的情况下进行长时间、长距离飞行,这种技巧应用于小型无人机上可拓展其完成任务的能力。基于飞行器动力学对梯度风场中的无人机运动方程进行推导和简化处理;利用简化的运动方程,分别从非惯性参考系中的动能定理和机械能变化的角度,对动态滑翔获取能量的机理进行分析;利用微分平坦法,以最小平均控制输入变化率为目标函数,对徘徊模式和平移模式的动态滑翔航迹进行优化计算。分析结果表明:逆风爬升、顺风下滑是动态滑翔基本获能方式。优化结果表明:控制输入变得更加平滑,甚至出现阶段性的常值,使得控制更加简化;徘徊模式下,当风梯度作为决策变量时,优化过程可在[0,0.5 s-1]的区间上找到使得目标函数值最小的风梯度;平移模式下,目标函数值在该区间上单调递减。     

基于DDS的虚拟信号发生器LabVIEW程序设计

针对传统信号发生器存在的成本高、功能单一、电子线路复杂等缺点,设计了一种基于频率合成技术的虚拟任意信号发生器。通过动态链接库(DLL)与下位机设备DDS-3X25进行通信,基于"模块化"和事件结构的设计思想,用LabVIEW编程实现了基本波形、任意波形、噪声叠加、波形数据载入、波形数据量化转换和线性插值等程序模块。实验结果表明,该设计不仅能产生纯净和叠加噪声的正弦波、方波、三角波和锯齿波等基本波形,而且可以输出手绘的任意波形,验证了设计的有效性。     

基于复合信号的激光陀螺零偏误差补偿分析

作为一种集成了光学、电学和机械力学的复杂系统，激光陀螺可以精确地测量物体的角速率输出。为了满足惯性导航系统长时、高精度的测量要求，研究了激光陀螺内部不同类型的传感器与激光陀螺零偏误差之间的特性，在传统的基于温度的零偏误差补偿方法的基础上，引入了二频机抖激光陀螺内部温度传感器、光电二极管和粘在抖动机构上压电陶瓷的输出信息进行复合建模，利用非线性拟合能力强的支持向量机算法，针对不同类型信息与二频机抖激光陀螺零偏误差的相关性对模型进行优化。实验结果表明，该二频机抖激光陀螺零偏误差补偿模型的补偿精度高于传统的补偿方法。     

动态弹道补偿

通常意义下的弹道补偿没有考虑火炮摆动对射击的影响,因而在坦克运动或目标运动时,命中概率将大大降低.分析了由火炮摆动带来的射击误差,给出了相应的补偿算法及电路的实现方法.