The Research Of Traffic Information Acquisition Based On VANET And Path Planning Algorithm In Ride-sharing

Transportation tools have been greatly improved and developed with improvement of people's living standards and quality, among which the use of motor vehicles is becoming increasingly popular. In order to reduce traffic and environmental problems caused by motor vehicles, the intelligent transportation systems, based on vehicular ad-hoc network(VANET), have become industry and academia research focus because of real-time, accuracy, efficiency and other advantages. Among them, attached to the intelligent transportation system, carpool mechanism effectively improves the vehicle carrying rate. Therefore, based on VANET the carpool algorithm has become one of the important research directions in the field of intelligent transportation research.This paper mainly studies the carpool path planning algorithm based on VANET. It mainly consists of two parts: the acquisition of real-time traffic information based on VANET and carpool path planning based on traffic information. On the basis of research results of domestic and foreign scholars, AOMDV routing algorithm, based on historical vehicle distance, is proposed on account of complexity and inaccuracy of current routing algorithm. For some problems of typical carpool algorithm ignoring arrival time of stops and poorly reflecting road conditions changes, we propose carpool path planning algorithm based on the arrival time of stops(CPPAT) and carpool path planning algorithm based on the riding ring(CPPAR). The main research work and achievements are as follows:Firstly, the relevant technology and research status of carpool path planning are elaborated as well as advantages of VANET network in intelligent transportation network. According to shortage of acquisition of traffic information and carpool path planning these two aspects, AOMDV routing algorithm based on historical vehicle distance is proposed.After that, for the ignorance of arrival time accuracy in existing path planning algorithm, path planning algorithm based on arrival time of stops is proposed. Then, for the impact of city traffic information changes on vehicles, we propose carpool path planning algorithm based on the riding circle which can change with dynamic traffic information. It takes the group idea in carpool path planning algorithm based on arrival time of stops as reference.Finally, the proposed routing algorithm and carpool path planning algorithm are simulated and analyzed. The result analysis shows that proposed routing algorithms compared to some of the existing routing algorithms, have lower delay and packet loss, and higher throughput; proposed CAPPAT and CPPAR algorithms compared to current carpool path planning algorithms, respectively improve arrival time accuracy and shorten carpool time when traffic condition changes.At the end of the article, the work of this paper is summarized, and the future work is prospected.