Research on Terrain Suitability of Iterative Closest Contour Point Algorithm for Underwater Navigation

K. Wang, Y. Li, C. Rizos

Abstract:	An alternative approach to underwater navigation – terrain-aided navigation (TAN) – is described in this paper. The focus is not on the TAN algorithm per se but in deriving a quantitative relationship of the matching errors of a TAN algorithm with terrain factors. The TAN algorithm used in this paper is known as the “iterative closest contour point” (ICCP) algorithm. Firstly, the ICCP algorithm is run 10 times along each path across 20 regions to collect 207 matching points. 182 points are used in the analysis and the other 25 points are used for verification. Then 6 fctors, among the total 17 factors, are identified as being most correlated with the accuracy of the ICCP algorithm by cluster and correlation analysis. Finally, three statistical methods, including multiple regression, logistics analysis and discriminant analysis, are applied to derive three different types of relationship between the terrain factors and the matching errors. Each formula uses no more than 3 terrain factors to fit the matching errors. The verification with the 25 points demonstrates the effectiveness of the formulas. The relationships derived herein are more practical, due to their simplification and effectiveness, in applications such as trajectory planning.
Published in:	Proceedings of the 22nd International Technical Meeting of the Satellite Division of The Institute of Navigation (ION GNSS 2009) September 22 - 25, 2009 Savannah International Convention Center Savannah, GA
Pages:	723 - 727
Cite this article:	Wang, K., Li, Y., Rizos, C., "Research on Terrain Suitability of Iterative Closest Contour Point Algorithm for Underwater Navigation," Proceedings of the 22nd International Technical Meeting of the Satellite Division of The Institute of Navigation (ION GNSS 2009), Savannah, GA, September 2009, pp. 723-727.
Full Paper:	ION Members/Non-Members: 1 Download Credit Sign In