应用抗差无迹卡尔曼滤波的再入弹道处理技术

针对现有无迹卡尔曼滤波在再入弹道处理中可能出现的异常观测、观测随机误差模型不准确以及动力学模型不合理等问题,在无迹卡尔曼滤波中引入自适应与抗差估计理论,研究适用于再入弹道处理的自适应抗差滤波方法。该方法可以自适应地估计测量噪声等价协方差阵和状态噪声等价协方差阵,并可实现异常值的分离和维纳模型方差的自适应调整。数值仿真结果表明:该方法计算简单,并能有效减弱测量误差和动力学模型误差对弹道处理精度的影响。     

Nonexistence of the maximum likelihood estimates in the weibull process

With incomplete data the maximum likelihood estimates of the parameters of the Weibull process can only be obtained by solving the likelihood equations iteratively. In this article we show that the solution of the likelihood equations may lie outside of the parameter space if none of the processes can be observed from time zero.     

Minimax trees,paths, and cut sets

The notions of minimax paths, trees, and cut sets are defined for undirected graphs; and relationships between these entities are established. Simple solution procedures based on these relationships are presented.     

The discrete evasion game with three-move lag

The discrete evasion game with three-move lag, formulated over 30 years ago, was one of the earliest games with time-lag complications. This game remains unsolved even though it is well known that the game has a value. In this article we obtain an upper bound for the value by constructing a strategy which consists of 400 conditional probabilities for the minimizing player. This is believed to be the best upper bound known.     

Tabular aids for fitting weibull moment estimates

Moment estimators for the parameters of the Weibull distribution are considered in the context of analysis of field data. The data available are aggregated, with individual failure times not recorded. In this case, the complexity of the likelihood function argues against the use of maximum-likelihood estimation, particularly for relatively large sets of data, and moment estimators are a reasonable alternative. In this article, we derive the asymptotic covariance matrix of the moment estimators, and provide listings for BASIC computer programs which generate tables useful for calculation of the estimates as well as for estimating the asymptotic covariance matrix using aggregated data.     

Rectilinear m-Center problem

In this article we consider the unweighted m-center problem with rectilinear distance. We preent an O(n^m–2 log n) algorithm for the m-center problem where m ≥ 4.