共查询到20条相似文献,搜索用时 375 毫秒
1.
主要研究空间预警系统利用星载红外传感器的视线测量估计弹道导弹自由飞行段弹道的问题。针对目标运动的弱可观测性 ,提出了位置与速度依次滤波的改进Gauss -Newton方法 ,解决了自由段弹道的最大似然估计问题 ,利用MonteCarlo仿真实验验证了估计方法的有效性 ,并对估计误差进行了分析。 相似文献
2.
3.
通过数值仿真定量地比较了三种Chirp信号参数估计算法——解线调法、迭代估计法和局部搜索最大似然法的性能,并定性地比较了算法的运算量。仿真结果表明,在三种算法中,局部搜索最大似然法的估计性能最好,而运算量居中;解线调法运算量最大,但估计性能居中;迭代估计法的估计性能最差,但运算量最小。对于实际系统,应根据不同的估计精度和运算量要求,灵活选择不同的算法。综合考虑估计性能和运算量之间的折衷可以得到结论,在三种算法中局部搜索最大似然法是一种相对较好的选择。 相似文献
4.
5.
建立天基红外低轨星座对自由段目标的观测模型,引入精确的目标运动模型。考虑到算法的数值稳定性,引入平方根UKF算法。理论分析与实验结果表明,平方根UKF算法能够对天基红外低轨星座中自由段目标进行有效跟踪。 相似文献
6.
单波束内目标往往相距较近,采用传统角度分辨技术难以将其分辨,从而给目标跟踪和识别带来较大困难。于是提出基于LM算法的极大似然角度估计方法,实现波束内双目标的分辨。该方法在阵列雷达的基础上建立双目标回波模型,推导极大似然角度估计算法。考虑到求解算法直接影响极大似然角度估计的收敛速度和估计精度,利用LM算法实现了极大似然估计的求解,从而得到目标角度的精确估计。该方法避免了多次脉冲相干积累,具有计算量小的特点。仿真结果验证了方法的有效性。 相似文献
7.
基于双边定时截尾样本,研究广义Pareto分布的形状参数和可靠性指标的估计问题。在进行极大似然估计时,由于似然方程无解析解,故采用EM算法。对形状参数选取,4信息先验,在平方损失下,研究给出广义Pareto分布的形状参数和可靠性指标的Bayes估计。通过Monte-Carlo模拟对形状参数和可靠度函数的极大似然估计、EM估计和Bayes估计的效果进行比较。模拟结果说明,Bayes方法和EM算法适合在小样本场合下对形状参数进行估计,Bayes方法和极大似然估计法适合在大样本场合下对形状参数估计,极大似然估计方法和EM算法适合对可靠度进行估计。 相似文献
8.
针对非线性最小二乘法在国内目标运动分析中应用较少的现状,首先在二维平面内推导出关于纯方位目标运动状态的极大似然估计的计算公式并给出了基于高斯-牛顿迭代算法的计算过程及步骤,随后分析了极大似然估计的性能和迭代算法的收敛性.仿真计算的结果表明:当迭代初值与目标真实状态充分接近时,用所推导出的计算公式能够快速稳定地得到关于目标运动状态的极大似然估计,迭代算法形式简洁,计算量小.该研究成果可应用于舰艇作战系统目标被动跟踪定位软件. 相似文献
9.
介绍了基于客观数据的延迟时间模型参数极大似然估计方法,提出了应用优化理论中的单纯形法求解似然函数的算法,为延迟时间模型的参数估计问题提供了可行的解决方法。通过计算机模拟数据的验证,此方法切实可行,结果可以满足需要。 相似文献
10.
在逐步Ⅰ型混合截尾试验下,研究了Burr部件寿命参数及可靠性指标的极大似然估计和Bayes估计.利用简单迭代方法,给出了寿命参数和可靠性指标的极大似然估计的数值解.然后利用Lindely Bayes近似算法得到了平方损失下寿命参数以及可靠性指标的Bayes估计.最后,运用Monte-Carlo方法对各估计结果作了模拟比较,结果表明Bayes估计较极大似然估计的误差小. 相似文献
11.
针对功率放大器的非线性特性及记忆效应,提出了一种基于记忆有理函数的功放行为模型。在传统记忆多项式模型和无记忆有理函数模型基础上,构建记忆有理函数模型,并利用共轭梯度法辨识模型系数,同时比较不同记忆深度和不同非线性阶数下的归一化均方误差,获取最佳记忆深度和非线性阶数。采用多载波的WCDMA信号和MRF6S21140H功放来验证模型的有效性,并与记忆多项式模型、无记忆有理函数模型进行了比较。结果表明,记忆有理函数模型在减少系数数目的同时具有更好的逼近精度。 相似文献
12.
为了测量高旋弹丸在炮口处的各种信息,基于双高速摄像机交汇的测量方法,提出了一种新的弹丸位姿估计方法.对总攻角函数进行了误差建模与分析,结果表明两台高速摄像机的光轴应相互垂直,且应选择光轴远离攻角平面的高速摄像机所对应的测量函数计算总攻角,此时测量误差最小.以靶场实验的方式对攻角函数的误差分析结论和位姿估计算法进行验证.... 相似文献
13.
In this paper we consider the problem of scheduling a set of jobs on a single machine on which a rate‐modifying activity may be performed. The rate‐modifying activity is an activity that changes the production rate of the machine. So the processing time of a job is a variable, which depends on whether it is scheduled before or after the rate‐modifying activity. We assume that the rate‐modifying activity can take place only at certain predetermined time points, which is a constrained case of a similar problem discussed in the literature. The decisions under consideration are whether and when to schedule the rate‐modifying activity, and how to sequence the jobs in order to minimize some objectives. We study the problems of minimizing makespan and total completion time. We first analyze the computational complexity of both problems for most of the possible versions. The analysis shows that the problems are NP‐hard even for some special cases. Furthermore, for the NP‐hard cases of the makespan problem, we present a pseudo‐polynomial time optimal algorithm and a fully polynomial time approximation scheme. For the total completion time problem, we provide a pseudo‐polynomial time optimal algorithm for the case with agreeable modifying rates. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
14.
15.
16.
A bicriterion approach to common flow allowances due window assignment and scheduling with controllable processing times 下载免费PDF全文
We investigate a single‐machine scheduling problem for which both the job processing times and due windows are decision variables to be determined by the decision maker. The job processing times are controllable as a linear or convex function of the amount of a common continuously divisible resource allocated to the jobs, where the resource allocated to the jobs can be used in discrete or continuous quantities. We use the common flow allowances due window assignment method to assign due windows to the jobs. We consider two performance criteria: (i) the total weighted number of early and tardy jobs plus the weighted due window assignment cost, and (ii) the resource consumption cost. For each resource consumption function, the objective is to minimize the first criterion, while keeping the value of the second criterion no greater than a given limit. We analyze the computational complexity, devise pseudo‐polynomial dynamic programming solution algorithms, and provide fully polynomial‐time approximation schemes and an enhanced volume algorithm to find high‐quality solutions quickly for the considered problems. We conduct extensive numerical studies to assess the performance of the algorithms. The computational results show that the proposed algorithms are very efficient in finding optimal or near‐optimal solutions. © 2017 Wiley Periodicals, Inc. Naval Research Logistics, 64: 41–63, 2017 相似文献
17.
在基于导频的信道估计方法中,伪导频的功率决定了该信道估计方法的性能。为了提高OFDM/OQAM系统的信道估计精度,提高频谱效率,提出一种基于改进导频结构的信道估计方法。在原有导频结构的基础上,对其中功率最高的导频结构进行改进,并给出对应的信道估计方法。由于缺乏足够的接收信号先验知识,无法直接对信道进行估计。为了解决这一问题,提出一种预判决方法对接收信号进行估计,并通过迭代减小预判决引入的误差,提高估计精度。仿真结果表明,本文提出的导频结构具有更高的频谱效率和更好的信道估计性能。 相似文献
18.
19.
研究了具有线性参数的非线性多项式模型的数据阵L-D分解性质,其中D是对角阵,L是带有单位元素的下三角阵.结果表明,通过因子L可以估计出模型的参数,通过因子D可以选择模型中的项;提出了同时进行模型的结构确定和参数估计的递推辨识算法.该算法可用于船舶运动的实时建模.实际应用结果表明,该算法可以有效地辨识多项式等线性参数的非线性模型. 相似文献
20.
《防务技术》2020,16(4):846-855
Aiming at the problem that the traditional Unscented Kalman Filtering (UKF) algorithm can’t solve the problem that the measurement covariance matrix is unknown and the measured value contains outliers, this paper proposes a robust adaptive UKF algorithm based on Support Vector Regression (SVR). The algorithm combines the advantages of support vector regression with small samples, nonlinear learning ability and online estimation capability of adaptive algorithm based on innovation. Firstly, the SVR model is trained by using the innovation in the sliding window, and the new innovation is monitored. If the deviation between the estimated innovation and the measured innovation exceeds a given threshold, then measured innovation will be replaced by the predicted innovation, and then the processed innovation is used to calculate the measurement noise covariance matrix using the adaptive estimation algorithm. Simulation experiments and measured data experiments show that SVRUKF is significantly better than the traditional UKF, robust UKF and adaptive UKF algorithms for the case where the covariance matrix is unknown and the measured values have outliers. 相似文献