Abstract

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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.