Pseudo Randomized Search Strategy Algorithm in Resolving the Ambiguity Resolution

Azmi Hassan and David Mezera

Abstract:	A technique has been developed for reliably resolving the GPS carrier phase ambiguity over short and medium length baselines. A combination of three methods, optimization, global random search and ambiguity function mapping has produced an efficient search algorithm denoted as the Pseudo Randomized Search Strategy (PRSS) method. The PRSS algorithm is an adaptive search technique that can learn high performance knowledge structures in reactive environments that provide information as an objective function. What makes this search efficient is that the objective function, which includes all the GPS measurements is evaluated periodically to guide the search to a global optimum. Numerical result indicate that, in all the test cases, no more than 4% search of the total search space was investigated to determine the correct set of ambiguities. This result implies that the size of the search window does not play an important role in determining the search efficiency. Therefore the algorithm is suitable for on-the-fly ambiguity resolution for a single frequency C/A code receiver.
Published in:	Proceedings of the 10th International Technical Meeting of the Satellite Division of The Institute of Navigation (ION GPS 1997) September 16 - 19, 1997 Kansas City, MO
Pages:	1135 - 1142
Cite this article:	Hassan, Azmi, Mezera, David, "Pseudo Randomized Search Strategy Algorithm in Resolving the Ambiguity Resolution," Proceedings of the 10th International Technical Meeting of the Satellite Division of The Institute of Navigation (ION GPS 1997), Kansas City, MO, September 1997, pp. 1135-1142.
Full Paper:	ION Members/Non-Members: 1 Download Credit Sign In