Abstract

Intelligent transportation system (ITS) is a complicated system, and selecting the shortest path is the core of the system. In order to ease traffic congestion of the city, through solving the shortest path, the key technology in realizing the function of ITS, and based on the analysis of traditional Dijkstra algorithm, the paper puts forward the improved algorithm. The new algorithm includes two parts, that is, preprocessing and real-time pruning research, and the effect of pruning totally depends on the division of specific diagram.

Full Text
Paper version not known

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.