Abstract
This paper uses colored Petri nets (PN) to develop a model of vehicle movement in a city. The modeler defines the number and location of crossroads, the connections between them, and how many vehicles are at the given points of the network. The vehicles are recognized by their license plate numbers, and it is possible to determine where they start their journey and where they are going. The algorithm proposed in this paper suggests the shortest vehicle route based on Dijkstra’s algorithm. This study focuses on improving route planning by considering road usage, which is determined by the starting and ending locations of vehicles (as if traffic cameras were identifying license plates). This approach will lead to optimal control of traffic lights (or vehicle navigation) to minimize traffic jams and make good use of all roads. Additionally, this paper shares the results of preliminary simulations using both colored and uncolored Petri nets in the GPenSIM environment.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
