地磁匹配导航算法研究  

Research of geomagnetic matching navigation algorithm

作　　者：王向磊[1] 苏牡丹 李博 杨超 

机构地区：[1]信息工程大学测绘学院 [2]63999部队 [3]61081部队

出　　处：《测绘科学》2011年第4期12-15,共4页Science of Surveying and Mapping

摘　　要：文中首先研究了基于点的地磁匹配导航算法,这种算法一次定位时间太长,不能满足导航系统对实时性的要求。针对基于点的地磁匹配导航算法的缺点提出了基于向量的地磁匹配导航算法,这种算法满足了导航系统对实时性的要求。基于点的地磁匹配导航算法和基于向量的地磁匹配导航算法都是基于单点的匹配算法,这决定了它们有共同的缺陷:匹配结果可能不惟一。针对这一点提出了基于Monte Carlo的地磁匹配导航算法,这种匹配算法是一种基于线的匹配算法,通过各个点之间的约束可以克服前面两种算法匹配结果不惟一的缺陷。针对每一种算法都给出了仿真结果,得出了一些有益的结论。Geomagnetic Matching Navigation Algorithm（GMNA） is an important factor to influence the navigation precision, to some extent GMNA determines the navigation precision. An excellent GMNA should not only fulfill the precision demand but also the time. First, in this paper GMNA based on point was studied, which is unsatisfied with the real-time due to the long time of posi- tion. Aimed to the problem which exists in GMNA based on point, GMNA based on the vector was proposed, which is satisfied with the real-time needed to the navigation system. The former two navigation algorithms are both based on the single point, which makes them have the same defect： the matching is not unique. Taking into account of this, the GMNA based on the Monte Carlo was brought out, which is on the basis of the line, and could overcome the defect by means of the restriction among the points. The simulation results were showed and attained some benefit conclusion.

关 键 词：地磁匹配导航 地磁匹配导航算法 MONTE Carlo 代价函数 向量 

分 类 号：P225[天文地球—大地测量学与测量工程]