JP4271931B2 - Navigation device and electronic map updating method - Google Patents

Description

[0001]
BACKGROUND OF THE INVENTION
The present invention relates to a navigation device and an electronic map update method.
[0002]
[Prior art]
In recent years, navigation devices that use electronic maps to guide routes to destinations have become widespread. Such a navigation device requires updating of the electronic map. Conventionally, updated data is distributed via a storage medium such as a DVD-ROM or a communication line.
[0003]
However, this method using a storage medium requires complicated work for an end user (hereinafter simply referred to as a user) such as changing the storage medium. Another problem is how to reduce transmission data in a method via a communication line.
[0004]
As a conventional technique for solving such a problem, for example, there is a technique disclosed in Patent Document 1 shown below. Hereinafter, this is referred to as Prior Art 1. Prior art 1 is a method of updating an electronic map via a communication line, and creates update data for each predetermined area (hereinafter referred to as a mesh), and when this mesh is displayed on the client side, the update data is updated. The presence or absence is determined and updated as necessary.
[0005]
In general, the electronic map file format varies depending on the manufacturer and model. For this reason, in order to generate update data from the updated electronic map, it is necessary to match these file formats. Conventionally, this operation has been performed manually, and it has been very laborious.
[0006]
As a conventional technique for solving such a problem, for example, there is a technique disclosed in Patent Document 2 shown below. Hereinafter, this is referred to as Prior Art 2. Prior art 2 is a method of automatically standardizing a file format of an updated electronic map into a predetermined format and generating difference data by comparing it with a previously standardized electronic map.
[0007]
[Patent Document 1]
JP 2000-298429 A
[Patent Document 2]
JP 2002-32773 A
[0008]
[Problems to be solved by the invention]
However, in the methods according to the prior arts 1 and 2, the updated data and newly added data are written in an arbitrary free area on the hard disk, so that a file related to a single mesh is fragmented and separated. There is a problem of end. For this reason, a lot of seek time is required for reading, and the user's comfort is impaired.
[0009]
The present invention has been made in view of the above problems, and an object of the present invention is to provide a navigation device and an electronic map update method capable of updating an electronic map without impairing user comfort.
[0010]
[Means for Solving the Problems]
In order to achieve such an object, the present invention provides a navigation device for storing an electronic map for each predetermined area as described in claim 1, wherein a free area for storing update data for rewriting the electronic map is provided. Electronic map storage means for each predetermined area, for each unit prepared for each area and for each layer prepared for each unit, the start address of the storage area of each unit, and the relative address from the start address And based on , Specify the update position of the electronic map in bits, Electronic map update means for updating the electronic map with the update data, wherein the electronic map storage means stores corresponding data at the same position from the head address of each unit in a plurality of versions of the electronic map. It is comprised as follows. With this configuration, a navigation device that can update the electronic map without impairing the user's comfort is provided. In other words, since the data to be added is stored in an empty area provided in advance for each predetermined area, for each unit prepared for each area and for each layer prepared for each unit, the seek time increases after the update. It is possible to update the electronic map while preventing the problem.
[0014]
Further, according to the present invention, an electronic map is stored for each predetermined area and a free area for storing update data for rewriting the electronic map is provided for each predetermined area and each area. An electronic map updating method for a navigation device for each prepared unit and for each layer prepared for each unit, wherein for each unit to be updated, the start address of the unit, the number of rewrites, and the start address of the unit Based on the update program input step for inputting the update program including the relative address and the update data, the start address of the unit included in the input update program, the number of rewrites, and the relative address from the start address of the unit, Specify the update location of the electronic map in bits, A data writing step of writing the update data into the electronic map. By comprising in this way, the electronic map update method which can update an electronic map, without impairing a user's comfort is provided. In other words, since the data to be added is stored in an empty area provided in advance for each predetermined area, for each unit prepared for each area and for each layer prepared for each unit, the seek time increases after the update. It is possible to update the electronic map while preventing the problem.
[0015]
In the electronic map update method, preferably, as in claim 3, the electronic map is configured by storing data related to a predetermined object in a predetermined address area, and the update program includes the update program. Where update data is written The above Yu Identified by the start address of the unit and the relative address from the start address of the unit An address is included, and the data writing step is configured to write the update data to the electronic map based on the address. As a result, the update process can be performed based on a previously known address, so that it can be performed easily and quickly.
[0016]
In addition, the electronic map update method is preferably claimed. 4 As described, the electronic map is configured such that at least one of a drawing unit, a road unit, an intersection unit, a road shape unit, and a maneuver unit is stored for each predetermined area, Relative address from the start address of the unit Is a relative address from the head address of the area in which the drawing unit, the road unit, the intersection unit, the road shape unit, or the maneuver unit is stored. As a result, it is possible to perform update processing for each drawing unit, road unit, intersection unit, road shape unit, or maneuver unit based on a previously known address. It becomes possible.
[0020]
DETAILED DESCRIPTION OF THE INVENTION
[One Embodiment]
An embodiment of the present invention will be described in detail with reference to the drawings. FIG. 1 is a block diagram showing an outline of a data flow in the electronic map update system according to the present embodiment.
[0021]
As shown in FIG. 1, the electronic map update system according to the present embodiment provides and sells an electronic map 11a,... (Hereinafter, an arbitrary electronic map provided by the map vendor 10 is 11). It comprises a map vendor 10, an update service provider 20 that provides the update of the electronic map 11, and an end user (hereinafter simply referred to as a user) 40 that uses this. In the following, the electronic map (11, 21, 41) is stored in storage means such as a hard disk.
[0022]
In this configuration, the map data format (Geographic Data Format: GDF) of the electronic map 11 provided from the map vendor 10 is various (for example, HAL, KIWI, etc., which is format A in FIG. 1). For this reason, in the present embodiment, the update service provider 20 first unifies the electronic map 11 into a predetermined GDF, in the present embodiment, a Hybrid HAL Format (in FIG. 1, this is referred to as a format B) by the format conversion device 22. (Also called standardization).
[0023]
The update service provider 20 also stores past electronic maps 21a,... (Hereinafter, an arbitrary electronic map code stored in the update service provider 20 is 21). This GDF is also in format B. Therefore, the update service provider 20 uses the difference data generation device 23 to compare the previous electronic map (for example, 21a) with a new electronic map (for example, 21b), thereby updating the update contents. For generating the difference data shown and automatically incorporating the updated content into the electronic map (referred to as 41a for example) in the navigation device 42 on the end user (hereinafter simply referred to as the user) 40 side based on the difference data An update program DUC (this is, for example, 24ab) is generated.
[0024]
The generated DUC 24ab is distributed to the navigation device 42 by the DUC distribution server 26 via the network 30 such as a public line network, a mobile communication line network, or the Internet. This distribution is transmitted from the DUC distribution server 26 via the predetermined network 30 every predetermined period such as a quarter or when there is a request from the user terminal 42.
[0025]
The navigation device 42 automatically compiles the DUC 24ab received via the network 30 according to a predetermined flow, thereby incorporating the updated contents into the electronic map 41a and creating the electronic map 41b. In the following description, reference numeral 41 denotes an arbitrary electronic map 41a,.
[0026]
Next, the format conversion device 22 will be described below. The format conversion device 22 is configured to include an information processing device such as a single or a plurality of workstations or personal computers, and the electronic map 11 described in an arbitrary GDF (format A) by a predetermined program. Convert to GDF of format B as shown below. The Hybrid HAL Format (hereinafter abbreviated as HHF) applied as the GDF (format B) of the converted electronic map 21 is a file format that incorporates the KIWI concept while following the conventional HAL. FIG. 2 shows the data structure of HHF.
[0027]
Referring to FIG. 2, the HHF includes a file common header 211, a base file allocation table 212, a level structure information table 213, a leaf address unit 214, a drawing unit 215a,..., A road unit 215a,. A unit 218 and a maneuver unit 219a,... Have a hierarchical structure. In FIG. 2, the root of the arrow represents the layer storing the address, and the tip of the arrow represents the layer pointed to by the address.
[0028]
In this structure, the file common header 211 is for enabling identification of a file storing the electronic map (21, 41). Accordingly, this includes items such as an identification code of the target area (corresponding to a mesh in the following), a creation date, an update history, and the like. Further, it may be configured to include a secret key for user authentication.
[0029]
The base file allocation table 212 is a table for moving to the level structure information table 213 and the leaf address unit 214, and stores the movement destination and the address in association with each other.
[0030]
The level structure information table 213 stores information for managing the drawing unit 215, the road unit 216, the intersection unit 217, the road shape unit 218, and the maneuver unit 219 for each predetermined square area (this is called a mesh). . This is, for example, information such as the corresponding mesh identification code, latitude and longitude of the reference point, storage information for each layer (referred to below), link ID conversion layer flag, and the like.
[0031]
Here, the mesh will be described with reference to the drawings. In the present embodiment, a mesh is created by dividing a map described in, for example, the Mercator projection by a longitude and latitude of a predetermined width. In this embodiment, as shown in FIG. 3, the mesh has a layer structure from the highest mesh to the lowest mesh (four-layer structure in this embodiment). Here, the uppermost mesh is, for example, a rectangular area divided into latitude and longitude widths of 8 °. In these hierarchical structures, a rectangular area that is divided with a latitude width and a longitude width of 1 ° is referred to as a primary mesh in this embodiment. The uppermost mesh is a 0th-order mesh, and this is further divided by a square area of the same size, which is a k (2 ≦ k ≦ n) -order mesh, and is divided by a smaller square area as the degree k is larger. Is. In the HHF, the above-described primary mesh is used as a reference (this is simply referred to as a mesh), and information associated with layers below this is managed as one unit.
[0032]
Returning to FIG. The leaf address unit 214 manages an identification code for identifying each mesh. This is described by, for example, a 4-digit number, and the first two digits indicate latitude information, and the latter two digits indicate longitude information. A drawing unit 215 and a road unit 216 for each mesh are linked to the leaf address unit 214.
[0033]
The drawing unit 215 stores data on the background of the electronic map for each mesh and for each layer. The drawing unit 215 includes a background (image, terrain, road), icons, characters, a link ID conversion layer, a polygon name, and the like.
[0034]
The road unit 216 stores information for attaching links such as a unit header, a node table, a node list, a link table, and a time restriction table. The unit header is information for jumping to the intersection unit 217, the maneuver unit 219, and the road shape unit 218. The road unit 216 also includes an identification code in order to specify information on adjacent meshes.
[0035]
The intersection unit 217 stores a guide code at the intersection. The road shape unit 218 stores element points forming a link.
[0036]
The HHF has a link number for each mesh. This link number corresponds to the link ID of the link record, and is used when calculating a route when transitioning from a lower layer to an upper layer. Therefore, the maneuver unit 219 is stored so that a lower layer can be searched from an upper layer. Therefore, the maneuver unit 219 is used when referring to the lower layer number when transitioning to an upper layer once in guidance or the like.
[0037]
The above-described HHF may be divided into a plurality of files based on the drawing unit 215 and the road unit 216 or based on the mesh when the data has a large capacity.
[0038]
In such a structure, in this embodiment, the area of each unit (drawing unit 215, road unit 216, intersection unit 217, road shape unit 218, maneuver unit 219) prepared for each mesh is different regardless of the version. Configured identically. That is, in all versions, specific data is stored at the same address. In order to realize this, in this embodiment, an empty area for storing additional data is provided for each mesh and unit, and the corresponding data in all versions of the electronic maps (21, 41). Are stored in the same position from the head address of each unit. In other words, the electronic map (21, 41) is configured such that data relating to the same object is stored in the same predetermined address area. This will be described with reference to FIG. 4 while focusing on the character layer 2152 in the drawing unit 215. The storage position of each unit is the same in all versions of the electronic maps (21, 41).
[0039]
Referring to FIG. 4, the rendering unit 215 stores a rendering unit header 2151 and character layers 2152 (# 1 to # 3 in FIG. 4) that are contents. The drawing unit header 2151 includes the number of character layers 2152 (character layer number 2151a) included for each mesh, an ID (layer ID 2151b) for identifying the character layer, and an empty area 2151c. A character layer 2152 is stored at the address destination corresponding to each layer identifier 2151b (# 1 to # 3). One character layer 2152 includes a data area 2152a in which data is stored and a free area 2152b in which nothing is stored. The empty area 2152b is an area for storing additional data related to the same character layer 2152. Further, after the character layer 2152, an empty area 2153 for storing an additional character layer 2152 is provided. When the character layer 2152 is added to the empty area 2153, the number of character layers 2151a is incremented by 1, and the corresponding layer ID 2151b is further added to the drawing unit header 2151.
[0040]
Further, returning to FIG. In FIG. 1, the difference data generation device 23 is configured to include an information processing device such as a single or a plurality of workstations or personal computers, like the format conversion device 22, and the previous electronic map by a predetermined program. A data difference (difference data) between the current electronic map (referred to as 21a) and the current electronic map (referred to as 21b) is generated, and a DUC 24ab is generated based on the difference data. Here, in the electronic map by HHF, as shown above, the information accompanying each unit is stored in the same address position from the head address of the unit. Therefore, the difference data generation device 23 generates difference data by comparing bit values from the head address for each unit. The generated difference data includes a unit identification code, an address from the head address of the unit, and a rewrite value. A DUC (hereinafter, an arbitrary DUC code is 21) is described so that corresponding bits in the electronic map 41a are automatically rewritten based on these pieces of information.
[0041]
Here, the data structure of the DUC 24 will be described with reference to FIG. FIG. 5 shows the data structure of the DUC 24. As shown in FIG. As shown in FIG. 5, the DUC 24 has, for each unit to be rewritten, a record including the unit start address IA, the number N to be rewritten, the relative address RA and the rewrite value X from the top of the unit. Configured. In addition, the DUC 24 generated as described above is predetermined from the DUC distribution server 26, for example, every predetermined period or when there is a request for information on the target unit (or a mesh including this) from the user terminal 42. Are transmitted via the network 30.
[0042]
The update process based on the DUC 24 configured in this way will be described with reference to FIG. For example, when the DUC 24 for one unit is a data string as shown in FIG. 6A, the target unit has a relative address from the start address Ax of a total of 7 of A3, A4, A7, A9, Aa, Ab, Ac. The bits are rewritten as shown in FIG. In other words, in the present embodiment, it is possible to specify the bit to be rewritten only by the head address of the unit and the relative address with respect to this, and the update is performed quickly and efficiently.
[0043]
Moreover, the structure of the navigation apparatus 42 which rewrites the electronic map 41 based on said DUC24 is shown below. FIG. 7 is a block diagram showing a configuration for updating the electronic map 41 in the navigation device 42. Referring to FIG. 7, the navigation device 42 includes a reception processing unit 421 that receives the DUC 24 from the network 30 as a configuration for updating the electronic map 41, that is, a configuration for incorporating the updated contents in the DUC 24 into the electronic map 41. The DUC analyzer 422 for specifying the start address IA of the unit in the received DUC 24, the number N to be rewritten, the relative address RA from the head of the unit, and the rewrite value X, and the unit specified by the DUC analyzer 422 A rewrite processing unit 423 that rewrites the electronic map 41 with the rewrite value X based on the electronic map 41 based on the start address IA, the number N to be rewritten, and the relative address RA from the top of the unit. Has been.
[0044]
In the present embodiment, the electronic map 41 is composed of a rewritable storage medium such as a hard disk or a DVD-RW.
[0045]
Next, the update operation of the electronic map 41 in the navigation device 42 will be described based on the flowchart shown in FIG. Referring to FIG. 8, in this operation, first, the reception processing unit 421 receives the DUC 24 via the network 30 (step S101), and the record included in the DUC 24 received by the DUC analysis unit 422 is specified (step S102). . However, if there is no record, the update process ends.
[0046]
Next, the DUC analysis unit 422 selects one of the specified records (step S103), writes the number N to be rewritten with the start address IA corresponding to this record, and the relative address RA from the start address IA. The replacement value X is specified (step S104).
[0047]
When IA, N, RA, and X are specified in this way, the rewrite processing unit 423 next sets q = 1 (step S105). Further, the rewrite processing unit 423 selects one of the specified RA and X (step S106), and rewrites the electronic map 41 based on this value (step S107).
[0048]
When the rewriting is completed in this way, the rewriting processing unit 423 increments q by 1 (step S108), and compares the q value after the increment with the number N to be rewritten (step S109). As a result of this comparison, when q = 1 is not satisfied (No in step S109), the rewrite processing unit 423 returns to step S106, selects any one of unselected RA and X, and thereafter Repeat the process.
[0049]
If q = 1 as a result of the comparison in step S109 (Yes in step S109), the rewrite processing unit 423 determines whether there is an unselected record among the records identified in step S102 ( Step S110). If there is an unselected record as a result of this determination (Yes in step S110), the rewrite processing unit 423 returns to step S103 to select any one of the unselected records and perform the subsequent processing. repeat. If there is no unselected record as a result of the determination in step S110 (No in step S110), the rewrite processing unit 423 ends the process.
[0050]
Next, as a specific example of the update operation, a case where a road R1 is added to the electronic map as shown in FIG. 9A will be described as an example. In this case, it is assumed that the identification codes of the updated units are # 131144 and # 131145. Accordingly, the DUC 24 includes identification codes # 131144 and # 131145 for specifying these units, and head addresses 100 and 250 corresponding thereto, as shown in FIG. 9B. Further, based on this DUC 24, units # 131144 and # 131145 are rewritten as shown in FIG. 9C. Thereby, the electronic map is updated as shown in FIG.
[0051]
With the configuration as described above, according to the present embodiment, it is possible to automatically rewrite with a minimum amount of data, so that time and labor can be reduced, and the electronic map can be easily updated. It becomes possible. In addition, the timing for executing the update can be set, for example, every predetermined period, and the communication channel can be effectively used as a resource for other functions. In addition, this makes it possible to minimize the load applied to the update service provider's equipment (format conversion device, differential data generation device, DUC distribution server, etc.), and can be realized at low cost. . Furthermore, bugs included in the electronic map 41 can be corrected with the same configuration.
[0052]
In this embodiment, the DUC 24 is input to the navigation device 42 via the network 30. However, the present invention is not limited to this. For example, the DUC 24 is input to the navigation device 42 using a portable storage medium such as a CD-ROM. You may comprise so that it may do.
[0053]
[Other Embodiments]
The embodiment described above is merely a preferred embodiment of the present invention, and the present invention can be variously modified and implemented without departing from the gist thereof.
[0054]
【The invention's effect】
As described above, according to the present invention, it is possible to provide a navigation device and an electronic map update method that can update an electronic map without impairing the user's comfort.
[Brief description of the drawings]
FIG. 1 is a block diagram showing an outline of an electronic map update system according to an embodiment of the present invention.
FIG. 2 is a diagram showing an outline of a data structure of HHF used in an embodiment of the present invention.
FIG. 3 is a diagram for explaining a mesh used in an embodiment of the present invention.
4 is a diagram showing an outline of a data structure of a drawing unit 215 in the HHF shown in FIG.
FIG. 5 is a diagram showing a data structure of a DUC 24 according to an embodiment of the present invention.
FIG. 6 is a diagram for explaining an outline of a processing operation when the electronic map 41 is updated using the DUC 24 in the embodiment of the present invention.
FIG. 7 is a block diagram showing a configuration for updating an electronic map 41 in the navigation device 42 according to one embodiment of the present invention.
FIG. 8 is a flowchart showing a flow of update processing of the electronic map 41 according to the embodiment of the present invention.
FIG. 9 is a diagram for explaining a specific example of the update process of the electronic map 41 according to the embodiment of the present invention.
[Explanation of symbols]
10 Map vendor
11, 11a, 11b, 11c, 11d, ... Electronic map (form A)
20 Update service provider
21, 21a, 21b, 21c, 21d, ..., 41, 41a, 41b, 41c, 41d, ... Electronic map (form B)
22 Format converter
23 Differential data generator
24, 24ab, 24bc, 24cd, ... DUC
26 DUC distribution server
30 network
40 End users
42 Navigation devices
211 File common header
212 Base file allocation table
213 Level structure information table
214 Figure Leaf Address Unit
215 Drawing unit
216 road unit
217 Intersection unit
218 Road shape unit
219 Maneuver unit
421 Reception processing unit
422 DUC analyzer
423 rewrite processing unit
2151 Drawing unit header
2151a Number of layers
2151b Layer identifier (# 1 to # 3)
2151c, 2152b, 2153 Free space
2152 Character layer
2152a Data area
IA start address
RA Relative address from start address IA
N Number to rewrite
X Rewrite value

Claims (4)

In a navigation device that stores an electronic map for each predetermined area,
An electronic map storage means having a free area for storing update data for rewriting the electronic map for each predetermined area, for each unit prepared for each area and for each layer prepared for each unit;
Electronic map update means for specifying the update position of the electronic map in bit units based on the start address of the storage area of each unit and the relative address from the start address, and updating the electronic map with the update data And
The electronic map storage means is configured such that, in a plurality of versions of an electronic map, corresponding data is stored in the same position from the head address of each unit. An empty area for storing an electronic map for each predetermined area and storing update data for rewriting the electronic map is provided for each predetermined area, for each unit prepared for each area, and for each layer prepared for each unit. An electronic map update method for a navigation device comprising:
For each unit to be updated, an update program input step for inputting an update program including the start address of the unit, the number to be rewritten, a relative address from the start address of the unit, and the update data;
Based on the start address of the unit included in the input update program, the number of rewrites, and the relative address from the start address of the unit, the update position of the electronic map is specified in bits, and the update data is stored in the electronic data An electronic map update method, comprising: a data writing step of writing to a map. The electronic map is configured by storing data related to a predetermined object in a predetermined address area,
The update program includes an address specified by a relative address from the write destination der update data is, the start address and the start address of the unit of the units,
3. The electronic map updating method according to claim 2, wherein the data writing step writes the update data into the electronic map based on the address. The electronic map is configured such that at least one of a drawing unit, a road unit, an intersection unit, a road shape unit, and a maneuver unit is stored for each predetermined area,
The relative address from the head address of the unit is a relative address from the head address of the area in which the drawing unit, the road unit, the intersection unit, the road shape unit, or the maneuver unit is stored. The electronic map update method according to claim 3.

Images