共查询到18条相似文献，搜索用时 125 毫秒
1.
《测绘文摘》2006,(4)
CH20062146用LAMBDA改进算法固定GPS整周模糊度=Restricting GPS Integer Ambigulity by ImprovedLAMBDA Algorithm/高成发,赵毅,万德钧(东南大学交通学院)∥武汉大学学报(信息科学版).-2006,31(8).-744~747介绍了LAMBDA算法原理,结合国土资源调查的工程实践,对常规的LAMBDA方法作了两点改进,即扩大超椭球的体积和以点位的先验信息检验坐标解算结果。实测数据分析表明,两点改进均能有效提高基线解算的可靠性,具有一定的理论价值。表1参13CH20062147多种有色噪声自适应滤波算法的比较=Comparison of Adaptive Filter Arith… 相似文献
2.
高精度GNSS定位需要解算双差模糊度值,经典最小二乘求解的模糊度一般为浮点解,浮点解丢失了模糊度的整数性,不利于提高未知参数的精度。本文讨论了LAMBDA方法的原理及其算法,对模糊度整数变换前后LAMBDA方法的执行结果进行了比较,讨论了联合去相关法和迭代法两种整数Z变换算法的基本原理,对LAMBDA整周模糊度解算方法中的两种整数Z变换算法进行了比较。结果表明LAMBDA方法模糊度效率较高,联合去相关法的处理成功率高于迭代法。 相似文献
3.
在单历元阻尼LAMBDA算法的基础上 ,采用两种处理方案 ,分析了一些简单的坐标函数约束对解算模糊度的作用 ,并用两个实际算例验证了坐标约束在单历元定位中的应用效果 相似文献
4.
《测绘科学》2020,(2)
针对整数最小二乘模糊度降相关平差(LAMBDA)算法解算高维整周模糊度效率比较低的问题,该文从模糊度解算一般规则是一个非线性整数规划问题的角度出发,提出了一种改进模拟植物生长算法。该算法是一种智能优化算法。通过多组高维模拟数据和实测数据,将该文算法与LAMBDA算法及MLAMBDA算法进行了对比分析。结果显示,当模糊度维数等于45维和50维时,该文算法在运算效率上略优于LAMBDA算法。当维数达到55维及以上时,相比于LAMBDA和MLAMBDA算法运算速度分别提高了至少52.8%和19.2%。因此改进模拟植物生长算法对于快速固定高维整周模糊度具有一定的应用参考价值。 相似文献
5.
6.
针对BDS三频精密定位问题,该文将LAMBDA算法应用于BDS三频数据模糊度解算中,基于LAMBDA算法对BDS实测超短基线数据进行处理,分别从BDS 3个频点单历元模糊度固定成功率和基线E、N、U方向增量结果分析了LAMBDA算法的有效性。结果表明,LAMBDA算法能实现BDS各频点单历元模糊度固定及基线解算,其中,B1频点单历元模糊度固定成功率相对于B2、B3频点略差,但仍有超过93.7%的历元其单历元模糊度固定成功率高于95%,且整个时段单历元模糊度固定成功率均值优于98.7%;B2、B3频点基线E、N、U方向增量结果基本一致,但与B1频点结果有一定的差异,可能是由于B1频点的频率和波长与B2、B3差异较大引起的。 相似文献
7.
针对CORS系统建设成本高和选址困难的问题,该文提出GPS长距离网络RTK定位算法。该算法首先利用MW组合观测方程解算基准站双差宽巷整周模糊度,采用Saastamoinen模型和GMF映射函数模型相结合解算双差对流层干分量延迟残差,并将双差对流层湿分量延迟残差作为未知参数进行估计,同时结合无电离层组合观测值解算基准站双差载波整周模糊度;然后,采用综合误差内插法解算基准站和流动站的误差改正数;最后,采用最小二乘法逐历元进行法方程叠加解算流动站双差模糊度浮点解,并利用LAMBDA算法和通过TIKHONOV正则化改进的LAMBDA算法搜索固定流动站双差宽巷整周模糊度和双差载波整周模糊度。实验表明,该算法能够将基准站间距离提高到100~150km,使流动站用户可以获得厘米级定位结果。 相似文献
8.
9.
本文提出了一种改进LAMBDA方法:在确定Z变换后的模糊度时,改变以往对所有历元的模糊度全部进行搜索的做法,而是通过设置合理的条件,将搜索与直接归整有效地结合起来,从而减少了模糊度的解算时间,提高了解的效率。文章最后利用实测GPS数据验证了改进效果。 相似文献
10.
11.
12.
The least-squares ambiguity Decorrelation (LAMBDA) method has been widely used in GNSS for fixing integer ambiguities. It
can also solve any integer least squares (ILS) problem arising from other applications. For real time applications with high
dimensions, the computational speed is crucial. A modified LAMBDA (MLAMBDA) method is presented. Several strategies are proposed
to reduce the computational complexity of the LAMBDA method. Numerical simulations show that MLAMBDA is (much) faster than
LAMBDA. The relations between the LAMBDA method and some relevant methods in the information theory literature are pointed
out when we introduce its main procedures. 相似文献
13.
On lattice reduction algorithms for solving weighted integer least squares problems: comparative study 总被引：2，自引：1，他引：1
Decorrelation or reduction theory deals with identifying appropriate lattice bases that aid in accelerating integer search to find the optimal integer solution of the weighted integer least squares problem. Orthogonality defect has been widely used to measure the degree of orthogonality of the reduced lattice bases for many years. This contribution presents an upper bound for the number of integer candidates in the integer search process. This upper bound is shown to be a product of three factors: (1) the orthogonality defect, (2) the absolute value of the determinant of the inverse of the generator matrix of the lattice, and (3) the radius of the search space raised to the power of the dimension of the integer ambiguity vector. Four well-known decorrelation algorithms, namely LLL, LAMBDA, MLAMBDA, and Seysen, are compared. Many simulated data with varying condition numbers and dimensions as well as real GPS data show that the Seysen reduction algorithm reduces the condition number much better than the other algorithms. Also, the number of integer candidates, before and after the reduction process, is counted for all algorithms. Comparing the number of integer candidates, condition numbers, and orthogonality defect reveals that reducing the condition number and the orthogonality defect may not necessarily result in decreasing the number of integer candidates in the search process. Therefore, contrary to the common belief, reducing the orthogonality defect and condition number do not always result in faster integer least squares estimation. The results indicate that LAMBDA and MLAMBDA perform much better in reducing the number of integer candidates than the other two algorithms, despite having a larger orthogonality defect and condition number in some cases. Therefore, these two algorithms can speed up the integer least squares estimation problem in general and the integer ambiguity resolution problem in particular. 相似文献
14.
GPS快速定位方程的病态性对整周模糊度及基线解的影响 总被引：2，自引：0，他引：2
GPS快速定位的数据处理一般是基于整数最小二乘理论,参数估计通过浮点解、整周模糊度的搜索、固定解三个步骤实现。当观测时间较短时,观测量间具有较强的相关性,用LS估计未知数的法方程严重病态,导致模糊度及基线浮点解与其正确值差距较大。本文通过实例研究了不同观测时间的GPS快速定位方程的病态性程度及其对模糊度和基线解的影响,计算结果表明当观测时间少于2分钟时,采用LS结合LAMBDA法难以求出可靠的固定解。 相似文献
15.
单频GPS快速定位方程是严重病态的,应用最小二乘原理得到的模糊度浮点解大大偏离其准确值,应用LAMBDA方法难以正确地固定模糊度。本文将GPS载波相位双差观测量在不同的小波空间和尺度空间进行分解和重构,去除高频测量噪声,可减小测量噪声对GPS快速定位中病态方程解的影响,提高模糊度浮点解的精度,缩小模糊度搜索空间。实验表明,对于GPS短基线,仅利用1min左右的单频载波观测数据,经过基于haar、db4、coif4和sym4小波的5尺度小波变换后,可获得较准确的模糊度浮点解,应用LAMBDA法可正确地固定模糊度,达到厘米级定位精度。 相似文献
16.
Partial integer decorrelation: optimum trade-off between variance reduction and bias amplification 总被引：2，自引：2，他引：0
Different techniques have been developed for determining carrier phase ambiguities, ranging from float approximations to the
efficient solution of the integer least square problem by the LAMBDA method. The focus so far was on double-differenced measurements.
Practical implementations of the LAMBDA method lead to a residual probability of wrong fixing of the order one percent. For
safety critical applications, this probability had to be reduced by eight orders of magnitude, which could be achieved by
linear multi-frequency code–carrier combinations. Scenarios with single or no differences include biases due to orbit errors,
satellite clock offsets, as well as residual code and phase biases. For this case, a linear combination of Galileo E1 and
E5 code and carrier phase measurements with a wavelength of 3.285 m and a noise level of a few centimeters is derived. This
ionosphere-free combination preserves the orbit and clock errors, and suppresses the E1 code multipath by 12.6 dB. Since integer
decorrelation transformations, as used in the LAMBDA method, inflate biases, the number of such transformations must be limited,
and applied in a judicious order. With a Galileo type constellation, this leads to a vertical standard deviation of ca. 20 cm,
while keeping the probability of wrong fixing extremely low for code biases of 10 cm, and phase biases of 0.1 cycle, combined
in a worst case. 相似文献
17.
用遗传算法搜索GPS单频单历元整周模糊度 总被引：10，自引：2，他引：10
介绍了短基线利用单频单历元双差载波相位定位时模糊度固定的基本理论，探讨了利用遗传算法快速搜索GPS单频单历元整周模糊度的一些理论和实现的方法．提出了用改进的正则化方法改善浮动解来提高搜索成功率的新思路。算例分析表明，在一定的条件下．应用遗传算法搜索整周模糊度成功率高、稳键性较好。 相似文献
18.
Since its introduction in 1993, the LAMBDA method has found widespread use across the world. The method has been employed
in many geodetic and navigation applications, with lots of satisfied users. Independent tests show that it is considered the
best method for integer carrier phase ambiguity resolution available. But every now and then we still notice some misunderstandings
concerning the principles and potential of the method. In this contribution we will briefly summarize the principles underlying
the LAMBDA method, go into some of the frequently asked questions on the LAMBDA method and try to clarify some of the existing
misunderstandings.
Electronic Publication 相似文献