EP0902406B1 - Procédé de transmission de données routières et d'analyse du réseau de circulation routière, unité centrale de mesure du trafic routier et terminal associé - Google Patents

Procédé de transmission de données routières et d'analyse du réseau de circulation routière, unité centrale de mesure du trafic routier et terminal associé Download PDF

Info

Publication number
EP0902406B1
EP0902406B1 EP98250299A EP98250299A EP0902406B1 EP 0902406 B1 EP0902406 B1 EP 0902406B1 EP 98250299 A EP98250299 A EP 98250299A EP 98250299 A EP98250299 A EP 98250299A EP 0902406 B1 EP0902406 B1 EP 0902406B1
Authority
EP
European Patent Office
Prior art keywords
route
routes
borders
traffic
vehicle
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.)
Expired - Lifetime
Application number
EP98250299A
Other languages
German (de)
English (en)
Other versions
EP0902406A3 (fr
EP0902406A2 (fr
Inventor
Markus Dr. Becker
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.)
ATX Europe GmbH
Original Assignee
ATX Europe 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 ATX Europe GmbH filed Critical ATX Europe GmbH
Publication of EP0902406A2 publication Critical patent/EP0902406A2/fr
Publication of EP0902406A3 publication Critical patent/EP0902406A3/fr
Application granted granted Critical
Publication of EP0902406B1 publication Critical patent/EP0902406B1/fr
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

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
    • G—PHYSICS
    • G08—SIGNALLING
    • G08G—TRAFFIC CONTROL SYSTEMS
    • G08G1/00—Traffic control systems for road vehicles
    • G08G1/09—Arrangements for giving variable traffic instructions
    • G08G1/0962—Arrangements for giving variable traffic instructions having an indicator mounted inside the vehicle, e.g. giving voice messages
    • G08G1/0968—Systems involving transmission of navigation instructions to the vehicle
    • G08G1/096805—Systems involving transmission of navigation instructions to the vehicle where the transmitted instructions are used to compute a route
    • G08G1/096811—Systems involving transmission of navigation instructions to the vehicle where the transmitted instructions are used to compute a route where the route is computed offboard
    • G08G1/096822—Systems involving transmission of navigation instructions to the vehicle where the transmitted instructions are used to compute a route where the route is computed offboard where the segments of the route are transmitted to the vehicle at different locations and times
    • G—PHYSICS
    • G08—SIGNALLING
    • G08G—TRAFFIC CONTROL SYSTEMS
    • G08G1/00—Traffic control systems for road vehicles
    • G08G1/09—Arrangements for giving variable traffic instructions
    • G08G1/0962—Arrangements for giving variable traffic instructions having an indicator mounted inside the vehicle, e.g. giving voice messages
    • G08G1/0968—Systems involving transmission of navigation instructions to the vehicle
    • G08G1/096833—Systems involving transmission of navigation instructions to the vehicle where different aspects are considered when computing the route
    • G08G1/096844—Systems involving transmission of navigation instructions to the vehicle where different aspects are considered when computing the route where the complete route is dynamically recomputed based on new data
    • G—PHYSICS
    • G08—SIGNALLING
    • G08G—TRAFFIC CONTROL SYSTEMS
    • G08G1/00—Traffic control systems for road vehicles
    • G08G1/09—Arrangements for giving variable traffic instructions
    • G08G1/0962—Arrangements for giving variable traffic instructions having an indicator mounted inside the vehicle, e.g. giving voice messages
    • G08G1/0968—Systems involving transmission of navigation instructions to the vehicle
    • G08G1/096877—Systems involving transmission of navigation instructions to the vehicle where the input to the navigation device is provided by a suitable I/O arrangement
    • G08G1/096888—Systems involving transmission of navigation instructions to the vehicle where the input to the navigation device is provided by a suitable I/O arrangement where input information is obtained using learning systems, e.g. history databases

Definitions

  • the invention relates to a method for transmitting route data and a Traffic control center and a terminal.
  • the transmission of route data between a vehicle and a control center in particular the transmission of data (FCD) relating to a path covered by a vehicle in each case from the vehicle to the control center or, for example, the transmission of further transmitted data which can be assigned to a transmitted path in a control center, such as Travel times of vehicles put a heavy burden on the transmission route due to the very high number of vehicles.
  • FCD data relating to a path covered by a vehicle in each case from the vehicle to the control center
  • further transmitted data which can be assigned to a transmitted path in a control center
  • Travel times of vehicles put a heavy burden on the transmission route due to the very high number of vehicles.
  • due to the transmission of route data determined by many individual vehicles to the distances traveled in each case, and of travel times etc. for the respective route transmitted due to the large number of vehicles, a very large amount of data to be transmitted is required.
  • the transmission channels available for transmission are not unlimited in terms of their capacity.
  • DE 195 08 486 A1 discloses a method for transmitting position data by mobile radio between a vehicle and a control center, in which position data in the form of a point (with the specification of length and width) are recorded with a GPS receiver after a specific interval, whereby two points are connected to a vector and a first vector train is formed from all the vectors obtained in this way.
  • the first vector is approximated by straight lines with an increasing number of straight lines until the maximum distance of the actual position data from the straight line lies below a predetermined threshold value, whereupon the position data reduced in this way are transmitted. Access to information in a digital map of the traffic network is not recommended for data reduction.
  • the document EP-A-0 263 332 relates to a receiver for traffic radio broadcasts, in which a coarser grid in the form of segments is superimposed on an exit road network, which segments in turn contain a plurality of route segments.
  • the resulting list contains the names of the segments and the route segments contained therein.
  • the respective segment is determined by the transmission of the respective route segment.
  • the object of the present invention is to optimize the transmission of route data between a vehicle and a control center.
  • the invention optimizes the transmission of route data by reducing the Redundancy, i.e. by increasing the information density during transmission. For this will each have one or more edges in the digital map of the Traffic route network, in which vehicles move, to partial routes summarized.
  • Route data can be identified with a description of the partial route which they relate to are transferred. Other dates such as travel times, Environmental data, temperatures etc. can e.g. by designating a partial route and of the location on the partial route.
  • the nodes of a traffic route network can lie on one, two or more edges. If there is only one edge at a node, it is an end point of the Infrastructure network. If there are two edges on a node, it can be a subdivision of a street, roadway, lane group etc. in the longitudinal direction in act several edges, two edges each by a node are connected. If there are three or more edges on a node, it acts is a junction or intersection of roads, lanes, lane groups etc. An intersection with more than three edges can be divided by several Knots with three edges to be replaced.
  • the different directions of a street can be represented by one or more edges.
  • Route data in the sense of Claims include data that is covered by one vehicle at a time Identify the path, namely the edges or the partial paths, each one or include several contiguous edges and together the covered Make way. If, based on transmitted route data, the route of a vehicle in a digital map of a transport network in the head office can also Further data such as travel times can be assigned to this route.
  • Route data transmitted can in particular be one from a vehicle with one Traffic detector traveled route and from vehicle to headquarters be transmitted.
  • the data determined in this way in the central office can in particular for travel time statistics and for later recommendations on the choice of routes Vehicles are used.
  • the route data can also relate in particular to one of the vehicles Head office recommended route and from the head office to the vehicle respectively can be transmitted to several vehicles. So that a vehicle can be used for one or determined several routes based on travel time statistics in a central office Travel times are informed and advice on the selection of routes.
  • the transmission of a route is expediently carried out by the transmission of Designations of the partial routes forming it.
  • a way can be from one or exist several partial routes.
  • the names of the partial routes can be found in the Central and in the vehicle in identical or different databases stored with an assignment of edges forming a partial path one partial route each; instead can also be used in the head office and in the vehicle at least one set of rules for the formation of partial paths from edges be saved and for the identification of partial routes of a route to be transmitted these rules are used.
  • edges each Partly because of the road types of these edges are taken into account; thus can for example, partial routes from edges representing highway sections or from Edges representing highway sections and country roads are formed.
  • the associated period or time is preferably transmitted for route data.
  • the exact time or a time can thus be determined for route data determined by a vehicle quantified period of time are transmitted and stored in the headquarters.
  • the control center can also transmit route data, what time period, for example what time of day, what day of the week or which day of the year these route data relate to, for example Precise route recommendations for traffic jams occurring at certain times of the year can be transmitted.
  • the target file from a source file is used to reference partial routes in the Suitable transmission of route data between a control center and a vehicle Target file created.
  • Different can be used to generate the target file Approaches can be chosen. For example, starting from a as Starting nodes selected nodes of the network, partial routes are defined in such a way that with ascending numbering of the partial routes, one partial route through if possible long left turn, starting from the starting node. This regulation is very easy to implement.
  • Figure 1 shows a digital road map of an edge 1 to 17 and node A to T. extensive traffic network.
  • An edge here comprises a section of the route a street.
  • the edge 1 is between the two nodes A and B
  • the edge 2 is between nodes B and C
  • edge 3 is between the Nodes C and D etc.
  • the nodes are A, G, J, P, T each start node of the digital map of the traffic network, ie Knots, of which only one edge or only one edge of the considered Street classes.
  • the nodes B, D, L are branch nodes, i.e. nodes with at least three adjacent edges; this means, for example, from the edge 1 At node B, drive a vehicle in the direction of edge 2 or edge 10 can that there is a real possibility of branching off.
  • a junction node can also have more than three edges, for example at an intersection; however, it is also possible to order the here selected representation with branch nodes with exactly three edges each preserved, even at intersections with more than three edges, several junction nodes to define from which exactly three edges each originate.
  • the nodes C, E, F, H, I, K M, N, Q R are nodes, of which only two edges, for example Edge 2 and 3 start from node C.
  • edges can be in one Digital road map representing traffic route network for specific purposes, such as. Congestion detection may be important, however, they are used to analyze a route and transmission of route data relating to this route, in particular Travel times, not important.
  • a network of traffic routes can also be found representative digital map, i.e. output file, to form a partial route of the Traffic network with target file representing low redundancy Consideration of edges and / or nodes of only a certain road class, for example, freeway, are taken into account; also e.g. from one Output file, several target files can be created for each street class.
  • a traffic network representing digital road map in Figure 1 a way and this way further route data in question should be transmitted by The passed nodes and / or the passed edges are transmitted.
  • the passed nodes and / or the passed edges are transmitted.
  • This way can be in a terminal in the vehicle due to a position detection system (e.g. GPS) and / or one Odometer and / or a speedometer and / or the detection of the Steering movements of the vehicle and / or a digital road map etc. detected become.
  • a total time required for this route can be added to the route and for partial routes of the route, partial route times are recorded.
  • This route data should be transmitted from the vehicle 18 to a control center. This can be done from a terminal in the vehicle 18 to the central office, for example by radio, in particular mobile radio, respectively.
  • radio in particular mobile radio, respectively.
  • transmission according to GSM in particular GSM SMS, can be selected in the form of a short message.
  • a vehicle 18 can travel From A to J the edges 1, 2, 3, 7, 8, 9 and the time required for this as Route data can be transmitted to a control center. Because of the variety of However, vehicles generate a very large amount of data. The capacity of the However, the available transmission medium is limited. Therefore the resulting data volume can be kept as low as possible.
  • the traffic route network is broken down into partial routes.
  • One or each can be used several edges 1 - 17 form a partial path.
  • at least one set of regulations for the formation of partial routes in one Traffic network or one according to a set of regulations from the digital Road map of a traffic route network (output file) less formed redundant (information technology compressed) digital road map of the Traffic route network (i.e. destination file) must be saved.
  • the regulations for dividing the transport network into partial routes can be chosen in this way be independent of the digital road maps that exist in the terminal and the headquarters can be used.
  • the terminal and in the Central does not necessarily have the same digital street map or the same Version (update) of a digital road map is available. The procedure is too for different cards or card versions in the terminal and in the head office formable.
  • a partial route can be defined between two nodes each are either output nodes A, G, J, P, T or branch nodes B, D, L, respectively.
  • the partial routes of the digital channels shown in FIG. 1 result from this version Road map of a traffic network as follows:
  • the partial route W 1 comprises the edge 1
  • Another set of regulations for the formation of partial routes in a digital road map representing a traffic route network can be as follows: A partial route is formed starting from any exit node A with increasing node numbering, by turning left for as long as possible until a further exit node G, J, P, T. Paths between this output node A and the other output nodes are thus detected. After all possible routes from the output node A have been processed, a further rule can lie in the choice of a further output node G, all of which except the route to the output node A already considered being defined accordingly as partial routes. Another requirement may be to proceed accordingly with the remaining exit nodes.
  • a route as transmitted route data would only contain a partial route.
  • Another set of regulations for the formation of partial routes can also be defined as follows: From an arbitrarily selected output node A turns left as long as possible to another exit node G, J, P, T analyzed; partial routes are only used for routes between exit nodes and Output node and possibly additionally between output node and Intersection node defined when from traffic data recorded by Vehicles shows that a relevant number of vehicles are traveling this route.
  • a set of regulations for the formation of partial routes may look as follows: the first partial route Y 1 comprises the edges 1, 2, 3, 7, 8, 9, the partial route Y 2 comprises the edges 15, 16, 17, the partial route Y 3 comprises the edges 10, 11, 12, 13, 14, the partial route Y 4 comprises the edges 4, 5, 6.
  • the first partial route Y 1 comprises the edges 1, 2, 3, 7, 8, 9, the partial route Y 2 comprises the edges 15, 16, 17, the partial route Y 3 comprises the edges 10, 11, 12, 13, 14, the partial route Y 4 comprises the edges 4, 5, 6.

Landscapes

  • Physics & Mathematics (AREA)
  • Engineering & Computer Science (AREA)
  • Radar, Positioning & Navigation (AREA)
  • General Physics & Mathematics (AREA)
  • Remote Sensing (AREA)
  • Analytical Chemistry (AREA)
  • Databases & Information Systems (AREA)
  • Chemical & Material Sciences (AREA)
  • Mathematical Physics (AREA)
  • Traffic Control Systems (AREA)
  • Navigation (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Monitoring And Testing Of Exchanges (AREA)

Claims (24)

  1. Procédé pour la transmission de données routières, notamment par radiotéléphone mobile, entre un véhicule (18) et une centrale,
    les données routières étant transmises avec des désignations de trajets partiels (W1, W2, W4) comportant chacun un ou plusieurs liens contigus (1 ; 2, 3 ; 7, 8, 9),
    certains trajets partiels (W1, W2, W4), au moins, comportant plusieurs liens (2, 3 ; 7, 8, 9) sur la carte numérique du réseau routier.
  2. Procédé selon la revendication 1,
    caractérisé en ce que des données routières concernant un trajet parcouru par le véhicule (18) comportant un détecteur de circulation sont transmises à la centrale par le véhicule (18).
  3. Procédé selon l'une des revendications précédentes,
    caractérisé en ce que des données routières concernant un trajet sont transmises au véhicule (18) par la centrale.
  4. Procédé selon l'une des revendications précédentes,
    caractérisé en ce que la transmission d'un trajet a lieu par la transmission de désignations des trajets partiels le constituant, les désignations (W1 à W8) étant présentes en mémoire dans la centrale et dans le véhicule (18) dans des banques de données identiques (W1 à W7 ; X1 à X7) ou différentes (W1 à W8 ; X1 à X10), en particulier sous la forme de fichiers cibles formés selon la revendication 14, avec une affectation de liens (7, 8, 9) formant à chaque fois un trajet partiel (W4) au trajet partiel (W4) concerné.
  5. Procédé selon l'une des revendications précédentes,
    caractérisé en ce que la transmission d'un trajet a lieu par la transmission de désignations au moins des trajets partiels le constituant, un jeu de consignes, au moins, étant enregistré à chaque fois dans la centrale et dans le véhicule pour la formation de trajets partiels à partir de liens.
  6. Procédé selon la revendication 5,
    caractérisé en ce que plusieurs jeux de consignes sont enregistrés pour la formation de trajets partiels et en ce que, avec des données routières concernant un trajet, le jeu de consignes associé ou une désignation de ce jeu de consignes est également transmis.
  7. Procédé selon l'une des revendications précédentes,
    caractérisé en ce qu'un trajet partiel est formé entre un noeud, d'où partent au moins trois liens, et un autre noeud, d'où partent également au moins trois liens.
  8. Procédé selon l'une des revendications précédentes,
    caractérisé en ce que, lors de l'affectation de liens à des trajets partiels, les types de routes (autoroute) des liens sont pris en considération.
  9. Procédé selon la revendication 8,
    caractérisé en ce qu'un trajet partiel est toujours formé uniquement à partir de liens du même type de routes, des trajets partiels étant de préférence uniquement définis entre des noeuds finals de cette catégorie de routes.
  10. Procédé selon l'une des revendications précédentes,
    caractérisé en ce que, pour un trajet, la centrale transmet à un véhicule le temps de trajet escompté pour ce trajet.
  11. Procédé selon l'une des revendications précédentes,
    caractérisé en ce que le véhicule transmet à la centrale, pour un trajet parcouru par le véhicule, le temps de trajet nécessaire pour le trajet et/ou pour des trajets partiels.
  12. Procédé selon l'une des revendications précédentes,
    caractérisé en ce que, pour des données routières, il est transmis la période de temps pendant laquelle ou l'instant auquel les données routières ont été enregistrées ou pendant quelle période de temps ou à quel instant les données routières ont été déterminées.
  13. Procédé selon l'une des revendications précédentes,
    caractérisé en ce que, dans le cas de données routières enregistrées par plusieurs véhicules pour plusieurs trajets, des temps de trajets associés et des périodes de temps d'enregistrement ou des instants d'enregistrement associé(e)s sont enregistrés dans un fichier statistique dans la centrale.
  14. Procédé selon l'une des revendications précédentes,
    caractérisé en ce que, pour l'analyse d'un réseau routier présentant des liens (1 à 17) et des noeuds (A à T), lequel existe sous la forme d'un fichier de départ comportant au moins des indications sur des liaisons de liens et/ou de noeuds entre eux, un fichier cible représentant le réseau routier est produit, en ce que plusieurs trajets partiels sont formés à chaque fois par la réunion à chaque fois d'un ou plusieurs liens ou noeuds du fichier de départ reliés entre eux et en ce que, pour chacun de ces trajets partiels, une désignation de ce trajet partiel et une liste des liens et/ou noeuds contenus dans celui-ci sont enregistrées dans le fichier cible.
  15. Procédé selon la revendication 14,
    caractérisé en ce que, dans le fichier cible, sont également enregistrés les liens ou les noeuds qui ne sont pas contenus dans un trajet partiel.
  16. Procédé selon la revendication 14 ou 15,
    caractérisé en ce que les liens d'une certaine catégorie de routes (autoroute) sont à chaque fois analysés séparément et enregistrés dans un fichier cible ou sous-fichier cible spécifique.
  17. Procédé selon l'une des revendications 14 à 16,
    caractérisé en ce qu'un trajet partiel est défini à chaque fois entre un noeud, d'où partent au moins trois liens, et un autre noeud, d'où partent également au moins trois liens.
  18. Procédé selon l'une des revendications 14 à 17,
    caractérisé en ce que, partant d'un noeud de départ (A) du réseau pouvant être choisi, le trajet partiel portant le numéro 1 est formé en s'écartant de ce noeud vers la gauche et vers d'autres noeuds, et en ce que d'autres trajets partiels portant à chaque fois le numéro immédiatement inférieur sont formés en s'écartant à chaque fois vers la gauche le plus loin possible.
  19. Centrale de détermination de la circulation pour la détermination de la circulation, comportant une mémoire, un récepteur, un programme enregistré dans la mémoire pour l'exécution du procédé selon l'une des revendications précédentes et une commande pour l'interruption du programme.
  20. Centrale de détermination de la circulation selon la revendication 19,
    caractérisée en ce qu'elle présente un fichier cible produit selon la revendication 14.
  21. Centrale de détermination de la circulation selon la revendication 19 ou 20,
    caractérisée en ce qu'elle présente un émetteur.
  22. Terminal, en particulier pour un véhicule, pour la détermination de la circulation, comportant une mémoire, un émetteur, un programme enregistré dans la mémoire pour l'exécution du procédé selon l'une des revendications 1 à 18 et une commande pour l'interruption du programme.
  23. Terminal selon la revendication 22, comportant un récepteur.
  24. Terminal selon la revendication 22 ou 23, comportant un fichier cible généré selon la revendication 14.
EP98250299A 1997-09-12 1998-08-25 Procédé de transmission de données routières et d'analyse du réseau de circulation routière, unité centrale de mesure du trafic routier et terminal associé Expired - Lifetime EP0902406B1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
DE19741116 1997-09-12
DE19741116A DE19741116B4 (de) 1997-09-12 1997-09-12 Verfahren zur Übertragung von Wegedaten, Verfahren zur Analyse eines Verkehrswegenetzes, Verkehrserfassungszentrale und Endgerät

Publications (3)

Publication Number Publication Date
EP0902406A2 EP0902406A2 (fr) 1999-03-17
EP0902406A3 EP0902406A3 (fr) 2000-08-16
EP0902406B1 true EP0902406B1 (fr) 2004-03-17

Family

ID=7842784

Family Applications (1)

Application Number Title Priority Date Filing Date
EP98250299A Expired - Lifetime EP0902406B1 (fr) 1997-09-12 1998-08-25 Procédé de transmission de données routières et d'analyse du réseau de circulation routière, unité centrale de mesure du trafic routier et terminal associé

Country Status (5)

Country Link
US (1) US6314360B1 (fr)
EP (1) EP0902406B1 (fr)
AT (1) ATE262204T1 (fr)
DE (2) DE19741116B4 (fr)
ES (1) ES2213874T3 (fr)

Families Citing this family (30)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB2360421B (en) * 1999-11-10 2004-02-18 Ibm Transmission of geographic information to mobile devices
JP2003514238A (ja) * 1999-11-11 2003-04-15 フオルクスヴアーゲン アクチエンゲゼルシヤフト 道路網を表現および形成する方法および道路網
DE10052109B4 (de) * 1999-11-11 2014-10-30 Deutsche Telekom Ag Verfahren zum Beschreiben und Erzeugen von Straßennetzen und Straßennetz
GB2361545A (en) * 2000-01-27 2001-10-24 Trafficmaster Developments Ltd Traffic monitoring
US6353795B1 (en) * 2000-02-01 2002-03-05 Infospace, Inc. Method and system for matching an incident to a route
US6615130B2 (en) * 2000-03-17 2003-09-02 Makor Issues And Rights Ltd. Real time vehicle guidance and traffic forecasting system
DE10015935A1 (de) * 2000-03-30 2001-10-04 Bosch Gmbh Robert Verfahren zur Übertragung einer Position einer Verkehrsinformation, insbesondere einer Verkehrsstörung
US6587781B2 (en) * 2000-08-28 2003-07-01 Estimotion, Inc. Method and system for modeling and processing vehicular traffic data and information and applying thereof
MXPA03007168A (es) 2001-01-12 2013-05-28 Gates Corp Banda de transmision de potencia de bajo crecimiento
JP4663136B2 (ja) * 2001-01-29 2011-03-30 パナソニック株式会社 デジタル地図の位置情報伝達方法と装置
JP3990641B2 (ja) * 2002-03-27 2007-10-17 松下電器産業株式会社 道路情報提供システム及び装置と道路情報生成方法
DE10231833A1 (de) * 2002-07-12 2004-01-22 Robert Bosch Gmbh Verfahren zur Aktualisierung von Routendaten
CA2496870C (fr) * 2002-08-29 2016-06-07 Itis Holdings Plc Appareil et procede de mise a disposition d'information de trafic
US7254481B2 (en) * 2002-12-27 2007-08-07 Fujitsu Limited Action support method and apparatus
JP4255007B2 (ja) * 2003-04-11 2009-04-15 株式会社ザナヴィ・インフォマティクス ナビゲーション装置、およびその旅行時間算出方法
KR100703444B1 (ko) * 2003-06-03 2007-04-03 삼성전자주식회사 네비게이션 시스템에서 위치 정보에 관련된 영상의 다운로드 및 표시 장치 및 방법
US7620402B2 (en) 2004-07-09 2009-11-17 Itis Uk Limited System and method for geographically locating a mobile device
DE102006000643A1 (de) 2006-01-03 2007-07-05 Robert Bosch Gmbh Verfahren zur Übertragung von Routeninformationen
JP4591395B2 (ja) * 2006-03-31 2010-12-01 アイシン・エィ・ダブリュ株式会社 ナビゲーションシステム
GB0901588D0 (en) 2009-02-02 2009-03-11 Itis Holdings Plc Apparatus and methods for providing journey information
GB2492369B (en) 2011-06-29 2014-04-02 Itis Holdings Plc Method and system for collecting traffic data
US9053636B2 (en) 2012-12-30 2015-06-09 Robert Gordon Management center module for advanced lane management assist for automated vehicles and conventionally driven vehicles
US9286800B2 (en) 2012-12-30 2016-03-15 Robert Gordon Guidance assist vehicle module
CN104217579B (zh) * 2013-07-23 2016-08-24 同济大学 基于路段子网络冗余度的交通网络关键路段搜索方法
US9799218B1 (en) 2016-05-09 2017-10-24 Robert Gordon Prediction for lane guidance assist
US9911329B1 (en) 2017-02-23 2018-03-06 Robert Gordon Enhanced traffic sign information messaging system
FR3093976A1 (fr) * 2019-03-19 2020-09-25 Continental Automotive Procédé de routage adaptatif d’un véhicule dans un réseau routier
DE102019006103B4 (de) * 2019-08-29 2022-03-17 Joynext Gmbh Übertragen des Verlaufs einer Route
CN111798660B (zh) * 2020-06-30 2021-12-07 腾讯科技（深圳）有限公司 车辆信息显示、获取方法及装置以及相关设备
US12158349B2 (en) 2021-09-23 2024-12-03 At&T Intellectual Property I, L.P. Vehicular traffic flow optimization

Family Cites Families (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE3633881A1 (de) * 1986-10-04 1988-04-07 Bosch Gmbh Robert Empfaenger fuer verkehrsfunksendungen
DE3810177C2 (de) * 1988-03-25 1999-06-17 Bosch Gmbh Robert Rundfunkempfänger, insbesondere Fahrzeugempfänger
JP2792210B2 (ja) * 1990-07-03 1998-09-03 富士電機株式会社 無人搬送車の制御方法および制御装置
NL9001810A (nl) * 1990-08-13 1992-03-02 Philips Nv Werkwijze voor de positiebepaling van een voertuig, inrichting voor de positiebepaling van een voertuig, alsmede voertuig voorzien van de inrichting.
US5845227A (en) * 1991-02-01 1998-12-01 Peterson; Thomas D. Method and apparatus for providing shortest elapsed time route and tracking information to users
GB2271420A (en) * 1992-10-07 1994-04-13 Ford Motor Co Vehicle navigation system
JPH07234994A (ja) * 1994-02-24 1995-09-05 Toshiba Corp 経路表示装置
US5543789A (en) * 1994-06-24 1996-08-06 Shields Enterprises, Inc. Computerized navigation system
DE19508486A1 (de) * 1995-03-09 1996-09-12 Mannesmann Ag Verfahren und Vorrichtung zur Reduzierung einer aus einem Fahrzeug zu übertragenden Datenmenge
JPH08339162A (ja) * 1995-06-12 1996-12-24 Alpine Electron Inc 地図描画方法
KR100198813B1 (ko) * 1996-06-12 1999-06-15 정선종 우편경로 시스템 및 그 시스템에 따른 최단 경로 생성방법
JP3223240B2 (ja) * 1996-11-19 2001-10-29 本田技研工業株式会社 車両制御装置
US5893081A (en) * 1996-11-25 1999-04-06 Etak, Inc. Using multiple levels of costs for a pathfinding computation
US5916299A (en) * 1996-11-25 1999-06-29 Etak, Inc. Method for determining exits and entrances for a region in a network
US5978730A (en) * 1997-02-20 1999-11-02 Sony Corporation Caching for pathfinding computation

Also Published As

Publication number Publication date
DE19741116A1 (de) 1999-03-18
EP0902406A3 (fr) 2000-08-16
DE59810980D1 (de) 2004-04-22
US6314360B1 (en) 2001-11-06
ATE262204T1 (de) 2004-04-15
EP0902406A2 (fr) 1999-03-17
ES2213874T3 (es) 2004-09-01
DE19741116B4 (de) 2004-02-26

Similar Documents

Publication Publication Date Title
EP0902406B1 (fr) Procédé de transmission de données routières et d'analyse du réseau de circulation routière, unité centrale de mesure du trafic routier et terminal associé
EP1026649B1 (fr) Procédé et dispositif de préparation d'information de circulation
DE69222463T2 (de) Verfahren zum Sammeln von Verkehrsinformation sowie Einrichtung zum Ausführen dieses Verfahrens
DE69807828T2 (de) Navigationssystem zum gebrauch in einem fahrzeug
DE19539641C2 (de) Verfahren und Einrichtung zur verkehrssituationsabhängigen Fahrzeugzielführung
EP0944893B1 (fr) Procede de selection d'informations sur la circulation transmises par un central et concernant un trajet d'un vehicule equipe d'un terminal dans un reseau routier
EP0730726B1 (fr) Procede de realisation d'une carte routiere numerisee
EP1145210B1 (fr) Procede pour identifier des evenements couvrant plusieurs segments, par l'intermediaire desdits segments
EP0941533B2 (fr) Procede et terminal pour l'attribution spatiale d'informations se rapportant a un emplacement
EP1062481B1 (fr) Procede d'affichage d'informations de trafic
EP0884709B1 (fr) Dispositif pour obtenir les informations sur la vitesse maximale prédéterminée dans un véhicule
DE102018202970A1 (de) Verfahren zum Ermitteln einer topologischen Information einer Straßenkreuzung
EP0803852B1 (fr) Procédé et appareil de guidage d'un véhicule
EP1397643B1 (fr) Procede de production de donnees de navigation pour une prevision d'itineraire et systeme de navigation
EP0889454A2 (fr) Procédé et centrale de pronostic et d'analyse d'un réseau de circulation
EP1245017B1 (fr) Procede pour decrire et produire des reseaux routiers et reseau routier correspondant
EP0790591B1 (fr) Banque de données de lieux pour la détermination d'itinéraires dans un réseau de circulation routière
DE19753170A1 (de) Verfahren zur Übertragung von eine empfohlene Route eines Fahrzeuges in einem Verkehrsnetz betreffenen Routeninformationen von einer Verkehrszentrale an ein Endgerät in einem Fahrzeug, Endgerät und Zentrale
DE19816585B4 (de) Verfahren zur Routeninformation eines Endgerät-Benutzers durch Übermittlung von Routeninformationen von einer Zentrale an das Endgerät
DE19750775A1 (de) Verfahren zum Selektieren von eine Route eines Fahrzeuges mit einem Endgerät in einem Verkehrsnetz betreffenden, von einer Zentrale ausgesendeten Verkehrsinformationen, Endgerät und Zentrale zum Durchführen des Verfahrens
EP0261450A1 (fr) Système de guidage pour la circulation individuelle
DE10052934A1 (de) Verfahren zur Bestimmung eines Weges zwischen einem Ausgangspunkt und einem Endpunkt eines Netzes, wie beispielsweise Straßennetzes
EP0944896A1 (fr) Procede pour transmettre entre un central d'informations routieres et un terminal monte dans un vehicule des informations routieres concernant un trajet recommande d'un vehicule dans un reseau routier, terminal et central d'informations routieres
DE60106857T2 (de) Verfahren und Vorrichtung für Referenzstandorte in der Transporttelematik
DE19810126A1 (de) Verfahren zur rechnergestützten Routenfindung für Fahrzeugführer

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

AK Designated contracting states

Kind code of ref document: A2

Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LI NL PT SE

AX Request for extension of the european patent

Free format text: AL;LT;LV;MK;RO;SI

PUAL Search report despatched

Free format text: ORIGINAL CODE: 0009013

AK Designated contracting states

Kind code of ref document: A3

Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LI LU MC NL PT SE

AX Request for extension of the european patent

Free format text: AL;LT;LV;MK;RO;SI

RIC1 Information provided on ipc code assigned before grant

Free format text: 7G 08G 1/01 A, 7G 08G 1/0969 B, 7G 08G 1/09 B

17P Request for examination filed

Effective date: 20000810

AKX Designation fees paid

Free format text: AT BE CH CY DE DK ES FI FR GB GR IE IT LI NL PT SE

RAP1 Party data changed (applicant data changed or rights of an application transferred)

Owner name: VODAFONE AG

17Q First examination report despatched

Effective date: 20021022

RAP1 Party data changed (applicant data changed or rights of an application transferred)

Owner name: VODAFONE HOLDING GMBH

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

RAP1 Party data changed (applicant data changed or rights of an application transferred)

Owner name: ATX EUROPE GMBH

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): AT BE CH CY DE DK ES FI FR GB GR IE IT LI NL PT SE

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

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: 20040317

Ref country code: IE

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: 20040317

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: 20040317

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: 20040317

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

GBT Gb: translation of ep patent filed (gb section 77(6)(a)/1977)

Effective date: 20040317

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

Free format text: GERMAN

REF Corresponds to:

Ref document number: 59810980

Country of ref document: DE

Date of ref document: 20040422

Kind code of ref document: P

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

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: 20040617

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: 20040617

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: 20040617

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

Ref country code: GB

Payment date: 20040730

Year of fee payment: 7

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

Ref country code: FR

Payment date: 20040809

Year of fee payment: 7

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

Ref country code: ES

Payment date: 20040819

Year of fee payment: 7

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: 20040825

ET Fr: translation filed
PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LI

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

Effective date: 20040831

Ref country code: CH

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

Effective date: 20040831

Ref country code: BE

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

Effective date: 20040831

NLV1 Nl: lapsed or annulled due to failure to fulfill the requirements of art. 29p and 29m of the patents act
REG Reference to a national code

Ref country code: ES

Ref legal event code: FG2A

Ref document number: 2213874

Country of ref document: ES

Kind code of ref document: T3

RAP2 Party data changed (patent owner data changed or rights of a patent transferred)

Owner name: ATX EUROPE GMBH

REG Reference to a national code

Ref country code: IE

Ref legal event code: FD4D

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

BERE Be: lapsed

Owner name: *ATX EUROPE G.M.B.H.

Effective date: 20040831

26N No opposition filed

Effective date: 20041220

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

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;WARNING: LAPSES OF ITALIAN PATENTS WITH EFFECTIVE DATE BEFORE 2007 MAY HAVE OCCURRED AT ANY TIME BEFORE 2007. THE CORRECT EFFECTIVE DATE MAY BE DIFFERENT FROM THE ONE RECORDED.

Effective date: 20050825

Ref country code: GB

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

Effective date: 20050825

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 NON-PAYMENT OF DUE FEES

Effective date: 20050826

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

Effective date: 20050825

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

Ref country code: FR

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

Effective date: 20060428

REG Reference to a national code

Ref country code: FR

Ref legal event code: ST

Effective date: 20060428

REG Reference to a national code

Ref country code: ES

Ref legal event code: FD2A

Effective date: 20050826

BERE Be: lapsed

Owner name: *ATX EUROPE G.M.B.H.

Effective date: 20040831

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

Ref country code: PT

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

Effective date: 20040817

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

Ref country code: DE

Payment date: 20150821

Year of fee payment: 18

REG Reference to a national code

Ref country code: DE

Ref legal event code: R119

Ref document number: 59810980

Country of ref document: DE

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

Ref country code: DE

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

Effective date: 20170301