共查询到19条相似文献，搜索用时 171 毫秒
1.
2.
长距离网络RTK是实现GPS/BDS高精度实时定位的主要手段之一,其核心是长距离参考站网GPS/BDS整周模糊度的快速准确确定。本文提出了一种长距离GPS/BDS参考站网载波相位整周模糊度解算方法,首先利用GPS双频观测数据计算和确定宽巷整周模糊度,同时利用BDS的B2、B3频率观测值确定超宽巷整周模糊度。然后建立GPS载波相位整周模糊度和大气延迟误差的参数估计模型,附加双差宽巷整周模糊度的约束,解算双差载波相位整周模糊度,并建立参考站网大气延迟误差的空间相关模型。根据B2、B3频率的超宽巷整周模糊度建立包含大气误差参数的载波相位整周模糊度解算模型,利用大气延迟误差空间相关模型约束BDS双差载波相位整周模糊度的解算。克服了传统的使用无电离层组合值解算整周模糊度的不利影响。采用实测长距离CORS网GPS、BDS多频观测数据进行算法验证,试验结果证明该方法可实现长距离参考站网GPS/BDS载波相位整周模糊度的准确固定。 相似文献
3.
BDS网络RTK参考站三频整周模糊度解算方法 总被引：1，自引：1，他引：0
北斗卫星导航系统是目前唯一一个全星座提供三频观测数据的卫星导航定位系统,三频观测值有助于载波相位整周模糊度的快速、准确固定。本文提出了一种BDS网络RTK参考站三频整周模糊度解算方法。首先利用B2、B3频率的观测值及严格的模糊度固定标准确定超宽巷整周模糊度,将固定的超宽巷整周模糊度与其他宽巷整周模糊度的线性关系作为约束条件,然后估计宽巷整周模糊度、相对天顶对流层延迟误差和电离层延迟误差,并搜索确定宽巷整周模糊度。利用固定的宽巷整周模糊度与三频载波相位整周模糊度的整数线性关系,将线性关系加入载波相位整周模糊度参数估计观测模型中,然后确定载波相位整周模糊度。使用实测的CORS网BDS三频观测数据进行算法验证,结果表明,该方法可正确有效地实现参考站间三频载波相位整周模糊度的快速解算。 相似文献
4.
北斗卫星提供3种频率载波信号,极大地推动了利用载波对用户位置和速度信息进行高精度计算方法研究。本文重点研究基于北斗卫星三频信号的载波相位模糊度解算CIR方法,通过使用函数极限的原理推导载波组合,为算法提供了理论基础;分析每一步的误差传递,选取优秀的伪距组合、相位组合,并处理数据验证算法的可行性。在短基线向量前提下,双差中忽略大气延迟的影响,验证了本文提出的几种载波组合的计算模糊度的可行性。 相似文献
5.
基于区域参考站网的网络实时动态定位(real-time kinematic,RTK)方法是实现全球定位系统(global positioning system,GPS)、北斗卫星导航系统(BeiDou satellite navigation system,BDS)高精度定位的主要手段。研究了一种长距离GPS/BDS双系统网络RTK方法,首先采用长距离参考站网GPS/BDS多频观测数据确定宽巷整周模糊度,利用引入大气误差参数的参数估计模型解算GPS/BDS双差载波相位整周模糊度;然后按照长距离参考站网观测误差特性的不同,分类处理参考站观测误差,利用误差内插法计算流动站观测误差,以改正流动站GPS/BDS双系统载波相位观测值的观测误差;最后使用流动站多频载波相位整周模糊度解算方法确定GPS/BDS载波相位整周模糊度并解算位置参数。使用长距离连续运行参考站(continuously operating reference stations,CORS)网的实测数据进行实验,结果表明,该方法能够利用长距离GPS/BDS参考站网实现流动站的厘米级定位。 相似文献
6.
北斗系统短基线解算数据处理方法 总被引：5，自引：1，他引：4
北斗卫星导航系统基线解算和高精度定位中的关键问题是整周模糊度解算。针对北斗系统的相对定位问题,该文利用B1、B2载波相位观测值组成宽巷双差观测值,利用搜索算法固定宽巷双差整周模糊度,建立宽巷及B1、B2的双差观测方程,并利用搜索算法固定B1的整周模糊度,进而固定B2的整周模糊度。以武汉大学PANDA软件处理结果作为参考值处理16km以下的四段基线进行算法的试验检验,结果表明,四段基线在E方向、N方向、U方向的精度分别为1.5cm、2.0cm、5.0cm,验证了利用宽巷组合观测值进行北斗系统基线解算是可行的,其精度和GPS系统相当。 相似文献
7.
整周模糊度搜索方法的效率比较和分析 总被引：4，自引：0，他引：4
GPS整周模糊度的快速、正确求解是利用GPS载波相位进行高精度定位中最为关键的问题，目前应用最广泛的模糊度解算方法是搜索法。本文比较了不同搜索法的搜索效率，并对搜索的算法和过程进行内在原因的分析。 相似文献
8.
9.
高精度的单历元GPS动态定位由于观测值数目较少而很难确定整周模糊度.为了解算整周模糊度,需要利用已有的坐标、速度等信息.在分析常规GPS参数解算模型的基础上,推导利用虚拟观测值的GPS虚拟观测模型并分析取其相应权的方法,结合已有信息和伪距、相位观测值联合解算来进行单历元坐标分量改正数求解.并通过一个实际算例验证方法有效且可靠地提高整周模糊度解算的成功率. 相似文献
10.
通过分析北斗系统的星座特点及GEO卫星特征,提出了一种针对北斗系统的快速高精度定向方法。该方法利用北斗GEO卫星东西向几何构型好的优势,首先由GEO卫星的观测值结合降维解算理论解算基线向量候选值;然后通过模糊度函数法对候选值进行判决,得到最优基线向量,解出宽巷模糊度;最后在此基础上解算B1模糊度,进行高精度定向。该方法不但可以改善利用北斗定向解算所产生的病态性,而且可以减小模糊度搜索范围,实现单历元整周模糊度快速解算。利用实测北斗星历对算法进行了仿真验证,结果表明在实时动态条件下,该方法解算B1的整周模糊度成功率为99.31%,确定的俯仰角标准差为0.07°,航向角标准差为0.13°,是一种高效快速的定向算法。 相似文献
11.
Testing of a new single-frequency GNSS carrier phase attitude determination method: land,ship and aircraft experiments 总被引：4，自引：1，他引：3
Global navigation satellite system (GNSS) ambiguity resolution is the process of resolving the unknown cycle ambiguities of
the carrier phase data as integers. The sole purpose of ambiguity resolution is to use the integer ambiguity constraints as
a means of improving significantly on the precision of the remaining GNSS model parameters. In this contribution, we consider
the problem of ambiguity resolution for GNSS attitude determination. We analyse the performance of a new ambiguity resolution
method for GNSS attitude determination. As it will be shown, this method provides a numerically efficient, highly reliable
and robust solution of the nonlinearly constrained integer least-squares GNSS compass estimators. The analyses have been done
by means of a unique set of extensive experimental tests, using simulated as well as actual GNSS data and using receivers
of different manufacturers and type as well as different platforms. The executed field tests cover two static land experiments,
one in the Netherlands and one in Australia, and two dynamic experiments, a low-dynamics vessel experiment and high-dynamics
aircraft experiment. In our analyses, we focus on stand-alone, unaided, single-frequency, single-epoch attitude determination,
as this is the most challenging case of GNSS compass processing. 相似文献
12.
崔鑫 《测绘与空间地理信息》2020,(4):158-162
北斗卫星导航系统能全星座播发3个频率的观测值,有利于载波相位模糊度的解算。本文以传统的CIR方法为基础,分析了其在短基线和长基线计算时的优点和限制。针对于电离层延迟的影响,经典的CIR难以实现长基线模糊度固定的问题,本文提出了一种附有约束条件的适用于长基线的改进CIR算法,利用北斗三频数据对算法性能进行了验证。实验表明:提出的新算法能够提高长基线宽巷模糊度的固定成功率,并且能够很大程度上缩小窄巷模糊度的搜索空间,使其估值的波动能够在4周以内。 相似文献
13.
Integer GNSS ambiguity resolution involves estimation and validation of the unknown integer carrier phase ambiguities. A problem
then is that the classical theory of linear estimation does not apply to the integer GPS model, and hence rigorous validation
is not possible when use is made of the classical results. As with the classical theory, a first step for being able to validate
the integer GPS model is to make use of the residuals and their probabilistic properties. The residuals quantify the inconsistency
between data and model, while their probabilistic properties can be used to measure the significance of the inconsistency.
Existing validation methods are often based on incorrect assumptions with respect to the probabilistic properties of the parameters
involved. In this contribution we will present and evaluate the joint probability density function (PDF) of the multivariate
integer GPS carrier phase ambiguity residuals. The residuals and their properties depend on the integer estimation principle
used. Since it is known that the integer least-squares estimator is the optimal choice from the class of admissible integer
estimators, we will only focus on the PDF of the ambiguity residuals for this estimator. Unfortunately the PDF cannot be evaluated
exactly. It will therefore be shown how to obtain a good approximation. The evaluation will be completed by some examples. 相似文献
14.
根据GNSS双频载波相位观测值间的特定关系,提出了一种基于双频整周关系约束的模糊度解算方法(FirCAR)。该方法在局部整数范围内可将载波相位的等效波长增长,以利于整周模糊度的快速解算。不同长度的基线数据实验证明了该算法的正确性和有效性,并分析了卫星截止高度角对解算结果的影响。 相似文献
15.
网络RTK参考站间模糊度动态解算的卡尔曼滤波算法研究 总被引：10，自引：1，他引：9
提出一种适用于参考站网络的站间模糊度解算方法,该方法使用CA码与相位的电离层无关组合解算宽巷模糊度,利用多路径效应的周期性削弱CA码多路径效应。在宽巷模糊度得到固定后,利用卡尔曼滤波对L1模糊度进行估计,并使用模糊度失相关搜索算法,动态地确定模糊度。这种方法已经应用在自主开发的网络RTK软件上,并以四川GPS综合服务网络SIGN(Sichuan Integrated GPS Network)作为试验网络,进行了试验和分析。 相似文献
16.
Penalized GNSS Ambiguity Resolution 总被引：1，自引：1，他引：1
P. J. G. Teunissen 《Journal of Geodesy》2004,78(4-5):235-244
Global Navigation Satellite System (GNSS) carrier phase ambiguity resolution is the process of resolving the carrier phase ambiguities as integers. It is the key to fast and high precision GNSS positioning and it applies to a great variety of GNSS models which are currently in use in navigation, surveying, geodesy and geophysics. A new principle of carrier phase ambiguity resolution is introduced. The idea is to give the user the possibility to assign penalties to the possible outcomes of the ambiguity resolution process: a high penalty for an incorrect integer outcome, a low penalty for a correct integer outcome and a medium penalty for the real valued float solution. As a result of the penalty assignment, each ambiguity resolution process has its own overall penalty. Using this penalty as the objective function which needs to be minimized, it is shown which ambiguity mapping has the smallest possible penalty. The theory presented is formulated using the class of integer aperture estimators as a framework. This class of estimators was introduced elsewhere as a larger class than the class of integer estimators. Integer aperture estimators, being of a hybrid nature, can have integer outcomes as well as non-integer outcomes. The minimal penalty ambiguity estimator is an example of an integer aperture estimator. The computational steps involved for determining the outcome of the minimal penalty estimator are given. The additional complexity in comparison with current practice is minor, since the optimal integer estimator still plays a major role in the solution of the minimal penalty ambiguity estimator. 相似文献
17.
The least-squares ambiguity decorrelation adjustment: a method for fast GPS integer ambiguity estimation 总被引：71，自引：26，他引：71
P. J. G. Teunissen 《Journal of Geodesy》1995,70(1-2):65-82
The GPS double difference carrier phase measurements are ambiguous by an unknown integer number of cycles. High precision relative GPS positioning based on short observational timespan data, is possible, when reliable estimates of the integer double difference ambiguities can be determined in an efficient manner. In this contribution a new method is introduced that enables very fast integer least-squares estimation of the ambiguities. The method makes use of an ambiguity transformation that allows one to reformulate the original ambiguity estimation problem as a new problem that is much easier to solve. The transformation aims at decorrelating the least-squares ambiguities and is based on an integer approximation of the conditional least-squares transformation. This least-squares ambiguity decorrelation approach, flattens the typical discontinuity in the GPS-spectrum of ambiguity conditional variances and returns new ambiguities that show a dramatic improvement in correlation and precision. As a result, the search for the transformed integer least-squares ambiguities can be performed in a highly efficient manner. 相似文献
18.
Fast integer least-squares estimation for GNSS high-dimensional ambiguity resolution using lattice theory 总被引：4，自引：0，他引：4
GNSS ambiguity resolution is the key issue in the high-precision relative geodetic positioning and navigation applications.
It is a problem of integer programming plus integer quality evaluation. Different integer search estimation methods have been
proposed for the integer solution of ambiguity resolution. Slow rate of convergence is the main obstacle to the existing methods
where tens of ambiguities are involved. Herein, integer search estimation for the GNSS ambiguity resolution based on the lattice
theory is proposed. It is mathematically shown that the closest lattice point problem is the same as the integer least-squares
(ILS) estimation problem and that the lattice reduction speeds up searching process. We have implemented three integer search
strategies: Agrell, Eriksson, Vardy, Zeger (AEVZ), modification of Schnorr–Euchner enumeration (M-SE) and modification of
Viterbo-Boutros enumeration (M-VB). The methods have been numerically implemented in several simulated examples under different
scenarios and over 100 independent runs. The decorrelation process (or unimodular transformations) has been first used to
transform the original ILS problem to a new one in all simulations. We have then applied different search algorithms to the
transformed ILS problem. The numerical simulations have shown that AEVZ, M-SE, and M-VB are about 320, 120 and 50 times faster
than LAMBDA, respectively, for a search space of dimension 40. This number could change to about 350, 160 and 60 for dimension
45. The AEVZ is shown to be faster than MLAMBDA by a factor of 5. Similar conclusions could be made using the application
of the proposed algorithms to the real GPS data. 相似文献