TY - JOUR
T1 - Network-Level Traffic Signal Cooperation
T2 - A Higher-Order Conflict Graph Approach
AU - Li, Wan
AU - Wang, Boyu
AU - Khattak, Zulqarnain H.
AU - Deng, Xinyu
N1 - Publisher Copyright:
© 2000-2011 IEEE.
PY - 2023/1/1
Y1 - 2023/1/1
N2 - Traffic signal control and cooperation are extremely important to alleviate traffic congestion in a large traffic network. This study develops a higher-order conflict graph approach for network-wide traffic signal control and cooperation. A conflict graph is applied to model the traffic signal configurations, which identifies the conflict and unconflicted movements for each intersection. In conflict graph, the node represents each movement. The weight of each node can be defined as traffic volume, queue length, fuel consumption, or any weighted combinations of these measurements. The calculation of the optimal green light duration and green light sequence (for different movements) is equivalent to sequentially finding the maximum weight independent set (MWIS) in the conflict graph. The conflict graph also provides a uniform and efficient way to connect traffic signal operations among nearby intersections spatially. Then, we introduced the concept of the k -th order neighborhood to model the degree of connectivity between each movement to the movements at upstream or downstream intersections. The weight of each node in the higher-order conflict graph not only represents its own congestion level, but also relates to the traffic conditions of nearby intersections. Through this approach, the cooperation of multiple intersections can be realized by incorporating their spatial connectivity into conflict graph and solving the MWIS problem. A simulation network is built in SUMO to test the effectiveness of the proposed method. Results suggested that the proposed model outperformed other state-of-the-art signal control methods. Also, the scheme maintains good performance under varying traffic demands.
AB - Traffic signal control and cooperation are extremely important to alleviate traffic congestion in a large traffic network. This study develops a higher-order conflict graph approach for network-wide traffic signal control and cooperation. A conflict graph is applied to model the traffic signal configurations, which identifies the conflict and unconflicted movements for each intersection. In conflict graph, the node represents each movement. The weight of each node can be defined as traffic volume, queue length, fuel consumption, or any weighted combinations of these measurements. The calculation of the optimal green light duration and green light sequence (for different movements) is equivalent to sequentially finding the maximum weight independent set (MWIS) in the conflict graph. The conflict graph also provides a uniform and efficient way to connect traffic signal operations among nearby intersections spatially. Then, we introduced the concept of the k -th order neighborhood to model the degree of connectivity between each movement to the movements at upstream or downstream intersections. The weight of each node in the higher-order conflict graph not only represents its own congestion level, but also relates to the traffic conditions of nearby intersections. Through this approach, the cooperation of multiple intersections can be realized by incorporating their spatial connectivity into conflict graph and solving the MWIS problem. A simulation network is built in SUMO to test the effectiveness of the proposed method. Results suggested that the proposed model outperformed other state-of-the-art signal control methods. Also, the scheme maintains good performance under varying traffic demands.
KW - Higher-order conflict graph
KW - multi-agent system
KW - network-wide traffic control
KW - traffic signal control
KW - urban transportation network modeling
UR - http://www.scopus.com/inward/record.url?scp=85135734403&partnerID=8YFLogxK
U2 - 10.1109/TITS.2022.3191290
DO - 10.1109/TITS.2022.3191290
M3 - Article
AN - SCOPUS:85135734403
SN - 1524-9050
VL - 24
SP - 990
EP - 999
JO - IEEE Transactions on Intelligent Transportation Systems
JF - IEEE Transactions on Intelligent Transportation Systems
IS - 1
ER -