DE102021200804A1 - Procedure for controlling display cross-sections - Google Patents

Abstract

The invention relates to a method for controlling a plurality of display cross sections 20, 21, 22, 23, 24, with the following steps: reading in a requested display 100 for at least one variable message sign 30 of at least one display cross section 20, 21, 22, 23, 24; - Setting up conditional equations for a discrete optimization, with information about a topology of variable message signs 30 of the display cross-sections 20, 21, 22, 23, 24 and signaling rules being used for the conditional equation; - Calculating a solution for the discrete optimization, with the solution using a display plan 110 the display cross-sections 20, 21, 22, 23, 24 includes.

Description

The invention relates to a method for controlling a plurality of display cross sections. The invention also relates to a computer program, a control unit and a traffic management system for implementing the method.

Display cross-sections can be used, for example, on multi-lane roads such as freeways, among other things to display variable speed limits, lane closures, merging of lanes, warning signs or prohibitions, such as no overtaking or tonnage restrictions. Display cross-sections can include rotatable prisms for displaying changing traffic signs or optical displays using pixels, for example in the form of LEDs, and can be controlled in a way that is adapted to the current traffic situation. The display cross-sections can be designed, for example, in the form of gantry signs above the roadway or as units arranged at the edges of the roadway. The display sections may also include mechanical barriers such as barriers or text displays.

As a rule, an event, for example a traffic incident, will result in a change in several variable message signs in the display cross sections. For example, it can be provided that when a lane is blocked in the direction of travel before the lane is blocked, a request to change lanes is displayed and a warning sign is displayed even further before the lane is blocked in the direction of travel. In principle, an operator could initiate all of these changes, with complex relationships between the display cross sections such manual initiation of the changes no longer being possible. Provision can be made for an operator to specify a requested display for at least one variable message sign, i.e. what a specific variable message sign of one of the display cross sections should display, and for the remaining changes to other variable message signs to take place automatically using predefined rules.

Such systems are known from the prior art and are based on a flow chart in which conditions and exceptions are considered one after the other in order to arrive at a display plan for the variable message signs of the display cross-sections. The advertising plan specifies for each variable message sign of the display cross-sections which advertisement is to be placed and, in particular, which traffic sign is to be displayed. If the display cross sections or variable message signs include barriers, for example, the display plan can include a status of the barrier (open, closed). If the advertisement cross-sections or the variable message signs include text advertisements, for example, the advertisement plan can include the text to be displayed, such as "road closed", "tunnel closed" or "traffic jam". The disadvantage of this solution is that it is difficult or impossible to theoretically prove that the display plan follows all traffic rules, especially if the requested display includes multiple variable message signs at different locations. Therefore, lengthy test procedures are necessary. In addition, using a flowchart-based method with conditions and exception rules can also cause problems when processing another requested ad, thereby overwriting parts of the ad schedule. The current methods provide for a complicated verification method here, which takes up a lot of computing capacity.

The object of the invention is to provide an improved method for controlling a plurality of display cross sections, in which signaling rules are taken into account by the method. Furthermore, the invention is based on the object of providing a computer program for carrying out the method, a storage medium with the computer program, a control unit and a traffic control system with these properties.

These objects are solved with the subject matter of the independent patent claims. Advantageous developments are specified in the dependent claims.

A method for driving a plurality of display sections includes the following steps. First, a requested display for at least one variable message sign of at least one display cross section is read in, it being possible for the requested display to also be read in for multiple variable message signs of one or more display cross sections. Subsequently, conditional equations for a discrete optimization are set up, information about a topology of variable message signs of the display cross sections and signaling rules being used for the conditional equation. Due to the topology, spatial relationships of the variable message signs among each other which are taken into account. With the signaling rules it can be achieved that only legally permissible advertisements are issued using variable message signs. In particular, this may refer to the fact that a combination of advertisements is legally permissible. A solution of the discrete optimization is then computed, the solution comprising a display map of the display cross-sections.

By using discrete optimization, a method can be provided in which all legally permissible combinations of advertisements are used by means of the signaling rules and a combination of advertisements is selected within these. It can be provided that the method selects an optimal combination from among the legally permissible combinations, ie a combination with the best possible traffic flow.

The display plan can contain display images for the variable message signs, ie which variable message sign should display which traffic sign.

In one embodiment, the method is carried out in a computing unit of a traffic control system. Control signals are issued to the display sections based on the display plan. The display cross-sections can then be set up to control variable message signs using the control signals and to switch displays of the variable message signs corresponding to the control signals or the display plan.

In one embodiment of the method, the information about the topology, the signaling rules and the requested display is stored in an input file. When reading the requested ad, the input file is read. This method is particularly advantageous when several sections of a road network are to be controlled from a central location and the calculation is only to be carried out in a limited area around the variable message signs of the requested display. This allows for an efficient process. If necessary, different signaling rules can also be taken into account for different locations. A multi-lane freeway, for example, may be subject to different signaling rules than a multi-lane inner-city road. Alternatively, the topology and the signaling rules can also be provided for all the different locations within the processing unit that carries out the method, for example in a memory of the processing unit.

In one embodiment of the method, the conditional equations include parameters for different display options for the variable message signs. In computing the solution, a weighted function of the parameters of the various display possibilities is maximized. In particular, weighting factors can be such that, when the solution is calculated, preference is given to those display options that promise better traffic flow.

In one embodiment of the method, the parameters are either zero or one. This enables the determination equations to be set up easily, automated if necessary, and also enables the solution to be calculated more easily.

In one embodiment of the method, the information about the topology of variable message signs of the display cross sections includes a list of variable message signs that may be influenced for each variable message sign of the display cross sections. The method is carried out iteratively, initially for the variable message signs possibly influenced by the at least one variable message sign with the requested display. In each further iterative step, further variable message signs are taken into account, with the further variable message signs being those that are part of the lists of possibly influenced variable message signs of the variable message signs to be taken into account when implementing the display plan. The procedure is carried out until, in an iterative step, the ad plan no longer changes. So initially only the variable message signs that can be influenced by the requested display are taken into account. This results in a display plan that includes variable message signs of the requested display and variable message signs influenced by them. Now all variable message signs that are influenced by these variable message signs can also be taken into account and another display plan can be calculated. This can be carried out until the advertising plan no longer changes, despite the addition of variable message signs that may be affected. This enables a fast and efficient method in which not all of the variable message signs have to be taken into account from the start, so that this method requires less computing capacity.

In one embodiment, the method for a further requested display is carried out for at least one further variable message sign of at least one display cross section. This can be another variable message sign of the same display cross section or a different display cross section. A further advertising plan is determined for the further variable message sign. In the event that the advertisement plan and the further advertisement plan contain at least one common variable message sign, a combined requested advertisement is calculated and the method for the combined requested advertisement is carried out again and a combined advertisement plan is calculated. As a result, an efficient calculation method can be provided if the result is that the advertising plan and the combined advertising plan overlap, so that compliance with the signaling rules is also made possible here.

In particular, this embodiment can be combined with the multiple iterative implementation of the method described above in order to achieve as little computing power as possible while at the same time complying with the signaling rules.

In an embodiment of the method, the calculation of the combined requested advertisement compares the requested advertisement with the further advertisement plan. All variable message signs for which the further advertising plan provides for more restrictive display options will be removed from the requested display. The additional requested ad is compared to the ad schedule. All variable message signs for which the advertising plan provides for more restrictive display options will be removed from the further requested display. The combined requested display contains all variable message signs or further variable message signs remaining in the requested display and the further requested display.

Provision can be made for the weighting factors already mentioned to be used for this. There can be a relationship between the weighting factors and a restriction on the display options. In this context, more restrictive display options can be in particular those which lead to the expectation of poorer traffic flow. Alternatively, provision can be made for the requested displays to be assigned a prioritization and for the selection of the variable message signs remaining in the combined requested display to be selected on the basis of the prioritization. The prioritization can be implemented using a character priority.

In one embodiment of the method, at least one variable message sign of at least one display cross section is operated according to a current display plan. A transition display plan or a plurality of transition display plans are calculated, and a transition is made from the current display plan to the calculated display plan using the transition display plan or plans. This allows you to switch from the current ad plan to the calculated ad plan to remain compliant with ad rules during the transition.

In one embodiment of the method, the transition display plan or transition display plans are calculated in such a way that further conditional equations are set up for a discrete optimization. Rules for permitted transitions of the variable message signs are used for the further conditional equations, with the further conditional equations comprising further parameters for different transition possibilities of the variable message signs. A further solution of the further discrete optimization is then calculated, with a weighted function of the further parameters of the various transition possibilities being maximized when the further solution is calculated.

In one embodiment of the method, the further parameters are zero or one. This enables the further conditional equations to be set up easily, possibly automated, and also enables the further solution to be calculated more easily.

The invention also includes a control unit with an input interface for at least one requested advertisement, a computing unit for carrying out the method according to the invention and an output interface for control signals derived from the advertisement plan.

The invention also includes a traffic control system with a control unit according to the invention and at least one display section. The display section has an input interface which is connected to the output interface of the control unit and the display section is set up to receive control signals derived from the display plan via the input interface and to operate variable message signs using the control signals. It can be provided that the Steuersig nale include the advertisement plan and the advertisement cross-sections determine which variable message sign should place which advertisement on the basis of the advertisement plan. This provides a traffic control system in which an operator can enter a requested display via the input interface, the control unit creates the display plan from this and the display cross section(s) display the display images provided by the display plan. The display cross-sections are then operated based on the display plan.

The invention also includes a computer program, comprising program code which, executed on a computing unit, causes the latter to carry out the method according to the invention. Such a computer program can be stored in the control unit.

The invention also includes a machine-readable storage medium on which the computer program according to the invention is stored. The control unit can have such a machine-readable storage medium.

• 1 eine angeforderte Anzeige für ein Wechselverkehrszeichen eines Anzeigequerschnitts;
• 2 einen Anzeigenplan;
• 3 eine Tabelle mit Anzeigemöglichkeiten und Gewichtungen;
• 4 ein Verkehrsleitsystem mit einer Steuereinheit;
• 5 ein weiteres Beispiel einer angeforderten Anzeige;
• 6 ein weiteres Beispiel eines Anzeigenplans;
• 7 eine Tabelle mit weiteren Anzeigemöglichkeiten und weiteren Gewichtungen;
• 8 angeforderte Anzeigen, und eine daraus berechnete kombinierte angeforderte Anzeige;
• 9 Einflussbereiche von Wechselverkehrszeichen; und
• 10 Übergangsanzeigepläne.

The characteristics, features and advantages of this invention described above, and the manner in which they are achieved, will become clearer and more clearly understood from the explanations of the following highly simplified schematic representations of preferred embodiments. Here show in each case a schematic representation

• 1 a requested display for a variable message sign of a display section;
• 2 an advertising plan;
• 3 a table with display options and weights;
• 4 a traffic control system with a control unit;
• 5 another example of a requested ad;
• 6 another example of an ad plan;
• 7 a table with further display options and further weightings;
• 8th requested ads, and a combined requested ad calculated therefrom;
• 9 areas of influence of variable message signs; and
• 10 Transitional Display Plans.

1 shows a requested display 100 for a three-lane roadway 10 with a left lane 11, a middle lane 12, a right lane 13 and a direction of travel 14, wherein vehicles (not shown) in lanes 11, 12, 13 can move in direction of travel 14 . Furthermore, four display sections 20, a first display section 21, a second display section 22, a third display section 23 and a fourth display section 24 are shown, each display section 20 having three variable message signs 30, one variable message sign 30 per lane 11, 12, 13. The first display section 21 is located at the rear in the direction of travel 14, the second display section 22 in the direction of travel in front of the first display section 21, the third display section 23 in the direction of travel in front of the second display section 22 and the fourth display section 24 in the direction of travel in front of the third display section 23. The variable message signs 30 are assigned to the lanes 11, 12, 13 here, but this does not necessarily have to be the case.

The requested display 100 includes a lane closure signal 31, which is to be displayed for the variable message sign 30 of the first display cross section that is assigned to the middle lane 12. Lane blocking signal 31 is shown as a diagonal cross, which is shown in real terms, for example, in the form of a red indicator light. Other representations of lane closure signal 31 are also conceivable, for example different representations in different countries. A completely red area could also be provided, for example.

• - Einlesen der angeforderten Anzeige 100 für mindestens ein Wechselverkehrszeichen 30 mindestens eines Anzeigequerschnitts 20;
• - Aufstellen von Bestimmungsgleichungen für eine diskrete Optimierung, wobei für die Bestimmungsgleichung Informationen über eine Topologie von Wechselverkehrszeichen 30 der Anzeigequerschnitte 20 sowie Signalisierungsregeln verwendet werden;
• - Berechnen einer Lösung der diskreten Optimierung, wobei die Lösung einen Anzeigenplan 110 der Anzeigequerschnitte 20 umfasst.

With the method according to the invention, a display plan for the display cross sections 20 can now be determined. The following steps can be carried out:

• - Reading in the requested display 100 for at least one variable message sign 30 of at least one display cross-section 20;
• - Setting up conditional equations for a discrete optimization, with information about a topology of variable message signs 30 of the display cross sections 20 and signaling rules being used for the conditional equation;
• - Compute a solution of the discrete optimization, the solution comprising a display map 110 of the display cross-sections 20.

2 shows a display plan 110 which is the result of the calculated solution of the discrete optimization of the method. The display plan 110 includes the lane closure signal 31 of the middle lane 12 assigned variable message sign 30 of the first display section 21 and a warning sign 32 for the middle lane 12 assigned variable message sign 30 of the second display section 22, the third display section 23 and the fourth display section 24. The warning sign 32 is shown as a triangle with an integrated exclamation mark, where the triangle can be red and the exclamation mark can be white or black, for example. Alternatively, the warning sign 32 can be a completely yellow area, for example.

3 shows a table with different display options 50 and different weightings 51 of the display options 50. In addition to the aforementioned lane closure signal 31 with a weighting of minus one hundred and the aforementioned warning sign 32 with a weighting of minus fifteen, there is also a lane change signal to the left 33 with a weighting of minus twenty, a lane change signal to the left right 34 with minus thirty weight, a first speed limit 35 (60 km/h) with minus ten weight, a second speed limit 36 (80 km/h) with zero weight, a third speed limit 37 (100 km/h) with ten weight and a fourth speed limit 38 (120 km/h) with a weighting of twenty is shown. As is usual in Europe, the speed limits 35, 36, 37, 38 are represented by numbers in a circle, the circle being red and the numbers being white or black. Of course, the representations of the display options 50 can differ for other regions or countries.

$$\text{x}\_1\_2\_80+\text{x}\_1\_1\_\text{Sperrung}=1$$

$$\text{x}\_1\_2\_100+\text{x}\_1\_1\_\text{Sperrung}=1$$

$$\text{x}\_1\_2\_120+\text{x}\_1\_1\_\text{Sperrung}=1.$$

In one exemplary embodiment, the discrete optimization is carried out in such a way that the conditional equations include parameters for different display options 50 of variable message signs 30, with a weighted function of the parameters of the different display options being maximized when the solution is calculated. For the requested ad 100 and ad plan 110 the 1 and 2 this can be done, for example, with the following algorithm and the display options 50 and weightings 51 of 3 take place. The left lane 11 is given index 0, the middle lane 12 index 1 and the right lane 13 index 2. The maximum index of a lane can be one less than the number of lanes 11, 12, 13. The first display section 21 is given the index 1, the second display section 22 is given the index 2, the third display section 23 is given the index 3 and the fourth display section 24 is given the index 4. The parameter x 0 2 then stands for the display of the variable message sign 30, which is assigned to the first lane 11 and the second display cross section 22 . The parameter x_1_1_Blocking is set equal to 1 by the requested display 100. As a result, x_1_1_blocking=1 is a first conditional equation for the discrete optimization. A signaling rule could be, for example, that 600 meters in driving direction 14 before the lane closure signal 31 only the lane closure signal 31, the warning sign 32 or the lane change signals 33, 34 should be displayed, but not the speed limits. The following relationships result for the variable message sign 30 of the second display cross section (x_1_2) assigned to the middle lane 12: $$\text{x}\_1\_2\_60+\text{x}\_1\_1\_\text{blocking}=1$$

$$\text{x}\_1\_2\_80+\text{x}\_1\_1\_\text{blocking}=1$$

$$\text{x}\_1\_2\_100+\text{x}\_1\_1\_\text{blocking}=1$$

$$\text{x}\_1\_2\_120+\text{x}\_1\_1\_\text{blocking}=1.$$

$$\text{x}\_1\_3\_80+\text{x}\_1\_1\_\text{Sperrung}=1$$

$$\text{x}\_1\_3\_100+\text{x}\_1\_1\_\text{Sperrung}=1$$

$$\text{x}\_1\_3\_120+\text{x}\_1\_1\_\text{Sperrung}=1$$

$$\text{x}\_1\_4\_60+\text{x}\_1\_1\_\text{Sperrung}=1$$

$$\text{x}\_1\_4\_80+\text{x}\_1\_1\_\text{Sperrung}=1$$

$$\text{x}\_1\_4\_100+\text{x}\_1\_1\_\text{Sperrung}=1$$

$$\text{x}\_1\_4\_1200+\text{x}\_1\_1\_\text{Sperrung}=1.$$

The indices 60, 80, 100 and 120 stand for the speed limits 35, 36, 37, 38. Similarly, for the third display cross section 23 and the fourth display cross section 24: $$\text{x}\_1\_3\_60+\text{x}\_1\_1\_\text{blocking}=1$$

$$\text{x}\_1\_3\_80+\text{x}\_1\_1\_\text{blocking}=1$$

$$\text{x}\_1\_3\_100+\text{x}\_1\_1\_\text{blocking}=1$$

$$\text{x}\_1\_3\_120+\text{x}\_1\_1\_\text{blocking}=1$$

$$\text{x}\_1\_4\_60+\text{x}\_1\_1\_\text{blocking}=1$$

$$\text{x}\_1\_4\_80+\text{x}\_1\_1\_\text{blocking}=1$$

$$\text{x}\_1\_4\_100+\text{x}\_1\_1\_\text{blocking}=1$$

$$\text{x}\_1\_4\_1200+\text{x}\_1\_1\_\text{blocking}=1.$$

Furthermore, it can result from the signaling rules that there should not be free travel ahead of a lane blocking signal 31, so that one of the display options 50 is displayed. This results in a further conditional equation for the variable message sign 30 of the second display cross section assigned to the middle lane 12: $$\begin{array}{l}\text{x}\_1\_2\_\text{blocking}+x\_1\_2\_\text{warning}+x\_1\_2\_\text{exchange links}+\\ \text{x}\_1\_2\_\text{right of exchange}+\text{x}\_1\_2\_60+\text{x}\_1\_2\_80+\text{x}\_1\_2\_100+\\ \text{x}\_1\_2\_120=1.\end{array}$$

The parameters of all display options 50 of all variable message signs 30 can now be multiplied by the weightings 51 and summed up, with this sum being maximized by the discrete optimization under the boundary conditions given by the determination equations.

The topology of the variable message signs 30 can also be taken into account by the conditional equations, the topology in particular having an influence on which parameters are mutually exclusive.

By maximizing the sum as described above and choosing the weights 51 as in 3 shown, it can be achieved that the solution is the one that can be assumed to have the least impact on the traffic flow. In particular, the weightings 51 can be carried out in such a way that less intrusive display options 51 are weighted more highly.

It can be provided that all parameters x are either zero or one. This enables a particularly simple calculation of the advertising plan 110.

In addition to the algorithm described, in which the discrete optimization takes place by means of integer linear optimization, other discrete optimization methods are also conceivable, for example linear optimization with subsequent selection of discrete display images of the individual variable message signs 30.

4 shows a traffic control system 1, in which the four display cross sections 21, 22, 23, 24 of the roadway 10 are designed as already described. The traffic management system 1 also has a control unit 2 which has a computing unit 3 , an input interface 4 and output interfaces 5 . The output interfaces 5 are connected to input interfaces 6 of the four display cross sections 21, 22, 23, 24. The input interface 5 is connected to an input computer 7 . An operator can input the requested display 100 using the input computer 7 . The processing unit 3 then carries out the method and outputs the display plan 110 or control signals derived from the display plan 110 via the output interfaces 5 to the display cross sections 21 , 22 , 23 , 24 which then display the display plan 110 . A machine-readable storage medium 8 , which is assigned to the processing unit 3 , is shown as an option. A computer program, comprising program code, which is executed on the computing unit 3 and causes it to carry out the method according to the invention, can be stored in the machine-readable storage medium 8 . In particular, this can include a hard drive, a flash memory, a DVD, a CD-ROM and other storage media.

The information about the topology, the signaling rules and the requested display 100 can be stored in an input file and made available to the control unit 2 by the input computer 7 . When the requested display 100 is read, the input file can then be read.

5 shows another example of a requested display 100 for a three-lane roadway 10 with four display cross sections 20, which is the requested display 100 of FIG 1 provided that no differences are described below. Each display cross-section 20 has five variable message signs 30, one variable message sign 30 per lane 11, 12, 13 analogous to 1 and two cross-lane variable message signs 30.

The requested display 100 includes a lane closure signal 31, which is to be displayed for the variable message sign 30 of the first display cross section that is assigned to the middle lane 12. An advertisement plan can also be created from this requested advertisement 100 using the method according to the invention.

6 shows the display plan 110, which is the result of the calculated solution of the discrete optimization of the with the requested display 110 of the 5 procedure carried out. The display plan 110 includes the lane closure signal 31 of the variable message sign 30 assigned to the middle lane 12 of the first display cross section 21. The display plan 110 also includes the third speed limit (80 km/h) for all the first lane 11 and the third lane 13 assigned variable message sign 30 and the The variable message sign 30 of the third display cross section 23 and the fourth display cross section 24 assigned to the second lane 12. The display plan 110 also includes a warning sign 32 for the cross-lane variable message sign 30 of the second display cross section 22, the third display cross section 23 and the fourth display cross section 24.

7 shows a table with different display possibilities 50 and different weightings 51 of the display possibilities 50, whereby the display possibilities 50 can be provided for the variable traffic signs 30 crossing lanes. In addition to the already described warning signal 32 with a weighting of minus fifteen, there is an overtaking ban 41 with a weighting of minus thirty, a truck overtaking ban 42 with a weighting of minus twenty and a tonnage restriction 43 with a weighting of minus fifty. An index that corresponds to the number of lanes 11 , 12 , 13 can be provided for each of the variable message signs 30 spanning the lanes.

8th shows how conflicting advertising plans can be dealt with using the method according to the invention. Reference symbols of the display options 50 refer to the ones shown in FIGS 3 and 7 Display options 50 shown. A requested display 100 includes a lane blocking signal 31 and a first speed limit 35. From this, a display plan 110 with a lane blocking signal 31, a lane change to the left 33, several first speed limits 35 and several second speed limits 36 is calculated using the method according to the invention. Another requested display 102 includes a lane closure signal 31 and a second speed limit 36. From this, another display plan 112 with a lane closure signal 31, a lane change to the right 34, several first speed limits 35 and several second speed limits 36 is calculated using the method according to the invention.

If the advertising plan 110 and the further advertising plan 112 do not contain any common variable message signs 30, both advertising plans 110, 112 are output. In 8th however, the case is shown in which the display plan 110 and the further display plan 112 contain at least one variable message sign 30 in common. In this case, a combined requested advertisement 104 is calculated and the method for the combined requested advertisement 104 is performed again and a combined advertisement schedule 114 is calculated. This combined ad plan 114 can then be output.

in 8th In the exemplary embodiment shown, the combined requested display 104 is determined in such a way that the requested display 100 is compared with the further display plan 112 and all variable message signs 30 are removed from the requested display 100 for which the further display plan 112 provides more restrictive display options and the further requested display 102 is compared with the display plan 110 and all variable message signs 30 for which the display plan 110 provides more restrictive display options are removed from the further requested display 102 . The combined requested display 104 contains all variable message signs or further variable message signs remaining in the requested display 100 and the further requested display 102 . Referring to the in 8th In the example shown, this means that the first speed limit 36 is removed from the requested display 100, since the further display plan 112 provides a lane change signal to the right 34 here and the second from the further requested display speed limit 36 is removed because the display plan 110 provides for a lane change signal to the left 33 here. Thus, only the lane blocking signals 31 remain in the combined requested display 104. The combined display plan 114 calculated from the combined requested display 104 includes lane blocking signals 31, a lane change signal to the left 33, a lane change signal to the right 34 and first speed limits 35 and second speed limits 36 in connection with 8th The method explained can be used to ensure that a combined advertisement plan 114 that corresponds to the signaling rules can be calculated even when the advertisements 100, 102 requested are actually contradictory.

Provision can be made for the weighting factors already mentioned to be used for this. There can be a relationship between the weighting factors and a restriction on the display options 30 . In this case, more restrictive display options can be, in particular, those which indicate a poorer traffic flow and thus have a lower and, in particular, a negative weighting.

9 shows a requested ad 100 corresponding to requested ad 100 of 1 is equivalent to. The information about the topology of variable message signs 30 of the display cross sections for each variable message sign of the display cross sections 21, 22, 23, 24 includes a list of possibly affected variable message signs 30, the method being carried out iteratively. A first area of influence 121 includes the variable message signs 30 possibly influenced by the variable message sign 30 with the requested display (lane closure signal 31). In 9 these are the other variable message signs 30 of the first display cross section 21 and the variable message sign 30 of the second display section assigned to the middle lane 12 . In a first iterative step, the advertisement plan is only calculated for the first sphere of influence 121 . The display plan calculated for the first area of influence 121 results in a second area of influence 122, with the second area of influence containing those variable message signs 30 that may be affected by the variable message signs 30 of the variable message signs to be taken into account when implementing the display plan calculated for the first area of influence 121. A third area of influence 123 and a fourth area of influence 124 can be determined analogously. Overall, further variable message signs 30 are taken into account in each further iterative step, with the further variable message signs 30 being those that are part of the lists of possibly influenced variable message signs 30 of the variable message signs 30 to be considered when implementing the display plan. The process is carried out until the ad plan no longer changes in an iterative step. In this way, a computationally efficient method for determining the advertisement schedule can be provided.

10 shows transitional display plans 131, 132, with which the at least one variable message sign 30 of the at least one display cross section 20 can be transferred from a current display plan to the display plan 110 determined by the method. Transitional rules can be followed. The requested display 100 can be analogous to 1 The signaling rules show that the variable message sign 30 assigned to the middle lane 12 of the second display cross section 22 also sends a lane closure signal 31 and the two variable message signs 30 arranged in front of it and assigned to the middle lane 12 of the third display cross section 23 and the fourth display cross section 24 each send the warning signal 32 should show. It can be provided, for example, that no variable message sign can switch directly from an empty display to the lane closure signal 31 . Furthermore, it can be provided that no variable message sign 30 may change over if a variable message sign also has to change over in the direction of travel 14 in front of the relevant variable message sign 30 . Furthermore, it can be provided that variable message signs 30 arranged behind a variable message sign 30 in the direction of travel 14 may only switch over if the two variable message signs 30 display different display options.

Related to 10 this means that initially all the variable message signs 30 assigned to the middle lane 12 switch over to the warning sign 32 . This represents a transitional display plan 131. This is signaled in the display plan 110 by the letter W being assigned to all variable message signs 30 in the middle lane, the W standing for switching to warning signs. Starting from the first transition display plan 131, the variable message sign 30 of the third display cross section 23 and the fourth display cross section 24 assigned to the middle lane 12 is now assigned a zero, since these are already in the final state. The variable message sign 30 of the second display cross section 22 assigned to the middle lane 12 is assigned a one, since this variable message sign 30 is to switch further in the next step (to the lane blocking signal 31). The variable message sign 30 of the first display cross section 21 assigned to the middle lane 12 the letter V is assigned because this variable message sign 30 is not yet allowed to switch, i.e. it should only switch with a delay, since the variable message sign 30 (of the second display cross section 22) in front of it in the direction of travel 14 also has to switch. The variable message sign 30 of the first display cross section 21 assigned to the middle lane 12 therefore continues to display the warning sign 32 . This represents a further transitional display plan 132, with the further transitional display plan 132 now being transferred to the display plan 110 by switching over the variable message signs 30 of the first display cross section 21 assigned to the middle lane 12. This is illustrated further in transition display plan 132 in that the variable message signs 30 of the second display cross section 22, the third display cross section 23 and the fourth display cross section 24 assigned to the middle lane 12 are each assigned a zero, which signals no further switching, and the one assigned to the middle lane 12 Variable message sign 30 of the first display cross-section 21 is assigned a one, and thus this variable message sign 30 may switch in the next step.

The at least one variable message sign 30 of the at least one display cross section 20 is therefore operated according to a current display plan and a transitional display plan 131 or a number of transitional display plans 131, 132 are calculated. By means of the transition advertisement plan 131 or the transition advertisement plans 131, 132, a transition from the current advertisement plan to the calculated advertisement plan 110 is carried out.

In an exemplary embodiment, the transition display plan 131 or the transition display plans 131, 132 are calculated in such a way that further conditional equations are set up for a discrete optimization. Rules for permitted transitions of variable message signs 30 are used for the further determination equations. The further conditional equations include further parameters for different transition possibilities of the variable message signs 30. A further solution of the further discrete optimization is then calculated, with a weighted function of the further parameters of the different transition possibilities being maximized when the further solution is calculated.

In the transition from the first transitional display plan 131 to the second transitional display plan 132, the following further conditional equations can be used, the indices being as in connection with the 1 until 3 and parameter W (Warning Sign) has the weight minus one hundred ten, parameter Zero (no further change) has the weight minus one hundred, parameter V (Delayed Change) has the weight ten and parameter One (change to the next symbol) has the weight one hundred receives.

A first further conditional equation results from the fact that the variable message sign 30 assigned to the middle lane 12 of the third display cross section 23 is not delayed and the variable message sign 30 assigned to the middle lane 12 of the second display cross section 22 is therefore allowed to switch: $$\text{x}\_1\_2\_\left[1\right]+\text{x}\_1\_3\_\left[\text{V}\right]=1$$

A second further conditional equation results from the fact that the variable message sign 30 assigned to the middle lane 12 of the first display cross section 21 and the variable message sign 30 assigned to the middle lane 12 of the second display cross section 22 must not switch at the same time: $$\text{x}\_1\_1\_\left[1\right]+\text{x}\_1\_2\_\left[\text{1}\right]=1$$

Now the further parameters of all switching options (V, W, 0, 1) of all variable message signs 30 can be multiplied by the further weightings and summed up, this sum being maximized by the discrete optimization under the boundary conditions given by the further determination equations. It can be provided that the further parameters are zero or one.

In particular, those related to 1 until 7 explained process steps with the process steps of 8th and/or the 9 and/or the 10 be combined.

Although the invention has been illustrated and described in detail by the preferred embodiment, the invention is not limited by the disclosed examples and other variations can be derived therefrom by those skilled in the art without departing from the scope of the invention.

Claims (15)

Method for driving a plurality of display cross sections (20, 21, 22, 23, 24), with the following steps: - Reading in a requested display (100) for at least one variable message sign (30) of at least one display cross section (20, 21, 22, 23, 24); - Setting up conditional equations for a discrete optimization, information about a topology of variable message signs (30) of the display cross sections (20, 21, 22, 23, 24) and signaling rules being used for the conditional equation; - calculating a solution of the discrete optimization, the solution comprising a display map (110) of the display cross-sections (20, 21, 22, 23, 24). procedure after claim 1 , wherein the method is carried out in a computing unit (3) of a traffic control system (1) and control signals are output to the display cross sections (20, 21, 22, 23, 24) on the basis of the display plan (110). procedure after claim 1 or 2 , wherein the information about the topology, the signaling rules and the requested display (100) are stored in an input file and the input file is read when the requested display (100) is read. Procedure according to one of Claims 1 until 3 , wherein the conditional equations include parameters for different display options (50) of the variable message signs (30), wherein a weighted function of the parameters of the different display options (50) is maximized when the solution is calculated. procedure after claim 4 , where the parameters are either zero or one. Procedure according to one of Claims 1 until 5 , wherein the information about the topology of variable message signs (30) of the display cross sections (20, 21, 22, 23, 24) for each variable message sign (30) of the display cross sections (20, 21, 22, 23, 24) a list of possibly affected variable message signs ( 30), wherein the method is carried out iteratively, first for the variable message sign (30) possibly influenced by the variable message sign (30) with the requested display (100), with further variable message signs (30) being taken into account in each further iterative step, the further variable message signs (30) are those that are part of the lists of possibly influenced variable message signs (30) of the variable message signs (30) to be taken into account when implementing the display plan (110), and the method is carried out until an iterative Step the ad plan (110) no longer changes. Procedure according to one of Claims 1 until 6 , wherein the method for a further requested display (102) for at least one further variable message sign (30) of at least one display cross section (20, 21, 22, 23, 24) is carried out, with a further display plan (112) being determined, wherein for the If the advertisement plan (110) and the further advertisement plan (112) contain at least one common variable message sign (30), a combined requested advertisement (104) is calculated and the method for the combined requested advertisement (104) is carried out again and a combined advertisement plan (114) is calculated. procedure after claim 7 , wherein when the combined requested display (104) is calculated, the requested display (100) is compared with the further display plan (112) and all variable message signs (30) are removed from the requested display (100) for which the further display plan (112 ) provides more restrictive display options (50) and wherein the further requested display (102) is compared with the display plan (110) and all variable message signs (30) are removed from the further requested display (102) for which the display plan (110) has more restrictive display options (50) provides, wherein the combined requested display (104) contains all variable message signs (30) or further variable message signs (30) remaining in the requested display (100) and the further requested display (102). Procedure according to one of Claims 1 until 8th , wherein the at least one variable message sign (30) of the at least one display cross section (20, 21, 22, 23, 24) is operated according to a current display plan and a transitional display plan (131) or several transitional display plans (131, 132) are calculated, with the transitional display schedule (131) or transitional display schedules (131, 132) a transition is made from the current ad plan to the calculated ad plan (110). procedure after claim 9 , wherein the transition display plan (131) or the transition display plans (131, 132) are calculated in such a way that further conditional equations are set up for a discrete optimization, with rules for permitted transitions of the variable message signs (30) being used for the further conditional equations, with the further conditional equations further parameters for different transition possibilities of the variable message sign (30) and then a further solution of the further discrete optimization is calculated, wherein a weighted function of the further parameters of the different transition possibilities is maximized when calculating the further solution. procedure after claim 10 , where the other parameters are zero or one. Control unit (2) with an input interface (4) for at least one requested display (100), a computing unit (3) for carrying out the method according to one of Claims 1 until 11 and an output interface (5) for the advertisement plan (110). Traffic control system (1) with a control unit (2). claim 12 and at least one display section (20, 21, 22, 23, 24), the display section (20, 21, 22, 23, 24) having an input interface (6) which is connected to the output interface (5) of the control unit (2). and wherein the display cross section (20, 21, 22, 23, 24) is set up to receive control signals derived from the display plan (110) via the input interface (6) and to operate variable message signs (30) on the basis of the control signals. Computer program, comprising program code which, executed on a computing unit (3), causes it to carry out the method according to one of Claims 1 until 11 to perform. Machine-readable storage medium (8) on which a computer program Claim 14 is saved.

Images