论文部分内容阅读
为降低脉冲星导航解周期模糊空间搜索算法的试探次数,提出了一种基于匹配搜索的解模糊方法。先利用3颗脉冲星确定航天器位置,再引入第4颗脉冲星建立一组平面,并通过计算该组平面与航天器位置的最小距离来检验模糊向量。然后给出了点面最小距离、整周期数和相位差的关系,分析了整周期数对点面最小距离的影响。通过建立搜索模板,避免了对试探空间的遍历,降低了试探次数。仿真实验表明,在相同的条件下,算法试探次数较现有算法降低了4个数量级。
In order to reduce the number of probing times of the search algorithm for the periodic solution of the Pulsar navigation solution, a new method based on the matching search is proposed. Firstly, the position of the spacecraft is determined by using three pulsars, the fourth pulsar is introduced to establish a plane, and the fuzzy vector is verified by calculating the minimum distance between the plane and the spacecraft position. Then the relationship between the minimum distance, the whole period and the phase difference is given, and the effect of the whole period on the minimum distance of the point surface is analyzed. By establishing a search template, traversing the heuristic space is avoided and the number of probing times is reduced. The simulation results show that under the same conditions, the number of algorithm exploration is reduced by 4 orders of magnitude compared with the existing algorithms.