刘智敏, 刘经南, 姜卫平, 李陶. 遗传算法解算GPS短基线整周模糊度的编码方法研究[J]. 武汉大学学报 ( 信息科学版), 2006, 31(7): 607-609.
引用本文: 刘智敏, 刘经南, 姜卫平, 李陶. 遗传算法解算GPS短基线整周模糊度的编码方法研究[J]. 武汉大学学报 ( 信息科学版), 2006, 31(7): 607-609.
LIU Zhimin, LIU Jingnan, JIANG Weiping, LI Tao. Ambiguity Resolution of GPS Short-Baseline Using Genetic Algorithm[J]. Geomatics and Information Science of Wuhan University, 2006, 31(7): 607-609.
Citation: LIU Zhimin, LIU Jingnan, JIANG Weiping, LI Tao. Ambiguity Resolution of GPS Short-Baseline Using Genetic Algorithm[J]. Geomatics and Information Science of Wuhan University, 2006, 31(7): 607-609.

遗传算法解算GPS短基线整周模糊度的编码方法研究

Ambiguity Resolution of GPS Short-Baseline Using Genetic Algorithm

  • 摘要: 将遗传算法(GA)应用于GPS短基线模糊度解算过程,实现了二进制编码和实数编码方法,并对这两种编码方法在实际计算过程中的实现效率和复杂度进行了分析比较。针对双差模糊度的整数特性,笔者在实数编码内取整后再生成个体进行算子操作。试验结果表明,经过修改的实数编码遗传算法可以取得比二进制编码更高的可靠性和成功率,是更适于双差模糊度搜索采用的编码方法。

     

    Abstract: The efficiencies are analyzed and compared to GPS data process using GA with two coding methods.GA with binary coding is prone to carry out GA operators,but its length is longer,EMS memory is larger and stability is weaker than ones of real coding.To integer nature of double-differenced ambiguity,real code were modified to round in coding then made up of individual.The results of the practical data processing show that GA with the modified real coding can be higher in reliability and get success rate on GPS ambiguity resolution than one with binary coding.

     

/

返回文章
返回