A Study of Path Planning Algorithm in VANETs

2014 ◽  
Vol 602-605 ◽  
pp. 3503-3507
Author(s):  
Ling Zhang

Based on GPS and RFID technology, a vehicle path planning guidance system is analyzed in this paper. Specially, the ant colony optimization in the vehicle path planning application of Internet in vehicles environment is proposed, and an improved strategy is put forward to provide an efficient path planning algorithm for the construction of intelligent transportation system. As an alternative of wireless radio and guidance display screen and other primary induction means, the ant colony optimization in this work could supply some significant exploring and thinking for currently construction of the intelligent transportation system.

2019 ◽  
Vol 259 ◽  
pp. 02009 ◽  
Author(s):  
Noussaiba Melaouene ◽  
Rahal Romadi

For the last fifty years, finding efficient vehicle routes has been studied as a representative logistics problem. In the transportation field, finding the shortest path in a road network is a common problem. VANET presents an innovation opportunity in the transportation field that enables services for intelligent transportation system (ITS) especially communication features. Because of VANET features [1] and despite road obstacles, a route for the shortest path can be established at a given moment. This paper proposes an enhanced algorithm, based on ACO Ant Colony Optimization and related to VANET infrastructure that aims to find the shortest path from the source to destination through the optimal path; in addition, a storage on static nodes is installed in each intersection in a VANET environment and for a specific time.


2020 ◽  
Vol 38 (3A) ◽  
pp. 343-351
Author(s):  
Mohammed I. Abdulakareem ◽  
Firas A. Raheem

n this paper, a unique combination among probabilistic roadmap, ant colony optimization, and third order B-spline curve has been proposed to solve path-planning problem in complex and very complex environments. This proposed method can be divided into three stages. First stage is to construct a random map depending on the environment complexity using probabilistic roadmap algorithm. This could be done by sampling N nodes randomly in complex and very complex static environments, then connecting these nodes together according to some criteria or conditions. The constructed roadmap contains huge number of possible random paths that may connect the start and the goal points together. Second stage includes finding path within the pre-constructed roadmap. Ant colony optimization is selected to find or to search the best path between start and goal points. Finally, the third stage uses B-spline curve to smooth and reduce total length of the found path in the previous stage where path’s length has been reduced by 1% in first environment and by 15% in second environment. The results of the proposed approach ensure feasible path between start and goal points in complex and very complex environment. In addition, the path is guaranteed to be shortest, smooth, continues and safe.


2014 ◽  
Vol 624 ◽  
pp. 567-570
Author(s):  
Dan Ping Wang ◽  
Kun Yuan Hu

Intelligent Transportation System is the primary means of solving the city traffic problem. The information technology, the communication, the electronic control technology and the system integration technology and so on applies effectively in the transportation system by researching rationale model, thus establishes real-time, accurate, the highly effective traffic management system plays the role in the wide range. Traffic flow guidance system is one of cores of Intelligent Transportation Systems. It is based on modern technologies, such as computer, communication network, and so on. Supplying the most superior travel way and the real-time transportation information according to the beginning and ending point of the journey. The journey can promptly understand in the transportation status of road network according to the guidance system, then choosing the best route to reach destination.


Sign in / Sign up

Export Citation Format

Share Document