Disclosed is a three-dimensional
laser point cloud rapid
relocation method, on the basis of a priori map, the data
operand is reduced based on two-dimensional rasterization, the real-time performance is improved, meanwhile, a preliminary candidate scene set is obtained based on a Jaccard coefficient. On this basis, screening is carried out on the preliminary candidate scene set based on a data main direction and a Pearson
correlation coefficient to obtain a candidate scene set, so that the real-time performance is improved, three-dimensional clustering is carried out based on an Euclidean clustering method, and then a
bipartite graph is constructed for each historical frame scene in the candidate scene set; three-dimensional similarity measurement is completed based on
cosine similarity after a maximum matching relation is found based on a Hungarian matching
algorithm, and finally a unique candidate scene is obtained, so that the obtained corresponding relation is more reliable in solution, higher in robustness, more accurate in registration result, high in overall real-time performance of the method and high in accuracy. And finally, a 3D-NDT
algorithm is utilized to obtain an attitude transformation relation matrix between two frames to complete repositioning. According to the method, unique candidate scene screening is carried out based on
cosine similarity.