双星预警系统弹道参数估计及一些问题分析

主要讨论由2颗地球同步轨道卫星组成的卫星预警系统(简称双星预警系统)中弹道导弹参数的估计问题。阐述了主动段运动的建模问题和弹道数据处理方法,考虑到微分求速的重要性,采用了带光滑约束的样条拟合方法。结合预警系统对弹道导弹预警的具体情况,分别讨论了预警系统下的发射原点估计、射向估计、关机时刻估计、关机点弹道参数估计、落点估计等问题。还讨论了系统中存在的两个问题的分析与解决。模型及分析方法均经过理论和仿真的验证,可应用于双星预警系统下的实际预警的研究。     

A simple fixed-lag algorithm for tracking frequency rate-of-change

A family of simple fixed-lag frequency smoothing algorithms which provide good estimates of both frequency and frequency rate-of-change is reported. The smoothers were developed from a fixed-gain αβ tracker by replacing the recursive derivative estimator with a finite-impulse-response (FIR) differentiator. Simulation results are presented which show that the smoothing algorithms provide frequency estimates with a similar variance to those produced by the αβ filter but with greatly improved frequency-rate estimates. The smoothing algorithms and the αβ filter are also compared on the basis of the bias and delay introduced in the frequency-rate estimates. Although the results presented are for frequency estimation, the smoothing algorithms can be used in any single-input tracking application where some lag in the estimates is allowable     

Detection and Estimation with Fixed Lag for Abruptly Changing Systems

The problem of state estimation and system structure detection for discrete-time stochastic systems with parameters which may switch among a finite set of values is considered. The switchings are modeled by a semi-Markov, or Markov, chain with known transition statistics. A fixed time delay (lag) is allowed in estimation (smoothing) and detection. The optimal solutions require geometrically increasing computations and storage with time. Suboptimal solutions are proposed to alleviate this problem and simulation results are presented to illustrate the effectiveness of the proposed algorithms and the advantages of introducing a delay in processing of the observations.     

An Approach to Fixed-Point Smoothing Problems

This paper examines the possibility of deriving fixed-point smoothing algorithms through exploitation of the known solutions of a higher dimensional filtering problem. It is shown that a simple state augmentation serves to imbed the given n-dimensional smoothing problem into a 2n-dimensional filtering problem. It is further shown that computation of the smoothed estimate and the corresponding error covariance does not require implementation of the 2n-dimensional filtering equations. Some new results involving systems with or without multiple time delays and having colored observation noise have been derived in order to illustrate the versatility of the proposed technique. It is also demonstrated that the present approach leads to an easier derivation of the continuous-time fixed-point smoothing algorithm reported in the literature.     

Bootstrap Algorithms for Parameter and Smoothing State Estimation

Two-stage bootstrap algorithms for simultaneous smoothing state and parameter estimation of linear dynamical system are developed. Cases of both fixed point and fixed lag smoothing have been considered. Simulation results pertaining to a satellite tracking system are presented for illustration.     

Variable structure multiple model fixed-interval smoothing

This paper focuses on fixed-interval smoothing for stochastic hybrid systems. When the truth-mode mismatch is encountered, existing smoothing methods based on fixed structure of model-set have significant performance degradation and are inapplicable. We develop a fixed-interval smoothing method based on forward- and backward-filtering in the Variable Structure Multiple Model (VSMM) framework in this paper. We propose to use the Simplified Equivalent model Interacting Multiple Model (SEIMM) in the forward and the backward filters to handle the difficulty of different mode-sets used in both filters, and design a re-filtering procedure in the model-switching stage to enhance the estimation performance. To improve the computational efficiency, we make the basic model-set adaptive by the Likely-Model Set (LMS) algorithm. It turns out that the smoothing performance is further improved by the LMS due to less competition among models. Simulation results are provided to demonstrate the better performance and the computational efficiency of our proposed smoothing algorithms.     

发动机故障诊断的变记忆约束滤波算法

为提高故障诊断可靠性,给出了3种利用多次测量信息减少测量误差影响的方法,即变记忆约束滤波算法、分段算术平均预平滑算法以及指数顶平滑算法。其中,变记忆约束滤波算法能够有效地避免由于故障方程多重共线性所引起的病态解。证明了多故障诊断问题中滤波算法与分段算术平均算法的等价性,证明了在衰减滤波的条件下（第一变记忆因子小于1）,随测量点数的增加,变记忆滤波算法的第一变记忆因子与指数平滑的平滑系数之和趋近于1。利用计算机仿真方法对于所得结论进行了检验。     

Sensitivity Analysis of Finite-Lag Receivers

This paper presents the sensitivity analysis of a class of receivers called finite-lag receivers, introduced by the authors in [1] through [3]. Since these receivers are based on the use of fixed-lag smoothing techniques, algorithms for the calculation of large-scale and small-scale sensitivities of fixed-lag smoothing are derived using a state augmentation approach. Steady-state analysis of these algorithms shows that an explicit relation can be obtained between sensitivity coefficients of fixed-lag smoothing and filtering. The specific case of sensitivity to variations in the measurement (channel) noise is considered as an example. These results are applied to study the sensitivity performance of the finite-lag receivers for analog communication. It is shown, for example, that finite-lag receivers for AM signals, besides being superior in performance [1]-[3], [11], in terms of output SNR or error variance, are also much less sensitive to the additive noise power level, compared to zero-lag receivers.     

Practice in the application of specialized technologic process patterns of 5-axis machining operation of blade rings of blisks

The purpose of this work is to form transparent parametric patterns for 5-axis machining of blade rings of GTE blisks. The algorithms were developed for geometry correction of control surfaces by the results of measuring the geometry of the airfoil blade processed with the use of smoothing algorithms based on the bicubic spline interpolation.     

On the Sensitivity of a Fixed-Point Smoothing Algorithm

This paper presents a simple approach to the derivation of sensitivity measures of smoothing algorithms. It is proposed that the known sensitivity results of the Kalman filtering algorithm be utilized along with the state augmentation approach for this purpose. The sensitivity measures so obtained are easier to compute than the ones available in the literature. It is then shown that the fixed-point smoothing algorithm, derived recently by Biswas and Mahalanabis [1], [2], is less sensitive to model parameter variations than the algorithm studied by Griffin and Sage [7], [8]. The case of a satellite tracking problem is presented by way of illustrating the results.     

Efficient algorithms for finding the K best paths througha trellis

A set of algorithms is presented for finding the best set of K mutually exclusive paths through a trellis of N nodes, with worst-case computation time bounded by N³log n for a fixed-precision computation. The algorithms are based on a transformation of the K-path trellis problem into an equivalent minimum-cost network flow (MCNF) problem. The approach allows the application of efficient MCNF algorithms, which can obtain optimal solutions orders of magnitude faster than the algorithm proposed by J.K. Wolf et al. (1989). The resulting algorithms extend the practicality of the trellis formulation (in terms of required computations) to multiobject tracking problems with much larger numbers of targets and false alarms. A response by Wolf et al. is included     

Progress in design optimization using evolutionary algorithms for aerodynamic problems

Evolutionary algorithms (EAs) are useful tools in design optimization. Due to their simplicity, ease of use, and suitability for multi-objective design optimization problems, EAs have been applied to design optimization problems from various areas. In this paper we review the recent progress in design optimization using evolutionary algorithms to solve real-world aerodynamic problems. Examples are given in the design of turbo pump, compressor, and micro-air vehicles. The paper covers the following topics that are deemed important to solve a large optimization problem from a practical viewpoint: (1) hybridized approaches to speed up the convergence rate of EAs; (2) the use of surrogate model to reduce the computational cost stemmed from EAs; (3) reliability based design optimization using EAs; and (4) data mining of Pareto-optimal solutions.     

An efficient algorithm of data smoothing in real-time calculations

We propose an algorithm for real-time data smoothing due to considerable reduction and simplification of computations by employing the recursive least mean squares technique. The efficiency of algorithms is shown by an example of determining the flight airspeed and altitude based on the data of pressure sensors.     

Adaptive double chain quantum genetic algorithm for constrained optimization problems

Optimization problems are often highly constrained and evolutionary algorithms(EAs)are effective methods to tackle this kind of problems. To further improve search efficiency and convergence rate of EAs, this paper presents an adaptive double chain quantum genetic algorithm(ADCQGA) for solving constrained optimization problems. ADCQGA makes use of doubleindividuals to represent solutions that are classified as feasible and infeasible solutions. Fitness(or evaluation) functions are defined for both types of solutions. Based on the fitness function, three types of step evolution(SE) are defined and utilized for judging evolutionary individuals. An adaptive rotation is proposed and used to facilitate updating individuals in different solutions.To further improve the search capability and convergence rate, ADCQGA utilizes an adaptive evolution process(AEP), adaptive mutation and replacement techniques. ADCQGA was first tested on a widely used benchmark function to illustrate the relationship between initial parameter values and the convergence rate/search capability. Then the proposed ADCQGA is successfully applied to solve other twelve benchmark functions and five well-known constrained engineering design problems. Multi-aircraft cooperative target allocation problem is a typical constrained optimization problem and requires efficient methods to tackle. Finally, ADCQGA is successfully applied to solving the target allocation problem.     

A novel variable-lag probability hypothesis density smoother for multi-target tracking

It is understood that the forward-backward probability hypothesis density (PHD) smoothing algorithms proposed recently can significantly improve state estimation of targets. However, our analyses in this paper show that they cannot give a good cardinality (i.e., the number of targets) estimate. This is because backward smoothing ignores the effect of temporary track drop- ping caused by forward filtering and/or anomalous smoothing resulted from deaths of targets. To cope with such a problem, a novel PHD smoothing algorithm, called the variable-lag PHD smoother, in which a detection process used to identify whether the filtered cardinality varies within the smooth lag is added before backward smoothing, is developed here. The analytical results show that the proposed smoother can almost eliminate the influences of temporary track dropping and anomalous smoothing, while both the cardinality and the state estimations can significantly be improved. Simulation results on two multi-target tracking scenarios verify the effectiveness of the proposed smoother.     

A New Approach to Estimation of Initial Conditions and Smoothing Problems

A unified approach utilizing the Kalman-Bucy filtering technique istaken to solve the estimation problem of initial conditions and thesmoothing problem in linear dynamic systems. The equivalencebetween the forward integration method and the backward integrationmethod of the smoothing solution is proved. Complete analyticalsolutions of filtering and smoothing problems of rectilinear motion ofa randomly accelerated spacecraft are derived when the vehicle istracked by the ranging system at the ground station.     

小推力深空探测轨道全局优化设计

 针对小推力深空探测四维轨道优化设计,给出了一种组合优化算法,采用该算法基于二体模型进行了深空探测四维轨道全局优化。该组合优化算法由动态规划算法、静态参数优化算法与共轭梯度算法组成。动态规划算法和静态参数优化算法用以选择最优的发射窗口、返回窗口及相应的近似飞行轨道;基于该近似轨道方案,采用共轭梯度算法（解决两点边值问题）求解精确的最优轨道。通过大量的数值仿真计算,得到了航天器的全局最优飞行轨道,及相应的最优发射窗口与返回窗口。数值仿真结果表明,该组合优化算法对深空探测轨道优化具有良好的通用性和工程运用价值。     

一种基于盲同态解卷积的SAR成像自聚焦算法

针对大气扰动及飞行平台不稳引起机载合成孔径雷达(SAR)图像散焦的问题,提出了一种新的自聚焦算法来估算运动误差。该算法是基于运动误差函数及场景散射函数平滑特性的差异来进行估计的,利用复对数变换将图像的幅度与相位信息分离,进而分别对相位及幅度信息进行处理。运动误差通常为慢变函数,而场景的散射信息具有某种随机特性。因此,经过复对数变换后,运动误差及散射信息可以通过滤波器进行分离,将相位中的随机噪声去除,从而保留了慢变的运动误差函数。为了去除噪声信息,需要建立一个平滑滤波器,利用Daubechies小波的尺度函数构造Riesz基向量,从而建立了正交子空间,通过所建立信号子空间及噪声子空间组建平滑滤波器,最终可以获得准确的运动误差。在实验部分,分别利用仿真数据及实测数据对本文方法进行验证,最终结果分析表明该方法具有很高的估计精度及执行效率。     

Fixed-interval retrodiction approach to Bayesian IMM-MHT formaneuvering multiple targets

In a Bayesian framework, we propose a hierarchy of suboptimal retrodiction algorithms that generalize Rauch-Tung-Striebel (RTS) fixed-interval smoothing to multiple hypothesis tracking (MHT) applications employing interacting multiple model (IMM) methods (IMM-MHT). As a limiting case we obtain new simple formulae for suboptimal fixed-interval smoothing applied to Markovian switching systems. Retrodiction techniques provide uniquely interpretable and accurate trajectories from ambiguous MHT output if a certain (small) time delay is tolerated. By a simulated example with two maneuvering targets that operate closely spaced under relatively hard conditions we demonstrate the potential gain by fixed-interval retrodiction and provide a quantitative idea of the achievable track accuracy and mean time delay involved     

未知互耦条件下混合信号波达方向估计

阵列天线互耦对导向矢量的扰动以及信号相干性对数据协方差矩阵造成的秩损,使得基于子空间正交性原理的超分辨波达方向估计(Direction-of-Arrival,DOA)算法性能恶化,甚至失效。针对这一问题,提出一种在相干与非相干信号混合状态下无需阵列互耦补偿的特征矢量平滑DOA估计算法。该算法对部分阵元接收数据的协方差矩阵特征分解,将得到的特征矢量平滑处理后构造等效协方差矩阵,抑制阵列互耦影响的同时完成混合信号DOA估计。在阵列互耦和信号相干性均未知的条件下,正确估计了信号DOA,无需互耦参数估计或补偿。计算机仿真结果验证了算法的有效性。