TY - JOUR
T1 - Intersection traffic deadlock formation and its probability
T2 - A petri net-based modeling approach
AU - Qi, Hong Sheng
AU - Yu, Yi
AU - Tang, Qing
AU - Hu, Xian Biao
N1 - Publisher Copyright:
© 2022 The Authors. IET Intelligent Transport Systems published by John Wiley & Sons Ltd on behalf of The Institution of Engineering and Technology.
PY - 2022/10
Y1 - 2022/10
N2 - Although traffic deadlock at an intersection is a common phenomenon during rush hours, the deadlock formation metrics such as formation probability and duration have not been derived yet. As Petri Net (PN)-based approach can formulate the deadlock formation in analytical form and has been applied in numerous traffic flow studies, the PN is employed to investigate the deadlock formation probability and duration. First, each of the four main components of an intersection is formulated, namely vehicle trajectory, traffic signal, vehicle arrivals, and conflict behaviour, as a Petri Net (or IntersectionPN), and name them CellularPN, TrafficLightPN, DemandPN, and ConflictPN, respectively. Together, the entire intersection becomes an IntersectionPN, on which the system's three classes of states are defined, namely the deadlock state, the trap state, and the live state. The deadlock occurrence is formulated as an integer programming problem, while the formation probability and duration are studied by constructing a reachability graph that leads to the Markov chain of the system. A case study shows that the developed model is able to reproduce an intersection deadlock, and that the focus is on two priority behaviours: “First Enter First Serve” and “Pure Stochastic”. The results show that different behaviours lead to different deadlock formation metrics and that, when the saturation flow rate degrades (due to events such as severe weather conditions), a deadlock will occur more quickly. The research results provide the analysis tool for probabilistic deadlock formation. It can also be applied to the intersection deadlock prevention and control.
AB - Although traffic deadlock at an intersection is a common phenomenon during rush hours, the deadlock formation metrics such as formation probability and duration have not been derived yet. As Petri Net (PN)-based approach can formulate the deadlock formation in analytical form and has been applied in numerous traffic flow studies, the PN is employed to investigate the deadlock formation probability and duration. First, each of the four main components of an intersection is formulated, namely vehicle trajectory, traffic signal, vehicle arrivals, and conflict behaviour, as a Petri Net (or IntersectionPN), and name them CellularPN, TrafficLightPN, DemandPN, and ConflictPN, respectively. Together, the entire intersection becomes an IntersectionPN, on which the system's three classes of states are defined, namely the deadlock state, the trap state, and the live state. The deadlock occurrence is formulated as an integer programming problem, while the formation probability and duration are studied by constructing a reachability graph that leads to the Markov chain of the system. A case study shows that the developed model is able to reproduce an intersection deadlock, and that the focus is on two priority behaviours: “First Enter First Serve” and “Pure Stochastic”. The results show that different behaviours lead to different deadlock formation metrics and that, when the saturation flow rate degrades (due to events such as severe weather conditions), a deadlock will occur more quickly. The research results provide the analysis tool for probabilistic deadlock formation. It can also be applied to the intersection deadlock prevention and control.
UR - http://www.scopus.com/inward/record.url?scp=85131012376&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85131012376&partnerID=8YFLogxK
U2 - 10.1049/itr2.12210
DO - 10.1049/itr2.12210
M3 - Article
AN - SCOPUS:85131012376
SN - 1751-956X
VL - 16
SP - 1342
EP - 1363
JO - IET Intelligent Transport Systems
JF - IET Intelligent Transport Systems
IS - 10
ER -