By Topic

A Novel Signal-Scheduling Algorithm With Quality-of-Service Provisioning for an Isolated Intersection

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Wunderlich, R. ; Dept. of Electr. Eng. & Comput. Sci., Univ. of Tennessee, Knoxville, TN ; Cuibi Liu ; Elhanany, I. ; Urbanik, T.

There have been countless efforts directed toward efficiently controlling the flow of vehicular traffic through an intersection. This paper describes an algorithm designed for the signal control problem that employs concepts drawn from the field of packet switching in computer networks. The novel method proposed utilizes a maximal weight matching algorithm to minimize the queue sizes at each approach, yielding significantly lower average vehicle delay through the intersection. Of particular interest are scenarios in which differentiated services are offered to vehicle classes with differing priorities. Lyapunov function-based analysis is provided, deriving the conditions under which the system is guaranteed to be stable. The algorithm is compared to an optimized fixed-time controller and a vehicle-actuated controller using the VISSIM traffic simulation environment. Simulation results demonstrate the performance gain obtained when using the proposed scheme, particularly in the scenario in which vehicle routes are unequally distributed, and multiple classes of service are desired.

Published in:

Intelligent Transportation Systems, IEEE Transactions on  (Volume:9 ,  Issue: 3 )