The Application of Modified ACS in DGPS Integer Ambiguity Resolution
In this paper, a modified ACS (Ant Colony System) is applied for the integer ambiguity-searching problem (IASP). Given the baseline, a modified ACS is proposed to search optimal solution in integer ambiguity space, which is deduced by solving the on-the-fly resolution of the double-differential GPS (Global Positioning System) integer ambiguity based on null-space restriction, and eliminating the correlation of the float solutions successively. Elitist choice of the initial ants, local updating and global updating are used in this modified ACS. Two criterions, searching by efficiency and searching by reliability, are proposed to evaluate the ACS. The resolution of a practical measurement example shows good results, and proves that the elitist choice of the first integer for the ants can improve the research reliability, and a function to confirm the number of the initial ants is defined.
DGPS carrier phase integer ambiguity combinatorial optimization ACS
Ning Yang Ping Li Mingsen Li
the Faculty of Electric and Automatic Engineering, Shanghai University of Electric Power the Academy of Agricultural Machinery, Changchun China.
国际会议
武汉
英文
2007-09-21（万方平台首次上网日期，不代表论文的发表时间）