Our Approach

Our aim is to bring in the dynamism in traffic light control scenario with dynamically
controlling both the time for which the present state of light should be maintained and the
sequence in which the light should be switched.
Since the traffic condition keeps on changing, even on the road which is known to be the
busiest experiences very low traffic which has to be handled accordingly so that the algorithm
works in an optimized way and the mean waiting time of the vehicles get minimized.
So we propose that to control the dynamic traffic we should have a mechanism to generate
the dynamic switching of light phases by taking into consideration the traffic load, the
priority of the lane and the mean speed of the traffic on it. The most important factor took
into consideration is the number of times the light phase is repeated.
a) Number of vehicles on the particular Lane:
Each lane has a traffic light associated to it that allow or disallow the movement of
traffic. Each vehicle present on the lane votes for the light to turn green. Whichever
light logic gets the highest vote parameter turns green. This vote parameter is also
influenced by other factors
b) Priority of Lane:
The vote of vehicle on the lane which has the more priority gets more weightage
while making the decision of light switching.
c) Mean Speed of vehicles on each Lane:
The aim of considering the mean speed is to determine where the traffic is
congested, or is likely to be congested. The slow mean speed of a lane suggests that
either the entire traffic is moving with slow speed due to their speed constraints or
there are large numbers of vehicle congested on the lane. Whereas a large mean
speed suggests that if the light is turned red for a large amount of time period, the
lane is likely to get congested.
So in order to generate a factor which would correctly predict the exact weightage
of each factor we took into consideration the ratios of the number of vehicles
waiting at the junction with the ratio of vehicles moving. The vehicles waiting at the
junction includes the vehicle which are not moving at all or moving with the very
slow speed.
Handling the number of vehicles moving and the mean speed, in a mathematical
way, would generate an approximate number of vehicles which would add to the
congested network if the current state continues. Thus in other words gives the
number of vehicles which get added to the network.

SECONDARY FACTOR to implement the Multiplicative weight Update:

a) Light Repetition Factor:
The lane which has the high traffic load gets repeated and the waiting time of the
vehicles on the other lanes increases. So to handle such a situation we increase the
priority of other lanes as the time passes. This exponentially handles the priority of
each lane giving a network a dynamism and fair chance to each vehicle in order to
minimize the difference between the peeks of waiting time of the vehicles in the
network and thus fairly distributing the waiting time amongst all the vehicles in the
network.
Based upon the above constraints a voting parameter is defined which is associated with each
traffic light logic. Whichever light get the highest vote parameter gets switched to green state
and accordingly all the other lights are switched.
The above logic creates a resolver to control the traffic situations with the general traffic
scenario, but there exists a few conditions which require an add on look ups.
a) Emergency vehicles:
There are situations where the emergency vehicles are present and no dedicated
lane is there for them, in order to handle such a situation firstly the entrance of a
new vehicle in that lane, through lane switching is disallowed and the light is turned
to green until the emergency vehicle crosses the junction.