EP2761609B1 - Method for transmitting route data for traffic telematics - Google Patents

Method for transmitting route data for traffic telematics Download PDF

Info

Publication number
EP2761609B1
EP2761609B1 EP12743736.6A EP12743736A EP2761609B1 EP 2761609 B1 EP2761609 B1 EP 2761609B1 EP 12743736 A EP12743736 A EP 12743736A EP 2761609 B1 EP2761609 B1 EP 2761609B1
Authority
EP
European Patent Office
Prior art keywords
road
vehicle
probability
junctions
traffic
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
EP12743736.6A
Other languages
German (de)
French (fr)
Other versions
EP2761609A1 (en
Inventor
Christian SKUPIN
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Robert Bosch GmbH
Original Assignee
Robert Bosch GmbH
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Robert Bosch GmbH filed Critical Robert Bosch GmbH
Publication of EP2761609A1 publication Critical patent/EP2761609A1/en
Application granted granted Critical
Publication of EP2761609B1 publication Critical patent/EP2761609B1/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G08—SIGNALLING
    • G08G—TRAFFIC CONTROL SYSTEMS
    • G08G1/00—Traffic control systems for road vehicles
    • G08G1/01—Detecting movement of traffic to be counted or controlled
    • G08G1/0104—Measuring and analyzing of parameters relative to traffic conditions
    • G08G1/0108—Measuring and analyzing of parameters relative to traffic conditions based on the source of data
    • G08G1/012—Measuring and analyzing of parameters relative to traffic conditions based on the source of data from other sources than vehicle or roadside beacons, e.g. mobile networks
    • G—PHYSICS
    • G08—SIGNALLING
    • G08G—TRAFFIC CONTROL SYSTEMS
    • G08G1/00—Traffic control systems for road vehicles
    • G08G1/01—Detecting movement of traffic to be counted or controlled
    • G08G1/0104—Measuring and analyzing of parameters relative to traffic conditions
    • G08G1/0108—Measuring and analyzing of parameters relative to traffic conditions based on the source of data
    • G08G1/0112—Measuring and analyzing of parameters relative to traffic conditions based on the source of data from the vehicle, e.g. floating car data [FCD]
    • G—PHYSICS
    • G08—SIGNALLING
    • G08G—TRAFFIC CONTROL SYSTEMS
    • G08G1/00—Traffic control systems for road vehicles
    • G08G1/01—Detecting movement of traffic to be counted or controlled
    • G08G1/0104—Measuring and analyzing of parameters relative to traffic conditions
    • G08G1/0137—Measuring and analyzing of parameters relative to traffic conditions for specific applications
    • G08G1/0141—Measuring and analyzing of parameters relative to traffic conditions for specific applications for traffic information dissemination

Definitions

  • the present invention relates to a method for traffic telematics information provision about the traveling route of a vehicle which is moved in a road system having a plurality of roads, the roads being connected to each other between road connection points.
  • the aim of traffic telematics is to make the most efficient use of existing transport infrastructure, for example to avoid traffic jams and empty and search trips by vehicles. Furthermore, the traffic safety can be increased, resulting in a reduction of accidents is achieved. Environmental impact can also be reduced by making vehicles more efficient and by optimizing routes. This reduces the CO2 emissions in road traffic in particular.
  • traffic telematics refers to individual traffic, and information about current or future driving routes from vehicles to central processing units or to vehicles is interchanged.
  • information that is the technology of information provision by the vehicle, based on various standards.
  • the various standards have different data record sizes, and the aim is to convey the most efficient possible transmission of the information content contained in the probable future microscopic vehicle route.
  • the microscopic vehicle route relates to the vehicle near field, for example directly roads or surrounding road paths with possible road junctions such as intersections or junctions.
  • a known method for describing the future vehicle route which is also referred to in the traffic-microscopic area as a preceding vehicle trajectory or probable path, relates to the use of a coordinate sequence.
  • the vehicle trajectory can be defined by this frequency of coordinates (Coordinate tuple) by describing the coordinates of the geo-coordinates of the trajectory to be described in a suitable resolution.
  • Map matching other road users can project the coordinate sequence on their digital map and thus close to the transmitted trajectory. In this way, the advantage can be achieved that, in principle, the shape of the trajectory can be reproduced as exactly as desired by means of a correspondingly high sequence length and resolution, in order to transmit them accordingly.
  • a plurality of point coordinates may be required, typically about 30 to 50 point coordinates for a respective microscopic trajectory.
  • the transmission of several probable trajectories generates a relatively high amount of data in this way.
  • 100 point coordinates already generate 800 bytes of net data using the usual WGS84 coordinates.
  • WGS84 coordinates When using the C2X communication via IEEE 802.11p for the transmission of the data, such a packet size can already be regarded as critical.
  • the possible trajectories are likely to contain significant redundancies.
  • Another transmission standard is the SAE J2735 Dedicated Short Range Communication (DSRC) Message Set Dictionary standard, and this standard is specified via the DF_PathPrediction element with a data field for immediate vehicle trajectory prediction. It consists of an indication of the current steering angle. This provides the advantage that this standard can essentially be provided for the prediction of the future lane, but this prediction is not sufficient for defining the microscopic driving route.
  • DSRC Dedicated Short Range Communication
  • AGORA-C Another standard known is the AGORA-C standard and defines a methodology that enables a relatively reliable positional referencing independent of the respective underlying digital map.
  • traffic network-specific attributes such as the road class and the direction of the corresponding section of the route are used. Both individual points of the road network as well as road sections or entire areas of a road network can be referenced.
  • An AGORA-C referencing of a single point typically has a data size of less than 50 bytes, while the referencing of link sections consisting of a few kilometers may require significantly more than 100 bytes.
  • the invention includes the technical teaching that the method comprises at least the steps of determining and assigning a probability to a respective road junction with which the vehicle approaches the road junction and has the transmission of the road junctions that are traveled with increased likelihood.
  • connection point likelihood approach is based on the idea not to transmit the complete trajectories, but only the relevant road connection points, each of these possible branches being assigned a probability of their use.
  • the possible traffic microscopic routes between the crossing points can thus be represented in the form of a tree structure.
  • the vehicle may include a traffic telematics unit and the data about the possible road junctions are transmitted either to another road user or to a central processing unit having a transmitter for receiving and transmitting data.
  • a map matching method of the route determined with an increased probability is executed with an electronic road map, so that the possible driving route of the vehicle is received with corresponding probability by other road users.
  • the map matching of the transmitted crossing points By means of the map matching of the transmitted crossing points, other road users can infer the possible route of the vehicle.
  • the probability of using the respective route can be determined by multiplying the corresponding branch probabilities along this route.
  • the referencing of the crossing points is made possible using a card-based independent method such as the AGORA-C method.
  • possible upcoming road connection points are transmitted, which are traveled with a probability of at least 20%.
  • the likelihood of the vehicle driving through respective connection points may be determined by multiplying respective branching probabilities of successive connection points. For example, if the vehicle is approaching a turn, and a first direction of the turn allows for travel in a variety of other directions, the turn is more likely to drive through the vehicle than the second turn, for example, a smaller number of possible other travel routes provides.
  • road connection points can be assigned to different probabilities and, for example, only those road connection points are transmitted which have a minimum probability of being driven on.
  • the data transmitted by the vehicle may be limited to geo-reference data of the position of the vehicle, geo-reference data of the upcoming road junctions and / or a link of a subsequent road junction with a previous road junction and / or an identification of possible branches of a road junction.
  • the possible branches of a road connection point can be assigned probabilities with which a respective road connection point is left.
  • the data transmitted by the vehicle may include the probabilities with which the vehicle leaves a road junction. This can be done in particular with the assignment of usage probabilities of the possible branches of a road connection point. This fulfills the purpose that these probabilities can be used at the receiver in order to determine next to the most probable route the second or third most probable route, but also further probable routes.
  • An unambiguous identification of the possible branches of a road connection point can be effected, for example, by means of "Link Angles" known from the NDS (Navigation Data Standard) card format.
  • the attributes can be in the form of a neighborhood list, the so-called “Adjacency List” are transmitted and allow the complete reconstruction of the tree structure.
  • the achievable benefits are maximum flexibility in evaluating likely trajectories, and the method is based on a relatively compact data set, with little redundancy, that is, repetitive information.
  • the crossing points tend to match more reliably in a map than any points on a route segment.
  • the robustness of the method can be increased.
  • possible forthcoming road junction points can be transmitted which are traveled with a probability of preferably at least 25% and more preferably of at least 30%.
  • a higher probability limit a further reduction in the amount of data is achieved, but the possible accuracy for predicting the route to be traveled or the variety of information for predicting possible routes to be traveled decreases.
  • the present invention is further directed to a traffic telematics unit for traffic telematics information delivery about the travel route of a vehicle being moved in a multi-street road system, the roads being interconnected between road junctions, the traffic telematics being arranged to determine and assign a probability to one respective road junction point at which the vehicle approaches the road junction and for transmission of the road junctions that are likely to be traveled.
  • a traffic telematics unit for traffic telematics information delivery about the travel route of a vehicle being moved in a multi-street road system, the roads being interconnected between road junctions, the traffic telematics being arranged to determine and assign a probability to one respective road junction point at which the vehicle approaches the road junction and for transmission of the road junctions that are likely to be traveled.
  • the present invention further relates to a computer program with program code means to perform all the steps of a method having the features and advantages described above, in particular when the computer program is executed on a computer or a corresponding traffic telematics unit. Furthermore, the invention relates to a computer program product with program code means which are stored on a computer-readable medium to perform the steps of the method described above, when the computer program is executed on a computer or a corresponding traffic telematics unit.
  • FIG. 1 shows schematically the view of a road system 11, which can be traveled by a vehicle 1.
  • the vehicle 1 travels to a road junction 22, and the road junction 22 allows the roads 12, 13, and 14 to continue.
  • the road 12 leads to the road junction 23, and allows the road 15 and 16 to continue.
  • the road 13 leads to the road junction 25 and the road 14 leads to the road junction 24.
  • a driving route 10 with a high probability of driving is indicated.
  • the probability that the vehicle 1 is driving past the road junction 22 on the road 12 is greater than driving on the roads 13 or 14.
  • the vehicle 1 has a traffic telematics unit 2, via which the vehicle 1 can communicate with a traffic telematics unit 2 of another road user 28 or via a transmitting device 6 with a central processing unit 5.
  • the aim is to keep the required data volumes for communication as low as possible.
  • the invention provides that the data sent out for traffic telematics information provision merely provides for the determination and assignment of a probability to a respective road junction 22, 23, 24 and / or 25, with which the vehicle 1 the road junction 22, 23, 24 and / or 25, wherein then a transmission of the possible road connection points 22 or 23 takes place, which are traveled with increased probability, the road connection points are optionally associated with the associated probabilities for the use of the respective A concludede Trents107 in particular for leaving the respective road connection point.
  • the data to be transmitted to the traffic telematics unit 2 of the further traffic participant 28 and / or to the central processing unit 5 can be limited to a smaller data set comprising only the current geo-reference of the vehicle 1 with a heading, furthermore the geo-referencing of upcoming road junctions 22 or 23, where a link of the road junctions 22 or 23 links to the given previous intersection.
  • the unambiguous identification of the possible branching for the assignment of usage probabilities of the branches of a crossing point can take place here by means of the "Link Angles" from the NDS card format. This identification has its meaning in the assignment of probabilities which indicate with what probability a road junction is left over which branch.
  • FIG. 2 directed In order to further clarify the determination of the probability of the roads to be traveled.
  • FIG. 2 shows by way of example a road system 11, and a vehicle 1, for example, drive on the road 17 and get to the road junction point 26.
  • the roads 18 or 19 can be traveled. If the road 18 is used, the vehicle can get to the road junction 27, from which the vehicle 1 is given the opportunity to continue on the roads 20 and 21.
  • driving on the road 19 is another possibility of a targeted route is unlikely. Consequently, the driving routes along the road 18 and the road 19 are determined with a different degree of probability.
  • this receives, for example, a probability of driving through the vehicle with 70%, the road 19 receives only a probability of 30%.
  • the probability of driving on these roads corresponds to the turn-off probabilities of the road connection point from which these roads branch off. If the vehicle passes the road connection point 26, the branching probability of road connection point 26 in this example has a value of 70% for continuing on road 18, 30% for continuing on road 19 and 0% for continuing on road 17. If the vehicle travels along the road 18 towards the road junction 27, it can again be determined with what probability the roads 20 or 21 are driven. Since the road 21 (in a manner not shown in detail) has a higher probability of further driving than the road 20, the road 21 can be categorized with a 60% likelihood of traffic and the road 20 with, for example, a 40% likelihood of driving.
  • a tree structure of the road map 11 can be reconstructed, and only those road connection points 22 to 27 are transmitted which have a correspondingly high probability of occurrence.
  • a limit of the probability of driving can be set at 30%, and only roads that are traveled with a probability of over 30% are transmitted with the traffic telematics unit 2.

Landscapes

  • Chemical & Material Sciences (AREA)
  • Analytical Chemistry (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Traffic Control Systems (AREA)
  • Navigation (AREA)

Description

Die vorliegende Erfindung betrifft ein Verfahren zur verkehrstelematischen Informationsbereitstellung über die Fahrroute eines Fahrzeugs, das in einem Straßensystem mit mehreren Straßen bewegt wird, wobei die Straßen zwischen Straßenverbindungspunkten miteinander verbunden sind.The present invention relates to a method for traffic telematics information provision about the traveling route of a vehicle which is moved in a road system having a plurality of roads, the roads being connected to each other between road connection points.

STAND DER TECHNIKSTATE OF THE ART

Mit der Verkehrstelematik wird das Ziel verfolgt, eine vorhandene Verkehrsinfrastruktur besonders effizient zu nutzen, um beispielsweise Staus sowie Leer- und Suchfahrten von Fahrzeugen zu vermeiden. Ferner kann die Verkehrssicherheit erhöht werden, woraus resultierend eine Verringerung von Unfällen erreicht wird. Auch die Umweltbelastung kann verringert werden, indem Fahrzeuge effizienter eingesetzt werden und indem Fahrrouten optimiert werden. Dadurch verringert sich insbesondere der CO2- Ausstoß im Straßenverkehr.The aim of traffic telematics is to make the most efficient use of existing transport infrastructure, for example to avoid traffic jams and empty and search trips by vehicles. Furthermore, the traffic safety can be increased, resulting in a reduction of accidents is achieved. Environmental impact can also be reduced by making vehicles more efficient and by optimizing routes. This reduces the CO2 emissions in road traffic in particular.

Die Verkehrstelematik bezieht sich vorliegend auf den Individualverkehr, und es werden Informationen über aktuelle oder zukünftige Fahrrouten von Fahrzeugen zu zentralen Recheneinheiten oder von Fahrzeugen untereinander ausgetauscht. Zum Austausch der Informationen, das heißt die Technik der Informationsbereitstellung durch das Fahrzeug, basiert auf verschiedenen Standards. Dabei weisen die verschiedenen Standards verschiedene Datensatzgrößen auf, und es wird das Ziel verfolgt, eine möglichst effiziente Übermittlung des enthaltenen Informationsgehaltes der wahrscheinlichen zukünftigen mikroskopischen Fahrzeugroute zu übermitteln. Die mikroskopische Fahrzeugroute betrifft das Fahrzeugnahfeld, beispielsweise direkt Straßen oder umgebende Straßenpfade mit möglichen Straßenverbindungspunkten wie Kreuzungen oder Einmündungen.In the present case, traffic telematics refers to individual traffic, and information about current or future driving routes from vehicles to central processing units or to vehicles is interchanged. For the exchange of information, that is the technology of information provision by the vehicle, based on various standards. The various standards have different data record sizes, and the aim is to convey the most efficient possible transmission of the information content contained in the probable future microscopic vehicle route. The microscopic vehicle route relates to the vehicle near field, for example directly roads or surrounding road paths with possible road junctions such as intersections or junctions.

Eine Bekannte Methode zur Beschreibung der zukünftigen Fahrzeugroute, die im verkehrsmikroskopischen Bereich auch als vorausliegende Fahrzeugtrajektorie oder Probable Path bezeichnet wird, betrifft die Nutzung einer Koordinaten-Sequenz. Die Fahrzeugtrajektorie lässt sich durch diese Frequenz von Koordinaten (Koordinatentupel) annähern, indem die Koordinaten die Geo-Koordinaten der zu beschreibenden Trajektorie in geeigneter Auflösung beschreiben. Mittels des sogenannten Map-Matchings können andere Verkehrsteilnehmer die Koordinaten-Sequenz auf ihre digitale Karte projizieren und damit auf die übermittelte Trajektorie schließen. Damit lässt sich der Vorteil erreichen, dass prinzipiell durch eine entsprechend hohe Sequenzlänge- und Auflösung die Form der Trajektorie beliebig genau nachgebildet werden kann, um diese entsprechend zu übermitteln. Dabei entsteht jedoch der Nachteil, dass die Koordinaten gleicher Straßenabschnitte in Kartendaten unterschiedlicher Hersteller nicht zwingend Geo-Koordinaten aufweisen, und die Genauigkeit beträgt üblicherweise etwa 30 Meter. Ein straßengenaues Map-Matching ist damit nicht grundsätzlich gewährleistet. Ferner ist die Gefahr eines fehlerhaften Map-Matchings gegeben, und um diese Gefahr zu verringern, bedarf es einer großen Sequenzlänge an Punktkoordinaten.A known method for describing the future vehicle route, which is also referred to in the traffic-microscopic area as a preceding vehicle trajectory or probable path, relates to the use of a coordinate sequence. The vehicle trajectory can be defined by this frequency of coordinates (Coordinate tuple) by describing the coordinates of the geo-coordinates of the trajectory to be described in a suitable resolution. By means of so-called map matching other road users can project the coordinate sequence on their digital map and thus close to the transmitted trajectory. In this way, the advantage can be achieved that, in principle, the shape of the trajectory can be reproduced as exactly as desired by means of a correspondingly high sequence length and resolution, in order to transmit them accordingly. However, there is the disadvantage that the coordinates of the same road sections in map data from different manufacturers do not necessarily have geo-coordinates, and the accuracy is usually about 30 meters. Road-accurate map matching is thus not guaranteed in principle. Furthermore, there is a risk of erroneous map matching, and to reduce this risk, a large sequence length of point coordinates is required.

Da jedoch zum Teil benachbarte Straßenzüge parallel verlaufen, ist dieser Ansatz nicht unbedingt zielführend und damit nicht zuverlässig. Ferner kann zur Nachbildung einer Trajektorie zur Erreichung einer einigermaßen hohen Map-Matching-Trefferquote eine Vielzahl von Punktkoordinaten erforderlich sein, typischerweise etwa 30 bis 50 Punktkoordinaten für eine jeweilige mikroskopische Trajektorie. Die Übermittlung mehrerer wahrscheinlicher Trajektorien erzeugt auf diese Art ein relativ hohes Datenaufkommen. 100 Punktkoordinaten erzeugen bereits 800 Byte Netto-Daten bei Gebrauch der üblichen WGS84-Koordinaten. Bei Nutzung der C2X-Kommunikation mittels IEEE 802.11p zur Übermittlung der Daten kann eine derartige Paketgröße bereits als kritisch betrachtet werden. Die möglichen Trajektorien enthalten mit großer Wahrscheinlichkeit signifikante Redundanzen.However, since some neighboring streets run parallel, this approach is not necessarily effective and therefore not reliable. Further, to replicate a trajectory to achieve a reasonably high map matching hit rate, a plurality of point coordinates may be required, typically about 30 to 50 point coordinates for a respective microscopic trajectory. The transmission of several probable trajectories generates a relatively high amount of data in this way. 100 point coordinates already generate 800 bytes of net data using the usual WGS84 coordinates. When using the C2X communication via IEEE 802.11p for the transmission of the data, such a packet size can already be regarded as critical. The possible trajectories are likely to contain significant redundancies.

Als weiterer Übertragungsstandard ist der Standard SAE J2735 - Dedicated Short Range Communications (DSRC) Message Set Dictionary bekannt, und dieser Standard ist über das DF_PathPrediction Element mit einem Datenfeld zur unmittelbaren Fahrzeugtrajektorienprädiktion spezifiziert. Es besteht aus einer Angabe zum gegenwärtigen Lenkeinschlag. Damit wird der Vorteil erreicht, dass dieser Standard im Wesentlichen zur Prädiktion der zukünftigen Fahrspur bereitgestellt werden kann, jedoch ist auch diese Prädiktion nicht ausreichend zur Definition der mikroskopischen Fahrroute.Another transmission standard is the SAE J2735 Dedicated Short Range Communication (DSRC) Message Set Dictionary standard, and this standard is specified via the DF_PathPrediction element with a data field for immediate vehicle trajectory prediction. It consists of an indication of the current steering angle. This provides the advantage that this standard can essentially be provided for the prediction of the future lane, but this prediction is not sufficient for defining the microscopic driving route.

Als weiterer Standard bekannt ist der AGORA-C-Standard und definiert eine Methodik, welche eine relativ zuverlässige Positionsreferenzierung unabhängig von der jeweils zugrundeliegenden digitalen Karte ermöglicht. Neben den WGS84-Koordinaten werden Verkehrsnetzwerk-spezifische Attribute wie Straßenklasse und Himmelsrichtung des entsprechenden Streckenabschnitts genutzt. Referenziert werden können sowohl einzelne Punkte des Straßennetzwerkes als auch Straßenstrecken oder Gesamtbereiche eines Straßennetzwerks. Eine AGORA-C-Referenzierung eines einzelnen Punktes weist typischerweise eine Datengröße von weniger als 50 Byte auf, während die Referenzierung von Streckenabschnitten bestehend aus wenigen Kilometern wesentlich mehr als 100 Byte beanspruchen kann. Damit wird der Vorteil erreicht, dass eine relativ zuverlässige Referenzierung von prädizierten mikroskopischen Routen geboten ist, jedoch ist damit auch der Nachteil verbunden, dass bei Übertragung mehrerer möglicher mikroskopischer Routen schnell die kritische Datengröße erreicht werden kann, und es ergibt sich eine Beschränkung der Selektion weniger möglicher Trajektorien.Another standard known is the AGORA-C standard and defines a methodology that enables a relatively reliable positional referencing independent of the respective underlying digital map. In addition to the WGS84 coordinates, traffic network-specific attributes such as the road class and the direction of the corresponding section of the route are used. Both individual points of the road network as well as road sections or entire areas of a road network can be referenced. An AGORA-C referencing of a single point typically has a data size of less than 50 bytes, while the referencing of link sections consisting of a few kilometers may require significantly more than 100 bytes. This achieves the advantage that a relatively reliable referencing of predicated microscopic routes is required, but this also has the disadvantage that when several possible microscopic routes are transmitted, the critical data size can be reached quickly, and there is less restriction on the selection possible trajectories.

Die Druckschrift EP 2 012 289 A1 beschreibt ein Verfahren zur verkehrstelematischen Informationsbereitstellung über die Fahrroute eines Fahrzeugs, das in einem Straßensystem mit mehreren Straßen bewegt wird, wobei die Straßen an Straßenverbindungspunkten miteinander verbunden sind, und wobei das Verfahren die folgenden Schritte aufweist:

  • Bestimmung und Zuordnung einer Wahrscheinlichkeit zu einem jeweiligen Straßenverbindungspunkt, mit der das Fahrzeug den Straßenverbindungspunkt anfährt und
  • Übermittlung der Straßenverbindungspunkte, die mit einer Wahrscheinlichkeit befahren werden.
The publication EP 2 012 289 A1 describes a method for traffic telematics information provision about the travel route of a vehicle being moved in a road system having a plurality of roads, the roads being connected to road junctions, and the method comprising the steps of:
  • Determining and assigning a probability to a respective road junction at which the vehicle approaches the road junction and
  • Transmission of the road connection points, which are driven with a probability.

OFFENBARUNG DER ERFINDUNGDISCLOSURE OF THE INVENTION

Es ist daher die Aufgabe der vorliegenden Erfindung, ein Verfahren zur verkehrstelematischen Informationsbereitstellung mit einem möglichst hohem Genauigkeitswert über die vorausliegende Fahrzeugtrajektorie bereitzustellen, und insbesondere ist es die Aufgabe der Erfindung, die Datenrate zur Übermittlung der Fahrzeugtrajektorie möglichst gering zu halten.It is therefore the object of the present invention to provide a method for traffic telematics information provision with the highest possible accuracy value on the vehicle trajectory ahead, and in particular it is the object of the invention to keep the data rate for transmitting the vehicle trajectory as low as possible.

Diese Aufgabe wird ausgehend von einem Verfahren zur verkehrstelematischen Informationsbereitstellung gemäß dem Oberbegriff des Anspruches 1 in Verbindung mit den kennzeichnenden Merkmalen gelöst. Vorteilhafte Weiterbildungen der Erfindung sind in den abhängigen Ansprüchen angegeben.This object is achieved on the basis of a method for traffic telematics information provision according to the preamble of claim 1 in conjunction with the characterizing features. Advantageous developments of the invention are specified in the dependent claims.

Die Erfindung schließt die technische Lehre ein, dass das Verfahren wenigstens die Schritte der Bestimmung und Zuordnung einer Wahrscheinlichkeit zu einem jeweiligen Straßenverbindungspunkt aufweist, mit der das Fahrzeug den Straßenverbindungspunkt anfährt und der Übermittlung der Straßenverbindungspunkte aufweist, die mit erhöhter Wahrscheinlichkeit befahren werden.The invention includes the technical teaching that the method comprises at least the steps of determining and assigning a probability to a respective road junction with which the vehicle approaches the road junction and has the transmission of the road junctions that are traveled with increased likelihood.

Dieser Verbindungspunkt-Wahrscheinlichkeitsansatz verfolgt den Grundgedanken, nicht die vollständigen Trajektorien zu übertragen, sondern lediglich die relevanten Straßenverbindungspunkte, wobei jeder dieser möglichen Abzweigungen eine Wahrscheinlichkeit für deren Nutzung zugeordnet wird. Die möglichen verkehrsmikroskopischen Routen zwischen den Kreuzungspunkten lassen sich so in Form einer Baumstruktur repräsentieren. Das Fahrzeug kann eine Verkehrstelematikeinheit aufweisen, und die Daten über die möglichen Straßenverbindungspunkte werden entweder an einen weiteren Verkehrsteilnehmer oder an eine zentrale Recheneinheit übertragen, die eine Sendeeinrichtung aufweist, mit der Daten empfangen und gesendet werden können.This connection point likelihood approach is based on the idea not to transmit the complete trajectories, but only the relevant road connection points, each of these possible branches being assigned a probability of their use. The possible traffic microscopic routes between the crossing points can thus be represented in the form of a tree structure. The vehicle may include a traffic telematics unit and the data about the possible road junctions are transmitted either to another road user or to a central processing unit having a transmitter for receiving and transmitting data.

Erfindungsgemäß ist vorgesehen, dass ein Map-Matching-Verfahren der mit einer erhöhten Wahrscheinlichkeit bestimmten Fahrroute mit einer elektronischen Straßenkarte ausgeführt wird, sodass durch weitere Verkehrsteilnehmer die mögliche Fahrroute des Fahrzeugs mit entsprechender Wahrscheinlichkeit empfangen wird. Mittels des Map-Matchings der übermittelten Kreuzungspunkte können andere Verkehrsteilnehmer auf die mögliche Route des Fahrzeugs schließen. Die Wahrscheinlichkeit für eine Nutzung der jeweiligen Route kann durch Multiplikation der entsprechenden Abzweig-Wahrscheinlichkeiten entlang dieser Route ermittelt werden. Für ein zuverlässiges Map-Matching-Verfahren wird die Referenzierung der Kreuzungspunkte mit Hilfe einer kartenbasisunabhängigen Methode wie beispielsweise der AGORA-C-Methode ermöglicht. Erfindungsgemäß werden mögliche bevorstehende Straßenverbindungspunkte übermittelt, die mit einer Wahrscheinlichkeit von wenigstens 20% befahren werden.According to the invention, it is provided that a map matching method of the route determined with an increased probability is executed with an electronic road map, so that the possible driving route of the vehicle is received with corresponding probability by other road users. By means of the map matching of the transmitted crossing points, other road users can infer the possible route of the vehicle. The probability of using the respective route can be determined by multiplying the corresponding branch probabilities along this route. For a reliable map-matching method, the referencing of the crossing points is made possible using a card-based independent method such as the AGORA-C method. According to the invention, possible upcoming road connection points are transmitted, which are traveled with a probability of at least 20%.

Vorzugsweise kann die Wahrscheinlichkeit für das Befahren jeweiliger Verbindungspunkte durch das Fahrzeug durch eine Multiplikation jeweiliger Abzweigungswahrscheinlichkeiten aufeinanderfolgender Verbindungspunkte bestimmt werden. Fährt das Fahrzeug beispielsweise auf eine Abzweigung zu, und ermöglicht eine erste Richtung der Abzweigung die Weiterfahrt in eine Vielzahl weiterer Richtungen, so wird die Abzweigung mit einer höheren Wahrscheinlichkeit durch das Fahrzeug befahren als die zweite Abzweigung, die beispielsweise eine geringere Anzahl von möglichen weiteren Fahrrouten bereitstellt. Damit können Straßenverbindungspunkte verschiedenen Wahrscheinlichkeiten zugeordnet werden, und es werden beispielsweise nur diejenigen Straßenverbindungspunkte übermittelt, die eine Mindest-Wahrscheinlichkeit zum Befahren aufweisen.Preferably, the likelihood of the vehicle driving through respective connection points may be determined by multiplying respective branching probabilities of successive connection points. For example, if the vehicle is approaching a turn, and a first direction of the turn allows for travel in a variety of other directions, the turn is more likely to drive through the vehicle than the second turn, for example, a smaller number of possible other travel routes provides. Thus, road connection points can be assigned to different probabilities and, for example, only those road connection points are transmitted which have a minimum probability of being driven on.

Mit besonderem Vorteil können die Daten, die vom Fahrzeug übermittelt werden, beschränkt werden auf Geo-Referenz-Daten der Position des Fahrzeugs, auf Geo-Referenz-Daten der bevorstehenden Straßenverbindungspunkte und/oder einer Verknüpfung eines nachfolgenden Straßenverbindungspunktes mit einem zuvorigen Straßenverbindungspunkt und/oder eine Identifizierung möglicher Abzweigungen eines Straßenverbindungspunktes. Somit können den möglichen Abzweigungen eines Strassenverbinungspunkts Wahrscheinlichkeiten zugeordnet werden, mit denen ein jeweiliger Strassenverbindungspunkt verlassen wird. Insbesondere können die Daten, die vom Fahrzeug übermittelt werden, die Wahrscheinlichkeiten umfassen, mit denen das Fahrzeug einen Strassenverbindungspunkt verlässt. Dies kann insbesondere mit der Zuordnung von Nutzungswahrscheinlichkeiten der möglichen Abzweigungen eines Strassenverbindungspunktes erfolgen. Damit wird der Zweck erfüllt, dass diese Wahrscheinlichkeiten am Empfänger genutzt werden können, um neben der wahrscheinlichsten Route die zweit- oder dritt- wahrscheinlichste Route, jedoch auch weitere warscheinliche Routen, zu bestimmen. Eine eindeutige Identifizierung der möglichen Abzweigungen eines Straßenverbindungspunktes kann beispielsweise mittels aus dem NDS-Kartenformat (Navigation Data Standard) bekannter "Link Angles" erfolgen. Die Attribute können in Form einer Nachbarschaftsliste, der sogenannten "Adjacency List" übermittelt werden und erlauben die vollständige Rekonstruktion der Baumstruktur.With particular advantage, the data transmitted by the vehicle may be limited to geo-reference data of the position of the vehicle, geo-reference data of the upcoming road junctions and / or a link of a subsequent road junction with a previous road junction and / or an identification of possible branches of a road junction. Thus, the possible branches of a road connection point can be assigned probabilities with which a respective road connection point is left. In particular, the data transmitted by the vehicle may include the probabilities with which the vehicle leaves a road junction. This can be done in particular with the assignment of usage probabilities of the possible branches of a road connection point. This fulfills the purpose that these probabilities can be used at the receiver in order to determine next to the most probable route the second or third most probable route, but also further probable routes. An unambiguous identification of the possible branches of a road connection point can be effected, for example, by means of "Link Angles" known from the NDS (Navigation Data Standard) card format. The attributes can be in the form of a neighborhood list, the so-called "Adjacency List" are transmitted and allow the complete reconstruction of the tree structure.

Die erreichbaren Vorteile sind eine maximale Flexibilität bei der Auswertung wahrscheinlicher Trajektorien, und das Verfahren basiert auf einem relativ kompakten Datensatz, wobei kaum Redundanzen, das heißt sich wiederholende Informationen, vorhanden sind. Die Kreuzungspunkte lassen sich tendenziell zuverlässiger in einer Karte "matchen", als beliebige Punkte auf einem Streckensegment. Durch Ausnutzung der geringfügig noch bestehenden Redundanz, beispielsweise bei der Information der Position des Fahrzeugs mit einem Heading und zuzüglich damit die mögliche Ableitung der bevorstehenden Kreuzungen aus der Karte lässt sich die Robustheit des Verfahrens noch erhöhen.The achievable benefits are maximum flexibility in evaluating likely trajectories, and the method is based on a relatively compact data set, with little redundancy, that is, repetitive information. The crossing points tend to match more reliably in a map than any points on a route segment. By utilizing the still slightly redundant, for example, in the information of the position of the vehicle with a heading and thus the possible derivation of the upcoming crossings from the map, the robustness of the method can be increased.

Mit weiterem Vorteil können mögliche bevorstehende Straßenverbindungspunkte übermittelt werden, die mit einer Wahrscheinlichkeit von vorzugsweise wenigstens 25% und besonders bevorzugt von wenigstens 30% befahren werden. Mit einer höheren Wahrscheinlichkeitsgrenze wird eine weitere Verringerung der Datenmenge erreicht, jedoch nimmt die mögliche Genauigkeit zur Vorhersage der zu fahrenden Route bzw. die Informationsvielfalt zur Vorhersage möglicher zu fahrender Routen nimmt ab.With further advantage, possible forthcoming road junction points can be transmitted which are traveled with a probability of preferably at least 25% and more preferably of at least 30%. With a higher probability limit, a further reduction in the amount of data is achieved, but the possible accuracy for predicting the route to be traveled or the variety of information for predicting possible routes to be traveled decreases.

Die vorliegende Erfindung richtet sich ferner auf eine Verkehrstelematikeinheit zur verkehrstelematischen Informationsbereitstellung über die Fahrroute eines Fahrzeugs, das in einem Straßensystem mit mehreren Straßen bewegt wird, wobei die Straßen zwischen Straßenverbindungspunkten miteinander verbunden sind, wobei die Verkehrstelematik ausgebildet ist zur Bestimmung und Zuordnung einer Wahrscheinlichkeit zu einem jeweiligen Straßenverbindungspunkt, mit der das Fahrzeug den Straßenverbindungspunkt anfährt und zur Übermittlung der Straßenverbindungspunkte, die mit erhöhter Wahrscheinlichkeit befahren werden. Die weiteren Ausführungsmerkmale und Vorteile des Verfahrens können mit der erfindungsgemäßen Verkehrstelematikeinheit entsprechend ausgeführt und angewendet werden.The present invention is further directed to a traffic telematics unit for traffic telematics information delivery about the travel route of a vehicle being moved in a multi-street road system, the roads being interconnected between road junctions, the traffic telematics being arranged to determine and assign a probability to one respective road junction point at which the vehicle approaches the road junction and for transmission of the road junctions that are likely to be traveled. The further embodiment features and advantages of the method can be carried out and used in accordance with the traffic telematics unit according to the invention.

Die vorliegende Erfindung betrifft ferner ein Computerprogramm mit Programmcodemitteln, um alle Schritte eines Verfahrens mit den vorstehend beschriebenen Merkmalen und Vorteilen durchzuführen, insbesondere wenn das Computerprogramm auf einem Computer oder einer entsprechenden Verkehrstelematikeinheit ausgeführt wird. Ferner betrifft die Erfindung ein Computerprogrammprodukt mit Programmcodemitteln, die auf einem computerlesbaren Datenträger gespeichert sind, um die Schritte des vorstehend beschriebenen Verfahrens durchzuführen, wenn das Computerprogramm auf einem Computer oder einer entsprechenden Verkehrstelematikeinheit ausgeführt wird.The present invention further relates to a computer program with program code means to perform all the steps of a method having the features and advantages described above, in particular when the computer program is executed on a computer or a corresponding traffic telematics unit. Furthermore, the invention relates to a computer program product with program code means which are stored on a computer-readable medium to perform the steps of the method described above, when the computer program is executed on a computer or a corresponding traffic telematics unit.

BEVORZUGTES AUSFÜHRUNGSBEISPIEL DER ERFINDUNGPREFERRED EMBODIMENT OF THE INVENTION

Weitere, die Erfindung verbessernde Maßnahmen werden nachstehend gemeinsam mit der Beschreibung eines bevorzugten Ausführungsbeispiels der Erfindung anhand der Figuren näher dargestellt. Es zeigt:

Figur 1
eine schematische Darstellung eines Straßensystems mit einem Fahrzeug, einem weiteren Verkehrsteilnehmer sowie einer zentralen Recheneinheit zur Ausführung eines Verfahrens zur verkehrstelematischen Informationsbereitstellung und
Figur 2
ein Beispiel eines Straßensystems mit Fahrrouten verschieden hoher Befahrenswahrscheinlichkeiten.
Further, measures improving the invention will be described in more detail below together with the description of a preferred embodiment of the invention with reference to FIGS. It shows:
FIG. 1
a schematic representation of a road system with a vehicle, another road user and a central processing unit for carrying out a method for traffic telematics information provision and
FIG. 2
an example of a road system with driving routes of different high probability of driving.

Figur 1 zeigt in schematischer Weise die Ansicht eines Straßensystems 11, das von einem Fahrzeug 1 befahren werden kann. Das Fahrzeug 1 fährt auf einen Straßenverbindungspunkt 22 zu, und der Straßenverbindungspunkt 22 ermöglicht die Weiterfahrt in die Straßen 12, 13 und 14. Die Straße 12 führt auf den Straßenverbindungspunkt 23 zu, und ermöglicht die Weiterfahrt in die Straßen 15 und 16. Die Straße 13 führt auf den Straßenverbindungspunkt 25 zu, und die Straße 14 führt auf den Straßenverbindungspunkt 24 zu. Beispielhaft ist eine Fahrroute 10 mit einer hohen Befahrenswahrscheinlichkeit angegebenSomit ist die Wahrscheinlichkeit, dass das Fahrzeug 1 nach dem Straßenverbindungspunkt 22 die Straße 12 befährt, größer, als das Befahren der Straßen 13 oder 14. FIG. 1 shows schematically the view of a road system 11, which can be traveled by a vehicle 1. The vehicle 1 travels to a road junction 22, and the road junction 22 allows the roads 12, 13, and 14 to continue. The road 12 leads to the road junction 23, and allows the road 15 and 16 to continue. The road 13 leads to the road junction 25 and the road 14 leads to the road junction 24. By way of example, a driving route 10 with a high probability of driving is indicated. Thus, the probability that the vehicle 1 is driving past the road junction 22 on the road 12 is greater than driving on the roads 13 or 14.

Zur verkehrstelematischen Informationsbereitstellung weist das Fahrzeug 1 eine Verkehrstelematikeinheit 2 auf, über die das Fahrzeug 1 mit einer Verkehrstelematikeinheit 2 eines weiteren Verkehrsteilnehmers 28 oder über eine Sendeeinrichtung 6 mit einer zentralen Recheneinheit 5 kommunizieren kann.For traffic telematics information provision, the vehicle 1 has a traffic telematics unit 2, via which the vehicle 1 can communicate with a traffic telematics unit 2 of another road user 28 or via a transmitting device 6 with a central processing unit 5.

Dabei wird erfindungsgemäß das Ziel verfolgt, die erforderlichen Datenmengen zur Kommunikation möglichst gering zu halten. Hierzu ist erfindungsgemäß vorgesehen, dass die Daten, die zur verkehrstelematischen Informationsbereitstellung ausgesendet werden, lediglich die Bestimmung und Zuordnung einer Wahrscheinlichkeit zu einem jeweiligen Straßenverbindungspunkt 22, 23, 24 und/oder 25 vorsieht, mit der das Fahrzeug 1 den Straßenverbindungspunkt 22, 23, 24 und/oder 25 anfährt, wobei anschließend eine Übermittlung der möglichen Straßenverbindungspunkte 22 oder 23 stattfindet, die mit erhöhter Wahrscheinlichkeit befahren werden, wobei den Straßenverbindungspunkten optional die zugehörigen Wahrscheinlichkeiten für die Nutzung der jeweiligen Abzweigungsmöglichkeiten insbesondere für das Verlassen des jeweiligen Strassenverbindungspunktes zugeordnet werden.In this case, according to the invention, the aim is to keep the required data volumes for communication as low as possible. For this purpose, the invention provides that the data sent out for traffic telematics information provision merely provides for the determination and assignment of a probability to a respective road junction 22, 23, 24 and / or 25, with which the vehicle 1 the road junction 22, 23, 24 and / or 25, wherein then a transmission of the possible road connection points 22 or 23 takes place, which are traveled with increased probability, the road connection points are optionally associated with the associated probabilities for the use of the respective Abzweigungsmöglichkeiten in particular for leaving the respective road connection point.

Somit können die an die Verkehrstelematikeinheit 2 des weiteren Verkehrsteilnehmers 28 und/oder an die zentrale Recheneinheit 5 zu übermittelnden Daten beschränkt werden auf einen geringeren Datensatz, der lediglich die gegenwärtige Geo-Referenz des Fahrzeugs 1 mit einem Heading umfasst, ferner die Geo-Referenzierung der bevorstehenden Straßenverbindungspunkte 22 oder 23 umfasst, wobei eine Verknüpfung der Straßenverbindungspunkte 22 oder 23 mit der gegebenen zuvorigen Kreuzung verknüpft. Die eindeutige Identifizierung der möglichen Abzweigung für die Zuordnung von Nutzungswahrscheinlichkeiten der Abzweigungen eines Kreuzungspunktes kann dabei mittels der "Link Angles" aus dem NDS-Kartenformat erfolgen. Diese Identifizierung hat ihren Sinn in der Zuordnung von Wahrscheinlichkeiten, die angeben, mit welcher Wahrscheinlichkeit ein Strassenverbindungspunkt über welche Abzweigung verlassen wird. Um die Bestimmung der Wahrscheinlichkeit der zu befahrenden Straßen weiter zu verdeutlichen, wird auf die nachfolgende Figur 2 verwiesen.Thus, the data to be transmitted to the traffic telematics unit 2 of the further traffic participant 28 and / or to the central processing unit 5 can be limited to a smaller data set comprising only the current geo-reference of the vehicle 1 with a heading, furthermore the geo-referencing of upcoming road junctions 22 or 23, where a link of the road junctions 22 or 23 links to the given previous intersection. The unambiguous identification of the possible branching for the assignment of usage probabilities of the branches of a crossing point can take place here by means of the "Link Angles" from the NDS card format. This identification has its meaning in the assignment of probabilities which indicate with what probability a road junction is left over which branch. In order to further clarify the determination of the probability of the roads to be traveled, reference is made to the following FIG. 2 directed.

Figur 2 zeigt beispielhaft ein Straßensystem 11, und ein Fahrzeug 1 kann beispielsweise über die Straße 17 fahren und an den Straßenverbindungspunkt 26 gelangen. Über den Straßenverbindungspunkt 26, dargestellt als Abzweigung, können die Straßen 18 oder 19 befahren werden. Wird die Straße 18 befahren, kann das Fahrzeug an den Straßenverbindungspunkt 27 gelangen, von dem aus das Fahrzeug 1 die Möglichkeit der Weiterfahrt in die Straßen 20 und 21 erhält. Durch Befahren der Straße 19 ist eine weitere Möglichkeit einer zielführenden Fahrroute unwahrscheinlich. Folglich können die Fahrrouten entlang der Straße 18 und der Straße 19 mit einer unterschiedlich hohen Wahrscheinlichkeit bestimmt werden. Durch die weiterführenden Abzweigungsmöglichkeiten bei Befahren der Straße 18 erhält diese beispielsweise eine Wahrscheinlichkeit zum Befahren durch das Fahrzeug mit 70%, wobei die Straße 19 lediglich eine Wahrscheinlichkeit von 30% erhält. Die Wahrscheinlichkeit zum Befahren dieser Straßen entspricht dabei den Abzweigungswahrscheinlichkeiten des Strassenverbindungspunktes, von welchem diese Strassen abzweigen. Passiert das Fahrzeug den Strassenverbindungspunt 26, so weist die Abzweigungswahrscheinlichkeit von Strassenverbindungspunkt 26 in diesem Beispiel einen Wert von 70% für eine Weiterfahrt auf Strasse 18 auf, 30% für eine Weiterfahrt auf Strasse 19 und 0% für eine Weiterfahrt auf Strasse 17 auf. Fährt das Fahrzeug entlang der Straße 18 auf den Straßenverbindungspunkt 27 zu, kann wiederum bestimmt werden, mit welcher Wahrscheinlichkeit die Straßen 20 oder 21 befahren werden. Da die Straße 21 (in nicht näher gezeigter Weise) eine höhere Weiterfahrtwahrscheinlichkeit aufweist als die Straße 20, kann die Straße 21 mit einer 60%-igen Befahrenswahrscheinlichkeit und die Straße 20 mit beispielsweise einer 40%-igen Befahrenswahrscheinlichkeit kategorisiert werden. FIG. 2 shows by way of example a road system 11, and a vehicle 1, for example, drive on the road 17 and get to the road junction point 26. Via the road junction 26, shown as a branch, the roads 18 or 19 can be traveled. If the road 18 is used, the vehicle can get to the road junction 27, from which the vehicle 1 is given the opportunity to continue on the roads 20 and 21. By driving on the road 19 is another possibility of a targeted route is unlikely. Consequently, the driving routes along the road 18 and the road 19 are determined with a different degree of probability. By the further branching possibilities when driving on the road 18, this receives, for example, a probability of driving through the vehicle with 70%, the road 19 receives only a probability of 30%. The probability of driving on these roads corresponds to the turn-off probabilities of the road connection point from which these roads branch off. If the vehicle passes the road connection point 26, the branching probability of road connection point 26 in this example has a value of 70% for continuing on road 18, 30% for continuing on road 19 and 0% for continuing on road 17. If the vehicle travels along the road 18 towards the road junction 27, it can again be determined with what probability the roads 20 or 21 are driven. Since the road 21 (in a manner not shown in detail) has a higher probability of further driving than the road 20, the road 21 can be categorized with a 60% likelihood of traffic and the road 20 with, for example, a 40% likelihood of driving.

Durch diese Kategorisierung kann eine Baumstruktur der Straßenkarte 11 rekonstruiert werden, und es werden lediglich diejenigen Straßenverbindungspunkte 22 bis 27 übermittelt, die eine entsprechend hohe Befahrenswahrscheinlichkeit aufweisen. Beispielsweise kann eine Grenze der Befahrenswahrscheinlichkeit auf 30% festgesetzt werden, und erst Straßen, die mit einer Wahrscheinlichkeit von über 30% befahren werden, werden mit der Verkehrstelematikeinheit 2 übermittelt.By means of this categorization, a tree structure of the road map 11 can be reconstructed, and only those road connection points 22 to 27 are transmitted which have a correspondingly high probability of occurrence. For example, a limit of the probability of driving can be set at 30%, and only roads that are traveled with a probability of over 30% are transmitted with the traffic telematics unit 2.

Die Erfindung beschränkt sich in ihrer Ausführung nicht auf das vorstehend angegebene bevorzugte Ausführungsbeispiel. Vielmehr ist eine Anzahl von Varianten denkbar, welche von der dargestellten Lösung auch bei grundsätzlich anders gearteten Ausführungen Gebrauch macht. Sämtliche aus den Ansprüchen, der Beschreibung oder den Zeichnungen hervorgehenden Merkmale und/oder Vorteile, einschließlich konstruktiven Einzelheiten, räumliche Anordnungen und Verfahrensschritte, können sowohl für sich als auch in den verschiedensten Kombinationen erfindungswesentlich sein.The invention is not limited in its execution to the above-mentioned preferred embodiment. Rather, a number of variants is conceivable, which makes use of the illustrated solution even with fundamentally different types of use. All features and / or advantages resulting from the claims, the description or the drawings, including design details, spatial arrangements and method steps, can be essential to the invention, both individually and in the most diverse combinations.

Claims (8)

  1. Method for the traffic-telematics provision of information about the route of travel (10) of a vehicle (1) that is moving in a road system (11) having a plurality of roads (12 to 21), wherein the roads (12 to 21) between road junctions (22 to 27) are connected to one another, and wherein the method has at least the following steps:
    - determination and allocation of a probability, for a respective road junction (22 to 27), of the vehicle (1) approaching the road junction (22 to 27), characterized in that road junctions (22 to 27) that have an increased probability of being used are transmitted, wherein the increased probability corresponds to a probability that is above a prescribed or selectable minimum value,
    in that a map matching method for the route of travel (10) determined as having increased probability is carried out using an electronic road map, so that further road users (28) receive the possible route of travel (10) of the vehicle (1) with corresponding probability, and
    in that possible upcoming road junctions (22 to 27) are transmitted that have a probability of at least 20% of being used.
  2. Method according to Claim 1, characterized in that the probability of respective junctions (22 to 27) being used by the vehicle (1) is determined by multiplication of respective fork probabilities for successive junctions (22 to 27).
  3. Method according to either of Claims 1 or 2, characterized in that the data that is transmitted by the vehicle (1) comprises the Geo-reference for the position of the vehicle (1), the Geo-reference for the upcoming road junctions (22 to 27) and/or a link between a subsequent road junction (22 to 27) and a previous road junction (22 to 27) and/or an identification for possible forks at a road junction (22 to 27).
  4. Method according to Claim 3, characterized in that the data that is transmitted by the vehicle (1) comprises the probabilities of the vehicle (1) leaving a road junction (22 to 27).
  5. Method according to one of the preceding claims, characterized in that possible upcoming road junctions (22 to 27) are transmitted that have a probability of at least 25% and particularly preferably of at least 30% of being used.
  6. Traffic telematics unit (2) having means for carrying out a method according to one of the preceding claims and for the traffic-telematics provision of information about the route of travel (10) of a vehicle (1) that is moving in a road system (11) having a plurality of roads (12 to 21), wherein the roads (12 to 21) between road junctions (22 to 27) are connected to one another,
    wherein the traffic telematics unit (2) is designed
    - to determine and allocate a probability, for a respective road junction (22 to 27), of the vehicle (1) approaching the road junction (22 to 27), and
    - to transmit the road junctions (22 to 27) that have the increased probability of being used.
  7. Computer program having program code means in order to carry out all the steps of a method according to one of Claims 1 to 5, particularly when the computer program is executed on a computer or a corresponding traffic telematics unit (2) according to Claim 6.
  8. Computer program product having program code means that are stored on a computer-readable storage medium in order to carry out the steps of a method according to one of Claims 1 to 5 when the computer program is executed on a computer or a corresponding traffic telematics unit (2) according to Claim 6.
EP12743736.6A 2011-09-26 2012-08-06 Method for transmitting route data for traffic telematics Active EP2761609B1 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
DE102011083375A DE102011083375A1 (en) 2011-09-26 2011-09-26 Method for transmitting route data for traffic telematics
PCT/EP2012/065348 WO2013045150A1 (en) 2011-09-26 2012-08-06 Method for transmitting route data for traffic telematics

Publications (2)

Publication Number Publication Date
EP2761609A1 EP2761609A1 (en) 2014-08-06
EP2761609B1 true EP2761609B1 (en) 2015-05-27

Family

ID=46634151

Family Applications (1)

Application Number Title Priority Date Filing Date
EP12743736.6A Active EP2761609B1 (en) 2011-09-26 2012-08-06 Method for transmitting route data for traffic telematics

Country Status (7)

Country Link
US (1) US9053631B2 (en)
EP (1) EP2761609B1 (en)
KR (1) KR102007181B1 (en)
CN (1) CN103890823B (en)
DE (1) DE102011083375A1 (en)
IN (1) IN2014DN01827A (en)
WO (1) WO2013045150A1 (en)

Families Citing this family (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9355560B2 (en) * 2014-01-31 2016-05-31 Here Global B.V. Differentiation of probe reports based on quality
JP6533675B2 (en) * 2015-03-16 2019-06-19 アイシン・エィ・ダブリュ株式会社 Transfer information transmitting system, transfer information transmitting apparatus, guidance terminal, transfer information transmitting method, and transfer information transmitting program
CN105354221A (en) * 2015-09-30 2016-02-24 百度在线网络技术（北京）有限公司 Path query method and apparatus
KR101847833B1 (en) 2015-10-27 2018-04-11 현대자동차주식회사 A system for predicting a volume of traffic, a displaying apparatus for a vehicle, a vehicle and a method for predicting a volume of traffic
KR101683588B1 (en) * 2016-04-28 2016-12-07 김성일 Server for transportation big data managemnet using recognition of vehicle license plate
DE102016007567A1 (en) * 2016-06-21 2017-12-21 Audi Ag Method for operating a vehicle system designed for determining a trajectory to be traveled and / or for performing driving interventions, method for operating a control system and motor vehicle
US10175059B2 (en) 2016-08-30 2019-01-08 Here Global B.V. Method, apparatus and computer program product for a navigation system user interface
US20180188057A1 (en) * 2017-01-03 2018-07-05 International Business Machines Corporation Detecting and simulating a moving event for an affected vehicle
DE102017201514B4 (en) 2017-01-31 2022-11-03 Volkswagen Aktiengesellschaft Method for a vehicle in a fleet of vehicles for transmitting data to a data processing system, method for a data processing system for transmitting data in a vehicle fleet to the data processing system, and vehicle
DE102018202970A1 (en) * 2018-02-28 2019-08-29 Robert Bosch Gmbh Method for determining topological information of a road intersection
DE102018209982A1 (en) 2018-06-20 2019-12-24 Robert Bosch Gmbh Method for providing data for a vehicle
DE102020109492A1 (en) 2020-04-06 2021-10-07 Bayerische Motoren Werke Aktiengesellschaft Method and system for determining turning probabilities at intersections
CN113240925B (en) * 2021-04-21 2022-02-25 郑州大学 Travel path determination method considering random delay influence of intersection signal lamps

Family Cites Families (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5063603A (en) * 1989-11-06 1991-11-05 David Sarnoff Research Center, Inc. Dynamic method for recognizing objects and image processing system therefor
JP2003057055A (en) * 2001-08-10 2003-02-26 Equos Research Co Ltd Method, apparatus and system for downloading of road data
DE102004031802A1 (en) * 2004-07-01 2006-01-26 Daimlerchrysler Ag Output of traffic routing network information to vehicle driver, derived from conditions arising, stores traffic turning behavior at junction
JP2006284254A (en) * 2005-03-31 2006-10-19 Denso It Laboratory Inc Course prediction method, course prediction device, and course-prediction information using system
US7813870B2 (en) * 2006-03-03 2010-10-12 Inrix, Inc. Dynamic time series prediction of future traffic conditions
JP4930191B2 (en) * 2007-05-28 2012-05-16 船井電機株式会社 Navigation device
FR2918495B1 (en) * 2007-07-02 2009-10-02 Mediamobile Sa ESTIMATION OF TRAFFIC IN A ROAD NETWORK
CN101488284A (en) * 2008-01-16 2009-07-22 闵万里 Intelligent management system for road traffic condition instant prediction
WO2009116105A2 (en) * 2008-03-21 2009-09-24 Gianfranco Antonini A traffic assignment method for multimodal transportation networks
CN102175253B (en) * 2010-12-28 2012-09-05 清华大学 Multi-hypothesis map matching method based on vehicle state transition
CN102542617B (en) * 2010-12-30 2014-07-23 北京交科公路勘察设计研究院有限公司 Path identification station arranging method of complicated road net

Also Published As

Publication number Publication date
KR102007181B1 (en) 2019-08-05
CN103890823B (en) 2016-08-17
EP2761609A1 (en) 2014-08-06
WO2013045150A1 (en) 2013-04-04
KR20140066200A (en) 2014-05-30
IN2014DN01827A (en) 2015-05-15
US9053631B2 (en) 2015-06-09
CN103890823A (en) 2014-06-25
DE102011083375A1 (en) 2013-03-28
US20140316686A1 (en) 2014-10-23

Similar Documents

Publication Publication Date Title
EP2761609B1 (en) Method for transmitting route data for traffic telematics
DE102016223638B4 (en) DRIVING ASSISTANT DEVICE
EP1224645B2 (en) Method for coding and decoding objects in a road traffic network
EP1150265B1 (en) Method for transmitting a position of a traffic information, in particular of a traffic difficulty
DE10013675B4 (en) Vehicle navigation system
EP0902406B1 (en) Method for transmitting traffic data and for analysing the road traffic network, traffic-evaluating central unit and terminal therefor
EP1297310B1 (en) Method for selecting map information, and navigation device
EP1141909B1 (en) Method for transmitting traffic information
EP3377858B1 (en) Method for aggregating traffic lane information for digital map services
EP1281044B1 (en) Navigation method and device
DE102009008745A1 (en) Method for automatic traffic routing of motor vehicle, involves transmitting traffic routing data from surrounding field model to corresponding road user for traffic routing by central control unit
DE102013211696A1 (en) Method for completing and / or updating a digital road map, device for a motor vehicle and motor vehicle
WO2018166567A1 (en) Method for the generation of a merged free-space map, electronic control device and storage medium
EP1814095B1 (en) Method for determining a future route by communication between vehicles
WO2003060429A1 (en) Method for determining a travel time
DE102008025707A1 (en) Traffic routing information determining method for vehicle, involves determining traffic routing information of vehicle from position and time data, which is detected using global positioning system, received from surrounding vehicles
DE102012210454A1 (en) Method for providing data for electronic horizon for e.g. navigation apparatus of motor car, involves merging parameters from group of vehicles to data packet for electronic horizon when group of vehicles, comprises two other vehicles
EP3994902B1 (en) Method for cooperative resource allocation for performing movement manoeuvres in a road area, and related control circuit and motor vehicle having such a control circuit
DE102022202165A1 (en) Method for providing lane localization for a motor vehicle in an area of an infrastructure facility
DE60106857T2 (en) Method and device for reference sites in transport telematics
EP2787494A1 (en) Creation of movement profiles
DE102021204244B4 (en) Preparing card data for efficient further processing
DE102019006103B4 (en) Transferring the history of a route
EP1908039B1 (en) Method, system, and control unit for navigating a vehicle in a road system
EP2212877B1 (en) Localization method

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20140428

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

DAX Request for extension of the european patent (deleted)
GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

INTG Intention to grant announced

Effective date: 20150226

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

Free format text: NOT ENGLISH

REG Reference to a national code

Ref country code: CH

Ref legal event code: EP

REG Reference to a national code

Ref country code: AT

Ref legal event code: REF

Ref document number: 729220

Country of ref document: AT

Kind code of ref document: T

Effective date: 20150615

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

Free format text: LANGUAGE OF EP DOCUMENT: GERMAN

REG Reference to a national code

Ref country code: DE

Ref legal event code: R096

Ref document number: 502012003312

Country of ref document: DE

REG Reference to a national code

Ref country code: LT

Ref legal event code: MG4D

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: ES

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150527

Ref country code: NO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150827

Ref country code: FI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150527

Ref country code: LT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150527

Ref country code: PT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150928

Ref country code: HR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150527

REG Reference to a national code

Ref country code: NL

Ref legal event code: MP

Effective date: 20150527

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: BG

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150827

Ref country code: IS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150927

Ref country code: LV

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150527

Ref country code: RS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150527

Ref country code: GR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150828

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: DK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150527

Ref country code: EE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150527

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: RO

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20150527

Ref country code: PL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150527

Ref country code: SK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150527

Ref country code: CZ

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150527

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 502012003312

Country of ref document: DE

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LU

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150806

Ref country code: MC

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150527

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: CH

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20150831

Ref country code: LI

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20150831

26N No opposition filed

Effective date: 20160301

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150527

REG Reference to a national code

Ref country code: IE

Ref legal event code: MM4A

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20150806

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 5

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150527

GBPC Gb: european patent ceased through non-payment of renewal fee

Effective date: 20160806

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: HU

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT; INVALID AB INITIO

Effective date: 20120806

Ref country code: SM

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150527

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: CY

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150527

Ref country code: NL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150527

Ref country code: SE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150527

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: GB

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20160806

Ref country code: BE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20150831

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 6

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150527

Ref country code: TR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150527

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 7

REG Reference to a national code

Ref country code: AT

Ref legal event code: MM01

Ref document number: 729220

Country of ref document: AT

Kind code of ref document: T

Effective date: 20170806

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: AL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150527

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: AT

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20170806

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: FR

Payment date: 20200820

Year of fee payment: 9

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: IT

Payment date: 20200831

Year of fee payment: 9

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IT

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20210806

Ref country code: FR

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20210831

REG Reference to a national code

Ref country code: DE

Ref legal event code: R084

Ref document number: 502012003312

Country of ref document: DE

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 20231025

Year of fee payment: 12