Path planning preprocessing data compression method

Abstract

The invention discloses a path planning preprocessing data compression method. The method specifically comprises the following steps: 1, preprocessing a road network to obtain a navigation passing path data set R; step 2, setting an initial iteration path data set as the navigation passing path data set R, and setting an initial dictionary D as an empty dictionary; step 3, counting a binary navigation passage sub-path with the highest occurrence frequency, setting the occurrence frequency as N, and judging whether the N is greater than 1 or not; step 4, if the N is greater than 1, defining the binary navigation passage sub-path as a virtual road section, and adding the virtual road section into the dictionary; step 5, performing replacing by using the newly added virtual road section; step 6, updating an iteration condition, and returning to the step 3 to continue the iteration; step 7, stopping the iteration when the N is equal to 1, and storing data in a binary form to complete data compression. According to the method of the invention, space occupation of preprocessed data can be reduced, so that the method is suitable for mobile computing equipment with limited storage space, and the path planning performance of the equipment is improved.

Description

technical field [0001] The invention relates to the technical field of navigation path planning preprocessing, in particular to a path planning preprocessing data compression method. Background technique [0002] In existing map navigation applications, for path planning in large-scale road networks, preprocessing methods are usually used to improve computational efficiency. The so-called preprocessing method refers to the method of pre-calculating the road network data, saving the obtained calculation results as pre-processing data, and calling them during route planning and calculation, so as to improve the speed of route planning and calculation. The essence of the preprocessing method is to advance part of the calculation in the path planning process to the compilation stage of the map data. Generally, the optimal paths between some key nodes need to be calculated in advance and stored in the preprocessing data. These pre-calculated paths Either directly store in the fo...

AI Technical Summary

Problems solved by technology

[0003] In large-scale road network applications, the amount of route data generated by the above path planning preprocessing is often very large, and when using a general data compression algorithm to compress route data, since only a fixed dictionary size and a single Due to reasons such as local compression processing methods, it is impossible to perform targete

Images