EP1105856B1 - Dispositif pour le codage et le decodage d'emplacements - Google Patents

Dispositif pour le codage et le decodage d'emplacements Download PDF

Info

Publication number
EP1105856B1
EP1105856B1 EP99934485A EP99934485A EP1105856B1 EP 1105856 B1 EP1105856 B1 EP 1105856B1 EP 99934485 A EP99934485 A EP 99934485A EP 99934485 A EP99934485 A EP 99934485A EP 1105856 B1 EP1105856 B1 EP 1105856B1
Authority
EP
European Patent Office
Prior art keywords
ordinate
location
locations
receiver
coordinates
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
EP99934485A
Other languages
German (de)
English (en)
Other versions
EP1105856A1 (fr
Inventor
Bernd Hessing
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
Family has litigation
First worldwide family litigation filed litigation Critical https://patents.darts-ip.com/?family=7876323&utm_source=google_patent&utm_medium=platform_link&utm_campaign=public_patent_search&patent=EP1105856(B1) "Global patent litigation dataset” by Darts-ip is licensed under a Creative Commons Attribution 4.0 International License.
Application filed by Robert Bosch GmbH filed Critical Robert Bosch GmbH
Publication of EP1105856A1 publication Critical patent/EP1105856A1/fr
Application granted granted Critical
Publication of EP1105856B1 publication Critical patent/EP1105856B1/fr
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G01MEASURING; TESTING
    • G01CMEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
    • G01C21/38Electronic maps specially adapted for navigation; Updating thereof
    • G01C21/3885Transmission of map data to client devices; Reception of map data by client devices
    • G01C21/3889Transmission of selected map data, e.g. depending on route
    • GPHYSICS
    • G08SIGNALLING
    • G08CTRANSMISSION SYSTEMS FOR MEASURED VALUES, CONTROL OR SIMILAR SIGNALS
    • G08C17/00Arrangements for transmitting signals characterised by the use of a wireless electrical link
    • G08C17/02Arrangements for transmitting signals characterised by the use of a wireless electrical link using a radio link
    • GPHYSICS
    • G08SIGNALLING
    • G08GTRAFFIC CONTROL SYSTEMS
    • G08G1/00Traffic control systems for road vehicles
    • G08G1/09Arrangements for giving variable traffic instructions
    • GPHYSICS
    • G09EDUCATION; CRYPTOGRAPHY; DISPLAY; ADVERTISING; SEALS
    • G09BEDUCATIONAL OR DEMONSTRATION APPLIANCES; APPLIANCES FOR TEACHING, OR COMMUNICATING WITH, THE BLIND, DEAF OR MUTE; MODELS; PLANETARIA; GLOBES; MAPS; DIAGRAMS
    • G09B29/00Maps; Plans; Charts; Diagrams, e.g. route diagram
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B7/00Radio transmission systems, i.e. using radiation field
    • H04B7/24Radio transmission systems, i.e. using radiation field for communication between two or more posts
    • H04B7/26Radio transmission systems, i.e. using radiation field for communication between two or more posts at least one of which is mobile

Definitions

  • the invention relates to a method for coding or decoding Places in a traffic network to which information from one transmitter each to a receiver.
  • Vehicles exchange traffic telematics systems Remote data transmission information with central facilities out. Through this exchange of information you can different applications, such as Emergency call service, traffic information service, Orientation aids or dynamic route guidance services will be realized. For all of these services is the Transfer of location information necessary.
  • Location information can include positions from Vehicles, location and extent of traffic disruptions, Destinations or selected intermediate points on a route being represented.
  • intermodal mobility services are also in Discussion with which different modes of transport, for example car traffic and public Local public transport, are linked together. Also location information is required here, for example as Interface from one mode of transport to another.
  • Such a key-based one Coding system is, for example, the coding of Location information in the TMC system according to CEN ENV 12313-3.
  • On essential feature of the location databases used therein are references to neighboring places. Among other things, because of these references are the maintenance and synchronization of these Location databases technically demanding. Apart from this, received information can only be coded if at the same location database was used for the coding.
  • the object of the present invention is a method to encode locations that require decoding of the Location information in the receiver even with different Coding and decoding tables allowed and thus for several of the above services can be used.
  • the agreement section also provides information on Art the coding and tolerances of the coordinate pairs contains.
  • Road networks, line networks come from as traffic route networks Transportation (train, bus, plane), rail networks and Waterway networks in question, i.e. ultimately all networks to those locations in Geographical Coordinates Are related to each other. You can use the coding according to the invention also addresses locations, which belong to different traffic route networks.
  • One application that can be mentioned is, for example Users on a Saturday morning as quickly as possible in one To manage the pedestrian zone, although it may be that the Transportation bus and train included in the optimization become.
  • the locations to be coded come apart from those specified Points in the road network, for example localities or Intersections, other types of places in question, such as one Traffic disruption in the road network or a stop a tram line.
  • the invention also has the advantage that despite being limited Accuracy of the transmitted coordinates an exact defined location can be coded. It won't assumed that the location databases at the transmitter and at Recipients are structured identically. It's just one Assignment to the content by specifying the geographical Coordinates required.
  • Adequate for decoding is sufficient Similarity of those defined by the step-by-step procedure Road elements.
  • the depth of detail in the Recipients at least the level of detail of the Correspond to the location database of the transmitter. They also have to accepted by the broadcaster when selecting the points Relationships between the points for the recipient be understandable. For example, all points can be on lying on a street. In this case, the recipient and in the transmitter this street and the points lying on it be known.
  • the individual steps in the device according to the invention form a maneuver that based on directions given one by one Respondent gives a stranger.
  • agreement When using geographic coordinates is a Agreement on the coding to be used required. there the agreement can be explicit or implicit. It it is also possible for everyone to be described by a maneuver Location information an information about the used Send coding ahead. This can be done in detail be provided that the agreement part at least partially permanently stored in the transmitter and in the receiver is. Such a part of the agreement can, for example, in a standard applicable to all transmitters and receivers his.
  • Part of the agreement at least in part at the time of admission a communication between transmitter and receiver becomes.
  • Part of the agreement at least partially directly in the Transferred in connection with the coordinate part and in Recipient is temporarily stored.
  • An advantageous method for decoding is to that in a location database showing the coordinates, the location on one traffic route and further information from Contains locations, locations that are identified within the Tolerance ranges of the received coordinate pairs lie, that from the determined locations those are selected which are on a common traffic route, and that from the selected locations the one determined as decoded, that in the tolerance range of the particular coordinate pair lies.
  • a digital is used for coding and decoding Road map used as a fictional example in FIG. 2 is shown.
  • A2C3 and B3C4 2 shows two further roads, namely a street A between locations A1 and A2C3 and a street B between locations B1, B2C2, B3C4 and B4.
  • the sections between the streets are preceded by an L and marked the indexing of the connected places.
  • Fig. 1 shows in addition to the road network of FIG Tolerance range of a point P11 with the coordinates P11 (x); P11 (y). This coding alone is thus determined which of the in the hatched tolerance range encoded locations. Therefore, according to FIG Auxiliary point P12 coded, for positioning the Coordinates of the location C1 can be used. In itself is too the use of other places on street C possible.
  • Fig. 4 shows in a highly simplified form traffic telematics system, in which an exchange and a use of location information coded according to the invention takes place.
  • a traffic telematics service 11 Information provided by a traffic telematics service 11 are delivered and received via a Encoder / decoder 12 and a transceiver 13 supplied to a remote data transmission device 4 or taken.
  • Such location databases are for example for the above known TMC system known and each get one Location code Information on the type of location, on neighboring locations the respective street and the position of the place in form of a pair of coordinates.
  • Remote data transmission device 4 is used, for example cellular radio network.
  • the central device 1 can Remote data transmission device 4 with many Vehicle interiors exchange information about what in 4 only vehicle devices 2, 3 are shown are the respective devices 21, 31 for the traffic telematics services, encoder / decoder 22, 32, Location databases 24, 34 and transmitting / receiving devices 23, 33 included. Despite this being shown identically in FIG. 4 Structure, the vehicle equipment can be quite different be from each other. For example, the telematics services 21, 31 significant differences have, the location databases 24, 34 also different can be, for example a different height Can have level of detail.
  • FIG. 5 shows another example in which a destination, namely a specific parking space in the arrival area of the Frankfurt Airport, Terminal 1.
  • a destination namely a specific parking space in the arrival area of the Frankfurt Airport, Terminal 1.
  • the corresponding Lanes are on top of each other. They are different however regarding the respective arrival. 5 are the on superimposed streets for departure and arrival 41, 42 shown side by side.
  • the destination P21 is approximately 8 ° 34'2.8 "at the geographical position east longitude and 50 ° 3'8.7 "north latitude agreed deviation of ⁇ 3 ", it is not clear whether the arrival or departure area of the airport to be started.
  • the corresponding tolerance range of P21 is shown hatched in Fig. 5. It will therefore an auxiliary point P22 is required.
  • the from the arrival of the Departure area deviating approach 43 to the parking lot runs about the point 3 ° 34'7.2 “and 50 ° 3'3.1” and is shown in Fig. 5 highlighted.
  • the tolerance range of the point P22 is hatched.
  • a junction 45 of a highway 46 for a Traffic announcement can be coded.
  • traffic reports are included in location databases except the location (junction 45) as a point on the highway 46 a point with the same or at least in the Tolerance range falling coordinates on a road 47.
  • the junction as a point on the highway 46 is clearly encoded, another point, namely the adjacent junction 44 as a pair of coordinates transfer.
  • this junction also in connection with two other streets 48, 49 listed.
  • this have no connection with point 45 is explained in more detail in conjunction with FIG. 7.
  • Fig. 7 shows the sequence of coding and decoding the junction 45 (Fig. 6). This procedure corresponds Programs of processors in the transmitter and receiver. To a start at 51 the order is accepted at 52, namely "code junction 45, direction of travel north (N) for traffic information (IT) ". At 53 the geographic coordinates x (45), y (45) of junction 45 from a digital map or other suitable Memory read out. At 54 the for Traffic information related to highways suitable tolerance set, for example ⁇ 500 m.
  • the program branches depending on whether Uniqueness for the specification of the coordinates for the Junction 45 is present. Are in the location database of the Coders found more than one place with these coordinates - in in this case the same place on street 47 - the program branches in the direction of the program part 56, in which the coordinates of the on the highway 46 previous location, namely the junction 44, to be added. With both coordinate pairs the Exam repeated at 55. If there is uniqueness at 57, the coordinates x (45), y (45) and x (44), y (44) to the receiver or decoder. There are the Coordinates received at 61, whereupon the coordinates at 62 the first point of existence in the location database be checked and a list of possible candidates, namely the junction 44 on the streets 46, 48, 49 created.
  • junction 45 on one or more lists are listed as successors.
  • Junction 45 is not on any list as a successor an error is found at 65. It can no decoding is done, whereupon the program at 66 is ended.
  • connection point 45 after the Junction 44 added to the list (program part 67).
  • the program is in Depends on whether all received Coordinate pairs were checked. Are not yet checked, the check is repeated at 63. Are all checked, the uniqueness is checked again at 70 whether namely the list only one coordinate chain on one Road contains.

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Remote Sensing (AREA)
  • Radar, Positioning & Navigation (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Theoretical Computer Science (AREA)
  • Educational Technology (AREA)
  • Educational Administration (AREA)
  • Signal Processing (AREA)
  • Business, Economics & Management (AREA)
  • Mathematical Physics (AREA)
  • Automation & Control Theory (AREA)
  • Traffic Control Systems (AREA)
  • Navigation (AREA)
  • Instructional Devices (AREA)

Claims (10)

  1. Procédé de codage et de décodage de lieux dans un réseau de circulation routière avec transmission d'informations de l'émetteur vers le récepteur
    caractérisé en ce que
    le code se compose d'une partie convenue et suivant le lieu codé également d'une partie de coordonnées,
    la partie de coordonnées contient plusieurs paires de coordonnées, une paire de coordonnées représentant les coordonnées enregistrées du côté de l'émetteur pour l'emplacement codé et au moins une autre paire de coordonnées représentant un point auxiliaire, et
    la partie convenue contient au moins le nombre des paires des coordonnées contenues dans la partie de coordonnées, la position de la paire de coordonnées du lieu codé dans la partie de coordonnées et une indication du type de lieu codé.
  2. Procédé selon la revendication 1,
    caractérisé en ce que
    la partie convenue contient en outre des indications sur la nature du codage et une tolérance des paires de coordonnées.
  3. Procédé selon l'une des revendications 1 ou 2,
    caractérisé en ce que
    la partie convenue est enregistrée au moins en partie de façon permanente dans l'émetteur et dans le récepteur.
  4. Procédé selon l'une des revendications précédentes,
    caractérisé en ce que
    la partie convenue est transmise au moins partiellement lors de l'établissement d'une communication entre l'émetteur et le récepteur.
  5. Procédé selon l'une des revendications précédentes,
    caractérisé en ce que
    la partie convenue est transmise au moins en partie, directement en liaison avec la partie de coordonnées et est enregistrée provisoirement dans le récepteur.
  6. Procédé selon l'une des revendications précédentes,
    caractérisé en ce que
    l'émetteur reçoit autant de paires de coordonnées dans la partie de coordonnées que chaque récepteur conçu pour le décodage, puisse identifier sans équivoque le lieu codé.
  7. Procédé selon la revendication 5,
    caractérisé en ce que
    les coordonnées contenues dans la partie de coordonnées reçues concernent des points qui ont une relation commune dans le récepteur.
  8. Procédé selon la revendication 7,
    caractérisé en ce que
    dans le récepteur, à l'intérieur de la plage de tolérance on peut avoir plusieurs points et on sélectionne le point qui présente la relation la plus proche avec le point auxiliaire précédent et le point auxiliaire suivant.
  9. Procédé selon l'une des revendications précédentes,
    caractérisé en ce que
    dans la partie de coordonnées on enregistre une paire de coordonnées comme grandeur absolue et l'autre paire de coordonnées comme déviation par rapport à une paire de coordonnées.
  10. Procédé de décodage de lieux dans un réseau de circulation routière transmis suivant les revendications précédentes,
    caractérisé en ce que
    dans une banque de données de lieux qui contient les coordonnées, les positions au niveau de chaque chemin de circulation et d'autres informations de lieux on détermine des lieux situés à l'intérieur de la plage de tolérance de la paire de coordonnées reçue,
    à partir des lieux obtenus on sélectionne ceux qui sont situés sur un chemin de circulation commun, et
    à partir des lieux sélectionnés on définit comme décodé celui qui se situe dans la plage de tolérance de la paire de coordonnées déterminée.
EP99934485A 1998-08-04 1999-05-12 Dispositif pour le codage et le decodage d'emplacements Expired - Lifetime EP1105856B1 (fr)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
DE19835051 1998-08-04
DE19835051A DE19835051A1 (de) 1998-08-04 1998-08-04 Einrichtung zur Codierung und zur Decodierung von Orten
PCT/DE1999/001433 WO2000008616A1 (fr) 1998-08-04 1999-05-12 Dispositif pour le codage et le decodage d'emplacements

Publications (2)

Publication Number Publication Date
EP1105856A1 EP1105856A1 (fr) 2001-06-13
EP1105856B1 true EP1105856B1 (fr) 2002-11-27

Family

ID=7876323

Family Applications (1)

Application Number Title Priority Date Filing Date
EP99934485A Expired - Lifetime EP1105856B1 (fr) 1998-08-04 1999-05-12 Dispositif pour le codage et le decodage d'emplacements

Country Status (5)

Country Link
US (1) US6728631B1 (fr)
EP (1) EP1105856B1 (fr)
JP (1) JP4215398B2 (fr)
DE (2) DE19835051A1 (fr)
WO (1) WO2000008616A1 (fr)

Families Citing this family (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040215387A1 (en) 2002-02-14 2004-10-28 Matsushita Electric Industrial Co., Ltd. Method for transmitting location information on a digital map, apparatus for implementing the method, and traffic information provision/reception system
JP3481168B2 (ja) 1999-08-27 2003-12-22 松下電器産業株式会社 デジタル地図の位置情報伝達方法
WO2001018769A1 (fr) 1999-09-07 2001-03-15 Robert Bosch Gmbh Procede de codage et de decodage d'objets dans un reseau de voies de circulation
DE10033193A1 (de) * 2000-07-07 2002-01-17 Bosch Gmbh Robert Verfahren und Anordnung zur Codierung, zur Decodierung und/oder zur Übertragung von Ortsinformationen
JP5041638B2 (ja) 2000-12-08 2012-10-03 パナソニック株式会社 デジタル地図の位置情報伝達方法とそれに使用する装置
JP4663136B2 (ja) 2001-01-29 2011-03-30 パナソニック株式会社 デジタル地図の位置情報伝達方法と装置
JP4749594B2 (ja) 2001-04-27 2011-08-17 パナソニック株式会社 デジタル地図の位置情報伝達方法
JP4230132B2 (ja) 2001-05-01 2009-02-25 パナソニック株式会社 デジタル地図の形状ベクトルの符号化方法と位置情報伝達方法とそれを実施する装置
US6519526B1 (en) 2002-02-14 2003-02-11 Matsushita Electric Industrial Co., Ltd. Method of updating registered information in digital map
CN1277373C (zh) * 2003-05-07 2006-09-27 华为技术有限公司 网络通信系统中用户位置信息的传递方法
US8818695B2 (en) 2009-02-23 2014-08-26 Hti Ip, L.L.C. Method for reporting traffic conditions
US8965670B2 (en) * 2009-03-27 2015-02-24 Hti Ip, L.L.C. Method and system for automatically selecting and displaying traffic images
JP5462536B2 (ja) * 2009-06-30 2014-04-02 日立オートモティブシステムズ株式会社 経路案内サーバ装置、ナビゲーション装置、経路案内システムおよび経路案内方法
DE102015222095A1 (de) 2015-11-10 2017-05-11 Robert Bosch Gmbh Verfahren und Vorrichtung zur Delta-Codierung eines Datenbestandes
US9874449B2 (en) 2016-02-01 2018-01-23 Here Global B.V. Efficient and error tolerant mapping from a source graph to a target graph
US10820166B1 (en) 2019-12-04 2020-10-27 Toyota Connected North America, Inc. Systems and methods for obtaining location intelligence

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS61216098A (ja) 1985-03-20 1986-09-25 日産自動車株式会社 車両用経路誘導装置
EP0261450B1 (fr) * 1986-09-03 1991-07-24 Siemens Aktiengesellschaft Système de guidage pour la circulation individuelle
DE3718996A1 (de) * 1987-06-06 1988-12-22 Bosch Gmbh Robert Verfahren und vorrichtung zur positionsbestimmung eines landfahrzeugs
DE19637127A1 (de) * 1996-09-12 1998-03-19 Mannesmann Vdo Ag Verfahren zur fahrtroutenspezifischen Selektion von Verkehrsinformationen und Empfangsgerät zum Ausführen des Verfahrens
DE19638515B4 (de) 1996-09-20 2004-01-15 Grundig Car Intermedia System Gmbh Verfahren und Vorrichtung zur Zuordnung von Nachrichten, insbesondere Verkehrsnachrichten

Also Published As

Publication number Publication date
DE59903571D1 (de) 2003-01-09
WO2000008616A1 (fr) 2000-02-17
EP1105856A1 (fr) 2001-06-13
DE19835051A1 (de) 2000-02-10
JP4215398B2 (ja) 2009-01-28
US6728631B1 (en) 2004-04-27
JP2002522776A (ja) 2002-07-23

Similar Documents

Publication Publication Date Title
EP1105856B1 (fr) Dispositif pour le codage et le decodage d'emplacements
EP1079353B1 (fr) Méthode pour demander et traiter des messages routiers
EP1224645B2 (fr) Procede de codage et de decodage d'objets dans un reseau de voies de circulation
EP0769180B1 (fr) Dispositif pour preparer et fournir des informations destinees au conducteur d'un vehicule
DE19942522A1 (de) Verfahren zur Codierung und Decodierung von Objekten mit Bezug auf ein Verkehrswegenetz
EP1150265B1 (fr) Procédé pour transmettre la position des informations routières, en particulier des difficultées routières
DE102005062019A1 (de) Verfahren zur Codierung von Meldungen, Verfahren zur Decodierung von Meldungen und Empfänger zum Empfang und zur Auswertung von Meldungen
WO2000036771A1 (fr) Systeme de transmission binaire
EP1460599B1 (fr) Base de données pour codage et décodage des messages de trafic et procédé pour transmettre des messages de trafic codés
EP0790591A1 (fr) Banque de données de lieux pour la détermination d'itinéraires dans un réseau de circulation routière
EP1141911B1 (fr) Dispositif pour la transmission de recommandations d'itineraires routiers, et recepteur associe
WO1998010396A1 (fr) Systeme de gestion du trafic de transport et du trafic touristique
EP0900432B1 (fr) Procede et recepteur pour la selection geographique de messages codes numeriquement
EP1028405B1 (fr) Procédé de transmission d'information relative à un lieu
DE10052934A1 (de) Verfahren zur Bestimmung eines Weges zwischen einem Ausgangspunkt und einem Endpunkt eines Netzes, wie beispielsweise Straßennetzes
DE10009149A1 (de) Verfahren zur Codierung und Decodierung von Objekten in einem Verkehrswegenetz
EP0984416B1 (fr) Procédé de rattachement de descriptions numériques de réseaux de circulation routière et une base de données de lieux
DE19911676A1 (de) Duales Übertragungssystem
DE10105468A1 (de) Verfahren zur Übertragung von codierten TMC-Meldungen in einem Nachrichtenübertragungssystem und Vorrichtung zum Empfang solcher Meldungen
EP1339180A1 (fr) Procédé pour la transmission des messages à codage TMC et dispositif pour la réception de ces messages
EP1489579A2 (fr) Procédé, récepteur et transmetteur pour la transmission d'informations routières numériques
EP1076325A2 (fr) Méthode pour demander et traiter des messages routiers
EP1619642A2 (fr) Procédé pour transmettre des messages numériquement codés en groupes de données et recepteur
EP1011219A2 (fr) Méthode et dispositif pour la génération d'informations routières concernant des situations routières couvrant une pluralité de segments d'un réseau routier

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

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): DE FR GB IT

17Q First examination report despatched

Effective date: 20011016

GRAG Despatch of communication of intention to grant

Free format text: ORIGINAL CODE: EPIDOS AGRA

GRAG Despatch of communication of intention to grant

Free format text: ORIGINAL CODE: EPIDOS AGRA

GRAH Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOS IGRA

GRAH Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOS IGRA

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): DE FR GB IT

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

Free format text: NOT ENGLISH

REF Corresponds to:

Ref document number: 59903571

Country of ref document: DE

Date of ref document: 20030109

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

Effective date: 20030315

ET Fr: translation filed
PLBQ Unpublished change to opponent data

Free format text: ORIGINAL CODE: EPIDOS OPPO

PLBI Opposition filed

Free format text: ORIGINAL CODE: 0009260

PLAX Notice of opposition and request to file observation + time limit sent

Free format text: ORIGINAL CODE: EPIDOSNOBS2

26 Opposition filed

Opponent name: HARMAN/ BECKER AUTOMOTIVE SYSTEMS GMBH (BECKER DIV

Effective date: 20030827

PLBQ Unpublished change to opponent data

Free format text: ORIGINAL CODE: EPIDOS OPPO

PLAB Opposition data, opponent's data or that of the opponent's representative modified

Free format text: ORIGINAL CODE: 0009299OPPO

PLAX Notice of opposition and request to file observation + time limit sent

Free format text: ORIGINAL CODE: EPIDOSNOBS2

R26 Opposition filed (corrected)

Opponent name: HARMAN/ BECKER AUTOMOTIVE SYSTEMS GMBH (BECKER DIV

Effective date: 20030827

PLBB Reply of patent proprietor to notice(s) of opposition received

Free format text: ORIGINAL CODE: EPIDOSNOBS3

PLBD Termination of opposition procedure: decision despatched

Free format text: ORIGINAL CODE: EPIDOSNOPC1

PLBM Termination of opposition procedure: date of legal effect published

Free format text: ORIGINAL CODE: 0009276

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

Free format text: STATUS: OPPOSITION PROCEDURE CLOSED

27C Opposition proceedings terminated

Effective date: 20051017

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 18

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 19

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 20

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

Ref country code: IT

Payment date: 20180518

Year of fee payment: 20

Ref country code: FR

Payment date: 20180523

Year of fee payment: 20

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

Ref country code: DE

Payment date: 20180725

Year of fee payment: 20

Ref country code: GB

Payment date: 20180523

Year of fee payment: 20

REG Reference to a national code

Ref country code: DE

Ref legal event code: R071

Ref document number: 59903571

Country of ref document: DE

REG Reference to a national code

Ref country code: GB

Ref legal event code: PE20

Expiry date: 20190511

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 EXPIRATION OF PROTECTION

Effective date: 20190511