An efficient way to cope with traffic congestion is Intelligent Traffic Light Control (ITLC). Particularly, multi-agent based intelligent traffic light control algorithms are more popular and efficient than others. But there are still some problems in these algorithms. Firstly, an efficient communication mechanism is needed. As current traffic condition of an intersection can impact other intersections' future traffic condition, every agent should know the traffic condition of other intersections through communication. Thus, a new communication mechanism should be designed. By using this mechanism, traffic condition of an intersection can be passed to several relevant agents easily. And traffic condition of an intersection can be described simply and clearly. Secondly, asynchronization of message should be considered while processing received messages. As duration time of traffic lights' cycles is different from agent to agent and message sending event happens at the end of each traffic light cycle, different agents will send message at different time. Moreover, every agent tries to process the received messages at the end of each traffic light cycle as well. So it is hard for an agent to decide which message is the latest one and the most valuable. Thirdly, a new reward calculating method should be designed. In the traditional reinforcement learning based ITLC algorithms, only queue length of congested cars or waiting time of these cars is considered while calculating reward value. But, both of them are very important for measuring the level of traffic congestion. So a new reward calculation method is needed. To solve all these problems, in this paper, a new ITLC algorithm is proposed. At the same time, a new message sending and processing method is proposed and adopted by this ITLC algorithm. The first and the second problems described above are tried to be solved by using this new method. Besides, to measure traffic congestion in a more reasonable way, a new reward calculation method is proposed and used. This method takes both waiting time and queue length into consideration.
Intelligent traffic light control (ITLC) algorithms are very efficient for relieving traffic congestion. Recently, many decentralized multi-agent traffic light control algorithms are proposed. These researches mainly focus on improving reinforcement learning method and coordination method. But, as all the agents need to communicate while coordinating with each other, the communication details should be improved as well. To guarantee communication effectiveness, two aspect should be considered. Firstly, a traffic condition description method need to be designed. By using this method, traffic condition can be described simply and clearly. Secondly, synchronization should be considered. As different intersections have different cycle lengths and message sending event happens at the end of each traffic signal cycle, every agent will receive messages of other agents at different time. So it is hard for an agent to decide which message is the latest one and the most valuable. Apart from communication details, reinforcement learning algorithm used for traffic signal timing should also be improved. In the traditional reinforcement learning based ITLC algorithms, either queue length of congested cars or waiting time of these cars is considered while calculating reward value. But, both of them are very important. So a new reward calculation method is needed. To solve all these problems, in this paper, a new ITLC algorithm is proposed. To improve communication efficiency, this algorithm adopts a new message sending and processing method. Besides, to measure traffic congestion in a more reasonable way, a new reward calculation method is proposed and used. This method takes both waiting time and queue length into consideration.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.