北斗／GPS双模定位中快速选星算法研究

采用双系统组合定位模式,导航接收机能在同一时刻接收到超过20颗可见星,大大增加了可见星的数量,能提供十分精准的定位。但可见星数量大幅度增加带来定位精度提升的同时也带来了大量的计算量,加上实际作业中的一些问题,都大大增加了选星时间。本文从GDOP与星座几何布局的关系出发,结合实际应用场景,提出了基于仰角和方位角排序的选星算法。该方法以满足定位要求为前提,根据可见星仰角排序初筛卫星,对不同仰角卫星进行合理的顶星选择,以卫星均匀分布为原则,将在理想情况和实际情况下寻找有效定位平衡点,以规避无效选星并减少计算量,从而大大减少选星时间,有效实现了在北斗和GPS双模定位中的快速选星。      

GPS/GLONASS组合单点定位中选星算法的研究

通过分析影响定位精度的因素,给出了一种基于高度角和GDOP的组合选星算法,研究了其算法在GPS/GLONASS组合单点定位中的应用,在提高定位效率的同时提高了定位精度。结果表明,在动态定位中能快速选出较少的卫星组合用于定位解算,能满足动态用户对实时性的需求。     

一种多系统组合导航快速选星方法

采用多卫星导航系统组合导航,定位精度和系统可靠性会大幅提升,但导航定位运算量也会成倍增长。为解决多系统组合导航定位精度与实时性之间的矛盾,提出一种新的选星方法。新方法不追求最小GDOP值,而是以满足导航定位精度的GDOP值为前提,结合模糊理论中隶属函数的思想,按卫星在星座中均匀分布为原则进行选星。推导伪距测量的误差模型,分析了GDOP与测量误差之间的关系。北斗、GPS和GLONASS三系统组合导航选星实验结果表明,在不超过3次求解GDOP值的情况下,新方法能以不小于98%的概率得到GDOP≤4。     

一种改进的组合导航系统选星算法

针对GPS,GLONASS,BDS组合导航系统定位中卫星的选择作了相关分析。首先用STK软件进行仿真,分析几何精度因子与卫星数的关系,得出组合导航系统最佳选星数;再根据卫星星座的空间几何分布,基于次优选星算法的成本函数模型,结合各导航系统卫星测量精度的差异性以及次优选星算法的峰值、不稳定特点,构建一种以卫星高度角和载噪比确定的加权成本函数模型,提出一种依据加权成本函数选星的分步次优加权选星算法。实验结果表明,该选星算法能近似到达最优选星算法的效果,计算负荷也相对较小,可满足导航定位解算精度和实时性要求。     

基于GDOP贡献值递推的自动天文选星算法

传统天文测量依赖人工选星,自动化程度不高,难以快速选出具有最优几何分布的恒星观测组合,因而存在测量效率低、定位精度易受作业员影响等突出问题.为此,提出一种基于GDOP贡献值递推的自动天文选星算法.首先,构建GDOP贡献值的数学模型,确定递推选星策略,实现自动化选星;其次,利用GDOP值定量评估恒星观测组合的几何分布特性,经可测性分析后编制出具有最优几何分布的观测星表.相比于人工选星,恒星观测组合的GDOP值减小0.025,优化了恒星观测组合的几何分布;每个观测时段测量耗时由29 min减少到12 min,测量效率提高58.6％.所设计的算法性能良好,且可实现自动化,具有较好的应用前景.     

GPS/GALILEO组合系统可见卫星与GDOP的区域和时序分析

卫星星座方案的选择对导航定位精度具有很大影响。本文根据GALILEO系统的设计轨道参数模拟得到的GALILEO系统的卫星位置,分别计算了GPS系统、GALILEO系统和GPS/GALILEO组合系统在不同卫星截止高度角的情况下,全国范围内可见卫星和GDOP值的分布情况,并选择了北京、武汉和乌鲁木齐三个城市,连续观测24小时,分析了各城市的可见卫星和GDOP值随时间的变化规律。     

地基伪卫星区域导航系统快速布设算法

现有的几种地基导航伪卫星布局优化算法时间复杂度过高,无法满足应急场景下的伪卫星导航系统布设需求,为此提出了基于最大凸多面体准则的快速优化算法。该算法利用最大凸多面体准则,对所有可能布设伪卫星的位置进行评估,评估依据为能否对降低多用户几何精度因子加权均值产生较大贡献,评估结果将可布设伪卫星位置分为高贡献度顶星位置、高贡献度底星位置和低贡献度可剔除位置3类。评估后穷举高贡献度的顶星、底星组合,找到最优伪卫星布局。将该算法应用于常见不规则地形的伪卫星布设问题中,仿真结果表明,该算法能够得到全局最优解,且解算耗时较现有算法大幅减少,能够满足应急场景下伪卫星导航系统布设的实际应用需求。     

近圆轨道遥感卫星星下点轨迹的计算

根据遥感卫星轨道的特点,提出了计算近圆轨道卫星星下点轨迹的算法,并对其进行了精度评估.结果表明这种算法是快捷和有效的,能够满足卫星规划阶段对轨道精度的要求.     

近圆轨道遥感卫星星下点轨迹的计算

根据遥感卫星轨道的特点，提出了计算近圆轨道卫星星下点轨迹的算法，并对其进行精度评估。结果表明这种算法是快捷和有效的，能够满足卫星规划阶段对轨道精度的要求。     

基于组合卫星导航系统的编队卫星分析

针对编队飞行中星间相对定位的任务需求,分析了卫星导航系统对编队卫星的动态观测几何问题,引入了相对定位精度衰减因子(RDOP)描述,并讨论了其性质。在对编队中单颗低轨卫星进行导航卫星GDOP分析的基础上,研究了不同编队宽度下编队集合的共视卫星和共视时段,仿真了一定场景下的编队卫星RDOP,并比较了与PDOP的大小关系。接收机的截止高度角对于导航卫星GDOP影响较大;编队宽度会影响到共视卫星的选择;而与采用单个GPS系统相比,采用GPS-Galileo组合卫星导航系统对编队卫星进行相对定位,RDOP数值明显减小,从而有利于高精度的星间位置确定。     

Inter-satellite communication and ranging link assignment for navigation satellite systems

Inter-satellite links improve the performance of global navigation satellite systems (GNSSs) via communication and ranging. When there are limited facilities and links, a key challenge involves assigning links for the downlink of telemetry data in time and effective ranging. We describe this problem and propose a corresponding link scheduling method consisting of three steps. A genetic algorithm was used to identify optimal downlink routes for all non-visible satellites in the first step. The optimization of minimizing timeslot delays usually has multiple optimal routes. The optimal routes were selected to expand to a superframe’s length, which constituted a downlink route scheme for the superframe. The position dilution of precision (PDOP) of ranging links was limited through satellite selection in the second step. Four visible satellites with minimal PDOP were selected and scheduled with idle timeslots. The PDOP decreased with increasing links, and its upper limit was therefore determined by the selected satellites. The final step was to schedule idle timeslots for visible satellites unless the requested link number was met. To test the feasibility of the proposed method, the link assignment was implemented for 10,080 superframes of a typical GNSS constellation. The final link assignment enabled all satellites to transmit telemetry data back to the facility with a delay of no more than 4 timeslots (with one ground facility tracking), and more than 10 links were obtained with PDOPs approaching the minimum. These scheduling results confirm the utility of the method.     

高遮挡环境下卫星数不足四颗的GPS定位研究

讨论了GPS接收机观测卫星数不足4颗条件下的GPS导航定位问题，提出拟合外推接收机钟差，联合大地高，地图匹配的方法，推导了相应的数学模型，并编程实现其算法，对实际车载动态GPS数据进行解算。解算结果表明：利用上述方法可以解决观测卫星数不足4颗条件下的GPS导航定位问题。     

顾及星座稳定性及综合成本的低轨导航星座优化设计方法

利用低轨道地球卫星(LEO)进行导航增强首先需要设计低轨星座,在进行星座构型设计时,星座的稳定性及综合成本是需要考虑的两个重要因素,本文提出了顾及星座稳定性及综合成本进行低轨导航星座优化设计的方法. 首先,利用遗传算法对铱星星座进行了优化,优化后的铱星星座与未优化前星座相比较,全球可见卫星数均值由2.3颗增至2.9颗,可见卫星数标准差由2.3降至0.7,综合成本因子由5.3降至4.5,证明了本方法的有效性. 然后以Walker星座作为基本构型,在保证低轨混合星座稳定性的基础上,顾及导航性能和综合成本,利用遗传算法进行了混合星座的优化. 将优化后的低轨混合星座与北斗星座进行了组合,组合后的星座与北斗星座相比较,全球可见卫星数均值由6.9颗增至9.3颗,可见卫星数标准差由1.1降至0.4.      

GNSS integration with vision-based navigation for low GNSS visibility conditions

In urban canyons, buildings and other structures often block the line of sight of visible Global Navigation Satellite System (GNSS) satellites, which makes it difficult to obtain four or more satellites to provide a three-dimensional navigation solution. Previous studies on this operational environment have been conducted based on the assumption that GNSS is not available. However, a limited number of satellites can be used with other sensor measurements, although the number is insufficient to derive a navigation solution. The limited number of GNSS measurements can be integrated with vision-based navigation to correct navigation errors. We propose an integrated navigation system that improves the performance of vision-based navigation by integrating the limited GNSS measurements. An integrated model was designed to apply the GNSS range and range rate to vision-based navigation. The possibility of improved navigation performance was evaluated during an observability analysis based on available satellites. According to the observability analysis, each additional satellite decreased the number of unobservable states by one, while vision-based navigation always has three unobservable states. A computer simulation was conducted to verify the improvement in the navigation performance by analyzing the estimated position, which depended on the number of available satellites; additionally, an experimental test was conducted. The results showed that limited GNSS measurements can improve the positioning performance. Thus, our proposed method is expected to improve the positioning performance in urban canyons.     

An efficient solution of real-time data processing for multi-GNSS network

Global navigation satellite systems (GNSS) are acting as an indispensable tool for geodetic research and global monitoring of the Earth, and they have been rapidly developed over the past few years with abundant GNSS networks, modern constellations, and significant improvement in mathematic models of data processing. However, due to the increasing number of satellites and stations, the computational efficiency becomes a key issue and it could hamper the further development of GNSS applications. In this contribution, this problem is overcome from the aspects of both dense linear algebra algorithms and GNSS processing strategy. First, in order to fully explore the power of modern microprocessors, the square root information filter solution based on the blocked QR factorization employing as many matrix–matrix operations as possible is introduced. In addition, the algorithm complexity of GNSS data processing is further decreased by centralizing the carrier-phase observations and ambiguity parameters, as well as performing the real-time ambiguity resolution and elimination. Based on the QR factorization of the simulated matrix, we can conclude that compared to unblocked QR factorization, the blocked QR factorization can greatly improve processing efficiency with a magnitude of nearly two orders on a personal computer with four 3.30 GHz cores. Then, with 82 globally distributed stations, the processing efficiency is further validated in multi-GNSS (GPS/BDS/Galileo) satellite clock estimation. The results suggest that it will take about 31.38 s per epoch for the unblocked method. While, without any loss of accuracy, it only takes 0.50 and 0.31 s for our new algorithm per epoch for float and fixed clock solutions, respectively.     

一种基于多频模糊度快速解算方法的BDS/GPS中长基线RTK定位模型

随着全球卫星导航系统（global navigation satellite system,GNSS）进入多系统时代,空中导航卫星的可见卫星数不断增加,中国北斗卫星导航系统（BeiDou navigation satellite system,BDS）已开始面向用户提供三频导航信号,这都有利于改善单历元实时动态定位（real-time kinematic,RTK）的精度和可靠性。中长基线单历元RTK通常采用电离层无关组合算法,但是该方法将观测噪声进行了放大,模糊度固定成功率随着基线长度的增加而明显降低。提出一种BDS/GPS（global positioning system）中长基线单历元多频RTK定位算法,先以较高成功率快速固定BDS的两个超宽巷模糊度,继而通过简单变换得到BDS宽巷模糊度,然后将其辅助提高GPS宽巷模糊度固定成功率,最后采用将电离层延迟误差参数化的策略以提高BDS/GPS窄巷模糊度固定成功率。结合实测数据进行验证分析,结果表明本文算法是可行的。     

扩展卡尔曼滤波的虚拟格网伪距差分算法研究

针对传统伪距差分服务端压力大,以及在复杂环境下进行导航定位,某些历元卫星信号弱、卫星数不足、无法连续定位的问题,该文提出了基于扩展卡尔曼滤波算法的虚拟格网伪距差分方法。该方法充分利用先验信息和动力学模型,解决了复杂环境中动态定位结果不连续、定位精度低等问题。为验证算法的有效性,该文分别进行了动态、静态实验,并与最小二乘结果进行对比,实验结果表明:静态模式下,卡尔曼滤波算法比最小二乘算法的定位精度,在N、E、U方向分别提高48.3%、47.1%、52.5%;动态模式下,卡尔曼滤波算法比最小二乘算法更加稳定,更适合复杂环境定位。