EP2811466A2 - Method and devices for error detection in a toll system - Google Patents

Abstract

In order to detect faults in a toll system, methods and devices are proposed which subject sequences of recognized toll sections to a plausibility check which takes into account vehicle movement parameters which were detected in connection with the recognition of the toll sections by a decentralized data processing device carried by the toll vehicle. According to the invention, the vehicle movement parameter is a duration that is the sum of partial durations during which the vehicle speed exceeds a limit speed.

Description

The invention relates to methods and devices for fault detection in a toll system according to the preambles of the independent claims.

Such a toll collection system according to the invention comprises at least one central data processing device and at least one plurality of decentralized data processing devices, each of which (i) is carried by a toll vehicle with which it is associated and (ii) is designed to record travel data that is representative of the traffic of toll sections of a network of toll sections through the toll vehicle and (iii) a decentralized radio communication device at least for sending data to the central data processing device or at least temporarily communication technology is coupled to such, wherein at least one of the data processing devices is formed to recognize by means of a link detection program for processing the Fahrungsungsdaten the pursuit of the respective route sections a _i by the respective vehicle and the ever the respective route sections a _i corresponding track section identifications s _i in the chronological order and / or each associated with a time value of their driving through the respective vehicle to register.

For example, the decentralized data processing device is embodied as a stationary vehicle-mounted vehicle device or as a toll-mountable toll-mounting device in the vehicle or as a mobile radio device with the functions mentioned in the preamble.

An example of a vehicle device is the so-called on-board unit (OBU) of Toll Collect GmbH, with which since 2005 the driving of toll sections in the German motorway network by the respective vehicle in which the OBU is installed, is detected.

In terms of data technology, the assignment of the decentralized data processing device to the vehicle is to be understood in the sense that a data record is present in the toll collection system that comprises a device identifier of the decentralized data processing device (eg an OBU-ID or a mobile phone number) and a vehicle identifier (eg. the vehicle identifier), wherein the device identifier and the vehicle identifier are uniquely linked by the data set in which they are present. Such an initialization record may be in a decentralized data store Data processing device and / or stored in a data memory of the central data processing device.

Typically, the driving data are position data of the vehicle, which is detected by a GNSS receiving device which is included in, or at least temporarily communication-linked, by the decentralized data processing device and is also carried by the vehicle as a result of receiving and processing GNSS data from GNSS data. Signals from satellites of a GNSS (Global Navigation Satellite System), for example, GPS, are provided. Supplemented by means for coupling detection position data of the vehicle can be obtained even with temporarily absent GNSS signal reception.

The route section recognition program according to the invention can be designed to examine the correspondence of the position data with the geographic coordinates of geo-objects, each of which represents a specific route section and in this sense are each linked to a specific route section identifier. The correct correspondence of the position data of the vehicle with such a geo-object interprets the route section recognition program as passing the respective route section and triggers a registration of the relevant route section identifier. This registration can, for example, by storage of the relevant link detection in a dedicated memory area of a decentralized data memory of the decentralized data processing device and / or a central data memory of the central data processing device - assigned to the device identifier and / or vehicle identification of the vehicle in which the driving data were detected, the detection of the the route concerned.

Alternatively or optionally, the driving data may be data transmitted from a roadside equipment (RSE) via short-range DSRC (Dedicated Short-Range Communication) to the distributed data processing device including a DSRC communication device or is coupled to such a communication technology.

The link detection program is designed in this case to interpret the RSE data as link identifications.

The link detection program can be executed by a decentralized processor of the distributed data processing device and / or by a central processor of the central data processing device.
In the first case (decentralized detection), the link detection program can on a Vehicle device implemented or as a so-called APP on a mobile phone.
In the second case (central detection), the tracking data is transmitted to the central data processing device for detection by means of the decentralized radio communication device, in particular a long-range mobile radio communication device (for example a GSM / GPRS / UMTS or LTE modem of a mobile radio device).

The detection of traveled route sections involves, in terms of method, the collection of a toll charge for the use of the relevant route section assigned to the vehicle, the vehicle device and / or the user / owner / owner of the vehicle. This survey can be done decentralized by reducing a stored in the decentralized data processing device pre-paid credit or by the central side triggered by the central processing device debiting an account of the user / owner / owner of the vehicle (post-paid payment).

In the course of the consecutive traffic of several toll sections of the toll road network, there is a consecutive registration of the corresponding route section identifications.

The generic toll systems now have the problem of recognizing whether a sequence of consecutively registered route section identifiers has a route section gap in the sense that the sequence lacks a route section identifier or a series of several different route section identifiers which would have registered with a correct function of the toll system Need to become.

In the case of the proper functioning of the toll system, such a leaky sequence of route segment identifiers would correspond to leaving the network of toll sections through the vehicle after entering a precursor route section of said route section gap and reentering the network of toll sections through the vehicle driving one Successor route section of the said route section gap, wherein in the network of toll sections the successor route section is not immediately adjacent to the precursor route section, but is separated from him by just the route section or just the series of track sections whose identifiers form the said track section gap. Such a journey then actually takes place in the toll-free road network and should not be monitored with regard to the route traveled in the interest of the user's privacy needs.

In contrast, said gapy sequence may also be the result of a fault in the toll system. This error may be due to the fact that (i) the decentralized data processing device (s) has no representative - because it does not exist or misses - track data (hereinafter referred to as a detection error), or (ii) the link detection program is unable to do so - possibly inaccurate, but correct - traffic data to detect the passage of a section of road (hereinafter referred to as recognition error). However, this can not be readily ascertained because the user is allowed to assume that the tolling system is operating correctly and, as a rule, does not want his route to be tracked outside the tolled route network.

It is therefore an object of the invention to provide methods and devices with which a reliable distinction can be made between a real (faultless) gap sequence by driving outside the toll road network and a spurious (erroneous) gap sequence when driving within the toll road network without an absolute Position of the vehicle outside the tolled route network should be recorded or used for differentiation.

For this purpose, the method steps of the preamble are provided, with which (a) by at least one of the data processing means at least one gap sequence to be examined, which is comprised of at least one sequence of a plurality of each time, consecutively registered route section identifiers associated with a particular vehicle, wherein the gap sequence to be examined is characterized in that it does not include at least one selected link identifier or at least one selected one of a plurality of different link identifiers on link sections immediately following the link network and includes a precursor link identifier corresponding to the precursor link, in the network the route section of the selected link identifier or the first link section of the selected series immediately bar, and includes a follower route section identifier corresponding to the child route section immediately following in the network the route section of the selected route identifier or the last route of the selected series; (b) for the gap sequence to be examined in the course of at least one first plausibility check by at least one of the data processing devices, it is checked whether at least one first vehicle movement parameter value, which consists of at least one first measured value the vehicle movement, which was detected in the context of the travel data from the decentralized data processing device is formed and has been assigned to the precursor-successor pair of preceding and following track section identifiers of recognized precursor track section and recognized tracker track section, at least a first Rule with respect to at least a first reference parameter value for the precursor-successor pair, which is or was at least temporarily stored in at least one central data memory of the central data processing device, is sufficient; wherein (c) if the first plausibility check yields a positive result, an error signal indicative of a possible error is generated by the inspecting data processing device; and (d) if the first plausibility check yields a negative result, no signal is generated by the examining data processing device or a non-error signal indicative of no error is generated.

Whenever there is talk of a parameter being larger or smaller than a reference parameter, it is meant, unless explicitly stated otherwise, that the value or magnitude of this parameter is greater or less than the value or magnitude of the parameter said reference parameter.

By comparing the decentrally generated vehicle motion parameter value associated with the gap sequence to be examined with the reference parameter value centrally stored with respect to the gap sequence to be examined, it becomes advantageously possible to distinguish between a real, real and error-free gap sequence and a spurious, because erroneous, only apparent, gap sequence. in that the error signal indicates a possible, spurious gap sequence and the missing error signal or the non-error signal indicates a true gap sequence.

From the publication EP 1 659 550 A2 It is known to examine gap sequences for detection errors by taking the vehicle movement parameter of the time difference, which is obtained from a first measurement of the time of exit from the precursor route section and a second measurement of the time of entry to the trailer segment, with the reference parameter of the usual journey time is compared to the missing in the gap sequence sections.

The problem is that in the case of intentional breaks (rest or refueling stop) or forced breaks (congestion or breakdown) on unrecognized sections of the toll route network, the actual journey time deviates significantly from the usual journey time, so that in the case of breaks spurious gap sequences with the the published patent EP 1 659 550 A2 known methods can no longer or at least not reliably detected.

The object of the invention is therefore to propose a method and devices with which faulty gap sequences can be detected even more reliably.

This object is achieved by a method according to claim 1 and devices according to claims 11 and 13. The independent, belonging to the same category of claims product claims on the inventive devices provide alternative embodiments of facilities for carrying out essential steps of the inventive method, which is characterized by their Character, once mobile (read: decentralized) and once stationary (read: central) differ.
Preferred embodiments are subject of the dependent claims and are mentioned in the description. The features and advantages referred to a category and its various embodiments always apply as transferable to the respective other embodiments and other categories, insofar as this is technically possible without contradiction.

The method according to the invention is characterized in that the first vehicle movement parameter is a limit speed duration as a sum of partial durations during which the vehicle speed exceeds a limit speed as a first measured value, the first reference parameter being a reference limit speed duration and the first rule falling below or exceeding the reference limit speed duration value by the limit speed duration value is.

Thus, the journey time is adjusted for breaks or periods of slow driving, which make little or no contribution to covering the route between two sections of the gap sequence. Thus, the probability of identifying a spurious gap sequence as genuine is significantly reduced and the reliability of detection of spurious gap sequences is significantly increased. The question of whether the first rule is below or above the reference limit velocity duration value by the threshold velocity duration value is decided by the magnitude of the value of the Border speed: Low border speeds exclude only the breaks, so that short travel times with a low minimum speed - and thus falling below the reference limit speed value - speak for remaining in the toll route network. High speed limits are exceeded more often and longer in the toll route network than in toll-free route network, so that long travel times with a high minimum speed - and thus the exceeding of the reference limit speed value - speak for remaining in the toll route network.

Advantageously, in certain embodiments of the method according to the invention for obtaining the test result, no driving data from the toll-free road network is necessary. In particular, no position data of the vehicle must be detected, processed or even transmitted to the central data processing device during its journey in the toll-free road network.

The data protection requirement of the drivers who are not potentially liable to pay tolls is taken into account in particular by virtue of the fact that only such a first measured value is used to determine the first vehicle movement parameter which was detected in connection with the recognition of the passage of a toll-liable forerunner section and such a second measured value into the determination On the other hand, however, traffic data can also be collected from the toll-free road network as long as it contains only relative position data and no absolute position data. Relative position data may be mileage information of the speedometer and / or the distance traveled from detection of the precursor track section. Also, speed values of the speedometer or GNSS receiver and / or time values of a clock may be detected, collecting and transmitting only time differences to which a limit speed was exceeded, which does not seem to correspond to a speed limit violation. Without the absolute position information necessary for this, this is possible for limit speeds between 0 km / h (standstill within the scope of measurement accuracy) and 40 km / h, with 50 km / h corresponding to a regular speed limit within closed towns.

Embodiments of the invention - both of the method according to the invention and of the devices according to the invention - make it possible to assign the occurrence of a spurious gap sequence to a specific type of error. First of all, software errors must be distinguished from hardware errors as the error type.

Software errors are that the current road network has not been correctly translated into data that (a) serves to detect the passage of a missing link in the gap sequence or (b) serve to detect an alternative route in the toll-free road network. The first error (a) constitutes a recognition error in the link detection program which results in erroneous non-recognition of a toll section actually traveled; the second error (a) constitutes a reference error of the reference parameter value (reference parameter error), which is based on the different characteristics of toll-based and toll-free alternative routes and leads to the non-recognition of the navigation of a possible alternative route in the toll-free road network. Unless the current road network differs from the well-known road network based on which the data was created for detection (this is also referred to as "modeling"), software errors usually do not remain due to extensive testing prior to using that data. However, if a change occurs in the road network resulting in an update state of a - henceforth partially - unknown road network that differs from the modeling state of the - previously known - road network, then software errors can occur if the changes in the road network are so blatant that they are affect the recognition and lead to a different recognition result. Formerly error-free software becomes defective software as a result of a change in the road network.

Such software errors must be differentiated from the hardware errors that lead to the route section recognition program being supplied with erroneous or missing track data and thus not being able to correctly detect the passage of a toll section. These so-called detection errors may have the cause of the temporary failure of the reception of GNSS signals or the temporary failure of the GNSS receiving device or the lack of reception of supplementary signals of an odometer or a gyroscope for coupling detection. If such errors occur several times in a decentralized data processing device, the defect is to be assumed, ie a hardware error, of the decentralized data processing device.

In order to distinguish the software errors from hardware errors and the recognition errors from reference errors, the invention provides for a further and a plurality of further plausibility checks. These will be referred to below.

Preferred embodiments of the method according to the invention are characterized in that the at least first vehicle movement parameter value has been assigned by the data processing device to the precursor-successor pair of link identifiers of recognized link sections which provided the gap sequence to be examined. This ensures a reliable linkage of the vehicle movement parameter value with the gap sequence to be examined.
In the case of decentralized detection, the first vehicle movement parameter value can be transmitted together with the gap sequence by means of the decentralized radio communication device to the central data processing device.

Alternatively, it is possible to transmit from the decentralized data processing device individual route section identifiers or groups of individual route section identifiers linked to the first measured value of the vehicle movement by means of the decentralized radio communication device to the central data processing device. By means of the central data processing device, the individual route section identifiers or groups of route section identifiers are subsequently combined vehicle-specifically into a sequence of route section identifiers and, in the case of an existing gap, such a sequence is identified as a gap sequence. For the precursor-follower pair of link identifiers included in this gap sequence, the vehicle motion parameter value is formed or derived from the first measured value of the vehicle motion.

Preferably, the provision of the gap sequence to be examined comprises the identification of a sequence of link identifications as a gap sequence. In this case, one or more sequences of route segment identifiers are analyzed by the decentralized and / or central data processing device for the presence of a possible gap.

In such an analysis, each pair of immediately consecutively registered link identifiers (forerunner-follower pair) is compared for agreement with a representation of the network of toll sections - for example, as a graph. The network of toll road sections, for example, a motorway network, namely mathematically can be represented as a graph with the ascents and descents as nodes and the sections as edges. If such a pair of link sections represented by nodes and / or edges is found in the representation of the graph, then there is no gap sequence with this pair; if this pair is missing, it represents a gap sequence. Representations of the graph may be present as an adjacency matrix (neighborhood matrix) or as an incidence matrix (node-edge matrix). Alternatively, a comparison may be made with a gap matrix in the form of a table of precursor link identifiers s _i as column values and successor link identifiers s _j as row values appropriate for a plurality of combinations of precursor-follower pairs of link identifiers (s _i , s _j ). contains in its cells a selected link identifier or a selected one of a plurality of different link identifiers in cases where the precursor-follower pair of link identifiers includes a gap formed by the selected link identifier or the selected series of multiple different link identifiers, and in the cases in which the gap matrix does not contain a link identifier, the precursor-successor pair of link identifiers is gap-free, that is, a pair of Track section identifiers corresponds whose track sections in the road network directly adjoin one another.

In the case of central detection, the central data processing device receives travel data, to each of which a first measured value is assigned, together with these first measured values, which were detected by the decentralized data processing device and sent by the decentralized radio communication device. From the driving data, the central data processing device recognizes the traveled sections of the route by means of the route section recognition program and forms a sequence of traveled route sections from the associated route segment identifiers. At least in the event of a gap of links in this sequence, the central computing device determines from the first or more first measurements the vehicle motion parameter value that it associates with the sequence-included precursor-follower pair of link identifiers.

Preferred embodiments of the method according to the invention are characterized in that at least the first reference parameter value is a reference parameter value of a plurality of reference parameter values suitable for a plurality of combinations of precursor-successor pairs of link identifiers in cells of a reference parameter matrix in the form of a table with precursor link identifiers Column values and successor route segment identifiers are or were at least temporarily stored in at least one central data memory of the central data processing device as line values or vice versa. With such a reference parameter matrix, an efficient assignment of the reference parameter value to be used for the test to the gap sequence to be examined becomes possible. In this case, the original of this reference parameter matrix is preferably stored on the central side. This does not necessarily mean that the audit can only be carried out centrally. The check can alternatively or cumulatively also be carried out on the decentralized side by the decentralized data processing device if the decentralized data processing device has a copy of the reference parameter matrix. For this purpose, a copy of the reference parameter matrix is transmitted wirelessly from the central data processing device to all decentralized data processing devices of the plurality of decentralized data processing devices and preferably received by the respective decentralized radio communication device from the respective decentralized data processing device. In this way, any updates of the reference parameter matrix can be transmitted from the central data processing device to the decentralized data processing devices.

For example, the reference parameter value may correspond to a value of the vehicle motion parameter corresponding to the vehicle movement on a journey outside the toll route network between the precursor route section and the successor route section. On the other hand, the reference parameter value may also correspond to the value of a vehicle movement parameter corresponding to the vehicle movement on a journey within the toll route network between the precursor route section and the successor route section.

The preferred choice of the reference parameter value depends on the reference parameter itself, on the available alternative routes of trips outside the toll route network, and in particular on the first rule whose fulfillment is checked in the first plausibility check.
Thus, for a rule that is consistent with the vehicle motion parameter value with a reference parameter value, the reference parameter value must correspond to that of a vehicle movement on a preferably determined route within the toll route network if the fulfillment of the rule in the plausibility check indicates a possible error in terms of a positive result and, for a rule that is based on a deviation of the vehicle motion parameter value from a reference parameter value, the reference parameter value corresponds to a vehicle movement on a preferably determined route outside the toll route network if the fulfillment of the rule in the plausibility check is a positive result for a possible error should point out, because the lack of recognition of the journey within the toll road network is the mistake that it is necessary to detect.

In embodiments of the method according to the invention, it is provided that in the course of the first plausibility check, it is additionally checked whether at least one second vehicle movement parameter value, which is formed or derived from at least one second measured value of the vehicle movement, which was detected by the decentralized data processing device in connection with the travel data and the precursor-successor pair has been assigned to prefetch and follower link identifiers of recognized precursor link and recognized follower link, at least one second rule relating to at least a first reference parameter value for the precursor-descendant pair at least temporarily in at least one of said precursor-descendant pair is stored or has been stored, the second vehicle movement parameter is one of the following parameters: (i) a distance that is dependent on n a first distance value as the second measured value, that of the precursor distance segment identifier and at least one second distance value as a third measured value associated with the successor link identifier; (ii) an average fictitious vehicle speed obtained by dividing a reference distance for the precursor-successor pair of link identifiers by the limit speed duration; (iii) a limit speed distance as the sum of partial distances over which the vehicle speed exceeds a limit speed; (iv) a limit speed range ratio formed by dividing the limit speed distance of (iii) by the distance of (i);
wherein in each case (i) the second reference parameter is a reference distance and the second rule is the correspondence of the distance value with the reference distance value within a predetermined maximum allowable deviation of the distance value from the reference distance value; (ii) the second reference parameter is a reference speed and the second rule is exceeding the reference speed value by the average fictitious vehicle speed value; (iii) the second reference parameter is a reference limit speed distance and the second rule is the reference limit speed range value exceeded by the limit speed range value; and (iv) the second reference parameter is a reference limit speed range ratio and the second rule is the reference speed limit range ratio value exceeded by the limit speed range ratio value.

It should be mentioned that the first plausibility check can also be carried out by several first partial checks on the satisfaction of values of several different vehicle movement parameters with regard to first partial rules with regard to the values of the several correspondingly different first reference parameters. The first plausibility check in some combinations of plausibility part checks and / or some combinations of forerunner-follower track pair pairs is considered to be completed as error-positive only if all of the part checks end up error-positive. The first plausibility check is then considered to be completed negative-negative if at least one sub-test ends in error-negative.

For example, the route of a toll-free route in toll-free road network (of federal, provincial, district and / or local roads) may be shorter than the reference distance of the trip on the toll route in the toll road network (for example, highways), with the shortest journey time on the shortest toll-free route is usually the same as the journey time on the toll route. Thus, the erroneous falling below a reference time difference defined as the shortest travel time (also: reference duration) not possible in any of the two networks (in this case, this would be an error-negative result of the first partial test). However, it is possible to deviate from the reference distance by a shorter or longer route in the toll road network (error-negative result of the second partial test). However, in the toll-free road network, there are also routes whose length coincides with the reference distance (error-positive result of the second partial test). For this reason, the reference time for the journey in the toll-free route network is that which corresponds to the time-fastest route in the toll-free road network whose length is equal to the reference distance of the journey in the toll road network. If this reference duration is undershot (error-positive result); this is only possible with an error-positive result of the distance test (distance corresponds to motorway route) if the motorway was used. However, since there is the corresponding gap in the gap sequence, this is to be considered as a possible spurious gap sequence and as a possible fault of the toll system. An error-positive result of the time difference test (faster driving) alone does not lead to an error-positive result of the overall plausibility test, because this also (in this case error-free) on a shorter route in the toll-free road network (error-negative result the distance test) can be obtained. Conversely, as already indicated above, an error-positive result of the distance test (distance corresponds to a journey in the toll road network) does not in itself lead to an error-positive result of the plausibility check altogether, because this distance yes (in this case error-free) on a slower route in the toll-free road network could be covered.

In other combinations of plausibility sub-checks and / or other combinations of precursor-follower track pair, the first plausibility check is already considered to be completed as fail-positive if at least one sub-check ends up fail-positive. The first plausibility check is then considered to be completed negative-negative if all partial checks end in error-negative.

Embodiments of the method according to the invention are characterized in that the testing data processing device is at least one decentralized data processing device, wherein in each case a copy of the reference parameter value is stored in at least one decentralized data memory in each of the decentralized data processing devices, a possible change of the reference parameter value in the central data memory by the central data processing device is detected and / or effected, and the central data processing device is adapted to trigger a transmission of the changed reference parameter value to each of the decentralized data processing devices, and wherein at least the error signal of the decentralized data processing device is sent to the central data processing device by means of the decentralized radio communication device.

This creates an efficient and reliable option for carrying out the first plausibility check according to the invention in a decentralized data processing device. Advantageously, the reference parameter values that are used by the decentralized data processing device for the first plausibility check are always up to date because changed reference parameter values are distributed by the central data processing device to the decentralized data processing devices.

An advantageous further development of this embodiment, which provides for the implementation of the first plausibility check by the decentralized data processing device, is that together with the error signal or as an error signal, the first vehicle movement parameter and the relevant precursor-successor pair of route section identifiers by means of the decentralized radio -Communikationseinrichtung is transmitted to the central data processing device and the central data processing device is configured to count error signals that it receives to the respective precursor-successor pair of link identifiers in at least a predetermined time interval, and the number of errors of the counted error signals or an error quotient formed from the number of errors of the counted error signals and the total number of sequences comprising the respective precursor-successor pair of link identifiers, and the d the central data processing system has received in the predetermined time interval from the plurality of decentralized data processing devices, (e) subject to a second plausibility check, with which it is checked whether the number of errors of the error signals exceeds a predetermined first reference error number or the error quotient exceeds a predetermined first reference error quotient; wherein (f) if the second plausibility check yields a positive result, the central data processing device generates a software error signal indicative of a potential software error; and (g) if the second plausibility check produces a negative result, the central data processing device generates a hardware error signal indicative of a possible detection error in the detection of the drive data by the remote data processing device from which the drive data originated investigated on the basis of the gap sequence.

The sequences comprising the respective precursor-successor pair of link identifiers may be sequences that include, without gaps, the selected link identifier or the selected series of multiple link identifiers and / or sequences containing the selected link identifier or series multiple link identifiers - patchy - do not include, both with or without error message.

Preferably, the time interval is in the range of one hour to one month.

Preferably, the first reference error number is in the range of 3 to 10 for the time interval of one hour to 100 to 10,000 for the time interval of one month. In essence, this value depends on the average traffic density on the legs of the gap sequence.

Preferably, the first reference error quotient is in the range of 0.001% to 10%. It is more preferably in the range of 0.01% to 1%. In many cases, a reference error quotient of 0.1% or approximately 0.1% is used.

This inventive solution makes use of the knowledge of the inventors that with a high quality of the hardware of the decentralized devices for the acquisition and processing of the travel data and with a high quality of the software of the link detection program and the reference parameter values rarely occurring gap sequences must be due to a hardware error, while frequently occurring gap sequences must be due to a change in the road network, the software is at least partially unusable with respect to this change and requires updating to be error-free again.

The detection error signal may be sent from the central data processing device in which it was generated to the relevant remote data processing device in the form of a detection error code, received by the decentralized data processing device, and the error in the form of a warning signal by means of an optical signal Display device of the decentralized data processing device, for example in the form of an LED, are brought from the decentralized data processing device for display.
Alternatively or optionally, an indication text on an optical display device can already inform the user when a detection error occurs for the first time or only after multiple occurrence of a detection error that he has to exchange the decentralized data processing device within a certain period of time. In this case, the decentralized data processing device be configured to switch to a passive mode at the end of this period, in which the decentralized data processing device omits the detection of driving data and / or the detection of sections.

With the second plausibility check, the error detection method according to the invention can be completed, wherein it is the expertise of an administrator responsible in the wake of the software error signal to determine on the basis of further analysis, if the software error is a recognition error or a reference parameter error ,

• Wenn (i) die dritte Plausibilitätsprüfung ein positives Ergebnis erbringt, wird durch die zentrale Datenverarbeitungseinrichtung ein Erkennungs-Fehler-Signal erzeugt, das auf einen tatsächlichen Erkennungsfehler des Streckenabschnittserkennungsprogramms hinweist.
• Wenn (j) die dritte Plausibilitätsprüfung ein negatives Ergebnis erbringt, erzeugt die zentrale Datenverarbeitungseinrichtung ein Referenz-Fehler-Signal, das auf einen tatsächlichen Referenzfehler des Referenzparameterwertes hinweist.

However, this is not mandatory. With a (h) third plausibility check, in which it is checked whether the number of errors of the error signals exceeds a predetermined second reference error number which is greater than the first reference error number, or the error quotient exceeds a predetermined second reference error quotient, which is greater than the first reference error quotient , Finally, can be determined by the central data processing device, whether a recognition error or a reference parameter error is present:

• If (i) the third plausibility check yields a positive result, the central data processing device generates a recognition error signal indicative of an actual recognition error of the link detection program.
• If (j) the third plausibility check yields a negative result, the central data processing device generates a reference error signal indicative of an actual reference error of the reference parameter value.

Preferably, the second reference error number is in the range of 10 to 1000 for the time interval of one hour to 10,000 to 1,000,000 for the time interval of one month. In essence, this value depends on the average traffic density on the legs of the gap sequence.

Preferably, the second reference error ratio is in the range of 10% to 99%. More preferably, it is in the range of 30% to 90%. In many cases, a reference error ratio of 50% or approximately 50% is used.

It is understood that the detection error signal, the reference error signal and the detection error signal can already be obtained in the second plausibility check, if this is changed to the error number and / or the Error quotient to be checked for exceeding the first and the second reference value: Is an error value

(Error number or error quotient) below the first reference value (first reference error number or first reference error quotient), a detection error signal is generated; if there is an error value between that of the first reference value and the second reference value (second reference error number or second reference error quotient), then a reference error signal is generated; if an error value is above the second reference value, a recognition error signal is generated;

As an alternative or supplement to the decentralized first plausibility check, an embodiment of the method according to the invention may be characterized in that the central data processing device is the central data processing device, wherein the central data processing device includes travel data and / or at least one sequence of several consecutively registered route section identifiers together with at least the first measured value and / or at least the first vehicle motion parameter value from the remote data processing device.

This creates a procedure for carrying out a central first plausibility check.

Regardless of whether the first plausibility check is carried out decentrally or centrally, provision may be made for the method according to the invention to receive from the plurality of decentralized data processing devices a set of sequences each of a plurality of consecutively registered route section identifiers or drive data, from which the central data processing device acquires the set of said sequences by means of the link detection program, and for at least one selected link section identifier or at least a selected series of multiple link identifications at link sections immediately following track sections by the central data processing device (i) that set of selected sequences from the set of received ones Sequences is determined that a Voriäufer Streckenabsch identity identifier corresponding to the precursor link section immediately preceding in the network the link section of the selected link identifier or the first link section of the selected series, and containing a follower link identifier corresponding to the follower link section in the network to the link section of the selected link identifier or immediately following the last leg of the selected series, and (ii) determining the set of selected extraordinary void sequences from the set of selected sequences that do not include the selected leg identifier or the selected series of leg specifiers and the error signal in the first plausibility check, further wherein an extraordinary gap quotient is formed from the number of selected extraordinary gap sequences of the set of selected extraordinary gap sequences and the number of selected sequences of the set of selected sequences, and wherein (e) if the first plausibility check is a positive one Provides result, is checked in the course of a second plausibility check by one of the data processing facilities, whether the extraordinary gap quotient exceeds at least a first reference gap quotient; (f) if the second plausibility check gives a positive result, a software error signal indicative of a potential software error is generated by the inspecting data processing device; (g) if the second plausibility check gives a negative result, a hardware error signal is generated by the inspecting data processing device indicative of a possible detection error with respect to the detection of the drive data by the remote data processing device from which the drive data originated from Gap sequence were based.

In this case, the selected extraordinary gap sequences which have triggered the error signal in the first plausibility check are preferably identified in a data record which includes the gap sequence by a corresponding error code in the data record.

It is understood that in the less preferred case where the remote data processing device performs the second plausibility check, the number of selected sequences and the number of selected gap sequences or the gap quotient itself is to be transmitted from the central data processing device to the remote data processing device via a mobile network -, wherein the decentralized data processing device is adapted to receive the number of selected sequences and the number of selected gap sequences or the gap quotient itself by means of the decentralized radio communication device. Preferably, the distributed data processing device receives regularly (eg once a day or once a week) or on certain occasions (eg turning on the decentralized data processing device) a plurality of respective current gap quotients, which are suitable for a multiplicity of combinations of precursor successors Pairs of link identifiers in cells of a gap quotient matrix in the form of a table with precursor link identifiers as column values s _i and successor link identifiers s _j as row values, or vice versa. Thus, the distributed data processing device is enabled, for each to be examined Gap sequence, which was registered by her, very quickly make a statement on a corresponding error.

However, to avoid a high data volume in the communication, the second plausibility check is preferably carried out by the central data processing device.

Preferably, the first reference gap quotient is greater than 0.001% and less than 10%. It is more preferably in the range of 0.01% to 1%. In many cases, a reference gap quotient of 0.1% or approximately 0.1% is used.

Preferably, a gap quotient is only formed and the second plausibility check is performed only if the number of selected sequences is not less than a predetermined minimum number and not greater than a predetermined maximum number. Preferably, the predetermined minimum number is equal to 100 and the predetermined maximum number is equal to 1,000,000. On the one hand, this achieves a sufficient statistical significance of the gap quotient and, on the other hand, sufficient sensitivity to quickly ascertain an increase in the gap quotient.

Preferably, gap quotients are formed multiple times within a period of time in which the number of selected sequences increases. This always provides a current value of the gap quotient.

Preferably, when adding newly acquired sequences to the set of selected sequences, those sequences which are the oldest are removed from the set of selected sequences. Thus, the timeliness of the gap quotient is further increased and the sensitivity to determine an increase in the gap quotient is increased, so that such an increase can be detected even faster.

The detection error signal can be sent to the relevant decentralized data processing device at the first occurrence of a detection error or only after multiple occurrence of a detection error from the central data processing device in which it was generated in the form of a detection error code, from the decentralized Data processing means are received and the error in the form of a warning signal by means of an optical display device of the decentralized data processing device, for example in the form of an LED, are brought from the decentralized data processing device for display.
Alternatively or optionally, when a detection error occurs for the first time or only after multiple occurrence of a detection error, a text message on an optical display device to inform the user that he has to exchange the decentralized data processing device within a certain period of time. In this case, the decentralized data processing device can be configured to switch to a passive mode after expiry of this deadline, in which the decentralized data processing device omits the detection of driving data and / or the recognition of sections.

The repeated occurrence of a detection error can be detected on the central or decentralized side, in which the decentralized data processing device accumulates the number of acquisition error messages and / or the central data processing device collects the acquisition errors associated with the identifier of the decentralized data processing device.

In this sense, only the repeated occurrence of a possible detection error can cause the central or decentralized data processing device to determine that the possible detection errors are an actual detection error of said decentralized data processing device.

With the second plausibility check, the error detection method according to the invention can be completed, wherein it is the expertise of an administrator responsible in the wake of the software error signal to determine on the basis of further analysis, if the software error is a recognition error or a reference parameter error ,

Alternatively, the inventive error detection method with the second plausibility check can also be completed because the central data processing device interprets the software error signal exclusively or only for certain gap sequences exclusively without reference either exclusively as a reference error or as a recognition error.

• Wenn (i) die dritte Plausibilitätsprüfung ein positives Ergebnis erbringt, wird durch die zentrale Datenverarbeitungseinrichtung ein Erkennungs-Fehler-Signal erzeugt, das auf einen tatsächlichen Erkennungsfehler des Streckenabschnittserkennungsprogramms hinweist.
• Wenn (j) die dritte Plausibilitätsprüfung ein negatives Ergebnis erbringt, erzeugt die zentrale Datenverarbeitungseinrichtung bei positivem Ergebnis der zweiten Plausibilitätsprüfung ein Referenz-Fehler-Signal, das auf einen tatsächlichen Referenzfehler des Referenzparameterwertes hinweist.

However, neither variant is mandatory. With a (h) third plausibility check, in which it is preferably checked by the central data processing device whether the gap quotient exceeds a predetermined second reference gap quotient which is greater than the first reference gap quotient, it can finally be determined whether a recognition error or a reference parameter error exists:

• If (i) the third plausibility check yields a positive result, the central data processing device generates a recognition error signal indicative of an actual recognition error of the link detection program.
• If (j) the third plausibility check yields a negative result, if the result of the second plausibility check is positive, the central data processing device generates a reference error signal which indicates an actual reference error of the reference parameter value.

Preferably, the second reference gap quotient is in the range of 10% to 99%. More preferably, it is in the range of 30% to 90%. In many cases, a reference gap quotient of 50% or approximately 50% is used.

It is understood that the detection error signal, the reference error signal and the detection error signal can be obtained already in the second plausibility check, if this is changed so that the gap quotient with the exceeding of the If the value of the gap quotient lies below the value of the first reference gap quotient, a detection error signal is generated; if the value of the gap quotient lies between the value of the first reference gap quotient and the value of the second reference gap quotient, then a reference error signal is generated; if the value of the gap quotient lies above the value of the second reference gap quotient, a detection error signal is generated.

Essential to the invention for the detection of either a reference error or a recognition error is generally the fact that the second plausibility check alone or in combination with the third plausibility check triggers a reference error signal or a detection error signal.

Such an error signal can consist of comprising in a data record which includes an identifier of the decentralized data processing device and / or an identification of the vehicle to which the decentralized data processing device is assigned, and the route section identifiers of the gap sequence and at least the value of the vehicle movement parameter assigned to the gap sequence setting the error bit representing a non-error state (eg, zero) to an error state (eg, one). Alternatively or optionally, such an error signal in the optical display (LED, text of an error message) consist of a display device.

Preferably, in the method according to the invention in which, as a result of the second plausibility check (this includes a possible third plausibility check), a reference error is determined or a reference error signal is triggered by the central data processing device, the faulty reference parameter value in the central one is processed by the central data processing device Data memory through a changed reference parameter value which deviates so far from the erroneous reference parameter that the first vehicle motion parameter value with respect to which the first plausibility check provided a positive result would result in a negative result in a renewed first plausibility check according to the first rule with respect to the changed reference parameter value.

Preferably, the changed reference parameter value is formed by a reference parameter determination program executed by the central data processing device, which includes a plurality of vehicle motion parameters of different vehicles or different distributed data processing devices of the set of selected gap sequences.

Preferably, those vehicle movement parameters whose values correspond to the first rule for determining an error (that is, those values of vehicle movement parameters which have led to a positive result of the first plausibility check) are grouped together by the reference parameter determination program, unless they are averaged by these or a selection of these vehicle movement parameters differ by more than a predetermined amount or proportion. The selection may indicate a predetermined number (for example, three or more than three or, for example, one hundred or less than one hundred) of those values of said vehicle motion parameters that are closest to each other. Subsequently, by means of the central reference parameter determination program from this group the relevant vehicle parameter value is selected which deviates furthest from this mean value as well as furthest from the erroneous reference parameter value, and the erroneous reference parameter value is replaced by the relevant vehicle parameter value to form the changed reference parameter value.

A device according to the invention is provided, for example, by a decentralized data processing device of a toll system, which comprises at least one central data processing device, wherein the decentralized data processing device is provided for entrainment in a toll vehicle to which it is assigned, and is designed to record travel data that is representative of the traffic of toll sections of a network of toll sections by the toll vehicle, and a decentralized radio communication device at least for sending data to the central data processing device or at least temporarily communication technology is coupled to such, wherein the decentralized data processing device is set up by means of at least a processor Executing route section recognition program for processing the drive data with the result of recognizing the passage of the respective route sections by the vehicle, and registering route section identifiers corresponding to the respective route sections in chronological order and / or in association with a time value of their travel by the vehicle in a data memory; wherein the decentralized data processing device is arranged to (a) provide at least one gap sequence to be examined each of a plurality of track segment identifiers associated with the toll vehicle, said gap sequence being characterized by comprising at least one selected link identifier or at least one selected series of multiple different Streckenabschnittskennungen on in the Streckenabschnittsnetz immediately consecutive sections not enthä lt and a predecessor link identifier corresponding to the precursor link immediately preceding in the network the link of the selected link identifier or the first link of the selected series and containing a follower link identifier corresponding to the follower link in the network immediately following the link of the selected link identifier or the last link of the selected series; (b) for the gap sequence to be examined in the course of at least a first plausibility check, to check whether at least one first vehicle movement parameter value formed or derived from at least one first measured value of the vehicle movement which was acquired by the decentralized data processing device in connection with the travel data; the at least one first rule relating to at least a first reference parameter value for the precursor-successor pair of link identifiers, at least temporarily in at least one of the decentralized data stores of the decentralized Data processing device is stored or was sufficient; (c) if the first plausibility check gives a positive result, in an error message to send the first vehicle movement parameter and the respective forerunner pair of route section identifiers to the central data processing device by means of the decentralized radio communication device; and (d) if the first plausibility check yields a negative result, not sending an error message to the central data processing device by the decentralized radio communication device or, in a non-error message, the respective precursor-successor pair of link segment identifiers without the first vehicle motion parameter by means of the decentralized radio communication device to send to the central data processing device; and characterized in that the first Vehicle motion parameter is a limit speed duration as a sum of partial durations during which the vehicle speed exceeds a limit speed as a first measured value, the first reference parameter being a reference limit speed duration and the first rule being below or exceeding the reference limit speed duration value by the limit speed duration value.

Thus, the decentralized data processing device can inform the central data processing device aptly and advantageously about the presence of a possible error.

Preferably, the distributed data processing device according to the invention comprises a decentralized data memory in which a plurality of reference parameter values corresponding to a plurality of combinations of precursor-follower pairs of link identifiers in cells of a reference parameter matrix in the form of a table with precursor link identifiers as column values and successor link identifiers are stored as row values - or vice versa-at least temporarily.

Preferably, such a decentralized data processing device according to the invention is designed to receive at least one changed reference parameter value for a specific precursor-successor pair of link identifications from the central data processing device, and the reference parameter value previously stored in the decentralized data memory for the particular precursor-follower pair of link identifiers replace the changed reference parameter value.

The reception of the changed reference parameter value can take place by means of the decentralized radio communication device of the decentralized data processing device.

Preferred further developments of the decentralized data processing device according to the invention result from design features of the decentralized data processing device according to the invention, which serve to carry out the above-mentioned inventive method steps.

Another example of a device according to the invention is provided by a central data processing device of a toll collection system comprising a plurality of decentralized data processing devices, each of which is carried by a toll vehicle to which it is associated, and adapted to acquire trajectory data that is representative for driving on toll sections of a network of toll sections through the toll vehicle and a decentralized radio communication device at least for sending data to the central data processing device or at least temporarily communication technology is coupled to such, wherein at least one of the data processing means is adapted to recognize by means of a link detection program for processing the Fahrathungsdaten the pursuit of the respective sections by the respective vehicle and the respective sections register corresponding route section identifiers in chronological order and / or each associated with a time value of their passage through the respective vehicle, the central data processing device being adapted to receive travel data and / or time-ordered route segment identifiers from each of the plurality of remote data processing devices, and the central Data processing device has a central data memory or at least temporarily communication technology is coupled to such, in which at least temporarily a set of sequences of a plurality of temporally consecutively registered track section identifiers; each associated with one of the plurality of remote data processing devices, stored and provided for processing at the central data processing device, the central data processing device being configured (a) for at least one selected link identifier or at least a selected one of a plurality of different link identifiers on the link network immediately successive links determine the set of selected sequences from the set of provided sequences containing a precursor link identifier corresponding to the precursor link section immediately preceding in the network the link of the selected link identifier or the first link of the selected series; and a successor link identifier corresponding to the successor link section present in the network to the S immediately following, and (ii) determine the set of selected gap sequences from the set of selected sequences that do not include the selected link identifier or the selected series of link identifiers; (B) for at least one to be examined gap sequence of the set of selected gap sequences in the course of at least a first plausibility check to check if at least a first vehicle motion parameter value, from at least a first measured value of the vehicle movement, which was detected in connection with the driving data of that decentralized data processing device which is associated with, formed or derived the gap sequence to be examined, and the precursor-successor pair of link identifiers of detected at least one first rule with respect to at least one first reference parameter value for the precursor-successor pair of link identifiers stored or was at least temporarily stored in at least one central data store of the central data processing device; (c) if the first plausibility check yields a positive result, generating an error signal indicative of a possible error; and (d) if the first plausibility check yields a negative result of not generating a signal or producing a non-error signal indicative of no error; and characterized in that the first vehicle motion parameter is a limit speed duration as a sum of partial durations during which the vehicle speed exceeds a limit speed as a first measured value, the first reference parameter being a reference limit speed duration and the first rule being less than or exceeding the reference limit speed duration value by the limit speed duration value.

Preferably, the link detection program is stored in a respective data memory of each of the plurality of distributed data processing devices, and each of the distributed data processing devices is configured to execute the link detection program by a respective distributed processor included in each of the plurality of distributed data processing devices.

Preferred further developments of the central data processing device according to the invention result from design features of the central data processing device according to the invention, which serve to carry out the above-mentioned inventive method steps.

Fig. 1

eine schematische Darstellung des erfindungsgemäßen Mautsystems,

Fig. 2a

eine schematische Darstellung eines ersten Straßennetzes,

Fig. 2b

eine schematische Darstellung eines gegenüber dem ersten Straßennetz geänderten zweiten Straßennetzes,

Fig. 2b

eine schematische Darstellung eines gegenüber dem ersten Straßennetz geänderten dritten Straßennetzes und

Fig. 3

eine Lückenmatrix für einen Ausschnitt des mautpflichtigen Streckennetzes des Straßennetzes der Fig. 2a, 2b und 2c.

The invention will be explained in more detail with reference to two embodiments. To show for both embodiments

Fig. 1

a schematic representation of the toll system according to the invention,

Fig. 2a

a schematic representation of a first road network,

Fig. 2b

a schematic representation of a comparison with the first road network changed second road network,

Fig. 2b

a schematic representation of a relation to the first road network modified third road network and

Fig. 3

a gap matrix for a section of the toll route network of the road network Fig. 2a . 2 B and 2c ,

• Das in Figur 1 dargestellte Mautsystem 10 für ein Vielzahl 210 von N mautpflichtigen Fahrzeugen umfasst eine zentrale Datenverarbeitungseinrichtung 100 in Form einer zentralen Elektronischen Datenverarbeitungsanlage (EDV) in einer Zentrale 110 des Mautsystems 10 und eine Vielzahl 200 von N dezentralen Datenverarbeitungseinrichtungen 200 _k von denen jede (200₁, 200₂, ..., 200_N) von einem mautpflichtigen Fahrzeug (210_k) mitgeführt wird, dem sie zugeordnet ist.

For both embodiments, the following applies:

• This in FIG. 1 toll system shown 10 for a plurality 210 toll of N vehicles comprising a central data processing device 100 in the form of a central electronic data processing unit (EDV) in a center 110 of the toll system 10 and a plurality 200 of N decentralized data processing devices 200 _k each of which (200 _1, 200 ₂ , ..., 200 _N ) is carried by a toll vehicle (210 _k ) to which it is assigned.

Each of the decentralized data processing devices 200 _k is _embodied in the form of an on-board unit (OBU) 200 _k , to capture tracking data in the form of position data of the vehicle 210 _k , which are representative of the tolling of toll sections of a network of toll sections by the vehicle toll vehicle is 210 _k . For this purpose, each OBU 200 _k comprises an unillustrated GNSS position determination device in the form of a GPS device, which can determine the position of the vehicle from GPS signals from GPS satellites it receives.

Each OBU 200 _k comprises a decentralized radio communication device 205 _k in the form of a GSM module, by means of which it communicates data via radio communication paths 320 _{k of} a communication network 300 which is connected via a communication line 310 to a communication module 105 of the toll center 10 Central EDP 100 can send, the central processor 103 is communication technology connected to the communication module 105.

In non-illustrated variants of the two embodiments, the decentralized radio communication device 205 _{k is formed} in the form of a stand-alone mobile phone, which is not included as such by the OBU, but in a short-range radio connection (for example, a Bluetooth connection) is communicatively connected to the OBU.

Each OBU 200, _k is formed, by means of a stretch recognition program _k of the OBU 200 _k is stored in a second data memory 202 and executed by a processor 203 _k of the OBU, the positional data from the GPS device by comparison with geographic information of Geo Objects that are contained in a database of the second data memory 202, to process with the result, the driving of the respective toll sections by the vehicle 210 _k to recognize and the respective sections corresponding, respectively associated with the geo-objects link identifiers in the temporal Order of her Register Befahrung by the respective vehicle 210 _k by storing in the first data memory 201 _k.

At predetermined conditions, each OBU 200 _k sends the registered link identifiers one at a time, or in subsequences of multiple link identifications to the central EDP, from the received link identifiers of all the OBUs 200 of the plurality of OBUs, a set {Q} of Q Creates sequences of link identifiers in the order of their patrol or includes the received subsequences as such in the set {Q}.

In variants of the two exemplary embodiments which are not illustrated, the route section recognition program is stored in a data memory of the central EDP 100 and is executed by a processor of the central EDP 100. For this purpose, the central EDP 100 receives the position data of the OBUs 200 _k on the way via the communication network 300.

FIG. 2a schematically shows a section of the road network in which the plurality of vehicles 210, 210 move with their OBUs _k 200 _k. The road network has a toll motorway network with toll road sections a _i , which are characterized by driveways k _i and departures k _j . In the route section recognition program, the toll road sections a _{i are represented} by corresponding route section identifiers s _i , which in Fig. 2a are shown as reference numbers of the toll road sections. The motorway network can be represented mathematically as a graph with the ascents and descents k _i , k _j as nodes and the sections a _i as edges.

The road network also has a toll-free road network of subordinate federal and state roads, which is connected at some nodes of the motorway network to the toll motorway network. By driving on a first toll section a _i the vehicle leaves the toll-free road network. The link detection program is configured to recognize whether the vehicle has traveled the first toll section a _i by leaving the toll-free route network. In this case, it provides the registered route section identifier s _i with an entry time stamp of the time T _{i1 of} the driveway onto the first toll road section a _i . At the same time it registers a first route _value , for example D _i1 = 0 km, from the driveway. The link detection program is further configured to detect the distance traveled from the driveway by a data tap from the speedometer of the vehicle or to determine by subtraction. It may also be configured to receive position data from the GPS device continuously and by repeated Difference formation of successive position data to determine sections and to determine by adding the sections a driven from the driveway total distance.

By departing from the toll section a _i , the vehicle may leave the toll road network again, unless it continues on the immediately following toll section a _{i + 1} on.

The stretch recognition program is adapted to detect whether the toll motorway network was _{+ 1} left between a first toll road section a _i and a second, the first toll road section a _i immediately following, toll road section a _{i + 1} to a node k _i. Furthermore, it is possible to detect alternatively whether the vehicle continues on the immediately following toll-liable route section a _{i + 1} in the motorway network. In the case of recognizing the exit of the motorway network, the route section recognition program provides the registered route section identifier s _i with a departure time stamp of the time T _i2 of departure from the first toll route section a _i . In the case of recognizing a continuation of travel on the immediately following toll section a _{i + 1} remains an addition of the time stamp to the section identifier s _{i + 1} .

In the event that the link detection program could not detect the exit from the motorway network at the departure k _{i + 1} nor could recognize the continuation of the immediately following toll section a _{i + 1 of} the motorway network, the link detection program performs the following procedure: It continuously determines the distance traveled from the vehicle's driveway to the first toll section by difference formation of continuously measured second distance values D _ij . As soon as a determined traveled distance is greater than a first limit distance value D _{j, max} , which corresponds to a maximum length of the first distance section a _i , the motorway network is registered as abandoned and leaving the motorway network by providing the registered route section identifier s _i with a departure route. Timestamp of the time T _{i2 of} the substitute ascertained departure from the first toll road section a _i carried out by the _{link detection} program. Thus, the route section identifier also receives a departure time stamp T _i2 , if the departure of the route section could not be determined by comparing the position data with the geo object of the node k _{i + 1} by the link detection program.

FIRST EMBODIMENT: DECENTRAL PARTIAL TEST

In the first variant of the first embodiment, a first drive of a truck as a vehicle 210 in the road network of Fig. 2a Consider the toll road sections a ₁₀₁ (k ₁₀₁ , k ₁₀₂ ) and a ₁₀₂ (k ₁₀₂ , k ₁₀₃ ) with the route section identifiers s ₁₀₁ and s ₁₀₂ (short: sections s ₁₀₁ and s ₁₀₂ ) and then a second time via the toll road sections a ₁₀₂ (k ₁₀₂ , k ₁₀₃ ) with the route section identifier s ₁₀₂ (short: section s ₁₀₂ ) leads on a highway. The sequence of links identified by the link detection program executed by the processor 203 on the OBU 200 and registered in the first data memory 201 of the OBU 200 is s ₁₀₁ , s ₁₀₂ , s ₁₀₂ .

There are two alternative routes on which this sequence can occur: Firstly, by following the route section a ₂₀₂ (k ₁₀₃ , k ₁₀₂ ) with the route section identifier s ₂₀₂ , which designates the route section of the highway which runs in the opposite direction to the route section s ₁₀₂ lies; second, by driving through the toll-free national roads L 1222 and L 1121 through the village. For reasons of data protection, the course of journeys in the toll-free route network with regard to the position of the vehicle is not recorded, let alone registered centrally.

This leaves without further ado, whether the freeway section s _{202 was} actually not used due to the journey in the toll-free road network, or whether due to a mistake the driving of the freeway section s _{202 was} not recognized.

A gap detection program executed by the processor 203 of the OBU 200 compares the first precursor-successor pair of links s ₁₀₁ and s ₁₀₂ with the gap matrix of the second data memory 202 Fig. 3 and finds no link details in that cell. Thus, the gap detection program qualifies the first precursor-successor pair at link sections s ₁₀₁ and s ₁₀₂ as gapless, so that no further analyzes are performed with respect to this first precursor-descendant pair of link sections s ₁₀₁ and s ₁₀₂ .

Subsequently, the gap detection program compares the second precursor-successor pair at link sections s ₁₀₂ and s ₁₀₂ with the gap matrix of FIG Fig. 3 and finds the link identifier s ₂₀₂ in the subject cell. Thus, the gap detection program qualifies and sets the first precursor-successor pair of links s ₁₀₂ and s ₁₀₂ as gaps with the stretched section a ₂₀₂ and s ₁₀₂ as the selected link identifier Examining gap sequence s ₁₀₂ , s ₁₀₂ ready for further analysis by a decentralized error detection program according to the invention.

With the descent of the track section _102, a first time value T s _1,102 by a radio clock of the OBU has been detected 200 and ₁₀₂ stored by the road section identification program together with the identifier of the precursor-route section s in the first data store two hundred and first With the renewed driveway on the route section s ₁₀₂ , a second time value T _{2.102 was detected} by the radio clock of the OBU and stored by the route section _{recognition program} together with the identifier of the successor route section s ₁₀₂ .

The distributed error detection program executed by the processor 203 of the OBU 200 forms a vehicle movement parameter in the form of a time difference having the value of 30 minutes from the first time value and the second time value. From a distance matrix stored in the second data memory 202, the error detection program for the gap sequence to be examined extracts a reference distance value of 20 km, which corresponds to the length of the route for driving on the toll-free national roads L 1222 and L 1121 through the village. From the time difference and the reference distance value, the error detection program calculates an average speed for the travel from the departure of the route section a ₁₀₂ to the entry of the route section a ₁₀₂ , which is 40 km / h. From a speed matrix stored in the second data memory 202, the error detection program extracts a value of a reference limit speed of 60 km / h for the gap sequence to be examined. It then checks whether the value of the average speed provided as vehicle movement parameter corresponds to the rule of exceeding the reference speed value. Since the average speed determined is 40 km / h less than the 60 km / h reference speed limit normally exceeded on the motorway, the drive usually runs through the village on the toll-free national roads L 1222 and L 1121 not, the test result is negative with the result that no error signal is generated. As a result, the OBU uses its GSM module to send the link sequence s ₁₀₁ , s ₁₀₂ , s ₁₀₂ to the control center without an error message. Transmission of the recorded time values and determined vehicle movement parameter values may be omitted due to the error-negative test result, so that the use of these data remains entirely in the privacy of the user's own OBU.

It is assumed below that instead of the toll-free route described, the vehicle actually traveled on the selected (unrecognized) section s ₂₀₂ because there is a petrol station on this section of the route which it had to visit. By the one with the refueling connected pause results in the same time difference of 30 min, so that the aforementioned plausibility check would erroneously provide an error-negative result. Such an erroneous result can be avoided by alternative or additional plausibility checks.

In such an alternative plausibility check, only the time periods from departure from the section s ₁₀₂ are taken into account for forming the time difference in which the vehicle travels faster than a limit speed of 10 km / h. Standstill of the vehicle at petrol stations, rest areas or traffic jams can thus be excluded from consideration. Less than 24 minutes downtime at the gas station, the time difference value of 6 minutes and the reference distance of 20 km results in an average speed of 200 km / h, which is atypical for a lorry operating on the toll free L 1222 and L 1121 drives through the village. On the section s _202, however, which has a length of 7 km, a non-stop average speed of 70 km / h would be plausible. In this respect, the rule that the average speed must exceed the non-stop limit speed of 60 km / h results in a false positive result, which indicates a possible software error or a possible hardware error, which is the cause of this result.

• Mit der Abfahrt von dem Streckenabschnitt s₁₀₂ wurde ein erster Streckenwert D_1,102 eines Tachometers erfasst, der kommunikationstechnisch an die OBU 200 angeschlossen ist, und durch das Streckenabschnittserkennungsprogramm zusammen mit der Kennung des Vorläufer-Streckenabschnitts s₁₀₂ im ersten Datenspeicher 201 gespeichert. Mit der erneuten Auffahrt auf den Streckenabschnitt s₁₀₂ wurde ein zweiter Streckenwert D_2,102 von dem Tachometer erfasst und durch das Streckenabschnittserkennungsprogramm zusammen mit der Kennung des Nachfolger-Streckenabschnitts s₁₀₂ gespeichert.

Measured distance values can be used in a plausibility check additionally carried out for the first original plausibility check:

• With the departure of the route section s ₁₀₂ , a first route _value D _{1, 102 of} a tachometer has been detected, which is connected to the OBU 200 by communication technology, and stored by the route section recognition program together with the identifier of the precursor route section s ₁₀₂ in the first data memory 201. With the renewed access to the section s ₁₀₂ , a second distance _value D _{2.102 was detected} by the tachometer and _stored by the route section _{detection program} together with the identifier of the successor section s s ₁₀₂ .

The decentralized error detection program executed by the processor 203 of the OBU 200 forms from the first distance value and the second distance value a vehicle movement parameter in the form of a length of the traveled distance having the value of 7.4 kilometers. From the distance matrix stored in the second data memory 202, the error detection program for the gap sequence to be examined extracts a reference distance value of 7.0 km, which corresponds to the length of the route section s ₂₀₂ .

It then checks whether the value of the length of the traveled distance provided as vehicle movement parameter of the rule corresponds to the agreement with the value of the reference distance of 7.0 at a maximum deviation of amount 1 km. The result of this additional plausibility check is error-positive after the original plausibility check was error-negative. In this case, the error-positive result of the distance part check is sufficient to provide an error-positive overall result of the plausibility check regardless of the error-negative result of the time difference / average speed part check.

The consequently produced by the decentralized error detection Error signal consists in a message which is transmitted by means of the encompassed by the OBU GSM module together with the identifier of the OBU to the central data processing device 100 and in addition to the road section identifiers s _102, s ₁₀₂ of the faulty (and so that extraordinary) gap sequence contains the measured value of the length of the traveled route or an error code that refers to the error-positive partial test with respect to the reference distance.

In the central data processing device of the central EDP 100, all error messages associated with their extraordinary gap sequences are stored as error signals in a first central data memory 101. In addition, in the first central data memory 101, all route section sequences which contain the sequence of precursor-successor pair of the route sections s ₁₀₂ , s ₁₀₂ with or without gap, that is to say faulty or error-free with or without the selected route section s ₂₀₂ , are stored. Based on a set of 200 such selected sequences received over a period of one month, a central error detection program executed by the central processor 103 forms an extraordinary gap quotient in the form of an error quotient of the number of selected extraordinary gap sequences The selected section of the gap s ₂₀₂ according to the previous first plausibility check incorrectly not included, and the number of all 200 selected sequences., In addition to the selected gap sequence of the truck 210 also belongs to the selected extraordinary gap sequences an older, also according to a previous first plausibility check erroneously qualified Gap sequence of another truck. The set of all selected sequences with a precursor segment s ₁₀₂ and a successor segment s ₁₀₂ contains both all sequences with the intervening segment s ₂₀₂ , in each case in the order s ₁₀₂ , s ₂₀₂ , s ₁₀₂ in conformity with the gap matrix from Fig. 3 as well as all the gap sequences without the route section s ₂₀₂ , both the flawless ones for which the preceding first plausibility check on the sequence s ₁₀₂ , s _{102 had} not generated an error message, as well as the two faulty ones of the truck 210 and the other trucks. This extraordinary gap ratio is therefore 1%. The reference gap quotient valid for this number 200 of the set of selected sequences is 3%. A comparison of the determined extraordinary gap quotient with the reference gap quotient to the fact that the latter is exceeded by the central EDP results in a negative result of this second plausibility check, which points to a detection error by the OBU 200 of the truck 210. This detection error is stored in a database that logs acquisition errors of all OBUs assigned to the identifier of the OBU.

The error detection program extracts from this error database that this detection error was the tenth detection error of this OBU within one month. Thus, an error limit has been exceeded which triggers the sending of an error message to the OBU 200, which displays an indication on a display device of the OBU asking the user to replace the OBU 200 with a new OBU within a week.

In a second variant of the first exemplary embodiment, the lorry 210 departs from the route section s ₁₀₃ at the exit k 104 and via the state road sections L 1423, L 1124, L 1424 and the federal road section B 132 through the city to the node k ₃₁₄ at which the truck will drive onto section s _{314 of} the motorway network. The precursor-successor link pair of this gap sequence is s ₁₀₃ , s ₃₁₄ . The selected set of link identifications that make up the gap for this pair is s ₁₀₄ , s ₁₀₅ , s ₁₀₆ , s ₃₁₂ , s ₃₁₃ .

In toll-free route network now exists a route over the federal road sections B 131 and B 132, whose length is a total of 35 km shorter than the total length of the toll route of 50 km over the selected series of gaps sections. However, the travel time is ideally the same on both routes. A first plausibility check based on the time difference between both nodes k ₁₀₄ and k ₃₁₄ would therefore be error-positive for this spatial acronym in the toll-free network. Therefore, a second plausibility check based on the distance between both nodes k ₁₀₄ and k ₃₁₄ would be correctly error-negative for this abbreviation route in the toll-free network, because the federal highway route deviates significantly in terms of its length from the highway route with a reference distance of 50 km.

In the case of such a spatial abbreviation and in particular temporal abbreviation of a journey in the toll-free road network, it is not sufficient for a total error-positive result of the plausibility check, if only a partial test results in a false positive result.

Conversely, for the described route over the provincial roads, the length of which (as well as the toll route) is 50 km, a second plausibility check based on the distance between both nodes k ₁₀₄ and k ₃₁₄ for this route in the toll-free network is error-positive due to the longer travel time, the first plausibility check based on the time difference between both nodes k ₁₀₄ and k ₃₁₄ would give an error-negative result.

Only in the case in which the duration of the distance traveled is shorter than the reference time difference of the same length alternative route in the toll-free road network (error-positive result of the first part of the test) and the length of the distance traveled is comparable to the reference distance on the toll sections (faulty positive result of the second partial examination) results in a total error-positive result of the overall examination.

SECOND EMBODIMENT: COMPLETE CENTRAL TEST

The central EDP 100 receives link identifiers s _i from each OBU 200 k, which is carried by each truck 210 _{k traveling} the road network, part of which is shown in FIGS. 3a, 3b and 3c. The corresponding route sections a _i were recognized and registered as being traveled by the route section recognition program of the OBU 200 k. The route section identifiers s _{i of} the recognized route sections a _i are transmitted by means of the GSM module encompassed by each OBU 200 _k via the mobile radio communication network 300 to the central EDP together with an identifier of the OBU 200 _k and measured values of the time from a radio clock and measured values the distance transmitted by a speedometer, which were detected together with the driveway on a section a _m and the departure of a section a _n by the OBU 200 _k , which is coupled to the radio clock and the tachometer.

The central EDP forms from the received link sections s _i a set {Q} of Q sequences of a plurality of chronologically consecutively registered link identifiers (s _i , ..., s _j ).

In the context of an error search program, the central EDP selects a link identifier s _m for which the Q sequences which do not contain this link identifier are to be examined for errors. In the context of an error search program, the central computer also selects a series R _mn of a plurality of consecutively registered route section identifiers (s _m , s _n ) or (s _m , ..., s _n ) for which the Q sequences containing this series R _mn not to be included in route section identifiers, to be checked for errors.

By means of a gap detection program corresponding to that of the first embodiment, the central EDP first determines the set {Q _mn } of Q _mn selected sequences from the set {Q} of the received sequences containing a precursor link identifier s _m-1 . which corresponds to the precursor link a _m-1 which immediately precedes in the network the link a _{m of} the selected link identifier s _m or the first link a _{m of} the selected row R _mn , and a follower link identifier s _{m + 1} or s _{n + 1} corresponding to the successor route section a _{m + 1} or a _{n + 1} , which immediately _follows in the network the route section a _{m of} the selected route identifier s _m or the last route segment a _{n of} the selected series R _mn . Subsequently, the central EDP determines the set {Q0 _mn } of Q0 _mn selected gap sequences from the set {Q _nm } of Q _mn selected sequences containing the selected link identifier s _m or the selected row R _nm at link identifiers (s _m , s _n ) or (s _m , ..., s _n ) not included. For this Q _mn sequences selected, the central computer performs a first plausibility check by forming a time difference from the time measurement values of the precursor and of the successor route section and forms a distance from the distance measurement values of the precursor and of the follower track portion and first in a Partial test checks the undershooting of a measured under the difference in a time difference taken under the segment identifiers of the precursor-successor pair of a time difference matrix and checks the match of a reference distance taken under a distance segment identifiers of the precursor-successor pair from a distance matrix with the measured distance in a second part of the test , The data sets of all selected gap sequences, for which the totality of partial checks according to the comments on the first exemplary embodiment results in an error-positive result of the first plausibility check, are provided with an error code by the central EDP. These selected gap sequences, provided with such an error code, are recognized by the central EDP as selected extraordinary gap sequences.

Then, by the centralized computer, the number of Q0 _mn (f) of the selected extraordinary gap sequences of the set {Q0 _mn (f)} of selected extraordinary gap sequences and the number Q _mn of selected sequences of the set {Q _mn } of selected sequences becomes extraordinary Gap ratio q0 _mn (f) = Q0 _mn (f) / Q _mn formed. It takes into account all the gap sequences of the quantity {Q} received by the central EDP within a given period of one month.

• Die erste Fahrtroute folgt dem Verlauf der Autobahn, wobei die Fahrzeuge 210_k die Streckenabschnitte s₁₀₂, s₁₀₃ und s₁₀₄ befahren. Die ausgewählte Streckenabschnittskennung ist s₁₀₃, der Vorläufer-Streckenabschnitt ist s₁₀₂ und der Nachfolger-Streckenabschnitt ist s₁₀₄. Die ausgewählten Sequenzen von Streckenabschnitten lauten (s₁₀₂, s₁₀₃, s₁₀₄) und (s₁₀₂, s₁₀₄); die ausgewählte Lückensequenz lautet (s₁₀₂, s₁₀₄): Von der Menge {Q0_mn} an Q0_mn dieser ausgewählten Lückensequenzen wird jede Lückensequenz mittels der ersten Plausibilitätsprüfung auf einen möglichen Fehler untersucht. Über einen ersten vorgegebenen Zeitraum von einem Monat bis zu einem ersten Eingangsdatum der neuesten ausgewählten Lückensequenz werden im Falle dieses Ausführungsbeispieles durch die erste Plausibilitätsprüfung nur drei Fehler-Signale erzeugt, die diese ausgewählten Lückensequenzen als außerordentlich kennzeichnen. Im Gegenzug umfasst die Menge an Sequenzen - sprich: die Menge an Fahrten - , die das Vorläufer-Nachfölger-Paar s₁₀₂, s₁₀₄ mit oder ohne den Streckenabschnitt enthalten, einhunderttausend (100.000) Der außerordentliche Lückenquotient beträgt somit 0,003 %. Mit der zweiten Plausibilitätsprüfung wird geprüft, ob dieser außerordentliche Lückenquotient einen ersten Referenzlückenquotient von 0,1 % überschreitet. Das Ergebnis dieser zweiten Plausibilitätsprüfung ist negativ, was zur Erzeugung eines Hardware-Fehler-Signals führt, das auf einen Erfassungsfehler der betreffenden OBUs hinweist, von der die ausgewählten außerordentlichen Lückensequenzen stammen.

The implementation of the second plausibility check by the central IT system will be carried out on the basis of two different routes through the road network of the Fig. 2a . 2 B and 2c explains:

• The first route follows the course of the highway, the vehicles 210 _k the sections s ₁₀₂ , s ₁₀₃ and s ₁₀₄ drive. The selected link identifier is s ₁₀₃ , the precursor link is s ₁₀₂ and the follower link is s ₁₀₄ . The selected sequences of links are (s ₁₀₂ , s ₁₀₃ , s ₁₀₄ ) and (s ₁₀₂ , s ₁₀₄ ); the selected gap sequence is (s ₁₀₂ , s ₁₀₄ ): From the set {Q0 _mn } to Q0 _{mn of} these selected gap sequences, each gap sequence is examined for a possible error by means of the first plausibility check. In the case of this embodiment, the first plausibility check generates only three error signals over a first predetermined period of one month to a first input date of the most recently selected gap sequence, which mark these selected gap sequences as extraordinary. In turn, the amount of sequences - that is, the amount of trips - that the forerunner-trailing pair s ₁₀₂ , s ₁₀₄ with or without the leg contains, is one hundred thousand (100,000). The extraordinary gap quotient is thus 0.003%. The second plausibility check checks whether this extraordinary gap quotient exceeds a first reference gap quotient of 0.1%. The result of this second plausibility check is negative, resulting in the generation of a hardware error signal indicative of a detection error of the respective OBUs from which the selected extraordinary gap sequences originate.

Over a second predetermined period of one month to a second input date of the latest selected gap sequence later than the first arrival date, the first plausibility check will now yield 1000 fault signals with a constant total of 100,000 trips. In the second plausibility check, it is now found that the first reference gap quotient of 0.1% was exceeded by the extraordinary gap quotient of the second period of 1%. The central computer then issues a software error signal. At the same time, the central EDP notes that the extraordinary gap ratio is continuously increasing in comparison to the previous results of the second plausibility check.

The central EDP is trained to shorten the predetermined period of the second plausibility check in cases in which the second plausibility check brings a fault-positive result. For a third predetermined period of time from one 24 hours to the minute-by-second second input date, the fault detection program determines that 900 fault signals come to a total of 3000 runs. This corresponds to an extraordinary gap quotient of 30%. In a third plausibility check, the central computer system determines that this extraordinary Gap quotient exceeds a second reference gap quotient of 10%. As a result, the central EDP outputs a recognition error signal indicative of a recognition error for the link s ₁₀₄ . With an on-the-spot check at the node k ₁₀₃ which the vehicle has to pass in order to access the gap route section from the precursor route section, it is determined that the road guidance in the area of this node k _{103 has been} changed, which is represented by the square representation this knot k ₁₀₃ in the Fig. 2b that the road network of Fig. 2a at a later stage is illustrated.
This change in the road guidance in the area of the node k ₁₀₃ has led to the route section recognition program no longer reliably detecting the passage of the gap route section s ₁₀₃ .

The second route includes the sections s ₁₀₁ on the highway and the sections L 1121, L 1122, L 1123, L 1124 and L 1125 and the section s s ₃₁₅ according to Fig. 2a ,

The selected series of link identifiers are s ₁₀₂ , s ₁₀₃ , s ₁₀₄ , s ₁₀₅ , s ₁₀₆ , s ₃₁₂ , s ₃₁₃ , s ₃₁₄ ; the precursor link is s ₁₀₁ and the follower link is s ₃₁₅ . The selected sequences of links are (s ₁₀₁ , s ₁₀₂ , s ₁₀₃ , s ₁₀₄ , s ₁₀₅ , s ₁₀₆ , s ₃₁₂ , s ₃₁₃ , s ₃₁₄ , s ₃₁₅ ) and (s ₁₀₁ , s ₃₁₅ ); the selected gap sequence is (s ₁₀₁ , s ₃₁₅ ): From the set {Q0 _mn } to Q0 _{mn of} these selected gap sequences, each gap sequence is examined for a possible error by means of the first plausibility check.

In this case, the first plausibility check is based on a check as to whether the measured time difference for the trip from the precursor route section ₁₀₁ to the successor route section _{314 is} less than a reference time difference, the fastest travel time of 60 minutes over the said route in toll-free Road network through the city corresponds. Over a first predetermined period of one month to a first date of receipt of the latest selected gap sequence, the first plausibility check generates only an error signal that marks one of the selected gap sequences as extraordinary. In turn, the amount of sequences - that is, the amount of journeys - that the forerunner-successor pair (s ₁₀₁ , s ₃₁₅ ) contains, with or without the stretch of track, is ten thousand (10,000). The extraordinary gap quotient is thus 0.01%. , The second plausibility check checks whether this extraordinary gap quotient exceeds a first reference gap quotient of 0.1%. The result of this second plausibility check is negative, resulting in the generation of a hardware error signal that indicates a detection error of the OBU concerned, from which the selected extraordinary gap sequence originated.

Over a second predetermined period of one month to a second input date of the latest selected gap sequence later than the first arrival date, the first plausibility check will now yield 30 error signals for a constant total of 10,000 trips. It was found in the first plausibility check that the measured time difference is less than 60 minutes in all error cases.

In the second plausibility check, it is now determined that the first reference gap quotient of 0.1% was exceeded by the extraordinary gap quotient of the second period of 0.3%. The central computer then issues a software error signal. At the same time, the central EDP notes that the extraordinary gap quotient has remained constant compared to earlier results of the second plausibility check. The central EDP takes this as an opportunity to determine that initially no exceeding of the second reference gap quotient is to be expected.

As a result, the central EDP outputs a reference error signal indicative of a reference error for gaps in the above-mentioned row or for precursor-successor pairs of link segments (s ₁₀₁ , s ₃₁₅ ). With a review of the toll-free route on-site it is noted that the road guidance in the area of the city was changed by the city - as in Fig. 2c represented, has received a local bypass U 11234 on which the national road sections L 1123 and L 1124 - and with them the city - can be bypassed. On this alternative route results in a much shorter travel time than through the city. The measured time differences leading to the error signal of the first plausibility check are in the range of 45 minutes to 50 minutes with an average of 48 minutes. The central EDP is configured to change the value of the reference time difference for said precursor-follower pair of link sections (s ₁₀₁ , s ₃₁₅ ) in the time difference matrix based on the reference error signal. Here, by the error detection program executed by the central processor, the value of the reference time difference stored in the second central data memory for said precursor-successor pair of link sections (s 101, s ₃₁₅ ) is replaced by a changed value of the reference time difference. These changed values correspond to the determined average less twice the maximum deviation of a measured time difference value that is not more than 10% less than the mean value itself. This maximum deviation is 3 minutes, so that the changed value of the reference time is 42 minutes.

For the case in which the toll system is designed to have the first plausibility check - as described in the first exemplary embodiment - carried out by the OBU, the central EDP is designed to transmit the changed value of the reference time difference over the mobile radio network to each OBU of the plurality 200 of OBUs to be transmitted, which in turn are adapted to overwrite the value of the reference time difference stored in its second data memory by the changed value of the reference time difference.

Claims (13)

Method for error detection in a toll system, the
at least one central data processing device (100) and
comprises at least a plurality of decentralized data processing devices (200),
each of which (200k) i) is carried by a toll vehicle (210 k) to which it is assigned, and (ii) is designed to record traffic data representative of the tolling of toll sections a _{i of} a network of toll sections by the toll vehicle (210 k) and iii) has a decentralized radio communication device (20.5 k) at least for sending data to the central data processing device (100) or at least temporarily communicatively coupled to such a device, in which
at least one of the data processing devices (100/200 k) is formed,
by means of a route segment recognition program for processing the travel data to detect the respective route sections (a _i ) by the respective vehicle (210 k) and the respective sections (a _i ) corresponding Streckenabschnittskennungen (s _i ) in the time sequence and / or in each case associated with to record a time value of their passage through the respective vehicle (210 k),
in which a) by at least one of the data processing means (100/200 k) at least one gap sequence to be examined (Q0 _mn ^(u) ), of at least one sequence of a plurality of, a specific vehicle (210 k) associated, sequentially registered track section identifiers (s _i , ..., s _j ) is provided,
wherein the gap sequence to be examined (Q0 _mn ^(u) ) is characterized in that it comprises at least one selected link clipping (s _m ) or at least one selected line (R _mn ) of a plurality of different link clues ((s _m , s _n ) or (s _m , ..., s _n )) does not contain any sections (a _m , a _n or a _m , ..., a _n ) directly following one another in the section network, and
includes a precursor link identifier (s _m-1 ) corresponding to the precursor link (a _m-1 ) in the network to the link a _{m of} the selected link identifier (s _m ) or the first link (a _m ) of the selected one Row (R _mn ) immediately ahead, and contains a successor track segment identifier (s _{m + 1} or s _{n + 1} ) corresponding to the successor link segment (a _{m + 1} or a _{n + 1} ) which is present in the network ( a _m ) immediately _follows the selected link identifier (s _m ) or the last link segment (a _n ) of the selected series (R _mn ); b) for the gap sequence to be examined (Q0 _mn ^(u) ) in the course of at least a first plausibility check by at least one of the data processing devices (100/200 k) is checked whether
at least a first vehicle motion parameter value,
which is formed or derived from at least one first measured value of the vehicle movement which was detected in connection with the driving data by the decentralized data processing device (200 k)
and the precursor-follower pair of prefix and successor link identifiers (s _m-1 , s _{m + 1} or s _{n + 1} ) of recognized precursor link (a _m-1 ) and recognized follower link (a _{m + 1} or a _{n + 1} ),
at least one first rule relating to at least one first reference parameter value for the precursor-successor pair (s _m-1 , s _{m + 1} or s _{n + 1} ),
which is or was at least temporarily stored in at least one central data memory (101) of the central data processing device (100),
enough;
in which c) if the first plausibility check yields a positive result, an error signal indicative of a possible error is generated by the checking data processing device (100/200 k);
and d) if the first plausibility check yields a negative result, no signal is generated by the testing data processing device (100/200 k) or a non-error signal is generated which does not indicate an error. characterized in that
the first vehicle motion parameter is a limit speed duration as a sum of partial durations during which the vehicle speed exceeds a limit speed as the first measured value, the first reference parameter being a reference limit speed duration and the first rule being less than or exceeding the reference limit speed duration value by the limit speed duration value. Method according to one of the preceding claims, characterized in that at least the first reference parameter value is a reference parameter value of a plurality of reference parameter values, which for a plurality of combinations of precursor-successor pairs of link identifiers (s _i , s _j ) in cells of a reference parameter matrix in form a table with precursor route section identifiers (s _i ) as column values and successor route section identifiers (s _j ) as line values or vice versa are at least temporarily stored in at least one central data memory (101) of the central data processing device (100). Method according to one of the preceding claims, characterized in that, in the course of the first plausibility check, it is additionally checked whether at least one second vehicle movement parameter value,
which is formed or derived from at least one second measured value of the vehicle movement which was recorded in connection with the travel data by the decentralized data processing device (200 k)
and the precursor-follower pair of prefix and successor link identifiers (s _m-1 , s _{m + 1} or s _{n + 1} ) of recognized precursor link (a _m-1 ) and recognized follower link (a _{m + 1} or a _{n + 1} ),
at least one second rule relating to at least one second reference parameter value for the precursor-successor pair (s _m-1 , s _m-1 or s _{n + 1} ),
which is or was at least temporarily stored in at least one central data memory (101) of the central data processing device (100),
enough;
in which
the second vehicle motion parameter is one of the following parameters: i) a distance which is dependent on a first distance value (D _m-1 ) as the second measured value, which is the Precursor link identifier (s _m-1 ) and at least one second distance value (D _{m + 1} or D _{n + 1} ) as a third measurement associated with the follower link identifier (s _{m + 1} or s _{n + 1} ) is; ii) a mean fictitious vehicle speed obtained by dividing a reference distance for the precursor-follower pair of link identifiers (s _m-1 , s _{m + 1} or s _{n + 1} ) by the limit speed duration; (iii) a limit speed route as the sum of sections where the vehicle speed exceeds a limit speed; iv) a limit speed range ratio formed by dividing the limit speed distance of (iii) by the distance of (i); in each case i) the second reference parameter is a reference distance and the second rule is the correspondence of the distance value with the reference distance value within a predetermined, maximum permissible deviation of the distance value from the reference distance value; ii) the second reference parameter is a reference speed and the second rule is exceeding the reference speed value by the average fictitious vehicle speed value; iii) the second reference parameter is a reference limit speed distance and the second rule is the reference limit speed range value exceeded by the limit speed range value; iv) the second reference parameter is a reference limit speed ratio and the second rule is exceeding the reference limit speed ratio value by the limit speed ratio value. Method according to one of the preceding claims, characterized in that the checking data processing device is at least one decentralized data processing device 200 k),
in which
in each case a copy of the reference parameter value is stored in at least one decentralized data memory (201 k) in each of the decentralized data processing devices (200 k), detects and / or effects a possible change of the reference parameter value in the central data memory (101) by the central data processing device (100) will, and
the central data processing device (100) is designed, a transmission of the changed Trigger reference parameter value to each of the decentralized data processing devices (200 k),
and where
at least the error signal of the decentralized data processing device (200 k) is sent by means of the decentralized radio communication device (205 k) to the central data processing device (100). A method according to claim 4, characterized in that together with the error signal or as an error signal, the first vehicle movement parameter and the respective precursor-successor pair of link identifiers (s _m-1 , s _{m + 1} or s _{n + 1} ) by means of decentralized radio communication device (205 k) is transmitted to the central data processing device (100) and
the central data processing device (100) is adapted to count error signals which it receives to the relevant precursor-successor pair of link identifiers (s _m-1 , s _{m + 1} or s _{n + 1} ) in at least one predetermined time interval , and
the number of errors of the counted error signals
or
an error quotient formed from the number of errors of the counted error signals and the total number of sequences comprising the respective precursor-successor pair of link identifiers (s _m-1 , s _{m + 1} or s _{n + 1} ), and the central data processing system has received in the predetermined time interval from the plurality of decentralized data processing devices, e) subjecting it to a second plausibility check, with which it is checked whether the number of errors error signals exceeds a predetermined first reference error number or the error quotient exceeds a predetermined first reference error quotient; in which f) if the second plausibility check yields a positive result, the central data processing device (100) generates a software error signal indicative of a possible software error;
and g) if the second plausibility check produces a negative result, the central data processing device (100) generates a hardware error signal indicative of a possible detection error in the detection of the drive data by the remote data processing device (200 k) of which the Traffic data derived, which were based on the examined gap sequence. Method according to one of claims 1 to 4, characterized in that the checking data processing device is the central data processing device (100),
in which
the central data processing device (100) includes travel data and / or at least one sequence Q ^(k) of a plurality of consecutively registered route section identifiers (s _i , ..., s _j ) together with at least the first measured value and / or at least the first vehicle motion parameter value from the decentralized one Data processing device (200 k) receives. Method according to one of Claims 1 to 4 and 6, characterized in that the central data processing device (100) of the plurality of decentralized data processing devices (200) has a set {Q} of Q sequences of a plurality of consecutively registered route section identifiers (s _i , .. ., s _j ) or travel data from which the central data processing device acquires the set {Q} of Q of said sequences by means of the link detection program, and
for at least one selected route section identifier s _m or at least one selected series R _mn of a plurality of route section identifiers (s _m , s _n ) or (s _m , ..., s _n ) on route sections a _m , a _n or a immediately following one another in the route network _n , .... a _m by the central data processing device (100) i) that the set {Q _{mn} mn} of Q sequences selected from the set {q} of the received sequences is determined, which contain a precursor route section identifier s _m-1, which corresponds to the precursor stretch a _m-1, of the web the track section a _{m of} the selected track section identifier s _m or the first track section a _{m of} the selected row R _mn immediately preceded, and a successor track section identifier s _{m + 1} or s _{n + 1} , the successor track section a _{m + 1} or a _{n + 1} corresponding to the network section a _m the selected link identifier s _m or the last link a _{n of} the selected row R _mn immediately follows, and ii) determining the set {Q0 _mn ^(f) } of Q0 _mn ^(f) selected extraordinary gap sequences from the set {Q _nm } of the selected sequences containing the selected link ID s _m or the selected row R _nm at link IDs (s _m , s _n ) or (s _m , ..., s _n ) and which triggered the error signal in the first plausibility check, in which
further from the number Q0 _mn ^{(f) of} the selected extraordinary gap sequences of the set {Q0 _mn ^(f) } of selected extraordinary gap sequences and the number Q _mn of selected sequences of the set {Q _mn } of selected sequences, an extraordinary gap quotient q0 _mn ^{(f )} = Q0 _mn ^(f) / Q _{mn is} formed,
and where e) if the first plausibility check yields a positive result, in the course of a second plausibility check by one of the data processing devices ⁽ 100/200 k) it is checked whether the extraordinary gap quotient q0 _mn ^(f) = Q0 _mn / Q _mn exceeds at least a first reference gap quotient; f) if the second plausibility check yields a positive result, a software error signal indicative of a possible software error is generated by the checking data processing device (100/200 k); g) if the second plausibility check yields a negative result, a hardware error signal is generated by the checking data processing device (100/200 k) that indicates a possible detection error with regard to the detection of the drive data by the decentralized data processing device (200 k), from which the trajectory data was based, based on the investigated gap sequence. A method according to claim 7, characterized in that
the first reference gap quotient is greater than 0.001% and less than 10%. A method according to claim 7 or 8, characterized in that
a gap quotient q0 _{mn is} only formed and the second plausibility check is performed only if the number Q _{mn of} the selected sequences is not less than a predetermined minimum number Q _mn ^(min) and not greater than a predetermined maximum number Q _mn ^(max) , wherein the predetermined minimum number Q _mn ^{(min) is} equal to 100 and the predetermined maximum number Q _mn ^{(max) is} equal to 1,000,000. Method according to one of Claims 7 to 9, characterized in that, triggered by the reference error signal by means of the central data processing device (100), the erroneous reference parameter value in the central data memory (101) is replaced by a changed reference parameter value which is so far from the faulty reference parameter differs that the first vehicle motion parameter value, with respect to which the first plausibility check had yielded a positive result, would bring a negative result in a renewed first plausibility check according to the first rule with respect to the changed reference parameter value. Decentralized data processing device (200) of a toll system,
comprising at least one central data processing device (100),
wherein the decentralized data processing device (200) is provided for entrainment in a toll vehicle (210), to which it is assigned, as well as
is designed to record driving data that are representative of the tolling of toll sections a _i a network of toll sections through the toll vehicle (210) and
a decentralized radio communication device (205) at least for the purpose of sending data to the central data processing device (100) or at least temporarily communicatively coupled to such a device,
wherein the decentralized data processing device is set up,
execute, by means of at least one processor, a link detection program for processing the drive data with the result of detecting the passage of the respective route sections a _i through the vehicle (210),
and register the respective route sections a _i corresponding route section identifiers s _i in the chronological order and / or in each case linked to a time value of their driving through the vehicle (210) in a data memory,
characterized in that
the decentralized data processing device is set up, a) to provide at least one gap sequence Q0 _mn ^(u) to be examined by a respective plurality of track segment identifiers (s _i , ..., s _j ) assigned to the toll vehicle (210) and registered in chronological succession,
the gap sequence Q0 _mn ^{(u) being} characterized in that it comprises at least one selected link identifier s _m or at least one selected series R _mn of a plurality of different link identifiers (s _m , s _n ) or (s _m , ..., s _n ) does not contain sections a _m , a _n or a _n , ..., a _m immediately following one another in the section network, and
includes a precursor link identifier s _m-1 corresponding to the precursor link a _m-1 immediately preceding the _link a _{m of} the selected link identifier s _m or the first link a _{m of} the selected row R _mn , and a follower Train section identifier s _{m + 1} or s _{n + 1} , which corresponds to the successor route section a _{m + 1} or a _{n + 1} , in the network the link section a _{m of} the selected link identifier s _m or the last link section a _{n of} the selected series R _im immediately succeeds; b) for the gap sequence Q0 _mn ^(u) to be examined, it is to be examined in the course of at least a first plausibility check whether
at least a first vehicle motion parameter value,
which is formed or derived from at least one first measured value of the vehicle movement which was detected in connection with the travel data by the decentralized data processing device (200)
and the precursor-successor pair has been assigned to link identifiers (s _m-1 , s _{m + 1} or s _{n + 1} ) from recognized precursor link a _m-1 and recognized follower link a _{m + 1} or a _{n + 1} .
at least one first rule relating to at least one first reference parameter value for the precursor-successor pair of link identifiers (s _m-1 , s _{m + 1} or s _{n + 1} ) at least temporarily in at least one decentralized data memory (201) of the decentralized data processing device ( 200) is stored or was,
enough; c) if the first plausibility check yields a positive result, in an error message the first vehicle movement parameter and the respective precursor-successor pair of route segment identifiers (s _m-1 , s _{m + 1} or s _{n + 1} ) by means of the decentralized radio To send the communication device (205) to the central data processing device (100);
and d) if the first plausibility check yields a negative result, no error message by means of the decentralized wireless communication device (205) to the central data processing device (100) to send or
in a non-error message, the respective precursor-successor pair of link identifiers (s _m-1 , s _{m + 1} or s _{n + 1} ) without the first vehicle motion parameter by means of the decentralized radio communication device (205) to the central data processing device ( 100) to send; characterized in that
the first vehicle motion parameter is a limit speed duration as a sum of partial durations during which the vehicle speed exceeds a limit speed as the first measured value, the first reference parameter being a reference limit speed duration and the first rule being less than or exceeding the reference limit speed duration value by the limit speed duration value. Decentralized data processing device (200) according to claim 11
with a decentralized data store (201) in which
a plurality of reference parameter values indicative of a plurality of combinations of precursor-follower pairs of link identifiers (si, sj) in cells of a reference parameter matrix in the form of a table of precursor link identifiers si as column values and successor link identifiers sj as row values, or vice versa; are temporarily stored, the decentralized vehicle device is set up,
receive at least one changed reference parameter value for a particular precursor-successor pair of link identifiers (si, sj) from the central processing device, and the previously in the remote data store for the particular precursor-follower pair Line reference identifiers (si, sj) stored reference parameter value to be replaced by the changed reference parameter value. Central data processing device (100) of a toll system,
comprising a plurality of decentralized data processing devices (200),
each of which (200k) i) is carried by a toll vehicle (210 k) to which it is assigned, and (ii) is designed to record traffic data representative of the tolling of toll sections a _{i of} a network of toll sections by the toll vehicle (210 k) and iii) has a decentralized radio communication device (205 k) at least for the purpose of sending data to the central data processing device (100) or is at least temporarily coupled to it by communication technology, in which
at least one of the data processing devices (100/200 k) is formed,
by means of a route segment recognition program for processing the travel data to recognize the respective route sections a _i by the respective vehicle (210 k) and the respective route sections a _i corresponding route section identifiers s _i in chronological order and / or each associated with a time value of their passage through the to register each vehicle (210 k),
characterized in that
the central data processing device (100) is configured to receive travel data and / or time-ordered route segment identifications s _i from each of the plurality of decentralized data processing devices (200), and
the central data processing device (100) has a central data memory (101) or at least temporarily communicatively coupled to one in which at least temporarily a set {Q} of Q sequences of a plurality of consecutively registered route section identifiers (s _i , ..., s _j ) each associated with one of the plurality of remote data processing devices (200) are stored and provided for processing at the central data processing device,
wherein the central data processing device is designed, a) for at least one selected route section identifier s _m or at least one selected row R _mn of several different route section identifiers (s _m , s _n ) or (s _m , .... s _n ) on the route section network immediately consecutive route sections a _m , a _n or a _n , ..., a _m i) determine the set {Q _mn } of Q _mn selected sequences from the set {Q} of the provided sequences containing a precursor link identifier s _{m -1} corresponding to the precursor link a _n-1 in the network the track section a _{m of} the selected track section identifier s _m or the first track section a _{m of} the selected row R _mn immediately preceded, and a successor track section identifier s _{m + 1} or s _{n + 1} , the successor track section a _{m + 1} or a _{n + 1} , which immediately _follows in the network the link section a _{m of} the selected link identifier s _m or the last link section a _{n of} the selected series R _mn , and ii) determine the set {Q0 _mn } of Q0 _mn selected gap sequences from the set {Q _nm } of the selected sequences containing the selected link identifier s _m or the selected row R _nm at link identifiers (s _m , s _n ) or (s _m , ..., s _n ) are not included; b) for at least one gap sequence Q0 _mn ^{(u) of} the set {Q0 _mn } to be examined at selected gap sequences in the course of at least a first plausibility check, to check whether
at least a first vehicle motion parameter value,
which is formed or derived from at least one first measured value of the vehicle movement, which was recorded in connection with the travel data from that decentralized data processing device (200 k) to which the gap sequence Q0 _mn ^(u) to be examined is assigned
and the precursor-successor pair has been assigned to link identifiers (s _m-1 , s _{m + 1} or s _{n + 1} ) from recognized precursor link a _m-1 and recognized follower link a _{m + 1} or a _{n + 1} .
at least one first rule relating to at least one first reference parameter value for the precursor-successor pair of link identifiers (s _m-1 , s _{m + 1} or s _{n + 1} ) at least temporarily in at least one central data memory (101) of the central data processing device ( 100) is stored or was,
enough; c) if the first plausibility check yields a positive result, generating an error signal indicative of a possible error;
and d) if the first plausibility check yields a negative result of not generating a signal or producing a non-error signal indicative of no error; characterized in that
the first vehicle motion parameter is a limit speed duration as a sum of partial durations during which the vehicle speed exceeds a limit speed as the first measured value, the first reference parameter being a reference limit speed duration and the first rule being less than or exceeding the reference limit speed duration value by the limit speed duration value.

Images