EP0818898A2 - Method and means for selecting digitally coded traffic messages - Google Patents

Abstract

The method involves providing a selection of digitally encoded traffic reports output to a receiver. A priority identifying the degree of the respective traffic hold-ups is allocated to the received traffic reports. In dependence on the number of the traffic reports, the reports to be output are selected according to the priority. The priority may be derived from the occurrence of a respective received traffic report. The highest priority is allocated when a traffic report of a special category, such as extra-urgent, is received. The method involves using a receiver with a decoder for digitally encoded the reports. The decoder includes an event list for decoding the reports. In the list, for each event a priority is carried out according to the effect of events on the traffic flow. The apparatus also has a memory storing the priorities.

Description

The invention relates to a method and a device for the selection of digitally coded traffic reports the output in a recipient.

With the radio data system (RDS) an additional and inaudible transmission of digital data parallel to Broadcast programs in a data channel. Specifications of the radio data system for FM radio are among others in the publication Tech. 3244-E, March 1984 of the European Runfunk Union (EBU). Radio receivers with suitable RDS decoders can transmitted data in addition to radio reception with the Record and decode the same receiver. For the Data transmission is 32 groups of 104 bits each provided, each of the transmitted groups one each certain service is assigned. Group 8a is for Time for the transmission of digitally coded Traffic announcements provided.

The structure and coding of these traffic reports are in CEN Draft pr. ENV / 278/4/1/0011 set on the Standard proposal ALERT C, December 1995, published by the RDS ATT ALERT Consortium. The essential elements A traffic announcement is the place of the event (Location) and the event (Event). These details are cataloged, that is, every traffic-relevant place and a unique code for every traffic-relevant event is assigned. The concatenation of the locations in the location table along existing roads shows the course. Except the usual facilities of a receiving device with a RDS decoders are used to use the traffic information channel TMC (Traffic Message Channel) Decoding devices for Storage, further processing and output of the Traffic announcements required.

Due to the presence of digital traffic reports including the location information contained therein is one Selection of the traffic reports to be output according to before entered selection criteria possible. So can for example the user of a suitably equipped one Enter the recipient that only traffic reports are issued should be a previously entered region or street affect.

A facility for managing digitally encoded Traffic announcements in receivers, which such Selection is possible, for example, in German Patent application 195 03 415 described. Such However, selection requires a certain amount of operating effort Enter the selection criteria. Even if the respective Position of the vehicle by a locating device, for example GPS, is an input of the geographic area of interest as a rule required. However, no entry is made Selection criterion, if there are many Traffic delays also a lot of traffic reports transmitted, received and issued by the recipient. This leads to an unnecessary flood of information for the user who if necessary, is distracted from the traffic or ignored really important traffic reports.

The object of the present invention is to make a selection of the traffic reports to be output enable if the user has no selection criteria can be entered. Even if the user Entering selection criteria, the number of output Traffic reports can be confusing. This is for example possible if the user is very general Enter selection criteria or if extremely many Traffic obstructions exist and are reported. For in this case, the method according to the invention is intended reasonable further selection of the output Enable traffic reports.

This object is achieved in the method according to the invention solved in that received traffic reports a Significant degree of the respective traffic obstruction Priority is assigned and that depending on the Number of traffic reports to be output Traffic announcements can be selected according to priority. It is preferably provided that with increasing Number of traffic reports received is a priority the relevant selection threshold raised for the output becomes.

For coding the digitally coded traffic reports an event list required to perform the method according to the invention by one Priority information per entry is added. In doing so the priorities of numerical values are given, whereby for example, high priority through high Numerical value is reproduced. In the event list after The above proposed standard is already information on the Urgency provided. However, these only show three different values (normal, urgent and very urgent) and are a sensible selection when issuing the Traffic reports not very suitable.

The traffic information stored in the receiver's memory are generally valid for a limited time. Either they are through one in the traffic announcement contained time specification invalid or by a corresponding Revoke traffic report (traffic jam has cleared). For the purposes of the method according to the invention are preferred the number of valid ones in memory Traffic reports decisive.

An advantage of the method according to the invention is that a Not many drivers of motor vehicles Traffic announcements is irritated if he is at the appropriate Traffic situation no or an unsuitable selection criterion has entered. For example, a Motor vehicle driver on a short distance trip Freeway used from one junction to the next, hardly therefore a selection of traffic reports on his Set the receiver. With the help of the invention In such a case, the procedure will also include the number of issued traffic reports restricted, however important traffic reports are still issued, for example, notices of wrong-way drivers or on Full closures.

There is a further development of the method according to the invention in that the priority from the event of each received traffic message is derived and that the highest priority is assigned when a traffic announcement a special category (x-urgent) is received. In order to allows traffic reports to be prioritized can be assigned without this being already from the transmitter are added to the traffic reports, which for the existing standard proposals only for the special Category (x-urgent) is provided.

Another development of the method according to the invention is that with less than a first number of received traffic reports traffic reports of all Priorities are given and that with a number received traffic reports larger than a second Number is, at least all traffic reports with the highest priority. With this Continuing education ensures that a first Number of traffic reports received for one average user does not find it irritating no limitation of the information is made. Of the For example, users then get a picture of the general Traffic situation. Furthermore, through this training ensures that extremely important traffic reports, such as for example references to wrong-way drivers, in any case be issued.

This development can preferably be designed in this way be that with a number of received Traffic reports between the first and the second Number is, with increasing number with low priority starting with an increasing number of traffic reports is issued. It can be provided that the number of the traffic reports issued between the first and the second number is kept constant. With the latter is a maximum amount to the user, so to speak Traffic announcements guaranteed, on which a suitable text in the instruction manual of the recipient.

Are among the traffic reports received numerous with the same priority, so the Number of traffic reports to be output by leaps and bounds change so that there may be fewer traffic reports be issued as intended. Another one Further development of the method according to the invention is therefore provided that if necessary by several Traffic announcements with the same priority received later Traffic announcements are reproduced preferentially.

In terms of the nature of the events, it has proven to be highlighted favorably when received traffic reports can be assigned to one of six priorities. The However, the method according to the invention can also be used with a different number of priorities.

An advantageous embodiment of the invention The procedure is that there is also an area selection is carried out and that those traffic reports are issued by the priority and by the Area selection are selected.

In another advantageous embodiment provided that a selection based on priority is omitted if an area selection is activated.

A device for carrying out the method according to a of the preceding claims in a receiver with a Decoder for digitally coded traffic reports, the one Event list for decoding the digitally coded Contains traffic reports is designed such that in a priority according to the event list for each event the impact of the event on the flow of traffic is listed and that a memory for received Traffic announcements is provided, in which also the out priorities read from the event list can be filed.

Fig. 1

ein Ablaufdiagramm zur Erläuterung einer ersten Ausführungsform des erfindungsgemäßen Verfahrens,

Fig. 2

ein Ablaufdiagramm zur Erläuterung einer zweiten Ausführungsform des erfindungsgemäßen Verfahrens,

Fig. 3

ein Blockschaltbild eines zum Empfang und zur Ausgabe von digitalen Verkehrsmeldungen ausgebildeten Empfängers, der zur Selektion der Verkehrsmeldungen nach dem erfindungsgemäßen Verfahren geeignet ist,

Fig. 4

ein Ablaufdiagramm zur Erläuterung der Eingabe eines Selektionskriteriums durch den Benutzer,

Fig. 5

ein Ablaufdiagramm der Initialisierung des Empfängers nach dem Einschalten,

Fig. 6

ein Ablaufdiagramm zur Erläuterung des Empfangs, der Prüfung und der Speicherung einer Verkehrsmeldung,

Fig. 7

ein Ablaufdiagramm zum Löschen und Ungültigwerden einer Verkehrsmeldung und

Fig. 8

ein Ablaufdiagramm zur Erläuterung einer dritten Ausführungsform des erfindungsgemäßen Verfahrens.

Exemplary embodiments of the invention are shown in the drawing using several figures and are explained in more detail in the following description. It shows:

Fig. 1

1 shows a flowchart to explain a first embodiment of the method according to the invention,

Fig. 2

2 shows a flowchart to explain a second embodiment of the method according to the invention,

Fig. 3

2 shows a block diagram of a receiver designed for receiving and outputting digital traffic reports, which is suitable for selecting the traffic reports according to the inventive method,

Fig. 4

1 shows a flowchart to explain the entry of a selection criterion by the user,

Fig. 5

a flowchart of the initialization of the receiver after switching on,

Fig. 6

1 shows a flowchart to explain the reception, testing and storage of a traffic report,

Fig. 7

a flowchart for deleting and invalidating a traffic report and

Fig. 8

a flowchart to explain a third embodiment of the method according to the invention.

n =

nein,

y =

ja,

TMC =

Traffic Message Channel als internationale Bezeichnung für die Übertragung von digital codierten Verkehrsmeldungen innerhalb des Radio-Daten-Signals,

TM =

Verkehrsmeldung,

n (innerhalb der Kästchen) =

Anzahl der Verkehrsmeldungen,

SEL =

Selektionskriterium,

REC =

Empfänger oder empfangen,

MEM =

Speicher oder gespeichert,

LIST =

Liste,

ACT =

aktualisiert,

TS =

Zeitstempel (Time Stamp).

The following abbreviations or
Formula symbols used:

n =

No,

y =

Yes,

TMC =

Traffic Message Channel as an international term for the transmission of digitally coded traffic reports within the radio data signal,

TM =

Traffic announcement,

n (inside the boxes) =

Number of traffic reports,

SEL =

Selection criterion,

REC =

Recipient or received,

MEM =

Memory or saved

LIST =

List,

ACT =

updated,

TS =

Time stamp.

Before going into the flow diagrams in FIGS. 1 and 2 first becomes the receiver shown in FIG. 3 explained. This is shown as a block diagram, which does not mean, however, that he is on a realization with Help from individual circuits corresponding to the blocks is limited. Rather, the recipient is in particular advantageously with the help of highly integrated Circuits possible. Digital Signal processors are used, which with suitable Programming the shown in the block diagrams Perform functions.

Fig. 3 shows some to explain the invention required modules of a radio receiver and in dashed framed part especially for the Existing modules. The ones to be received Signals are sent to a receiving part 2 via an antenna 1 fed to the output of which an RDS decoder 3 is connected is. To control the radio receiver via a Operating unit 4 serves a microcomputer 5. This is about a frequency adjuster 6 with a control input of the Receiving part 2 and with a control input one Audio amplifier 7 connected to the desired station and the playback parameters, such as volume, treble and Depth increase, etc. To an exit of the Audio amplifier 7, a speaker 8 is connected. The microcomputer 5 is also connected to a clock 9, from which data can be called up, which the date and represent the time.

At the center of the traffic information processing (TMC) serving facilities is another Microcomputer 11. This is the output signals of RDS decoders 3 supplied, from which the traffic reports be selected. The TMC microcomputer 11 is via a Device 12 for handling the operation with the Microcomputer 5 connected. For example Commands from the control unit 4 processed to messages output or edit selection criteria that in a designated non-volatile Read / write memory 13 are stored.

In the receiver shown in Fig. 3 is one Provided speech. This will be done in a Speech synthesis device 14 which decoded at 15 Traffic reports converted into voice signals and the Audio amplifier 7 fed. Additionally or alternatively can also be an optical output by characters or other symbols can be made. Traffic announcements and Administrative data records are stored in the memory 13. Read-only memories 16 and 17 contain a location list and an event list.

The following shows a section of the event list stored in the read-only memory 17, which contains, in addition to the information according to the aforementioned standard proposal, the priority assigned to the respective event in a column P. The information according to the proposed standard is a text in column T that is written in the respective national language and in the code column the code to be transmitted in each case. The columns N, Q, T, D, U and C are of no importance for the method according to the invention and are therefore not explained further. T code N Q T D U C. P ... Traffic obstruction 1 D 1 U 1 2nd traffic jam 101 D 1 U 1 4th 1 km traffic jam 102 D 1 U 1 3rd 2 km traffic jam 103 D 1 U 1 3rd 3 km traffic jam 129 D 1 U 1 3rd 4 km traffic jam 104 D 1 U 1 3rd 6 km traffic jam 105 D 1 U 1 4th 10 km traffic jam 106 D 1 U 1 4th blocked 489 L 1 U 5 5 Connection lane closed 478 L 1 U 5 5 Parallel lane blocked 479 L 1 U 5 4th right-hand lane blocked 480 L 1 U 5 4th left lane blocked 481 L 1 U 5 4th Fast Lane blocked 482 L 1 U 5 4th Long-distance lane blocked 483 L 1 U 5 4th Local traffic lane blocked 484 L 1 U 5 3rd Accident, road closed 240 1 D 1 U 5 5 ...

Like the rows in the event list listed as examples show, those events or traffic reports, which have only a slight disturbing effect, a small one Priority assigned, while for major disturbances higher priority was chosen. As part of development one suitable for the method according to the invention The recipient is initially compared to the known recipient an expansion of the event list by the column priority required. Then each of the approximately 1400 events evaluated for its impact on traffic flow and classified accordingly. The list is then in the Memory 17 (Fig. 3) filed and forms the basis for the selection of traffic reports using the inventive method.

The flow diagram according to FIG. 2 represents the essential ones Parts of a program to carry out the first Embodiment of the inventive method in TMC microcomputer 11 (Fig. 3). In addition to those shown Programs are still more in the TMC microcomputer 11 Programs processed, for example to control the Voice output. In the program shown in Fig. 1 first waited at 21 whether a selected output of Traffic announcements TM should take place. This can started, for example, by an entry in this regard will. Then at 22 the current one Message counter reading n "frozen". At 23 one Count variable i set to 1, followed by another one at 24 Counter variable j is also set to 1.

At 25, the program branches depending on whether the current message counter reading is less than or equal to the number n _j of traffic reports with priority ≥ _j . The respective values for n _j are specified in a previous initialization (FIG. 5). If this condition is not met, j is incremented at 26 and branch 25 is run through again. This continues until n is equal to or less than n _j . A selection threshold P of the priority of the traffic reports to be output is then set to 27 at 27. The following parts of the program are used to select and output traffic reports whose priority is greater than or equal to the selection threshold P. This is first checked at 28 for each traffic report currently in memory. If applicable, the respective traffic report TM _{i is} output at 29.

After that - just like in the case of a smaller one Priority of a traffic report - at 30 the count variable i incremented for the traffic reports TM. After a Check 31 whether i is greater than n becomes the selection repeated until i is greater than n, whereupon the 1 is ended. At 32 is in the Flow charts according to Fig. 1 and Fig. 2 one place referred to, on which the program described in Fig. 8 for further selection can be inserted.

The program shown in Fig. 2 starts like the program 1 first with a query 41 whether an output should be started by traffic reports. After that, at 42 n are frozen and the count variables i and j are each set to 1. In program part 43 the current one Distribution of the number of traffic reports over the Priorities identified. In the example shown are for example 55 traffic reports with one of the Priorities 1 through 6 exist. 45 of them have one of the Priorities 2 to 6, of which 35 were traffic reports assigned one of the priorities 3 to 6. 25 traffic reports have one of the priorities 4, 5 or 6, 15 Traffic reports one of the priorities 5 or 6 and only 5 Priority 6 traffic reports.

At 44, the count variable j is reset to 1, whereupon the program parts 45 and 46 determine which priorities are to be allowed for the message output. For this purpose, the program branches at 45 depending on whether n _{k is} greater than or equal to n _j and whether j is less than 6. Here n _{j is} the value determined in each case at 43. If this condition does not apply, the same check is carried out with a priority increased by 1 at 46. If the condition applies, it is checked at 47 whether n _{j is} greater than n _k . N _{k is} the number of traffic reports to be issued, which is only exceeded if more than n k = n const . Traffic reports with the highest priority P = 6 are received, because these traffic reports should always be output.

If n _j , that is to say the number of traffic reports with priority j or higher, which was determined in program parts 45 and 46, but greater than the constant number n _k of 20, for example, the difference n _{D is} determined in a program part 48 . This means that after determining a selection threshold P = j, more than n _k traffic reports would be selected. However, since only n _k traffic reports are to be output, the n _D oldest traffic reports are determined at 49.

At 50, i is reset to 1. In program part 51 the priority P (TM _i ) of each traffic report is checked. If the priority is less than the selection threshold P = j, i is incremented at 52 and the next traffic report is checked at 51. However, if the priority is sufficient for an output, a branch follows at 53 depending on whether the priority P (TM _i ) is equal to j. If this is not the case, ie with higher priorities, the traffic message TM _{i is} output at 54.

However, if the priority P (TM _i ) is equal to j, a check must be made before outputting whether this traffic report belongs to the older traffic reports determined at 49. This is done in the program part 55. It is not the respective traffic message oldest to the n _D, it is output at the 54th Otherwise, the program continues at 56 depending on whether i has reached the value n. As long as this is not the case, i is incremented at 52 and a further traffic report is selected. However, if i equals n, the program ends.

Fig. 4 shows a flow chart for explaining the input a selection criterion by the user, like it for example also in the known selection processes takes place. At 61, a query is made as to whether a Selection criterion should be entered. Isn't that the case, the program is exited without further effect. If a selection criterion is to be entered, this will be carried out at 62, for example a selection criterion "A7" (Autobahn No. 7) or "Stadt München" what to say Should only traffic reports, which a street or a concern geographic area to be spent. At 63 the selection criterion is activated, that is, it is stored in a memory, so that Selection program has access to the selection criterion and apply it to the selection.

Fig. 5 shows a program for initialization after the Switch on at 64, then at 65 the message memory is deleted and the message counter n is set to 0. At 66 there is a specification of the number of received traffic reports what priorities for output to lead. In the example shown it is determined that with up to ten received and currently in memory existing traffic reports all with a priority of P ≥ 1 - i.e. all - should be output. At up to Twenty traffic reports are only supposed to be given to those with one Priority two or higher are issued, etc.

With 50 to 100 traffic reports, only traffic reports with the highest priority are output. The values n ₁ to n ₆ are used at 25 in the program according to FIG. 1 as n _j . In program part 66, a number n _k is also specified for use in the program according to FIG. 2, which specifies the maximum number of traffic reports to be output - except for traffic reports with the highest priority.

Fig. 6 shows a program for reception, for testing and for Storage of traffic reports. The branch is 71 Part of a waiting loop that is only exited when one Traffic announcement TM was received (REC). Then branches the program at 72 depending on whether this Traffic announcement already exists in the memory MEM. Is if this is the case, the time stamp of this traffic announcement becomes updated at 73 so that the traffic report a Receives timestamp which corresponds to the time of the respective corresponds to the last reception of the traffic announcement. Thereupon the program returns to the waiting state.

If, however, it is determined at 72 that the traffic report is not yet present in the memory, it is checked at 74 whether the traffic report can be decoded and output. One criterion for this is, among other things, the existence of the location and event information contained in the traffic report in the corresponding lists stored in the receiver. If the traffic message cannot be decoded, it is discarded, whereupon the program returns to the waiting state. This also follows if it is determined at 75 that the total of n traffic reports present are not less than the maximum storable number n _max of traffic reports. However, if traffic reports can still be saved, the traffic report just received is saved at 76 and the message counter n is incremented at 77. Alternatively, the currently received traffic announcement is exchanged for the "oldest" traffic announcement, if n = n Max is.

So that the message memory does not contain traffic reports remains filled, which are no longer current, so that newer Traffic reports can no longer be saved measures for deleting the TMC system Traffic announcements provided. These exist, for example in special deletion messages that state that a previously broadcast traffic announcement is no longer valid and in Memory can be deleted. In addition, one can Traffic announcement when broadcast a lifetime be added.

Fig. 7 shows a program for deleting stored ones Traffic reports based on this received information. At 81 it is checked whether a delete message has been received. If this is not the case, a check is made at 82 as to whether for a Traffic announcement the lifespan DUR has expired. Will If both questions are answered in the negative, the program is repeated at 81. However, if at least one of the conditions is met, it is done at 83 the deletion of the traffic report concerned in the Storage. As is common in information technology, can this by setting a feature in one Table of contents of the memory without the Traffic announcement itself is deleted.

Then it is checked at 84 whether the number of Traffic announcements have already reached 0. As long as Traffic reports are available, the message counter n decremented at 85. In both cases, the program, starting at 81, repeated.

FIG. 8 shows a program for an additional selection that can be inserted into the programs according to FIGS. 1 and 2 at point 32. At 91 i is set equal to 1 and a variable n a (= n old ) the current value n of the message counter is assigned. Thereafter, it is checked at 92 for the respective traffic report TM _i whether it meets the respective selection criterion entered by the program according to FIG. 4, for example “A7”. If the traffic report does not meet this criterion, the message counter is decremented at 93, since in the subsequent selection according to the priority, one traffic report is then to be taken into account less.

However, if the traffic announcement TM _i at 92 meets the selection criterion, it is marked separately at 94 in the message memory. Then it is incremented at 95 i, so that the next traffic report can be checked at 92. This continues until it is found at 96 that all n _a traffic reports have been checked. Then one of the programs according to FIGS. 1 or 2 is continued at 32, the subsequent method steps being carried out only with the traffic reports marked at 94.

Claims (11)

Process for the selection of digitally coded Traffic reports when output in a receiver, characterized in that received traffic reports one the degree of the respective traffic obstruction characteristic priority is assigned and that in Depends on the number of traffic reports Traffic reports to be output according to priority be selected. A method according to claim 1, characterized in that with increasing number of traffic reports received a priority selection threshold at Issue is increased. Method according to one of the preceding claims, characterized in that the priority from the event the traffic information received is derived and that the highest priority is assigned when a Traffic announcement of a special category (x-urgent) Will be received. Method according to one of the preceding claims, characterized in that less than a first Number of traffic reports received Traffic reports of all priorities and that a number received traffic reports larger than a second Number is, at least all traffic reports with the highest priority. A method according to claim 4, characterized in that for a number of traffic reports received that lies between the first and the second number, with increasing number with low priority starting one increasing number of traffic reports not issued becomes. A method according to claim 5, characterized in that the number of traffic reports issued between the first and the second number is kept constant. Method according to one of the preceding claims, characterized in that, if necessary, of several Traffic announcements with the same priority received later Traffic announcements are reproduced preferentially. Method according to one of the preceding claims, characterized in that received traffic reports can be assigned to one of six priorities. Method according to one of the preceding claims, characterized in that furthermore an area selection is carried out and that those traffic reports are issued by the priority and by the Area selection are selected. Method according to one of claims 1 to 8, characterized characterized that a selection by priority is omitted if an area selection is activated. Device for carrying out the method according to a of the preceding claims in a receiver with a Decoder for digitally coded traffic reports, the one Event list for decoding the digitally coded Contains traffic reports, characterized in that in a priority according to the event list for each event the impact of the event on the flow of traffic is listed and that a memory for received Traffic announcements is provided, in which also the out priorities read from the event list can be filed.

Images