The name is absent

CHAPTER 4. CODING PROCESS
tion it is needed to find an alternative but equivalent restriction. This could be
translated as a green light is not turned red if there is at least one car approaching
within omega patches from the intersection.

The second restriction can be kept: restriction one is not taken into account if
there are more than mu cars approaching the intersection.

These restrictions are implemented in updateT LDs. When the minimal phase
is almost at its end, and there is at least one car but no more than mu cars ap-
proaching within omega patches, the minimal phase is incremented.

Testing succeeds. (had to fix bug in simModel where speed is changed. when
the light is green and the first roaduser could cross the node, it has to slow down
if the destination lane is full.)

4.3.6 Marching and Optim for the Wetstraat

Because the traffic flow in the Wetstraat is in one direction towards the centre, the
marching and optim controller can be made more efficient. The green time on the
Wetstraat has to be longer than the green time for the crossing roads. The crossing
roads of the Wetstraat are in one direction and because of this the green time can
be divided into green for the Wetstraat and green for the crossing roads.

The green times are the same as the green times in the Wetstraat. This is done
to be able to compare the current traffic light controller with the proposed self-
organizing traffic light controller.

4.3.7 Other traffic light controllers

The following traffic light controllers were created because of wrong interpreta-
tion, but are also self-organizing traffic lights.

Counting-cars-1 control counts the cars in front of the traffic lights. The traffic
light configuration with the highest count of cars is chosen.

<<   33   34   35   36   37   38   39   >>

More intriguing information