A Fast Path Planning Algorithm Research Based on Region-Partition
Hui Zhou, Peng Chen, Zhenyu Liu, Li Pan · 2016
A fast path planning algorithm based on region-partition r has been proposed in this article, which solves the problems of long time spending in the best path computation when the city's road net map has many nodes and the real-time traffic information has to be considered. The hybrid algorithm is computed respectively through the block map, the efficiency of which is improved by reducing the points. The experimental results show that this algorithm is dependable and stable in a GIS system. It has obvious advantage when a distance is long.