系统工程与电子技术 ›› 2020, Vol. 42 ›› Issue (3): 686-697.doi: 10.3969/j.issn.1001-506X.2020.03.025

• 制导、导航与控制 • 上一篇    下一篇

核模糊C均值聚类算法优选BDS-3三频组合观测值

田睿1(), 范祥祥1(), 戴影2(), 孙宪兵3(), 董绪荣1()   

  1. 1. 航天工程大学航天信息学院, 北京 101407
    2. 中国人民解放军61618部队, 北京 100088
    3. 沈阳市勘察测绘研究院有限公司, 辽宁 大连 116023
  • 收稿日期:2019-08-29 出版日期:2020-03-01 发布日期:2020-02-28
  • 作者简介:田睿 (1996-),男,硕士研究生,主要研究方向为列控系统上的GNSS应用。E-mail:2803781040@qq.com|范祥祥 (1995-),男,硕士研究生,主要研究方向为周跳探测与修复。E-mail:xiangx_fan@163.com|戴影 (1973-),女,高级工程师,主要研究方向为航天测绘工程。E-mail:1035842617@qq.com|孙宪兵 (1971-),男,工程师,主要研究方向为航天工程测量。E-mail:13387855612@189.cn|董绪荣 (1962-),男,教授,博士,主要研究方向为北斗卫星导航系统。E-mail:rongerdx@163.com
  • 基金资助:
    国家自然科学基金(41574010)

Optimal triple-frequency combination observations for BDS-3 derived from a modified kernel-based fuzzy C-means clustering algorithm

Rui TIAN1(), Xiangxiang FAN1(), Ying DAI2(), Xianbing SUN3(), Xurong DONG1()   

  1. 1. Information Institute, Space Engineering University, Beijing 101407, China
    2. Unit 61618 of the PLA, Beijing 100088, China
    3. Shenyang Geotechnical Investigation & Surveying Research Institute Company Limited, Dalian 116023, China
  • Received:2019-08-29 Online:2020-03-01 Published:2020-02-28
  • Supported by:
    国家自然科学基金(41574010)

摘要:

目前对全球导航卫星系统(global navigation satellite system, GNSS)三频组合观测值优选的研究,主要集中在全球定位系统(global positioning system, GPS)和北斗二号(beidou navigation satellite system, BDS-2)上,对BDS-3的研究相对较少。为克服以往聚类优选算法中存在的仅适用于类球形簇、聚类数目和初始聚类中心的确定主观性强、对离群点敏感、易陷于局部最优等不足,提出一种改进的核模糊C均值聚类算法,引入核函数与抑制离群点的新距离度量,基于多类广义核极化准则优化核参数,用改进爬山法确定聚类数目与初始聚类中心。然后,以模糊C均值聚类算法为对照进行了对比实验,在短、长两种基线下分别解算组合模糊度。通过对优选所得代表性组合的模糊度固定成功率进行对比分析,验证了该算法的可行性与算法改进的有效性。

关键词: 三频组合观测值, 改进的核模糊C均值聚类算法, 矩阵变换法, 模糊度固定

Abstract:

At present, researches on the optimization of global navigation satellite system (GNSS) triple-frequency combination observations mainly focus on global positioning system (GPS) and Beidou navigation satellite system (BDS)-2, while researches on BDS-3 are relatively few. In order to overcome the shortcomings of previous clustering optimization algorithms, which are only applicable to spherical clusters, highly subjective in the determination of clustering number and initial clustering centers, sensitive to outliers, and easily trapped in local optimal, a modified kernel-based fuzzy C-means (KFCM) clustering algorithm is introduced. This algorithm improves the above deficiencies by using the kernel function and a new kind of distance measure which can suppress the effect of outliers, optimize Gaussian kernel parameters based on generalized kernel polarization, initiale the number of clusters and the selection of initial clustering centers based on a new kind of modified mountain method. Then the fuzzy C-means clustering algorithm is used as a comparison experiment. Under short and long baseline conditions, the combination ambiguity is calculated respectively. By comparing and analyzing the ambiguity fixed success rate of the selected representative combinations, the feasibility of the algorithm and the effectiveness of the improved algorithm are proved.

Key words: triple-frequency combination, kernel-based fuzzy C-means clustering algorithm based on parameters optimization, matrix transformation algorithm, ambiguities fixing

中图分类号: