EP0346483B1 - Navigierungseinheit - Google Patents

Navigierungseinheit Download PDF

Info

Publication number
EP0346483B1
EP0346483B1 EP89900143A EP89900143A EP0346483B1 EP 0346483 B1 EP0346483 B1 EP 0346483B1 EP 89900143 A EP89900143 A EP 89900143A EP 89900143 A EP89900143 A EP 89900143A EP 0346483 B1 EP0346483 B1 EP 0346483B1
Authority
EP
European Patent Office
Prior art keywords
destination
data
input
intersection
navigation apparatus
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
EP89900143A
Other languages
English (en)
French (fr)
Other versions
EP0346483A4 (en
EP0346483A1 (de
Inventor
c/o Aisin Aw Co. Ltd. MOROTO Shuzo
Takashi c/o Aisin AW Co. Ltd. YAMADA
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.)
Aisin AW Co Ltd
Shinsangyo Kaihatsu KK
Original Assignee
Aisin AW Co Ltd
Shinsangyo Kaihatsu KK
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=17973436&utm_source=***_patent&utm_medium=platform_link&utm_campaign=public_patent_search&patent=EP0346483(B1) "Global patent litigation dataset” by Darts-ip is licensed under a Creative Commons Attribution 4.0 International License.
Application filed by Aisin AW Co Ltd, Shinsangyo Kaihatsu KK filed Critical Aisin AW Co Ltd
Publication of EP0346483A1 publication Critical patent/EP0346483A1/de
Publication of EP0346483A4 publication Critical patent/EP0346483A4/en
Application granted granted Critical
Publication of EP0346483B1 publication Critical patent/EP0346483B1/de
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G01—MEASURING; TESTING
    • G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
    • G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
    • G01C21/34—Route searching; Route guidance
    • G01C21/36—Input/output arrangements for on-board computers
    • G01C21/3605—Destination input or retrieval

Definitions

  • This invention relates to a navigation apparatus which, upon being provided with an input of a desired destination, outputs guidance information for travel to the destination.
  • a navigation apparatus provides course guidance for travel to a destination to a driver who is unfamiliar with the local geography. Recent years have seen extensive development of such navigation apparatus.
  • a vehicular navigation apparatus is adapted to set a course from a starting point to a desired destination before the vehicle begins travelling, with course guidance being provided to the driver in accordance with the course set.
  • a map is displayed on the screen of a CRT and the course is superimposed on the map when the driver designates a specific course.
  • the distance to this intersection is displayed numerically or in the form of a graph.
  • the driver When a turn is to be made at an intersection using such a navigation apparatus, the driver observes the course displayed on the map to decide the next intersection at which the turn is to be made, or the driver looks at the numeric or graphical display to ascertain the distance to the intersection where the turn is to be made, thereby determining the proper intersection.
  • the driver When entering the abovementioned destination, the driver enters a code upon taken from a table of codes and corresponding names set for each and every destination. Further, as proposed in JP-A-62-51000, the driver designates and enters the name of a specific destination and adopts, as the destination, a intersection nearest the point of departure and located within a circle whose center is represented by the designated coordinates (north latitute and east longitude).
  • the above-described conventional navigation apparatus is such that a course is set from a starting point to a desired destination before the vehicle begins travelling and course guidance is provided to the driver in accordance with the course set. Consequently, it is difficult to alter a destination.
  • a drawback is that if the driver should happen to mistake, say, an intersection and stray from the set course, travel in accordance with the guidance provided by the navigation apparatus will not be able to continue unless the vehicle is returned to the set course.
  • a decision as to whether or not a predetermined intersection has been passed as specified by the course guidance is premised upon detection of travelled distance or a left or right turn as detected by a distance sensor or steering angle sensor, respectively. In actuality, however, detection of travelled distance and steering angle is susceptible to considerable error, which can cause errors in judgment.
  • Japanese Patent Application No. 62-275059 a navigation apparatus in which coordinates of a plurality of geographical points are set and guidance information for travel to a desired destination is outputted at each of the geographical points when the desired destination is inputted.
  • this system it is possible to change the destination and to search a course from any geographical point to the destination. How to obtain an output of the destination information and search for a course to the destination in a simple manner are important problems.
  • EP-A1-0 119 674 discloses a travel guidance system for vehicles with a map data storage and a control unit for retrieving the region to which the present position of the vehicle belongs and/or a landmark in the vicinity of a present position.
  • EP-A-0 118 886 relates to a map display system for travel guidance.
  • This system comprises display means for displaying a map, a map data storage medium, designation means, extraction means for extracting spot coordinate data from said map data storage medium and display control means for forming display data.
  • Another object of the present invention is to provide a navigation apparatus particularly effective in a navigation system of the type in which guidance information to a destination is outputted at each of a plurality of geographical points, whose coordinates have been set, when the destination is entered.
  • the present invention provides a navigation apparatus as specified in claim 1.
  • a course search routine is executed in which a prefecture name list, city name list and town name list are retreived in order by the entry of prefecture name, city name and town name, the storage addresses of an intersection list and landmark list are obtained and a geographical point in the selected region is adopted as a set destination.
  • a concrete destination such as a representative intersection or a representative landmark, is called from the ambiguous destination so that navigation to this destination can be performed.
  • entry of a destination can be made in a simple manner on a display screen and, moreover, by means of characters or the like.
  • the apparatus in a case where the apparatus is applied to a navigation system of the type in which coordinates of a plurality of geographical points are set and guidance information for travel to a desired destination is outputted at each of the geographical points when the desired destination is inputted, the input operation is simplified and optimum course search can be carried out at all times. After a destination is designated, guidance information to the destination from any geographical point can be obtained.
  • Fig. 1 there are shown input means 1, a CPU 2, a display unit 3 such as a CRT or liquid crystal display panel, and a memory unit 4.
  • a keyboard 5 comprises a ten-key pad and function keys for inputting code numbers of predetermined geographical locations, such as a desired destination and present position (guidance location).
  • a touch panel 6, light pen 7, mouse 8 or voice input means 9 are employed instead of the keyboard 5.
  • the memory unit 4 is a memory such as a ROM in which network data indicative of geographical points, namely desired destination and present position, and other information are stored in advance.
  • a region name list 10 As will be described below, a region name list 10, a landmark list 11, an intersection list 12, map data 13, a romaji (Roman character) sort file 14, a hiragana (the cursive Japanese syllabary) sort file 15, intersection data 16, landmark data 17 and road data 18 are stored.
  • the CPU 2 sets information for travel to the desired destination, as by course search, in accordance with each geographical point stored in the memory unit 4, and stores this information in a memory such as a RAM.
  • the display unit 3 outputs guidance information for this point. If only intersections serve as geographical points, the guidance information for travel to the destination is an indication to, say, turn left or right at the next intersection, and this guidance is given at the intersection serving as the guidance point.
  • the outputted guidance information can include the direction of the first turn along with information designating the proper lane to take after the turn, as well as the direction of the second turn and the associated guidance information.
  • the display unit can output guidance information relating to a course leading to a desired destination in accordance with the path sequence a, b, c, ... shown in Fig. 2.
  • a course search mode is established in which information for travel to the desired destination is set for all geographical points with the exception of the entered desired destination [step 2].
  • a present position input mode is established, in which the driver inputs the code of his present position [step 3]. When this is done, the direction of forward travel from this position is outputted [step 4].
  • an intersection verification trigger [a start input, step 5] information for attaining the destination at the next intersection is outputted (step 6].
  • monitoring is performed [step 7] to see whether the intersection verification trigger or a signal from a present-position input button has been entered. If the intersection verification trigger has been entered, the program returns to the processing of step 6.
  • the program returns to the processing of step 3.
  • a trigger is inputted each time an intersection is verified providing that the vehicle is travelling as per instructions. If the vehicle strays from the instructed course and the driver notices this only after the vehicle has travelled to another intersection, the present-position input button is pressed. Accordingly, whenever a trigger is inputted, guidance information relating to an intersection on a route leading to the desired destination is outputted in sequential fashion.
  • the present position input button is pressed, the present position input mode is established.
  • step 2 When the course exploration input mode is established, as shown in Fig. 4(a), first the desired destination is set in a work area [step ], after which forward directions from intersections near the destination are set [step ]. As shown in Fig. 4(b), the set forward directions include forward directions d1 at intersections before the destination, and forward directions d2 at intersections before the first-mentioned intersections. It is permissible to execute this course search after the processing of step 3 in Fig. 3, in which case course search would be performed whenever present position is inputted. Furthermore, since guidance information is outputted in response to the trigger input in accordance with the route set as a result of course search, the pertinent intersections are limited in number. Accordingly, it will suffice to provide guidance information solely for the minimum number of intersections.
  • Figs. 5 through 9 illustrate the structure of data in accordance with the invention.
  • Fig. 5(a) is a list of the names of regions over a comparatively wide range, such as the names of urban and rural prefectures.
  • Prefecture No. 0 stands for "Aiti Prefecture”. Included as data are the prefecture name in kanji (Chinese characters), hiragana and Roman characters, a city name list storage address (leading address), the number of items of city name list data, a representative intersection landmark number, etc.
  • Fig. 5(b) illustrates a list of, e.g., district names or city names, which constitute information of lower significance than the names of regions.
  • Fig. 5(c) illustrates a list of town names, which constitute information of still lower significance than the names of regions.
  • Included as data are the names of towns in kanji , hiragana and Roman characters, the number of items of intersection list data, a landmark list storage address, a representative intersection landmark number, etc.
  • Figs. 6(a), (b) illustrate intersection and landmark lists in which intersection numbers and landmark numbers are listed, respectively.
  • Figs. 6(c), (d) show Roman character and hiragana sort files, respectively.
  • Place names are arranged in alphabetical order or in the order of the Japanese syllabary, and data storage addresses are provided corresponding thereto, thereby shortening the time needed to retrieve the place names.
  • Fig. 7(a) illustrates an example of intersection data.
  • Stored as data in correspondence with the intersection numbers are intersection names, coordinates (north latitude and east longitude), the numbers of roads between intersections, and whether traffic signals are present.
  • Fig. 7(b) shows an example of landmark data.
  • Stored as data in correspondence with the landmark numbers are landmark names (e.g., the names of rivers, buildings, bridges and the like), coordinates and the numbers of connecting intersections.
  • Fig. 8 shows an example of road data.
  • each road is assigned a road number(s).
  • the stored road data include, for each road number, starting and end points (intersection numbers), the number of the next road having the same starting point, the number of the next road having the same end point, road width, road prohibition information, information relating to guidance not required (as when the driver need only continue travelling straight ahead), and photograph numbers.
  • Fig. 10 illustrates examples of displays when inputting destination.
  • Fig. 11 illustrates input screens when selecting prefecture name, city name or town name in accordance with Fig. 10. Input is made on the display by a touch panel, light pen, mouse or the like.
  • Fig. 11(a) shows a Roman character input screen, (b) a hiragana input screen, and Fig. 12(a) a code number input screen.
  • Fig. 12(b) depictes an example of a menu screen when a destination input is made. This illustrates a case in which "KA” is entered for retrieval and display of "KANDA, KASUMIGASEKI”.
  • step 51 it is determined whether the name of a region has been entered. Depending upon the combination of prefecture name, city name and town name, the prefecture name list, city name list and town name list are retrieved in order and the storage addresses of the intersection list and landmark list are acquired (steps 52 - 58). Also, a routine 59 for setting the intersection of a destination is executed.
  • Fig. 14 shows another embodiment. This embodiment differs from the foregoing in that the names of prefectures, cities and towns are entered individually (steps 62 - 65), and in that the number of a representative intersection or the number of a landmark is adopted as the destination intersection number at step 66.
  • the entry of prefecture name, city name and town name can be made in simple fashion by Roman character input or hiragana input through place name selection processing using a touch panel.
  • the input screen is displayed at step 21, after which it is determined at step 22 whether a Roman character input is made.
  • an input character buffer is cleared, one Roman character is entered and this is stored in the input character buffer (steps 23 - 25).
  • names corresponding to the character array in the character buffer are selected from the Roman character sort list and displayed on the menu screen (step 26).
  • Processing which makes the number of place names corresponding to the character sequence smaller than a predetermined number is executed at step 37, and then an item in the menu is selected (step 27).
  • step 28 name data selected at step 28 is read in and set in a predetermined area of a memory. If an item selected is not on the menu screen, the program returns to step 24 and the foregoing processing is repeated. If the input is not a Roman character input at step 22, it is determined at step 29 whether the input is a hiragana input. If it is a hiragana input, processing (steps 30 - 34), which is similar to the foregoing processing, is executed. If the input is not a hiragana input at step 29, a code number is entered (step 35). Then, if a name corresponds to the code number at step 36, the program proceeds to step 28. The above-described display of Fig. 12(b) is thus obtained.
  • one intersection or landmark nearest the point of departure is decided from the intersection list or landmark list (this is course search).
  • Fig. 17 is a flowchart illustrating course search processing.
  • distance from the point of departure is made FF with regard to all intersections, and a search flag is made 0 (unsearched).
  • Step 72 calls for entry of distances from the point of departure to the two intersection numbers adjacent the point of departure on either side thereof, as well as entry of search flag 1 (searching) at these two adjacent intersection numbers.
  • search flag 1 searching
  • the number of the road taken from the point of departure is entered.
  • the number of a road whose search flag is 2 (end of search) and which has the shortest distance is found at step 73.
  • Peripheral road retrieval is performed at step 74.
  • a routine for setting optimum course conditions is executed (step 76), and the intersection number of the end point of this road and the distance thereof are entered at step 77.
  • Distance is computed at step 78. If this distance is shorter than the distance from the point of departure, this is taken as the distance from the point of departure, the search flag is set to 1 (searching) and this road number is entered (steps 79, 80). If the processing of steps 74 - 80 is executed and it is determined at step 75 that there is no peripheral road, then the search flag is made 2 and an end condition verification subroutine is executed (steps 81 - 83).
  • Fig. 18 illustrates the processing of the peripheral road retrieval subroutine shown at step 74 in Fig. 17.
  • step 91 it is determined at step 91 whether peripheral road retrieval is being performed for the first time. If it is, the number of the road for which the present intersection is the starting point is fetched from the intersection data and stored at step 92.
  • step 93 prohibited roads corresponding to the roads leading to this intersection are fetched from the road data, and it is determined at step 94 the road just fetched is a prohibited road, described in connection with Fig. 8. If the answer is YES, then the program proceeds to step 96; if NO, then the road just fetched is stored as a peripheral road.
  • peripheral road retrieval is not being performed for the first time at step 91, or if a YES answer is received at step 94, the number of a road having a starting point the same as that of the previously searched road, and whose number is the next number, is fetched from the road data at step 96, and it is determined at step 97 whether the initially retrieved road and the road just fetched coincide. If they do not coincide, the program proceeds to step 93; if they do, it is construed at step 98 that there is no peripheral road.
  • Fig. 19 illustrates the processing of the subroutine for setting the optimum course conditions at step 76 in Fig. 17.
  • peripheral road width and length are read in from the road data and it is determined whether width is less than 1 m, by way of example (steps 101, 102). If the width exceeds 1 m, the program proceeds directly to step 104. If the width is less than 1 m, the length of the road is, say, doubled, data relating to guidance not required, namely data for the road used to arrive at the intersection presently being searched, is read in from the road data (steps 103, 104). Next, it is determined at step 105 whether the data relating to guidance not required is indicative of a peripheral road.
  • step 107 the program proceeds to step 107; if not, 100 m, by way of example, is added to the length of the road.
  • 100 m by way of example, is added to the length of the road.
  • the present invention is not limited to the foregoing embodiment but can be modified in various ways.
  • an arrangement can be adopted in which a place name list of specific regions is stored on an IC card or CDROM.
  • the conventional set-up provided with a distance sensor or steering angle sensor is combined with the navigation apparatus of the present invention.
  • the resulting system can be adapted in such a manner that, rather than the next geographical point being identified only when a switch is operated by the driver, the navigation apparatus identifies predetermined geographical points automatically by other means and changes over the guidance information delivered to the driver each time.
  • the navigation apparatus of the present invention is used as a back-up if the conventional navigation apparatus fails. It is also possible to provide information relating to the distances between geographical points at which guidance is given, determine distance by a distance sensor and then urge the driver to input the next geographical point (i.e., to make a trigger input) by a voice track or visual display.
  • each geographical point can be provided with information indicating whether the point is on a route of the desired category.
  • course search can be carried out solely in terms of the geographical points along routes of the desired type.
  • the navigation apparatus of the present invention is mounted on an automotive vehicle so that even a driver unfamiliar with the roads can travel to a desired destination with ease.

Landscapes

  • Engineering & Computer Science (AREA)
  • Radar, Positioning & Navigation (AREA)
  • Remote Sensing (AREA)
  • Automation & Control Theory (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Navigation (AREA)
  • Instructional Devices (AREA)
  • Traffic Control Systems (AREA)

Claims (8)

  1. Navigationsvorrichtung zum Bereitstellen einer Kursleitung für die Fahrt zu einem gewünschten Ziel mit:
    a) einer Speichereinrichtung (4) zum Speichern von geographischen Daten (10 bis 18), wobei die geographischen Daten Namen von Regionen aufweisen und in einer hierarchischen Struktur in Zugehörigkeit zu Daten von geographischen Regionen und Daten mehrerer innerhalb der Regionen liegender geographischer Punkte vorgesehen sind;
    b) einer Eingabeeinrichtung (1) für Namen von Regionen zum Auswählen eines der Namen von Regionen; und
    c) einer Anzeigeeinrichtung (3);
    gekennzeichnet durch
    d) eine Einrichtung (2) zur Zielbestimmung, die den eingegebenen Namen der Region verarbeitet und einen der geographischen Punkte innerhalb der ausgewählten Region als ein eingestelltes Ziel übernimmt; und
    e) eine Einrichtung (2) zur optimalen Kurssuche zum Bereitstellen von Leitinformationen für die Fahrt von mindestens einem der geographischen Punkte zu dem eingestellten Ziel,
    f) wobei die Anzeigeeinrichtung (3) die Leitinformationen anzeigt.
  2. Navigationsvorrichtung nach Anspruch 1, ferner mit einer Eingabeeinrichtung (1) für aktuelle Positionen zum Eingeben einer aktuellen Position, wobei die Leitinformationen als die einzuschlagende Richtung von der aktuellen Position zu dem übernommenen Ziel gewonnen werden können.
  3. Navigationsvorrichtung nach Anspruch 1 oder 2, wobei das übernommene Ziel eine repräsentative Kreuzung oder eine repräsentative Landmarke innerhalb der gewählten Region ist.
  4. Navigationsvorrichtung nach Anspruch 2 oder 3, wobei die Kurssucheinrichtung (2) Leitinformationen zu der nächsten Kreuzung nacheinander auf der Route zu dem übernommenen Ziel als Reaktion auf eine wiederholte Eingabe der aktuellen Position an Kreuzungen bereitstellt, die mindestens einigen der geographischen Punkte entsprechen.
  5. Navigationsvorrichtung nach einem der Ansprüche 1 bis 4, wobei die Daten zu Regionen Daten einer oberen Ebene, Daten einer mittleren Ebene und Daten einer unteren Ebene aufweisen.
  6. Navigationsvorrichtung nach Anspruch 5, wobei die Daten der oberen Ebene Regionen bezeichnen, die mindestens ein Ballungsgebiet umfassen, die Daten der mittleren Ebene verschiedene Ballungsgebiete innerhalb der Regionen identifizieren und die Daten der unteren Ebene Städte innerhalb der verschiedenen Ballungsgebiete bezeichnen.
  7. Navigationsvorrichtung nach einem der Ansprüche 1 bis 6, wobei die Einrichtung (2) zur optimalen Kurssuche Straßenbreite, Informationen über verbotsbehaftete Straßen und Informationen über eine nicht erforderliche Leitung verarbeitet, die in den Straßendaten (18) für mögliche Kurse eingestellt sind, um den optimalen Kurs bereitzustellen.
  8. Navigationsvorrichtung nach Anspruch 7, wobei Informationen über eine nicht erforderliche Leitung in den Straßendaten (18) für eine Kreuzung eingestellt sind, die ohne besondere Leitung überquert werden kann.
EP89900143A 1987-12-05 1988-12-05 Navigierungseinheit Expired - Lifetime EP0346483B1 (de)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
JP62307805A JP2680317B2 (ja) 1987-12-05 1987-12-05 ナビゲーション装置
JP307805/87 1987-12-05
PCT/JP1988/001224 WO1989005501A1 (en) 1987-12-05 1988-12-05 Navigation unit

Publications (3)

Publication Number Publication Date
EP0346483A1 EP0346483A1 (de) 1989-12-20
EP0346483A4 EP0346483A4 (en) 1991-10-02
EP0346483B1 true EP0346483B1 (de) 1996-03-27

Family

ID=17973436

Family Applications (1)

Application Number Title Priority Date Filing Date
EP89900143A Expired - Lifetime EP0346483B1 (de) 1987-12-05 1988-12-05 Navigierungseinheit

Country Status (4)

Country Link
EP (1) EP0346483B1 (de)
JP (1) JP2680317B2 (de)
DE (1) DE3855161T2 (de)
WO (1) WO1989005501A1 (de)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
FR2840982A1 (fr) * 2002-06-15 2003-12-19 Bosch Gmbh Robert Procede pour determiner un trajet pour un vehicule a l'aide d'un systeme de navigation

Families Citing this family (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2680318B2 (ja) * 1987-12-28 1997-11-19 アイシン・エィ・ダブリュ株式会社 ナビゲーション装置
JP2659742B2 (ja) 1988-03-02 1997-09-30 アイシン・エィ・ダブリュ株式会社 ナビゲーション装置
JP2674521B2 (ja) * 1994-09-21 1997-11-12 日本電気株式会社 移動体誘導装置
JP4534209B2 (ja) * 1996-07-31 2010-09-01 アイシン・エィ・ダブリュ株式会社 ナビゲーション装置
DE19709518C5 (de) * 1997-03-10 2006-05-04 Harman Becker Automotive Systems Gmbh Verfahren und Vorrichtung zur Spracheingabe einer Zieladresse in ein Zielführungssystem im Echtzeitbetrieb
US7664597B2 (en) 2005-03-31 2010-02-16 Alpine Electronics, Inc. Address input method and apparatus for navigation system
CN103808327A (zh) * 2012-11-15 2014-05-21 比亚迪股份有限公司 导航方法与***及导航服务器
DE102019215660A1 (de) * 2019-10-11 2021-04-15 Audi Ag Verfahren und Prozessoreinrichtung zum Führen eines Kraftfahrzeugs und/oder mobilen Endgeräts an eine Zielposition

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE2925656A1 (de) * 1979-06-26 1981-01-15 Blaupunkt Werke Gmbh Verfahren und vorrichtung zur zielfuehrung von landfahrzeugen
JPS59132099A (ja) * 1983-01-17 1984-07-30 株式会社デンソー 車両用走行案内システム
JP2733223B2 (ja) * 1987-04-28 1998-03-30 松下電器産業株式会社 車載用航法装置

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
Automobil Revue, 80.Jahrgang, Nr.59, 18.09.85, S.51: "Der Copilot heisst Carin" *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
FR2840982A1 (fr) * 2002-06-15 2003-12-19 Bosch Gmbh Robert Procede pour determiner un trajet pour un vehicule a l'aide d'un systeme de navigation

Also Published As

Publication number Publication date
JPH01149200A (ja) 1989-06-12
WO1989005501A1 (en) 1989-06-15
DE3855161D1 (de) 1996-05-02
EP0346483A4 (en) 1991-10-02
JP2680317B2 (ja) 1997-11-19
DE3855161T2 (de) 1996-08-29
EP0346483A1 (de) 1989-12-20

Similar Documents

Publication Publication Date Title
US5191532A (en) Navigation apparatus
US5231584A (en) Navigation apparatus with non-volatile memory for return to initial departure point
US4954959A (en) Navigation system
US5819200A (en) Method and apparatus for selecting a destination in a vehicle navigation system
US5635953A (en) Map displaying apparatus
EP0636863B1 (de) Navigationssystem
EP0834850B1 (de) Verfahren und Gerät zur Auswahl des Zieles in einem Fahrzeugnavigationssystem
US5359527A (en) Navigation system for vehicle
EP0945707B1 (de) Verfahren und Vorrichtung zur Routenberechnung
EP0346491A1 (de) Anzeigeeinheit für navigationssystem
EP0323246A2 (de) Fahrzeugnavigationsgerät mit Hilfsfunktion
US5377113A (en) Navigation system for use in vehicle
EP2068257A1 (de) Suchvorrichtung, Navigationsvorrichtung, Suchverfahren und Computerprogrammprodukt
EP0346483B1 (de) Navigierungseinheit
JP4242169B2 (ja) 地図表示装置
EP0348528A1 (de) Navigationssystem für fahrzeuge
JP3718893B2 (ja) 経路誘導装置
JP3402836B2 (ja) ナビゲーション装置及びナビゲーション処理方法
EP2071478A2 (de) Suchvorrichtung, Navigationsvorrichtung, Suchverfahren und Computerprogrammprodukt
JP2000329567A (ja) ランドマーク表示方法及びナビゲーション装置
JP3293375B2 (ja) カーナビゲーション装置
JP3015047B2 (ja) ナビゲーションシステム
JP2725928B2 (ja) 車載ナビゲータの経路誘導方法
JPH1164021A (ja) 印刷によるナビゲーション情報提供方法
KR0163731B1 (ko) 차량용 네비게이션장치에서 최적의 주행경로를 간략화시켜 표시하는 방법

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

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): DE FR GB

A4 Supplementary search report drawn up and despatched

Effective date: 19910809

AK Designated contracting states

Kind code of ref document: A4

Designated state(s): DE FR GB

17Q First examination report despatched

Effective date: 19920610

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

RIN1 Information on inventor provided before grant (corrected)

Inventor name: YAMADA, TAKASHI, C/O AISIN AW CO., LTD.

Inventor name: MOROTO SHUZO, C/O AISIN AW CO., LTD.

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): DE FR GB

ET Fr: translation filed
REF Corresponds to:

Ref document number: 3855161

Country of ref document: DE

Date of ref document: 19960502

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

26N No opposition filed
PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 19971126

Year of fee payment: 10

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

Ref country code: FR

Payment date: 19971209

Year of fee payment: 10

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

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

Effective date: 19981205

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

REG Reference to a national code

Ref country code: FR

Ref legal event code: ST

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

Ref country code: DE

Payment date: 20071129

Year of fee payment: 20