JP4927860B2 - MAP DATA UPDATE DEVICE, MAP DATA UPDATE METHOD, MAP DATA UPDATE PROGRAM, AND STORAGE MEDIUM - Google Patents

Description

  The present invention relates to a method for updating map data.

  In general, map data used in a car navigation device includes node data and link data. The node data is data indicating a predetermined point on the road such as an intersection. The link data is data indicating a link corresponding to a road.

  In a system that is usually used frequently, a unique link ID is assigned to all links, and consecutive link IDs are assigned to a plurality of link IDs constituting the same road. Therefore, when a new road (new link) increases with respect to a certain road, it is necessary to update the link IDs of all links existing after the new link, and a huge amount of processing is required for updating the map data. . Further, when the same link ID is assigned to the same link in a plurality of layers constituting the map data, the above update process is required in all layers.

  From such a point of view, Patent Document 1 proposes a method of providing a link ID with a margin in advance for each link. However, in this method, a plurality of link IDs are given to one link as much as a margin is provided, and the number of link IDs used increases. Therefore, the data amount of the entire link data increases. Further, unless the number of digits of the link ID is increased, the link ID may be insufficient when the number of links increases.

JP 2002-175593 A

  Examples of problems to be solved by the present invention include the above. An object of the present invention is to reduce the amount of map data update processing when a link is added.

The invention according to claim 1 includes link data indicating a link corresponding to a road, node data indicating a node corresponding to a predetermined point on the road, and a parcel ID indicating a parcel. , Including a link ID composed of a road ID indicating a road, an offset indicating the order of the first link in the parcel with reference to the starting point of the road, and an intra-parcel ID indicating the order of each link in the parcel. When adding a new link on a specific road in a specific parcel and storing means for storing map data in the storage unit, the ID in the parcel after the new link in the specific parcel is updated, and includes a particular road, and, and a updating means for updating the offset parcel present in the subsequent specific parcel, The map data is prepared for each of a plurality of layers corresponding to different scales. In the plurality of layers, the same link is assigned to the same link, and layers other than the lowest layer are provided. In the map data corresponding to the ID in the parcel corresponding to the specific link, the first parcel or the first parcel ID among the plurality of IDs in the parcel corresponding to the link in the lowest layer, or the first parcel It is indicated by the difference between the inner ID and the last parcel ID, and the updating means updates for each layer, and increases the first and last parcel IDs for layers other than the lowest layer. It is characterized by making it.

The invention according to claim 3 includes link data indicating a link corresponding to a road, and node data indicating a node corresponding to a predetermined point on the road, and the link data includes a road ID indicating a road; Storing map data including a parcel ID indicating a parcel, an offset indicating the order of the first link in the parcel with reference to the starting point of the road, and an intra-parcel ID indicating the order of each link in the parcel Storing a new link on a specific road in a specific parcel, and updating a parcel ID after the new link in the specific parcel, and including the specific road and, and a updating step of updating the offset parcel present in the subsequent specific parcel, the map data are different condensation In the map data corresponding to the layers other than the lowest layer, the same in-parcel ID is assigned to the same link in the plurality of layers. The in-parcel ID corresponding to a specific link is determined by the first and last in-parcel ID among the plurality of in-parcel IDs corresponding to the link in the lowest layer, or the first in-parcel ID and the last in-parcel It is indicated by an ID difference, and the updating step updates each layer, and for the layers other than the lowest layer, the first and last parcel IDs are increased. .

The invention according to claim 4 is a map data update program executed in a terminal device including a storage unit and a computer, and includes link data indicating a link corresponding to a road and a node corresponding to a predetermined point on the road The link data includes a road ID indicating a road, a parcel ID indicating a parcel, an offset indicating the order of the top links in the parcel with reference to the start point of the road, and the parcel A storage means for storing map data including an intra-parcel ID indicating the order of each link in the storage unit, and when adding a new link on a specific road in the specific parcel, in the specific parcel Update the intra-parcel ID after the new link at the same time, include the specific road, and the specific par Updating means for updating the offset parcel present after Le, makes the computer function as, the map data is prepared for each of a plurality of layers corresponding to different scales, in said plurality of layers, the same link On the other hand, in the map data corresponding to the layers other than the lowest layer, the same intra-parcel ID is assigned to the link in the parcel corresponding to the specific link in the lowest layer. Among the parcel IDs of the first and last parcels, or by the difference between the first parcel ID and the last parcel ID, and the updating means updates each layer, and For the layers other than the lowest layer, the first and last parcel IDs are increased .

  The invention according to claim 8 is a storage medium, and includes link data indicating a link corresponding to a road, node data indicating a node corresponding to a predetermined point on the road, and a parcel ID indicating a parcel. The link data includes a road ID indicating a road, an offset indicating the order of the first link in the parcel with reference to the start point of the road, and an intra-parcel ID indicating the order of each link in the parcel. Map data including the link ID to be stored is stored.

The structure of the map data used in the Example of this invention is shown typically. The structural example of the data for route calculation is shown. The structural example of link data is shown. It is a figure explaining a link and a node. An example of the data structure of link data is shown. An example of link data before adding a new link is shown. An example of link data after adding a new link is shown. It is a block diagram which shows the structure of the navigation apparatus by an Example. The data structure example of link data update information is shown. It is a flowchart of the data update process which adds a new link. The example of the map data update system to which this invention is applied is shown.

Explanation of symbols

100 navigation device 120 map data 122 map display data 124 route calculation data 125 node data 126 link data PID parcel ID
RID Road ID
IPID Parcel ID
OFST offset

  In one aspect of the present invention, the map data update device includes link data indicating a link corresponding to a road, node data indicating a node corresponding to a predetermined point on the road, and a parcel ID indicating a parcel. The link data is composed of a road ID indicating a road, an offset indicating the order of the top links in the parcel with reference to the start point of the road, and an intra-parcel ID indicating the order of each link in the parcel. Storage means for storing map data including a link ID in a storage unit, and when adding a new link on a specific road in a specific parcel, the ID in the parcel after the new link in the specific parcel Update the parcel offset that includes the specific road and exists after the specific parcel. It includes an update means.

  The map data update device updates the map data in response to addition of a link included in the map data. The map data includes link data indicating a link corresponding to a road, node data indicating a node corresponding to a predetermined point on the road, and a parcel ID indicating a parcel. The link data includes a road ID indicating a road, an offset indicating the order of the top links in the parcel with reference to the start point of the road, and an intra-parcel ID indicating the order of each link in the parcel. Link ID. When a new link is added on a specific road in a specific parcel, the ID in the parcel after the new link in the parcel is updated. In addition, the offset of the parcel including the road and existing after the parcel including the road is updated.

  According to the above map data update device, when a new link is added, in a parcel other than the parcel to which the new link is added, only the offset needs to be changed, and the parcel corresponding to each link in the parcel There is no need to change the ID. Therefore, the burden of the map data update process can be reduced. In a preferred example, when the new link increases by one, the updating means increases the intra-parcel ID and the offset by one respectively.

  In one aspect of the map data update device, the map data is prepared for each of a plurality of layers corresponding to different scales, and the update unit performs update for each layer.

  In another aspect of the map data update device described above, in the plurality of layers, the same link in the parcel is attached to the same link, and the map data corresponding to a layer other than the lowest layer The intra-parcel ID corresponding to a specific link is determined by the first and last intra-parcel ID of the plurality of intra-parcel IDs corresponding to the specific link in the lowest layer, or the first intra-parcel ID and the last ID The update means increases the first and last parcel IDs for layers other than the lowest layer. In this aspect, the same link can be indicated by the same ID in a plurality of layers.

  In another aspect of the present invention, the map data update method includes link data indicating a link corresponding to a road, and node data indicating a node corresponding to a predetermined point on the road, and the link data includes the road Including a road ID indicating a parcel, a parcel ID indicating a parcel, an offset indicating the order of the top links in the parcel with reference to the start point of the road, and an intra-parcel ID indicating the order of each link in the parcel. The storage step of storing map data in the storage unit, and when adding a new link on a specific road in a specific parcel, while updating the ID in the parcel after the new link in the specific parcel, An update step of updating a parcel offset that includes a specific road and that exists after the specific parcel.

  According to this method, when a new link is added, in the parcel other than the parcel to which the new link is added, it is only necessary to change the offset, and the ID in the parcel corresponding to each link in the parcel is changed. Since there is no need to do this, the burden of map data update processing can be reduced.

  In another aspect of the present invention, a map data update program executed in a terminal device including a storage unit and a computer includes a link data indicating a link corresponding to a road, and a node indicating a node corresponding to a predetermined point on the road The link data includes a road ID indicating a road, a parcel ID indicating a parcel, an offset indicating the order of the first link in the parcel with reference to the start point of the road, and each link in the parcel Storage means for storing map data including an intra-parcel ID indicating the order of links in the storage unit, and when adding a new link on a specific road in the specific parcel, in the specific parcel The intra-parcel ID after the new link is updated, the specific road is included, and the specific parcel is included. Updating means for updating the offset parcel present after, as causing the computer to function. By executing this program by a computer, the above map data updating apparatus can be realized. Moreover, this map data update program can be suitably handled in a state stored in a storage medium.

  In another aspect of the present invention, the link data includes link data indicating a link corresponding to a road, node data indicating a node corresponding to a predetermined point on the road, and a parcel ID indicating a parcel. Map data including a link ID composed of a road ID indicating a road, an offset indicating the position of the parcel set with reference to the starting point of the road, and an intra-parcel ID indicating the order of each link in the parcel. A storage medium characterized in that is stored is provided.

  Hereinafter, preferred embodiments of the present invention will be described with reference to the drawings.

[Map data]
FIG. 1 schematically shows the configuration of map data used in this embodiment. The map data has a hierarchical structure including a plurality of layers corresponding to a plurality of different scales. Although FIG. 1 illustrates the map data of three layers for convenience of explanation, the map data may have a larger number of hierarchical structures. In each layer, one unit of map data is called “parcel P”. “Parcel” is a concept indicating a geographically wide range, and can also be expressed as “block”, “mesh”, or the like. In FIG. 1, layer 3 is the highest layer and corresponds to the widest map. Layer 1 is the lowest layer and corresponds to the most detailed map.

  The map data 120 is prepared separately for each layer, and includes map display data 122 and route calculation data 124, respectively. The map display data 122 is data used to display a map image to the user, and mainly includes image data corresponding to the map. The route calculation data 124 is data used for route calculation by the route search function.

  FIG. 2 shows the configuration of the route calculation data. The route calculation data 124 includes node data 125 and link data 126. The “node” corresponds to a predetermined point such as an intersection on the road, and the node data 125 is data indicating a node. On the other hand, “link” corresponds to one section of the road delimited by an intersection or the like, and the link data 126 is data indicating a link.

  Examples of nodes and links are shown in FIGS. 4 (A) and 4 (B). A map including a plurality of roads 111 shown in FIG. 4A includes a plurality of nodes and links as shown in FIG. In FIG. 4B, each node is indicated by a node ID (N00001 etc.) and each link is indicated by a link ID (L00001 etc.).

  FIG. 3 shows an example of link data. FIG. 3 shows areas corresponding to four parcels. An ID for each parcel is indicated by a parcel ID (PID). FIG. 3 shows areas corresponding to four parcels with parcel IDs “1” to “4”. As illustrated, each parcel includes one or more nodes N indicated by white circles. A road section divided by two adjacent nodes is a link.

  A road ID (RID) is assigned to the road. FIG. 3 shows a road whose road ID is “5015”. One road passes through a plurality of parcels. In each parcel, an offset (OFST) is assigned. The offset indicates the order of the top link in each parcel with the start point of the road as a reference. That is, the offset indicates the number of links corresponding to the first link in each parcel counted from the starting point of the road. The “first link” is a link closest to the starting point of the road among a plurality of links in the parcel corresponding to the same road. For example, in FIG. 3, the offset of the parcel of “Parcel ID: 1” is “7833”. This indicates that the top link in the parcel is the 7833th link counted from the starting point of the road. That is, the offset is also information indicating the order of each parcel in a plurality of parcels through which a certain road passes.

  In each parcel, an intra-parcel ID (IPID) is assigned for each link. The parcel ID is assigned independently for each parcel. A plurality of links included in each parcel are given “0”, “1”,... And an intra-parcel ID in order from the closest to the starting point of the road.

  Thus, in this embodiment, the link ID indicating each link on the road is indicated as follows.

Link ID = Road ID + Offset + Parcel ID (1)
That is, the number of the link counted from the starting point of the road is indicated by “offset + in-parcel ID”, not a serial number set in order from the starting point of the road. In other words, the link ID is indicated by a combination of an offset indicating the order of the top links in the parcel and an ID in the parcel indicating the order of the links in the parcel.

  Specifically, the example of FIG. 3 indicates that the offset of the parcel of “PID: 1” is “7833” means that there are 7832 links to the parcel counted from the starting point of the road. Is shown. The first link in the parcel with “PID: 1” is given “in-parcel ID (IPID): 0”, and the next link is given “IPID: 1”. That is, these links are the 7833th and 7834th (= 7833 + 1) th links, respectively, counted from the starting point of the road.

  The offset of the parcel of “PID: 2” located in the upper left of FIG. 3 is “7835”. There is only one link in the parcel, and “IPID: 0” is assigned to the link. Therefore, this link is the 7835th link counted from the starting point of the road.

  The offset of the parcel of “PID: 3” located in the lower left of FIG. 3 is “7836”. There are three links in this parcel, and “IPID: 0”, “IPID: 1”, and “IPID: 2” are assigned respectively. Accordingly, each link is the 7836th, 7837 (= 7836 + 1) th, and 7838 (= 7836 + 2) th link counted from the starting point of the road.

  Thus, even if each link is indicated not by a serial number from the start point of the road but by “offset + in-parcel ID”, each link is maintained with the order from the start point of the road, and a unique link ID Can be shown.

FIG. 5 shows an example of the data structure of link data. FIG. 5 is an example of link data for a certain parcel. In FIG. 5, the parcel ID is the ID of the parcel. Each road ID is an ID of an individual road that passes through the parcel. For each road, an offset, a link attribute, and a plurality of parcel IDs are set. As described above, “offset” indicates the head link order (serial number) of each road in the parcel with respect to the start point of the road. “Link attribute” is information indicating the type of road (highway, prefectural road, etc.), width, coordinates, length, and the like. Usually, the road types of the same road are the same. The “in-parcel ID” is a number indicating the order of each link in each parcel, as shown in FIG. Using this information, the link ID corresponding to the link on a certain road is
Link ID = “Road ID + Offset + Parcel ID”
Indicated by

  FIG. 6 shows an example of link data in a certain area in detail. In FIG. 6, only one road is shown for convenience of explanation. In FIG. 6, a parcel of “PID: 3-1” is shown at level 3. Further, the parcel of level 2 “PID: 2-1” corresponds to a part thereof, and the parcel of level 1 “PID: 1-1” corresponds to part thereof. .

The ID in the parcel (IPID) of the lowest layer is 0, 1, 2,. . It is indicated by a single number. On the other hand, in the layer higher than the lowest layer, the intra-parcel ID corresponding to each link is determined by the intra-parcel ID of the first link and the last link among a plurality of links corresponding to the link in the lower layer. Indicated. That is,
IPID = (first link number) − (last link number)
Indicated by This ensures that the same ID is assigned to the same link even between different layers.

  Specifically, it corresponds to three links in the parcel of the level 1 “Parcel ID: 1-1”, that is, three links of “IPID: 0”, “IPID: 1”, and “IPID: 2”. , “IPID: 0-2” is assigned to the link in the parcel of level 2 “PID: 2-1”. In addition, links in the parcel of level 3 “PID: 3-1” corresponding to a plurality of links in the parcel of level 2 “PID: 2-1” are assigned “IPID: 0-100”. ing.

  Next, an example of updating link data when a link is added will be described. FIG. 7 shows an example when a new road (new link) is added in the area of FIG. Specifically, a new link is added in the middle of the link of “IPID: 3” in the parcel of “PID: 1-1” of level 1 in FIG. Hereinafter, a description will be given with reference to FIGS. 6 and 7.

  In this case, for level 1, the link of “IPID: 3” in FIG. 6 before update is divided into two links of “IPID: 3” and “IPID: 4” in FIG. 7 after update. In addition, the link of “IPID: 4” before update is changed to “IPID: 5”. However, in parcels other than level 1 "PID: 1-1" parcels to which links have been added, it is not necessary to change the parcel ID. This is because the intra-parcel ID is set independently for each parcel, and the addition of a link in one parcel does not affect the intra-parcel ID in another parcel.

  Further, in FIG. 6 before the update, the offset of the parcel of the level 1 “PID: 1-2” is “45”, but in FIG. 7 after the update, the offset of the parcel is “46”. This is because one new link is added in the parcel of “PID: 1-1” preceding this parcel. That is, as described above, the offset indicates the order (serial number) of the first link in the parcel with reference to the starting point of the road. Therefore, if the link increases by one in the preceding parcel, The offset of all subsequent parcels that the road passes will increase by one.

  Next, regarding Level 2, “IPID: 3-9” including the additional link is changed to “IPID: 3-10” in the parcel of “PID: 2−1”. In addition, the IDs in the parcels of all subsequent links are also incremented by 1 respectively for the “first link number” and the “last link number”. That is, the IPIDs of the subsequent links in the parcel are all shifted by one, and “IPID: 30-45” is changed to “IPID: 31-46” and “IPID: 101-105” is changed to “IPID: 102-106”. , Each changed.

  Further, for the parcel of “PID: 2-2” following the parcel of “PID: 2-1” including the additional link, the offset is changed from “OFST: 106” to “OFST: 107”. Further, the offset is similarly increased by 1 for all subsequent parcels.

  Next, regarding level 3, the link “IPID = 0-100” including the additional link is changed to “IPID = 0-101”, and the intra-parcel IDs of all subsequent links are also changed to “the first link's ID”. The “number” and “last link number” are each incremented by one. The IPIDs of the subsequent links in the parcel are all shifted by 1 so that “IPID: 101-200” becomes “IPID: 102-201”, “IPID: 201-300” becomes “IPID: 202-301”, respectively. Be changed.

  As described above, in this embodiment, the link ID is indicated by “road ID + offset + in-parcel ID”. Therefore, when adding one new link for a certain road, Only update processing is required.

  (A) In the parcel to which a new link is added, the intra-parcel IDs of all links located behind the new link on the road are increased by one.

  (B) The offset is increased by 1 for all parcels located behind the parcel to which the new link is added among the plurality of parcels through which the road passes.

  It should be noted that “backward” in the following description means a method of going to the back, that is, the end point in the order from the start point of a certain road.

  As described above, in this embodiment, the link ID is indicated by “road ID + offset + in-parcel ID”, and the in-parcel ID is independently assigned to each parcel. Thereby, in the parcels other than the parcel to which the new link is added, it is only necessary to increase the offset by one, and it is not necessary to change the intra-parcel ID. In addition, the number of digits in the parcel ID can be reduced as compared with the case where link IDs are assigned by serial numbers to all links without introducing an offset, thereby reducing the overall data amount. be able to.

[Navigation device]
FIG. 8 shows a configuration of the navigation apparatus 100 according to the embodiment of the present invention. As shown in FIG. 8, the navigation device 100 includes a self-supporting positioning device 10, a GPS receiver 18, a system controller 20, a disk drive 31, a data storage unit 36, a communication interface 37, a communication device 38, a display unit 40, a voice output. A unit 50 and an input device 60 are provided.

  The autonomous positioning device 10 includes an acceleration sensor 11, an angular velocity sensor 12, and a distance sensor 13. The acceleration sensor 11 is made of, for example, a piezoelectric element, detects vehicle acceleration, and outputs acceleration data. The angular velocity sensor 12 is composed of, for example, a vibrating gyroscope, detects the angular velocity of the vehicle when the direction of the vehicle is changed, and outputs angular velocity data and relative azimuth data. The distance sensor 13 measures a vehicle speed pulse composed of a pulse signal generated with the rotation of the vehicle wheel.

  The GPS receiver 18 receives radio waves 19 carrying downlink data including positioning data from a plurality of GPS satellites. The positioning data is used to detect the absolute position of the vehicle from latitude and longitude information.

  The system controller 20 includes an interface 21, a CPU (Central Processing Unit) 22, a ROM (Read Only Memory) 23, and a RAM (Random Access Memory) 24, and controls the entire navigation apparatus 200.

  The interface 21 performs an interface operation with the acceleration sensor 11, the angular velocity sensor 12, the distance sensor 13, and the GPS receiver 18. From these, vehicle speed pulses, acceleration data, relative azimuth data, angular velocity data, GPS positioning data, absolute azimuth data, and the like are input to the system controller 20. The CPU 22 controls the entire system controller 20. The ROM 23 includes a nonvolatile memory (not shown) in which a control program for controlling the system controller 20 is stored. The RAM 24 stores various data such as route data preset by the user via the input device 60 so as to be readable, and provides a working area to the CPU 22.

  A system controller 20, a disk drive 31 such as a CD-ROM drive or a DVD-ROM drive, a data storage unit 36, a communication interface 37, a display unit 40, an audio output unit 50, and an input device 60 are mutually connected via a bus line 30. It is connected to the.

  The disk drive 31 reads and outputs content data such as music data and video data from a disk 33 such as a CD or DVD under the control of the system controller 20. The disk drive 31 may be either a CD-ROM drive or a DVD-ROM drive, or may be a CD and DVD compatible drive.

  The data storage unit 36 is composed of, for example, an HDD and stores various data used for navigation processing such as map data and facility data.

  The communication device 38 includes, for example, an FM tuner, a beacon receiver, a mobile phone, a dedicated communication card, and the like, and traffic congestion and traffic information distributed from a VICS (Vehicle Information Communication System) center via the communication interface 37. Receive road traffic information and other information.

  The display unit 40 displays various display data on a display device such as a display under the control of the system controller 20. Specifically, the system controller 20 reads map data from the data storage unit 36. The display unit 40 displays the map data read from the data storage unit 36 by the system controller 20 on a display screen such as a display. The display unit 40 includes a graphic controller 41 that controls the entire display unit 40 based on control data sent from the CPU 22 via the bus line 30 and image information that can be displayed immediately, such as a VRAM (Video RAM). A buffer memory 42 that temporarily stores, a display control unit 43 that controls display of a display 44 such as a liquid crystal display or a CRT (Cathode Ray Tube) based on image data output from the graphic controller 41, and a display 44 are provided. . The display 44 is composed of, for example, a liquid crystal display device having a diagonal of about 5 to 10 inches, and is mounted near the front panel in the vehicle.

  The audio output unit 50 performs D / A (Digital to Analog) conversion of audio digital data sent from the CD-ROM drive 31, DVD-ROM 32, RAM 24, or the like via the bus line 30 under the control of the system controller 20. A D / A converter 51 to perform, an amplifier (AMP) 52 that amplifies the audio analog signal output from the D / A converter 51, and a speaker 53 that converts the amplified audio analog signal into sound and outputs the sound into the vehicle. It is prepared for.

  The input device 60 includes keys, switches, buttons, a remote controller, a voice input device, and the like for inputting various commands and data. The input device 60 is disposed around the front panel and the display 44 of the main body of the in-vehicle electronic system mounted in the vehicle. When the display 44 is a touch panel system, the touch panel provided on the display screen of the display 44 also functions as the input device 60.

  The CPU 22 functions as an updating unit in the present invention by executing a map data update program stored in advance in the ROM 23 or the like. Further, the map data illustrated in FIG. 1 is stored in a data storage unit 36 as a storage unit.

[Data update processing]
Next, data update processing accompanying the addition of a link will be described.

  First, link data update information will be described. FIG. 9A shows the format of link data update information. The link data update information is information prepared when one new link is added to a plurality of links constituting a road. In the data update process described later, data update associated with addition of a new link is executed based on the link data update information.

  As shown in FIG. 9A, the link data update information includes additional link information, deletion link information, and change link information. The additional link information includes a parcel ID, road ID, offset, parcel ID, and link attribute for the new link to be added. The deleted link information includes a road ID, an offset, and an intra-parcel ID of a link that is deleted as a new link is added. The changed link information includes an intra-parcel ID and a link attribute that are changed with the addition of a new link.

  FIG. 9B shows an example (level 1) of link data update information corresponding to the example of adding a new link described with reference to FIG. 6 and FIG. As shown in FIG. 7, in this example, a new link is added to the link of “IPID: 3” in the parcel of “PID: 1-1” of level 1. As a result, the link of “IPID: 3” was divided into the links of “IPID: 3” and “IPID: 4”, and the link of “IPID: 4” was changed to the link of “IPID: 5”.

  In this example, as shown in FIGS. 7 and 9B, the parcel ID in the additional link information is “1-1”, the road ID is “0”, and the offset is “40”. Further, since the new link is added to the link of “IPID: 3”, the parcel ID in the additional link information is “3”.

  As a new link is added, the link of “IPID: 3” before addition is deleted, so the road ID in the deleted link information is “0”, the offset is “40”, and the parcel ID is “3”. . In addition, since the original “IPID: 3” link is deleted and new “IPID: 3” and “IPID: 4” links are added instead, the changed link information 1 and 2 The parcel IDs are “3” and “4”, respectively.

  Examples of level 2 and level 3 link data update information are shown in FIGS. 9 (C) and 9 (D).

  Next, data update processing will be described. FIG. 10 shows a flowchart of the data update process. In this embodiment, when the CPU 22 executes the map data update program, the navigation device 100 operates as a map data update device and executes data update processing. Specifically, the map data update program for executing the map data is executed on the navigation device, and the link data update information is input to update the map data stored in the navigation device. It can be performed.

  It is assumed that the link data update information illustrated in FIGS. 9B to 9D is prepared in advance as a premise for executing the data update process. Note that the flowchart shown in FIG. 10 corresponds to one level of map data. In the present embodiment, since the map data is composed of three levels, the data update process is executed individually for each level based on the link data update information of each level.

  First, the CPU 22 reads the corresponding parcel with reference to the additional link information in the prepared link data update information (step S10), and deletes the link to be deleted from the original data with reference to the deletion link information. (Step S11). By this step, in the example of FIGS. 6 and 7, the link of “IPID: 3” in the original data shown in FIG. 6 is deleted.

  Next, the CPU 22 refers to the added link information and the changed link information, and adds the new link and the changed link to the original data (step S12). With this process, in the previous example, new links of “IPID: 3” and “IPID: 4” are created.

  Next, the CPU 22 rewrites the intra-parcel ID of the subsequent link in the parcel (that is, increments the intra-parcel ID by 1) (step S13). Thereby, in the previous example, the link of “IPID: 4” in FIG. 6 is rewritten to “IPID: 5”.

  Next, the CPU 22 determines whether or not the link to be processed has reached the end of the road. If the link has reached the end of the road (step S14; Yes), the data update process is terminated. On the other hand, if the end of the road has not been reached (step S14; No), it is determined whether or not the link to be processed has reached the parcel boundary (step S15). In this way, step S13 is repeated until the boundary of the parcel to which a new link is to be added, and the intra-parcel IDs of all links existing after the new link are incremented by one.

  When the intra-parcel IDs of all subsequent links in the parcel are rewritten and the link to be processed reaches the boundary of the parcel (step S15; Yes), the CPU 22 reads the subsequent parcel (step S16), and the parcel Are rewritten (ie, incremented by 1) (step S17). The CPU 22 repeats the processes of steps S16 and S17 until the end of the road is found in the parcel (step S18; Yes). This completes offset rewriting for all parcels located behind the parcel to which new links are added.

  As described above, in the data update process, first, in the parcel to which a new link is to be added, a new link is added, and the parcel IDs of all links located behind the new link addition position are set one by one. increase. Furthermore, the offset is increased by 1 for all parcels behind the parcel to which a new link is to be added. As described above, in this embodiment, even if a new link is added, in the parcel other than the parcel to which the new link belongs, it is only necessary to update the offset, and it is not necessary to update the intra-parcel ID. Is greatly reduced.

[Modification]
In the above embodiment, the map data update device of the present invention is applied to a navigation device. However, the present invention can also be executed in a terminal device such as a PC that handles map data. For example, as shown in FIG. 10, the map data update program and the link data update information are downloaded from the server 101 to the terminal device 150 such as a PC or the navigation device 100 via the network 105, and executed, thereby executing the terminal device 150 or the navigation. The map data in the device can be updated.

  In the description of the data update process, link data update information is prepared for each level of map data, and the data update process is executed for each level. As another method, link data update information is prepared for the lowest level and data update processing is performed. For the higher level, link data update information is not prepared, and the link data after the lowest level data update is performed. It is also possible to update based on

  In the above embodiment, one offset is set for each parcel. However, when the number of links included in one parcel is large, one parcel may be divided into a plurality of sub-parcels, and a sub-offset may be set for each sub-parcel. That is, the parcel ID may be expressed as “suboffset + subparcel ID” in units of subparcels.

  In the above embodiment, in the map data corresponding to a layer other than the lowest layer, the in-parcel ID corresponding to the specific link is the first of the plurality of in-parcel IDs corresponding to the link in the lowest layer. And the last ID in the parcel. For example, the link of link 2 corresponding to the links “IPID: 10” to “IPID: 15” in the lowest layer 1 is expressed as “IPID: 10-15”. Instead, it may be indicated by the first parcel ID in the lowest layer and the difference between the first and last parcel ID. For example, the above example may be expressed as “IPID: 10 (first in-parcel ID) +5 (difference)”.

  In the above embodiment, as shown in FIG. 5, all intra-parcel IDs are stored as link data. Instead, when the parcel ID is not stored and the parcel ID is required, the intraparcel ID may be obtained by counting the number of links from the head of each parcel.

  In the example of FIG. 5, the offset is stored for each parcel, but instead, the offset corresponding to one road may be configured separately as offset data independent of the data of each parcel. . In this way, in the data update process for adding a new link, the offset rewriting process for a plurality of parcels may be executed for the offset data, so that the processing time can be shortened. Alternatively, instead of rewriting independent offset data, a system in which partial or whole replacement is performed may be used.

  Furthermore, if a margin is provided in advance in the offset, it is not necessary to rewrite the offset, so that adjacent parcels are not affected at all, and processing for adjacent parcels can be made unnecessary.

  In the above embodiment, the road ID and the offset are separate data, but the road ID and the offset may be integrated data.

  The present invention can be applied to various terminal devices that store and use map data. Specifically, in addition to a car navigation device, map data downloaded from a server on the web can be stored in an HDD or the like and applied to a terminal device or the like that is used.

Claims (5)

Link data indicating a link corresponding to a road, node data indicating a node corresponding to a predetermined point on the road, and a parcel ID indicating a parcel, wherein the link data includes a road ID indicating a road, Storage that stores map data including a link ID including an offset indicating the order of the top links in the parcel with respect to the start point of the road and an intra-parcel ID indicating the order of each link in the parcel in the storage unit Means,
When adding a new link on a specific road in a specific parcel, the ID in the parcel after the new link in the specific parcel is updated, and includes the specific road and includes the specific parcel. Updating means for updating the offset of the parcel existing thereafter ,
The map data is prepared for each of a plurality of layers corresponding to different scales,
In the plurality of layers, the same intra-parcel ID is attached to the same link,
In map data corresponding to layers other than the lowest layer, the parcel ID corresponding to a specific link is the first and last parcel ID among a plurality of parcel IDs corresponding to the link in the lowest layer. Or by the difference between the first parcel ID and the last parcel ID,
The map data updating apparatus , wherein the updating unit updates each layer and increases the first and last parcel IDs for layers other than the lowest layer .   The map data updating apparatus according to claim 1, wherein the updating unit increases the ID in the parcel and the offset. Link data indicating a link corresponding to a road, node data indicating a node corresponding to a predetermined point on the road, and the link data includes a road ID indicating a road, a parcel ID indicating a parcel, and A storage step of storing map data including an offset indicating the order of the first link in the parcel with respect to the start point of the road and an ID in the parcel indicating the order of each link in the parcel in the storage unit;
When adding a new link on a specific road in a specific parcel, the ID in the parcel after the new link in the specific parcel is updated, and includes the specific road and includes the specific parcel. An update process for updating the offset of a parcel existing thereafter ,
The map data is prepared for each of a plurality of layers corresponding to different scales,
In the plurality of layers, the same intra-parcel ID is attached to the same link,
In map data corresponding to layers other than the lowest layer, the parcel ID corresponding to a specific link is the first and last parcel ID among a plurality of parcel IDs corresponding to the link in the lowest layer. Or by the difference between the first parcel ID and the last parcel ID,
The update process updates the map data for each layer, and increases the first and last parcel IDs for layers other than the lowest layer . A map data update program executed in a terminal device including a storage unit and a computer,
Link data indicating a link corresponding to a road; node data indicating a node corresponding to a predetermined point on the road; and the link data includes a road ID indicating a road, a parcel ID indicating a parcel, Storage means for storing, in the storage unit, map data including an offset indicating the order of the top links in the parcel with respect to the start point of the road, and an intra-parcel ID indicating the order of each link in the parcel;
When adding a new link on a specific road in a specific parcel, the ID in the parcel after the new link in the specific parcel is updated, and includes the specific road and includes the specific parcel. The computer functions as an update means for updating an offset of a parcel existing thereafter ,
The map data is prepared for each of a plurality of layers corresponding to different scales,
In the plurality of layers, the same intra-parcel ID is attached to the same link,
In map data corresponding to layers other than the lowest layer, the parcel ID corresponding to a specific link is the first and last parcel ID among a plurality of parcel IDs corresponding to the link in the lowest layer. Or by the difference between the first parcel ID and the last parcel ID,
The update means updates the map for each layer and increases the first and last parcel IDs for layers other than the lowest layer . A storage medium storing the map data update program according to claim 4 .

Images