火炮射表数据处理中几个有关问题的讨论

本文是文献的继续,主要研究射表数据处理中的几个技术问题。其中包括:自变量、逼近多项式的结构、项数和逼近精度的选择问题,以及广义正规方程组的解法、选项中的异常现象和贼点剔除问题等。它们是正确和有效进行射表数据处理的重要因素,是必须很好解决的问题。     

低轨预警自由段弹道估计的多项式逼近算法

低轨单星对自由段弹道的估计是天基预警系统需解决的关键技术之一.建立了低轨预警卫星对自由段弹道的观测模型,针对极大似然估计批处理算法的大运算量问题,给出了一种多项式逼近算法,由观测数据的逼近多项式在一些特定采样点的值形成伪观测数据,以伪观测数据代替原观测数据进行弹道估计.仿真表明,精度与极大似然估计相当,运算量显著降低.     

三参数威布尔分布在寿命分析中的参数估计

威布尔分布在可靠性工程中已得到了广泛的应用.在对己给定的寿命试验数据进行可靠性分析与评估中,因简单易解多采用二参数威布尔分布,但参数估计会带来较大误差.对具有以损耗失效为特征的某些机械零部件,采用三参数威布尔分布进行拟合及参数估计,可以得到更高的精度,因而较二参数威布尔分布,更能反映产品可靠性的实际情况.     

可实现以期望角度过顶迂回打击的制导律设计

在已有的小型导弹角度约束制导律设计中,对敌方目标打击角度约束范围往往有限.为了扩大角度约束的可行范围,实现对目标的全方位打击,基于双圆弧原理设计了可实现过顶迂回打击的制导律.首先,建立了导弹的末制导段相对运动模型,然后对双圆弧曲线拟合的原理进行了介绍和推导证明,对于两段圆弧的关键参数进行了推导,最后基于该原理设计了一种...     

带任意泛函约束的多项式再生核的计算

讨论多项式再生核的构造与计算,指出了带任意泛函约束的多项式再生核可由带初值约束的再生核取两次投影余项而得到,并建立了具体的计算方法.     

基于多项式设计法的小推力轨迹设计

形状逼近法是小推力轨迹设计中的一种有效方法,然而现有的方法大都假定运动轨迹为某一特定的形状,而且没有考虑推力加速度的约束限制。针对小推力轨道交会问题,提出一种基于多项式的轨迹设计方法。结合极坐标系,建立基于多项式的三自由度轨迹运动模型,将轨迹设计问题转化为求解多项式的系数问题;根据运动模型推导轨迹的动力学特性,建立约束方程,并以消耗燃料最少作为性能指标,采用序列二次规划的方法对多项式的系数进行寻优计算。该方法不仅能求解多个形状设计参数不确定性问题,而且还能满足推力加速度的约束限制。仿真验证了该方法的正确性和可用性,该方法可为任务设计初步阶段的轨迹设计和燃料消耗预估提供一定的技术参考。     

量测坐标系下的纯距离自适应跟踪算法

为避免传统雷达数据处理方法中因坐标变换而导致噪声统计规律变化的问题,基于“当前”统计模型,在量测坐标系下提出一种纯距离自适应跟踪算法。算法基于拟合的思想,利用纯距离信息在量测坐标系下进行滤波计算,避免了由于坐标系的变换而产生的偏差和耦合误差。针对目标发生机动的情况,实时地调整加速度方差,从而达到自适应跟踪目标的效果。仿真结果表明,该算法对目标状态的估计更加精确,对机动目标具有较好的跟踪性能。     

Minimal LST representations of MAP(n)s: Moment fittings and queueing approximations

A Markovian arrival process of order n, MAP(n), is typically described by two n × n transition rate matrices in terms of rate parameters. While it is straightforward and intuitive, the Markovian representation is redundant since the minimal number of parameters is n² for non‐redundant MAP(n). It is well known that the redundancy complicates exact moment fittings. In this article, we present a minimal and unique Laplace‐Stieltjes transform (LST) representations for MAP(n)s. Even though the LST coefficients vector itself is not a minimal representation, we show that the joint LST of stationary intervals can be represented with the minimum number of parameters. We also propose another minimal representation for MAP(3)s based on coefficients of the characteristic polynomial equations of the two transition rate matrices. An exact moment fitting procedure is presented for MAP(3)s based on two proposed minimal representations. We also discuss how MAP(3)/G/1 departure process can be approximated as a MAP(3). A simple tandem queueing network example is presented to show that the MAP(3) performs better than the MAP(2) in queueing approximations especially under moderate traffic intensities. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 549–561, 2016     

Two-agent scheduling with linear resource-dependent processing times

This paper considers a two-agent scheduling problem with linear resource-dependent processing times, in which each agent has a set of jobs that compete with that of the other agent for the use of a common processing machine, and each agent aims to minimize the weighted number of its tardy jobs. To meet the due date requirements of the jobs of the two agents, additional amounts of a common resource, which may be in discrete or continuous quantities, can be allocated to the processing of the jobs to compress their processing durations. The actual processing time of a job is a linear function of the amount of the resource allocated to it. The objective is to determine the optimal job sequence and resource allocation strategy so as to minimize the weighted number of tardy jobs of one agent, while keeping the weighted number of tardy jobs of the other agent, and the total resource consumption cost within their respective predetermined limits. It is shown that the problem is -hard in the ordinary sense, and there does not exist a polynomial-time approximation algorithm with performance ratio unless ; however it admits a relaxed fully polynomial time approximation scheme. A proximal bundle algorithm based on Lagrangian relaxation is also presented to solve the problem approximately. To speed up convergence and produce sharp bounds, enhancement strategies including the design of a Tabu search algorithm and integration of a Lagrangian recovery heuristic into the algorithm are devised. Extensive numerical studies are conducted to assess the effectiveness and efficiency of the proposed algorithms.     

榴弹射表编拟中符合系数和符合对象的综合选取

基于综合符合思想,通过诸参数对于弹道影响敏感特性的分析,及诸符合方案的对比论证,提出了在一个射角下,以零阻力系数C_(xo)和相对静力臂系数h/l作为符合系数,以射程X和偏流Z为符合对象的符合方案;同时,与国外符合方案进行了对比。