脉冲星导航解周期模糊匹配搜索算法  

Cycle ambiguity resolution using matching search for X-ray pulsar navigation systems

作　　者：谢强[1] 许录平[1] 张华[1] 孙景荣[1] 

机构地区：[1]西安电子科技大学电子工程学院,陕西西安710071

出　　处：《系统工程与电子技术》2011年第11期2496-2500,共5页Systems Engineering and Electronics

基　　金：国家自然科学基金(60772139);国家高技术研究发展计划(863计划)(2007AA12Z323);中国科学院精密导航定位与定时技术重点实验室基金(2009PNTT08)资助课题

摘　　要：为降低脉冲星导航解周期模糊空间搜索算法的试探次数,提出了一种基于匹配搜索的解模糊方法。先利用3颗脉冲星确定航天器位置,再引入第4颗脉冲星建立一组平面,并通过计算该组平面与航天器位置的最小距离来检验模糊向量。然后给出了点面最小距离、整周期数和相位差的关系,分析了整周期数对点面最小距离的影响。通过建立搜索模板,避免了对试探空间的遍历,降低了试探次数。仿真实验表明,在相同的条件下,算法试探次数较现有算法降低了4个数量级。In order to reduce the test number of cycle ambiguity space searching algorithms, a novel method based on matching search for ambiguity resolution is proposed. First, three pulsars are used to determine the position of aircraft, and a set of planes are established by bringing in an additional pulsar. Then the ambiguity vectors are evaluated by calculating the minimum distances between aircraft and the above planes. Secondly, the relationships among the minimum distances, cycle sets and phase differences are exhibited and the influences on the minimum distances due to the variation of integer cycles are analyzed. After that, a searching template is built to refrain from testing each candidate eyele set and obtain the cycle ambiguity resolution. Therefore, the test number is cut down. Finally, simulation results show that, in the same experimental environment, the test number of the matching search algorithm is reduced by four orders of magnitude compared with the existing algorithms.

关 键 词：脉冲星 解模糊 匹配搜索 

分 类 号：V249[航空宇航科学与技术—飞行器设计]