A Markov process based dilemma zone protection algorithm

Authors:
Pengfei Li;Montasir M. Abbas
Affiliations:
Virginia Tech, Blacksburg, VA;Virginia Tech, Blacksburg, VA
Venue:
Winter Simulation Conference
Year:
2009

Citing 3
Cited 0

Computation of Equilibrium Distributions of Markov Traffic-Assignment Models

Transportation Science
Introduction to Probability Models, Ninth Edition

Introduction to Probability Models, Ninth Edition
State space reduction for nonstationary stochastic shortest path problems with real-time traffic information

IEEE Transactions on Intelligent Transportation Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Dilemma zone (DZ) is an area at high-speed signalized intersections, where drivers can neither cross safely nor stop comfortably at the yellow onset. The dilemma zone problem is a leading cause for crashes at high-speed signalized intersections and is therefore a pressing issue. This paper presents a novel Markov-chain-based dilemma zone protection algorithm that considers the number of vehicles caught in DZ as a Markov process. The new algorithm can predict the numbers of vehicles in DZ and determine the best time to end the green so as to reduce the number of vehicles caught in DZ per hour. The algorithm was compared to the traditional green extension system and the results showed that the new algorithm was superior.