Journal of Geodesy and Geoinformation Science ›› 2021, Vol. 4 ›› Issue (4): 84-96.doi: 10.11947/j.JGGS.2021.0407

Previous Articles     Next Articles

A Method of Road Data Aided Inertial Navigation by Using Learning to Rank and ICCP Algorithm

Xiang LI1(),Yixin HUA1,Wenbing LIU2   

  1. 1. Institute of Geospatial Information, Information Engineering University, Zhengzhou 450001, China
    2. Army Logistics University of PLA, Chongqing 401311, China
  • Received:2021-02-28 Accepted:2021-08-30 Online:2021-12-20 Published:2021-12-30
  • About author:Xiang LI(1987—),male,PhD,majors in aided positioning technique based on GIS and embedded GIS.E-mail: ryolx13@126.com
  • Supported by:
    National Key Research and Development Plan(2016YFB0502300)

Abstract:

As an independent navigation method, inertial navigation system(INS) has played a huge advantage in a lot of special conditions. But its positioning error will accumulate with time, so it is difficult to work independently for a long time. The vehicle loaded with the inertial navigation system usually drives on the road, so the high precision road data based on geographic information system(GIS) can be used as a bind of auxiliary information, which could correct INS errors by the correlation matching algorithm. The existing road matching methods rely on mathematical models, mostly for global positioning system(GPS) trajectory data, and are limited to model parameters. Therefore, based on the features of inertial navigation trajectory and road, this paper proposes a road data aided vehicle inertial navigation method based on the learning to rank and iterative closest contour point(ICCP) algorithm. Firstly, according to the geometric and directional features of inertial navigation trajectory and road, the combined feature vector is constructed as the input value; Furthermore, the scoring function and RankNet neural network based on the features of vehicle trajectory data and road data are constructed, which can learn and extract the features; Then, the nearest point of each track point and its corresponding road data set to be matched is calculated. The average translation between the two data sets is calculated by using the position relationship between each group of track points to be matched and road points; Finally, the trajectory data set is iteratively translated according to the translation amount, and the matching track point set is obtained when the trajectory error converges to complete the matching. During experiments, it is compared with other algorithms including the hidden Markov model(HMM) matching method. The experimental results show that the algorithm can effectively suppress the divergence of trajectory error. The matching accuracy is close to HMM algorithm, and the computational efficiency can meet the requirements of the traditional matching algorithm.

Key words: ICCP algorithm; vehicle trajectory data; features; road matching; pairwise learning