Navigation System

1. Field of the Invention:

The present invention relates to a navigation system for outputting information required to reach a destination.

2. Description of the Related Art:

Recently, navigation systems for vehicles have been developed which are designed to output on a display various types of information required for a driver who is unfamiliar with a particular area to reach a destination and thereby guide the driver to the destination.

Conventional navigation systems fall into two types: the location method and fixed route method.

The location method was proposed in, for example, the specification of Japanese Patent Laid-Open No. 58-115600. In this method, a map stored in an external memory is read out and is stored in an image memory by an arithmetic and logic unit constituted by a microcomputer. Also, the arithmetic and logic unit calculates the locus of a vehicle using data input from azimuth and distance sensors, and displays the map and the locus of the vehicle on a display.

Japanese Patent Laid-Open No. 62-142216 discloses the fixed route type navigation system. In this method, a course that is to be followed from a starting point to a destination is set beforehand, and the driver is guided in accordance with the course set. The next intersection along the course where the vehicle is to turn is indicated in this method by numerically or graphically displaying the distance remaining before that intersection is reached. So, the driver looks at the course indicated on the map and knows the intersection where he should turn. Alternatively, the driver looks at the numerals or graph displayed to ascertain the distance remaining to that intersection, and thus knows the intersection where the vehicle should be turned.

In both the location method and the fixed route method, the information required to guide a vehicle to a destination such as map data or intersection data is stored in one external memory such as a floppy disk, a CD-ROM, or a magnetic tape. Guided navigation to a plurality of areas (e.g., to Nagoya and Kyoto) is made possible by using corresponding external memories which are switched with each other as required.

In both of the above-described conventional navigation systems in which the information required to guide a vehicle to one area, e.g., Kyoto, such as map data or intersection data, is stored in the external memory beforehand, not all the information is stored in the external memory. Also, it is very difficult to store all the information in the external memory, both in terms of storage capacity and the calculation ability of the central processing unit. Even if all the necessary information is input in the memory, a large amount of information makes selection of a destination very difficult. In both of these navigation systems, it is impossible to guide a vehicle if the memory does not contain the information on a desired starting point or destination beforehand. In that case, a driver has to go to a nearby starting point which is stored in the memory without the assistance of the navigation system. He also has to go to his true destination by himself after he has reached the destination input in the memory beforehand.

Further, modification, addition and deletion of the information stored in an external memory such as map data or intersection data requires a great deal of time and expense.

The above-described location method has its own problem in that, in a case where it is necessary to turn at an intersection indicated on a map displayed on the display device, it may be impossible for a driver to identify an intersection where the vehicle is approaching with the one indicated on the map, due to errors accumulated in the measured running distance or direction. The driver may pass an intersection where he should turn, or the present position on the map may not correspond with a road on the map.

In the fixed route method, since the course to be followed from a starting point to a destination is set beforehand and the vehicle is guided in accordance with the course set, it is difficult to change the destination during travel. Further, if, for example, a wrong turning is made and the driver deviates from the original course, it is impossible to continue travelling under the guidance of the navigation system unless the vehicle can be returned to the course originally set. Furthermore, it is necessary to judge whether a vehicle has passed a predetermined intersection as planned on the basis of running distance data prepared by a distance sensor or data representing right or left turns which is obtained through a steering sensor. In consequence, any detection errors which occur during actual travel may cause misjudgement.

In order to obviate these problems, the present inventors filed an application in respect of a navigation system for outputting information required to guide a vehicle to a destination at a plurality of points (in Japan under Japanese patent application No. 62-307805 and in the U.S.A. on Oct. 20, 1988, as U.S. Ser. No. 07/260,213). In this system, the coordinates of a plurality of points are set and the information required to reach the destination is calculated at each of these points. This method (hereinafter referred to as the coordinate origin method) has the advantage that it is possible to change a destination during travel and that the course followed to a destination can be searched relative to any of the plural points. However, as stated above, it is difficult to input all the information required to guide a vehicle to a particular destination. It is therefore essential to decide properly which information is to be stored and how the stored information is to be used.

An object of the present invention is to provide a navigation system which can obviate the aforementioned problems, which enables a vehicle to be guided to a destination from any starting point by preparing a standard data base as an internal or external memory and an individual data base that complements this standard data base as an external memory, and which enables the data to be updated relatively easily.

To this end, the present invention provides a navigation system which comprises a display device 5, an external storage unit 3 for storing data needed for guidance, and a central processing unit 4 for processing the data in the external storage unit in accordance with a navigation program and outputting the result to the display device. The external storage unit 3 includes a first external storage device 16 which stores standard data needed for guidance and a second external storage device 17 which stores additional information of the standard guidance data. The CPU selectively operates the data stored in the first and second external storage devices.

.In the present invention, the first external storage device 16, which may be a CD, stores data representing the standard map of an area and the data required for guiding a vehicle in that area, and the second external storage device 17, which may be an IC card, stores individual data which cannot be complemented by the standard map data and the guidance data. In an actual operation, the CD stores the data representing the major route map of Japan or any area in the world and the data required for guidance. The IC card stores the data on the map of the vicinity of a hotel, a gas station or a rental car office in a particular area, and the data needed to guide a vehicle in that vicinity. IC cards are prepared for various objectives. For example, IC cards which store data needed to guide a user on a sightseeing trip or that needed to guide a user to commercial premises, a station or an airport may be prepared. Th IC cards may additionally store traffic information or weather information. The hotels, gas stations and rental car offices may serve as information centers where data is input into the card and data in the card is updated, and where these cards are sold and supplied to users. Thus, a user is first led to a target area using a CD. After arriving the area, he receives an IC card at the information center, and is then guided to a target location with the assistance of that card. Alternatively, data which is prepared in an information center may be input to the RAM of the CPU or to the IC card by a communication device such as a car telephone through a telephone line. In that case, it is not necessary to prepare CD or IC cards which store data beforehand.

Thus, in the present invention, since only the detailed data which is adequate for a desired area and a desired objective can be stored in the IC card which serves as the second external storage device, the data stored in the first external storage device which is a CD can be simplified. Further, modification and addition of data is performed on that stored in the IC card, and this facilitates maintenance operation. Furthermore, since data is stored in both CD and IC card, the number of data stored can be reduced. This makes the operation simpler and enables a data that meets the demand of a user to be selectively supplied to the user. As a result, guided navigation is made possible from any starting point to a destination by preparing a standard data base and an individual data base that complements the standard data base as the external memories. Further, data updating can be made relatively easy.

FIG. 1 (a) is a block diagram of a navigation system, showing a first embodiment of the present invention;

FIG. 1 (b) shows the structure of an external storage device; FIGS. 2(a), 2(b), 2(c), 3(a), 3(b), 3(c), 3(d), 4, 5, 6, and 7 show the structure of data stored in the first external storage device;

FIGS. 8, 9, 10, 11, 12(a), 12(b), 12(c), 13(a), 13(b), 13(c), 13(d) and 13(e) show the structure of data stored in the second external storage device;

FIG. 14 is a flowchart of the control processing executed in the coordinate origin method; FIGS. 15 (a) and 15 (b) show a flowchart of route searching processing;

FIG. 16 is a flowchart of destination inputting process;

FIG. 17 is a flowchart of destination setting process;

FIGS. 18 and 19 are flowcharts of a data searching process executed in the first embodiment of the present invention;

FIGS. 20, 21, and 22 are flowcharts of route searching process;

FIGS. 23(a), 23(b), 23(c), 24(a) 24(b), and 24(c) show the structure of data, showing a second embodiment of the present invention;

FIGS. 25 and 26 are flowcharts of a data searching process executed in the second embodiment of the present invention;

FIGS. 27(a) to 27(d) show the structure of data, showing a third embodiment of the present invention;

FIGS. 28, 29 and 30 (a) are flowcharts of a data searching process executed in the third embodiment of the present invention; FIGS. 30(b) and 30(c) explain a method of judging whether a data is within an area or outside of the area;

FIGS. 31 and 32 show the structure of data, showing a fourth embodiment of the present invention;

FIGS. 33, 34 and 35 are flowcharts of a data searching process executed in the fourth embodiment of the present invention; and

FIGS. 36 and 37 are flowcharts, showing another types of navigation system to which the present invention is applied.

Embodiments of the present invention will be described below with reference to the accompanying drawings.

Referring first to FIG. 1 which is a block diagram of a first embodiment of a navigation system according to the present invention, a system comprises a man-machine interface 1, a present position checking unit 2, an external storage unit 3, and a central processing unit 4.

The man-machine interface 1 includes at least a display device 5 and an inputting device 7. The display device 5 may comprise a CRT, a liquid crystal display or the like. The inputting device 7 may comprise a keyboard, a touch-panel, a light pen, a mouse or the like. The man-machine interface 1 optically includes a speech output device 6 such as a speaker and a communication device 9 such as a car telephone.

The present position checking unit 2 employs either a receiver 10 for a global positioning system (GPS) which measures a position utilizing an artificial satellite, a beacon receiver 11 for receiving the positional information from a beacon disposed on a road, a geomagnetic sensor 12, a distance sensor 13 or a steering sensor 15. Both of the GPS receiver 10 and the beacon receiver 11 can be used as a single unit to measure the present position. However, the geomagnetic sensor 12 and the steering sensor 15 must be used together with the distance sensor 13.

The external storage unit 3 consists of a first external storage device 16 and a second external storage device 17. Floppy disks, CD-ROMs, optical disks, magnetic tapes, IC cards, or optical cards may be used as the first and second storage devices 6 and 7. However, a CD-ROM having a large storage capacity may be preferably used as the first external storage device 16, and the second external storage device 17 may be of the card type which can be manufactured at a low cost. The first external storage device 16 which may be a CD stores data on the standard map of a particular area and the data required to guide a vehicle in that area, and the second external storage device 17 which may be an IC card stores individual data which cannot be complemented by the data on the standard map and that required for guidance. More specifically, as shown in FIG. 1 (b), data on the major route map of Japan or of any area in the world, as well as the data required for guidance are input in the CD, and data on the map of the vicinity of a hotel, a gas station or a rental car office located in a certain area and data required for guidance are input in the IC card. IC cards may be prepared for various objectives, e.g., IC cards storing information required to guide a user on a sightseeing trip or that required to guide a user to commercial premises, a station or an airport may be prepared. IC cards may additionally store traffic information, weather information and the like. The hotels, gas stations and rental car offices may serve as information centers where data is input or data in the IC card is updated, and where IC cards are sold or supplied to users. Thus, a user is first led to a target area using a CD. After arriving at that area, he receives an IC card at the information center and is then led to a destination with the assistance of that IC card. It is to be noted, however, that the data representing the map and that required for guidance are structured in different ways in the location method, the fixed route method and the coordinate origin method, as will be described later.

This embodiment employs two external storage devices 16 and 17 as its external storage unit . However, the standard information required for guidance may also be stored in a storage device within the CPU 4 rather than in the first external storage device 16.

Once a user has input a destination through the inputting unit 1, the CPU 4 reads out the data representing a map and that required for guidance from the external storage unit 3, operates the data, stores the operation results in a RAM 20, and outputs the necessary results to the display device 5 or the speech output device 6 in accordance with a navigation program stored in a ROM 19. The data required to guide a user which is output from the external storage unit 3 represents the data required for the vehicle to reach the destination. To a vehicle which is located at an intersection on a specific route, data representing a right turn or a left turn that the vehicle should make at a subsequent intersection is output. In a case where there is another intersection very close to a first intersection where the vehicle turns, the data representing the direction in which the vehicle should turn at the first intersection and that representing a traffic lane in which the vehicle should travel after it has turned at the first intersection may be output as information required for guidance. Alternatively, the direction in which the vehicle should turn at the second intersection may also be output as information required for guidance.

In addition, the data which is prepared in an information center 21 may be input by the communication device 9 such as a car telephone through a telephone line, the input data being entered to the RAM of the CPU 4 or in an IC card through a modem 22. In this case, it is not necessary to store data in an IC card beforehand. A hotel, a gas station or a rental car office in an area may be able to serve as the information center 21. Alternatively, an information center which acts as a service center for the entire region or a metropolitan area may be installed.

Next, the structure of the data employed in the navigation system for the vehicle according to the present invention, as well as the control process executed in the navigation system will be described below.

First, an example in which the present invention is applied to the coordinate origin method will be described.

FIGS. 2 to 7 show the structure of the data stored in the first external storage device (e.g., in a CD) employed in the navigation system for the vehicle according to the present invention.

FIG. 2 (a) shows a list of relatively broad regions, e.g., a list of prefecture names. Prefecture number 01(200) represents Aichi Prefecture. The list contains prefecture names in Chinese character (201), Hiragana (202) and Romaji (roman character) (203), the prefecture number (204), the address of list of cities (205) (the starting address thereof), the number of cities listed (206), the major intersections/landmarks numbers (207) and so on. FIG. 2 (b) shows a list of wards or cities which is the data narrower than the region data. The list contains city names in Chinese character (208), Hiragana (209) and Romaji (210), the city number (211), the address of list of sub-districts (212) (the starting address thereof), the number of sub-districts listed (213), the major intersections/landmarks numbers (214) and so on. FIG. 2 (c) shows a list of sub-districts, which is the data narrower than the ward or city data. The list contains sub-district names in Chinese character (215), Hiragana (216) and Romaji (217), the sub-district number (218), the address of list of intersections (219) (the starting address thereof), the number of intersections listed (220), address of list of landmarks (221), the number of landmarks listed (222), the major intersections/landmarks numbers (223) and so on. Such hierarchically structured data enables the list of prefectures, the list of cities and the list of subdistricts to be searched for a starting point, a present position or a destination input in that order. Further, it enables the major intersection or landmark to be separately searched in the list of prefectures, in the list of cities and in the list of sub-districts.

FIGS. 3 (a) and (b) respectively show a list of intersections that are located in each sub-district and a list of landmarks located in each sub-district. The lists contain the intersection numbers and landmark numbers, respectively. FIGS. 3 (c) and (d) respectively show the sort files of Romaji and Hiragana characters. The files contain alphabetically arranged prefecture names and the addresses of data representing the prefectures, and this enables the time required for search of the name of a place to be shortened.

FIG. 4 shows an example of numbering of roads and intersections on a map contained in CD data. In two sub-districts, there are 21 intersections from 1 to 21, and there are 46 roads from 1 to 46. If two-way traffic is allowed on a road, two different numbers are affixed to that road. If the road is a one-way road, one number is affixed to that road.

FIG. 5 shows an example of intersection data. The data includes the name of an intersection which corresponds to a intersection number, the coordinate (the latitude and a longitude), the road number which starts from an intersection and which has the smallest number, the road number which ends at that intersection and which has the smallest number, and data representing whether or not an intersection has a signal. A route can be searched and various navigation information can be displayed on a display using this data.

FIG. 6 shows an example of landmark data. The data includes the name of a landmark which corresponds to a landmark number, (e.g., the name of a river, the name of a building or the name of a bridge), the coordinate and the intersection numbers located adjacent to a landmark.

FIG. 7 shows an example of road data. As shown in FIG. 4, each road has its own number or numbers, and the road data contains the starting point and ending point (the intersection numbers) of each road number, one of the roads which start from the same starting point, one of the roads which end at the same ending point, the width of a road, no passage data, not guided data (e.g., no data is output when a vehicle proceeds from a road number 1 to a road number 3) and the photo number of an intersection.

Next, the structure of data stored in the second external storage device (e.g., an IC card) will be described below with reference to FIGS. 8 to 13

FIG. 8 shows the intersections and roads after the IC card data is added to the CD data. The roads to be added are indicated by a broken line, and added intersections and roads are affixed with sub-numbers, the road numbers being enclosed by an ellipse. As shown in FIG. 8, intersections from 1-1 through 1-3 and roads from 1-1 through 1-12 are added, and roads 22, 23, 29, 44, 45 and 46 are eliminated from the original map.

FIGS. 9, 10 and 11 respectively show intersection data, landmark data and road data to be added as the result of the addition of the intersections and roads shown in FIG. 8. The data contains the newly added data and data representing the modification of the intersection data and road data caused by the addition.

FIG. 12 (a), (b) and (c) respectively show modified data on the list of sub-districts, the list of intersections and the list of landmarks which are changed as the result of addition of intersections and roads shown in FIG. 8.

FIGS. 13 (a) to (c) respectively show road data, intersection data and landmark data to be deleted. FIG. 13 (d) shows the data representing the starting address of the deletion data in the memory, and FIG. 13 (e) shows the data representing the starting address of the modified data in the memory. The starting address 0 indicates that the data is not deleted or changed.

Control of the thus-arranged navigation system which employs the coordinate origin method will be described below with reference to FIGS. 14 to 22.

Referring first to FIG. 14, a driver inputs a destination (in step 31). Once the destination has been input, the system is switched into route search mode in which data required to guide a user to the destination is set with respect to all the points other than the destination (in step 32). After the route has been searched, the system switches to present position input mode in which the present position is input (in step 33), and the direction in which the vehicle proceeds from that point is then output (in step 34). Thereafter, an intersection confirmation trigger is input (starting of a vehicle is input in step 35), and the data required for the vehicle to reach the destination at a subsequent intersection is then output (in step 36). Next, it is monitored which is input next, an intersection confirmation trigger or a present position input button signal (in step 37). If the intersection confirmation trigger is input, the processing returns to step 36. If the signal input is the present position input button signal, the flow returns to step 33. In other words, in this system, when the vehicle is running as guided, a trigger is input every time the intersection is confirmed. If the vehicle passes the intersection where it is to turn and deviates from the course, the present position input button is pressed. Thus, every time the trigger is input, data required for the vehicle to reach the destination at an intersection along the route is output. When the present position input button is input, the system switches to present position input mode.

As shown in FIG. 15 (a), once the system has been switched to route search mode, a destination is set in a work area (in step 39), and the directions in which the vehicle may proceed are set starting from the intersections closest to the destination (in step 40). More specifically, the directions d.sub.1 are set first with respect to the intersections closest to the destination, and the directions d.sub.2 are then set with respect to the second closest intersections, as shown in FIG. 15 (b). The route search may also be performed after the step 33 shown in FIG. 14 has been executed. In that case, the route search is performed every time the present position is input. In a trigger input, since the data required for the vehicle to reach the destination is output in accordance with the route set by the route search, the number of intersections that are located on the route is limited. Therefore, the system may also be arranged such that only the data required at these intersections is set.

Once a destination has been input in step 31, it is first determined as to whether or not the name of a region is input in step 51, as shown in FIG. 16. Subsequently, the list of prefectures, the list of cities and the list of subdistricts are successively searched to fetch the addresses of the intersection list and landmark list using a combination of prefecture, city and sub-district which is input (in steps 52 to 58). If the name of a region is not input, a code number is input in step 60. Thereafter, target intersection setting route is executed in step 59. A prefecture, a city and a sub-district may be input through a touch panel or by pressing Romaji or Hiragana keys. A region is selected on the touch panel when that portion of the touch panel is touched.

In the target intersection setting subroutine executed in step 59 in FIG. 16, one of the intersections or landmarks which is the closest to the starting point is searched from the list of intersections and the list of landmarks (route search), as shown in FIG. 17.

FIGS. 16 and 17 are respectively flowcharts of processings generally executed when a route is searched and when the target intersection is searched. However, the data employed in this embodiment consists of CD data stored in the first external storage device 16 and IC card data stored in the second external storage device 17. The processing of these two types of data will be described now with reference to FIGS. 18 and 19.

FIG. 18 is a flowchart of a sub-district search conducted on these two types of data. First, it is determined in step 61 whether or not there is an IC card. If the answer is negative, the list of sub-districts in the CD [which is shown in FIG. 2 (c)] is searched for the sub-district in step 62, the data on the sub-district is fetched, and a flag indicating that the obtained data is a CD data is set (in steps 63 to 65). If there is an IC card in step 61, the list of sub-districts in the IC card [which is shown in FIG. 12 (a)] is searched for the target sub-district, and it is then determined whether or not there is the sub-district (in steps 67 and 68). If the answer is negative, the processing goes to step 62. On the other hand, if the answer is affirmative, the data on the subdistrict is fetched, and a flag indicating that the obtained data is an IC card data is set (in steps 69 and 70).

FIG. 19 is a flowchart of a read of the intersection data. First, it is determined whether or not there is an IC card in step 71. If the answer is negative, the intersection data stored in the CD (shown in FIG. 5) is searched for a necessary intersection and the target intersection data is fetched in step 72. Thereafter, a flag indicating that the obtained data is a CD data is set in step 73. If it is determined that there is an IC card in step 71, the added intersection data stored in the IC card (shown in FIG. 9) is searched for a necessary intersection in step 74. Subsequently, it is determined in step 75 whether or not the necessary intersection data is listed. If the answer is affirmative, the intersection data is fetched, and a flag indicating that the obtained data is an IC card data is then set (in steps 76 and 77). If it is determined that there is no intersection in step 75, the starting address of deletion data stored in the IC card [shown in FIG. 13 (d)] is fetched in step 78. If it is determined that the starting address is 0 (indicating that there is no deletion) in step 79, the processing proceeds to step 72. If the starting address is 0, search is conducted on the deleted intersection file stored in the IC card [shown in FIG. 13 (b)] in step 80. If the file contains the intersection, a flag indicating that the intersection is deleted is then set (in steps 81 and 82).

Search is conducted on the road data and the landmark data in the same manner as that in which the intersection data is searched. That is, search is conducted first on the data stored in the IC card first and then on the data stored in the CD.

FIG. 20 is a flowchart of route searching processing which is executed on the basis of the data which is read out from the CD and IC card. In FIG. 20, the following parameters are used:

L(c): distance from the starting point;

F(c): flag;

0: not yet searched;

1: being searched;

2: searched;

R(c): road number that has been passed (c: intersection number);

S0,S1: intersections adjacent to the starting point; and

e),e1: intersections adjacent to the destination.

First, in step 151, FF is assigned to the distance L (c) from the starting point with respect to all the intersections, and the search flag F (c) is set at 0 (indicating not searched) (the distance L (c) and search flag F (c) are initialized). Next, the distance from the starting point is assigned to the distances of the intersections located adjacent to the starting point, and the flags of the intersections located adjacent to the starting point are set at a search flag 1 (indicating that the intersection is being searched) in step 152. Further, the number of the road that the vehicle has passed after it started from the starting point is set. In step 153, an intersection whose flag is not 2 (which indicates that the search is over) and which has the smallest distance is found. Subsequently, in steps 154 and 155, the surrounding road search subroutine is executed. If there is a surrounding road, the optimal route condition setting subroutine is executed (in step 156), and the number of the intersection located at the end of that road and the distance L of the road are input in step 157. Thereafter, in step 158, this distance L is added. If the result is larger than the distance from the starting point, that distance is set as the distance from the starting point, the search flag is set at 1 (indicating that the intersection is being searched), and the number of that road is input (in steps 159 and 160). Next, the step 154 is executed, and if it is determined that there is no surrounding road in step 155, the search flag is set at 2. Thereafter, the ending condition confirmation subroutine is executed, thereby completing the route search processing (in steps 161 to 163). Thus, the shortest route that is followed from the starting point to the destination is set.

FIG. 21 is a flowchart of the surrounding road search subroutine which is executed in step 154 in the processing shown in FIG. 20. First, it is determined whether or not the search of the surrounding road is executed for the first time in step 171. If the answer is affirmative, the numbers of the roads which start from the current intersection are fetched from the intersection data and are stored in step 172. Next, in step 173, the no-passage roads that correspond to the roads that lead to this intersection are fetched from the road data, and it is then determined in step 174 whether or not the roads fetched this time are identical with the no-passage roads explained with reference to FIG. 7. If the answer is no, the fetched roads are stored as the surrounding roads. If it is determined that it is not the first time that the search of the surrounding road is executed in step 171, or if the answer of the step 174 is affirmative, the road having the same starting point as that of the previously searched road and having a subsequent number is fetched from the road data in step 176. Thereafter, in step 177, it is determined whether or not the previously searched road is identical with the road which is fetched this time. If the answer is negative, the processing proceeds to step 173. If the answer is affirmative, the processing goes to step 178 where it is determined that there is no surrounding road.

FIG. 22 is a flowchart of the optimal route condition setting subroutine executed in step 156 of the processing shown in FIG. 20. First, the width and length of the surrounding road are read in from the road data, and it is then determined whether or not the width is, for example, 1 m or less (in steps 201 and 202). If the width exceeds 1 m, the processing proceeds to step 203. If the width is 1 m or less, it is, for example, doubled in step 203, and the no guided data on the roads that lead to the currently searched intersection is read in from the road data in step 204. Thereafter, it is determined in step 205 whether or not there are surrounding roads that are identical with the no guided data. If there is such a surrounding road, the processing goes to step 207. If there is no such a surrounding road, 100 m, for example, is added to the length of the road, and the result is then added to the virtual distance of the currently searched intersection from the starting point to obtain the virtual distance of the intersection located at the end of the surrounding road in step 207.

Next, another embodiment of the present invention will be described below with reference to FIGS. 23 to 26. In the first embodiment, search is directly conducted on the CD data and IC card data, as has been described with reference to FIGS. 18 and 19. On the other hand, this embodiment prepares a comparison list of the CD data and IC card data.

FIG. 23 (a) shows the starting address of the memory where the comparison list data is stored, FIG. 23 (b) a comparison list for sub-districts which contains the order of modified data for each sub-district, and FIG. 23 (c) shows a comparison list for road data. An integer in the column of the order of modified data represents the order taken by the data when it is stored in the memory, -1 and 0 in the column indicating that the data is deleted and that the data is not changed, respectively. FIGS. 24 (a), (b) and (c) respectively show a comparison list for the intersection data, a comparison list for the landmark data, and the starting address of the modified data.

The above-described comparison list data may be created by operating data within the CPU. In that case, the CD data on all the intersections is read out and the data read out is compared with the corresponding IC data so as to determine if there is an addition or deletion of the data. The thus-created comparison list is then stored in the RAM or the like.

FIGS. 25 and 26 show the search processings which employ the above-described comparison lists.

In the sub-district search processing shown in FIG. 25, the sub-district is first searched in the sub-district list file in the CD in step 92, and it is then determined whether or not there is an IC card in step 92. If there is no IC card, data on the sub-district [shown in FIG. 2 (c)] is fetched from the CD, and a flag indicating that the obtained data is a CD data is set (in steps 93 to 96). If it is determined that there is an IC card in step 92, it is determined whether or not the sub-district is listed in step 97. If the sub-district is listed, the starting address of the list of sub-districts is fetched from the comparison list starting address file in the IC card [shown in FIG. 23 (a)] in step 98. Subsequently, it is determined whether or not the starting address is 0 in step 99. If the starting address is 0 (which means that there is no change), the processing goes to step 95. If the starting address is not 0, the order of the modified data on that sub-district is fetched from the comparison list for sub-districts [shown in FIG. 23 (b)] in step 100. Next, in step 101, it is determined whether or not the order is larger than 0. If the answer is no (which means that there is no change), the processing goes to step 95. If the answer is yes, the stored address of the modified data is obtained and the data on the sub-district [shown in FIG. 12 (a)] is fetched from the IC card in step 102, and a flag indicating that the data is an IC card data is set in step 103. If it is determined in step 97 that the sub-district is not listed, the sub-district modified data [shown in FIG. 12 (a)] is searched for the sub-district. If the sub-district is listed, a flag indicating that the data is an IC card data is set in step 106.

FIG. 26 is a flowchart of the read of the intersection data. First, it is determined in step 111 whether or not there is an IC card. If there is no IC card, the intersection data in the IC (shown in FIG. 5) is searched to fetch the necessary intersection data in step 112, and a flag indicating that the data is an CD data is set in step 113. If it is determined in step 111 that there is an IC card, it is determined in step 114 whether or not the intersection is an added one. If it is not an added intersection, the starting address of the list of intersections is fetched from the comparison list data starting address file [shown in FIG. 23 (a)] in the IC card in step 115. Subsequently, it is determined in step 116 whether or not the starting address is 0. If the starting address is 0 (which means that there is no change), the processing goes to step 112. If the starting address is not 0, the order of the modified data on that intersection is obtained from the intersection comparison list file [shown in FIG. 24 (a)] in step 117. Next, it is determined in step 118 whether or not the order is larger than 0. If it is not larger than 0 (which means that there is no change), the processing goes to step 112. If the order is larger than 0, the stored address of the modified data is obtained and the intersection data [shown in FIG. 12 (a)] is fetched from the IC card in step 119, and a flag indicating that the data is an IC card data is then set in step 120. In step 121, it is determined whether or not the order obtained in step 171 is a negative value. If it is, a flag indicating that the intersection is deleted is set in step 122. If it is determined that the intersection is an added one in step 114, the intersection data in the IC card (shown in FIG. 9) is searched to fetch the intersection data in step 123, and the processing then proceeds to step 120.

Still another embodiment of the present invention will be described below with reference to FIGS. 27 to 30. Whereas the modified data stored in an IC card is searched directly or by using a comparison list in the above-described embodiments, the present embodiment involves designation of a region where the modified data exists.

FIG. 27 (a) shows a method of designating a modified region using the most northerly latitude, the most southerly latitude, the most easterly longitude, and the most westerly longitude, FIG. 27 (b) shows a method of designating the modified region using a polygon defined by latitude and longitude, FIG. 27 (c) shows a method of designating a modified region using a polygon defined by roads, and FIG. 27 (d) shows a method of designating a modified region using the intersections or landmarks.

FIG. 28 is a flowchart of processing of search of intersection data which is employed by this region designation method. In step 211, the intersection data (shown in FIG. 5) is fetched from the CD, and it is then determined in step 212 whether or not there is an IC card. If there is no IC card, a flag indicating that the data is a CD data is set in step 213. If there is an IC card in step 212, it is determined whether or not the intersection is within the modified region designated by any of the methods shown in FIG. 27. If the intersection is outside of the modified region, the processing proceeds to step 213. If it is within the region, the added intersection data (shown in FIG. 9) stored in the IC card is searched for a necessary intersection (in step 216). If it is determined in step 217 that the intersection is listed, the intersection data is fetched from the IC card in step 218, and a flag indicating that the data is an IC card data is then set in step 219. If it is determined in step 217 that the necessary intersection is not included in the added intersection data in the IC card, the starting address of the intersection data is fetched from the deletion list data starting address [shown in FIG. 13 (d)] in step 230. Thereafter, it is determined in step 231 whether or not the starting address is 0. If it is not 0, the deleted intersection list file [shown in FIG. 13 (b)] in the IC card is searched. If the intersection is contained in the file, a flag indicating that the intersection is deleted is set (in steps 233 and 234).

FIG. 29 is a flowchart of road data search processing employed in the region designation method. The contents of the processing are the same as those shown in FIG. 28, description thereof being omitted.

FIG. 30 (a) is a flowchart of processing of determining whether or not the data is within a region which is executed when the region is designated using the roads shown in FIG. 27 (c).

First, the road numbers required to designate a region are read from the IC card, and the data read is assigned to LN(1) . . . LN(n) in step 271. Next, the starting points and ending points of the roads designated by LN(1) . . . LN(n) are read from the CD, and the data read which represent the starting points is assigned to LNS(1) . . . LNS (n) while the data representing the ending points is assigned to LNE (1) . . . LNE (n) (in step 272). Subsequently, the stating points and ending points are compared with each other so as to check whether or not the roads are connected (in steps 273 and 274). If the roads are not connected, a data inputting error flag is set (in step 281). If the roads are connected, it is determined in step 275 whether or not the starting point of the first road is identical with the ending point of the last road, i.e., whether or not the intersection is surrounded by the roads. If it is not surrounded by the roads, a (n+1) the road is virtually created so that the intersection can be surrounded by the roads in step 280. Thereafter, in step 276, a point of intersection where each road crosses the latitude line that passes the intersection is calculated, and the number XN of points of intersection located on the right side of the intersection is then counted. Next, it is determined in step 277 whether or not this XN is an odd number, and a flag indicating that the intersection is within the region or outside the region is accordingly set (in step 278 or 279). FIG. 30 (b) shows examples in which the intersection is within the region and FIG. 30 (c) shows examples outside the region. FIG. 30 (b) includes roads (234) and the intersection and latitude line that passes the intersection (235). FIG 30(c) includes a point of intersection (236).

As in the case of the method which utilizes a comparison list and which is described with reference to FIGS. 25 and 26, a comparison list may be made beforehand by checking if each of the intersections is located outside the region or if it is a modified data, and the resultant comparison list may be stored in the RAM or the like.

Still another embodiment of the present invention will be described below with reference to FIGS. 31 to 35. Whereas each of the above-described embodiments involves storage of modified names of places, intersections and roads in an IC card, modified geographical feature data is stored in an IC card in this embodiment.

FIG. 31 shows the structure of geographical feature data stored in a CD. The geographical data includes the most northerly latitude, the most southerly latitude, the most easterly longitude, the most westerly longitude, adjacent screens Gl to G8, screen data a.sub.11 . . . a.sub.mn, and a plurality of large- and small-scale maps. The screen data represents lands, sea, rivers and so on displayed on the screen in different colors using the bit mapping technique.

FIG. 32 shows added geographical feature data stored in an IC card, which includes the comparison list data starting address shown in FIG. 32 (a), the geographical data comparison list shown in FIG. 32 (b), the modified data starting address shown in FIG. 32 (c), and the added geographical data shown in FIG. 32 (d). The IC card may also store the map of a parking lot or the like which cannot be stored in the CD. This allows for the reduction in the number of data stored in the CD.

FIG. 33 is a flowchart of processing of read of the geographical feature data. The contents of the processing are the same as those shown in FIG. 26, description thereof being omitted.

FIG. 34 is a flowchart of processing of search of the geographical feature data to be displayed. First, it is determined in step 281 whether or not it is the first time that the search is conducted. If it is, the geographical feature data which has a designated screen size and which contains the present position is searched (in steps 282 and 283). If it is determined that it is not the first time in step 281, it is determined in step 284 whether or not the screen size is to be changed. If the screen size is to be changed, it is determined in step 285 whether or not the screen is enlarged in step 285. If it is determined that the screen is scaled down, small-scale map data of a large area which contains the currently displayed screen is searched in step 286. If it is determined in step 285 that the screen is enlarged, it is determined in step 287 whether or not there are enlarged maps. If there are enlarged maps, the enlarged map of the portion in the area which contains the present position is searched in step 288. If there are no enlarged maps, the fact that there is no enlarged maps is informed to the driver in step 289. If the answer is negative in step 284, the processing goes to step 290 where it is determined whether or not the currently displayed screen contains the present position. If it does not, search is conducted on the latitude/longitude data for the adjacent screen which contains the present position in step 291. Thereafter, it is determined in step 292 whether or not there is the adjacent screen which contains the present position. If there is, the processing goes to step 283. If there is no such adjacent screen, the processing goes to step 286 where the small-scale map data is searched.

FIG. 35 is a flowchart of the processing of modification of the geographical feature data. This enables the roads, landmarks and names of places to be added on the screen and enables the present position on the display to be marked.

In the above-described embodiments, the present invention is applied to the coordinate origin method. It is to be noted, however, if the contents of the data are selected, the present invention can be applied to the fixed route method or the location method.

FIG. 36 is a flowchart of the navigation control conducted in the fixed route method. Once a user has input the present location and a destination, route search is executed (in steps 301 to 303). Once the route has been fixed, the present position and the route are displayed (in steps 304 and 305). Subsequently, the sensor signal which represents the vehicle position is input, and the present position is then calculated (in steps 306 and 307). The processing from steps 303 to 307 is repeated in step 308 to guide the vehicle to the destination.

FIG. 37 is a flowchart of the navigation control conducted in the location method. In this method, route search is not executed, and the map and the vehicle position are displayed on a screen. In consequence, only the geographical feature data is stored in a CD and an IC card.