WO2008047448A1

WO2008047448A1 - Map data updating device, map data updating method, map data updating program, and recording medium

Info

Publication number: WO2008047448A1
Application number: PCT/JP2006/320939
Authority: WO
Inventors: Ippei Nambata
Original assignee: Pioneer Corporation
Priority date: 2006-10-20
Filing date: 2006-10-20
Publication date: 2008-04-24
Also published as: JPWO2008047448A1; JP4927860B2

Abstract

A map data updating device updates map data in compliance with addition of a link included in map data or the like. The map data include link data indicative of links corresponding to roads, node data indicative of nodes corresponding to predetermined places on the roads, and parcel ID's indicative of parcels. Further, the link data include link ID's comprised of road ID's indicative of roads, offsets indicative of orders of heading links in the parcels with reference to the start of roads, and in-parcel ID's indicative of an order of each link in the parcel. When a new link is added to a specific road in a specific parcel, in-parcel ID's from a link subsequent to the new link in the parcel are updated. Offsets including the road and parcels subsequent to the parcel including the road are updated.

Description

Specification

MAP DATA UPDATE DEVICE, MAP DATA UPDATE METHOD, MAP DATA UPDATE PROGRAM, AND STORAGE MEDIUM

Technical field

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

Background art

[0002] In general, map data used in a car navigation device or the like 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.

[0003] In a commonly used system, 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 on a certain road, it is necessary to update the link IDs of all links existing after that new link, and a huge amount of processing is required to update the map data. Required. In addition, if the same link ID is assigned to the same link in multiple layers that make up the map data, the above update process is required in all layers.

[0004] From this point of view, Patent Document 1 proposes a method for giving a link ID to each link with a margin in advance. However, with this method, multiple link IDs are assigned to one link as much margin as possible, and the number of link IDs used increases. Therefore, the data amount of the entire link data increases. In addition, if the number of digits in the link ID is increased, the link ID may be insufficient when the number of links increases.

Patent Document 1: Japanese Patent Application Laid-Open No. 2002-175593

Disclosure of the invention

Problems to be solved by the invention

[0006] Examples of problems to be solved by the present invention include the above. This invention makes it a subject to reduce the update processing amount of the map data at the time of link addition. Means for solving the problem [0007] The invention of claim 1 is a map data updating device, wherein 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 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 the order of each link in the parcel. Storage means for storing in the storage unit map data including a link ID composed of an intra-parcel ID indicating a specific parcel when adding a new link on a specific road in the specific parcel. Update the intra-parcel ID after the new link, and include the offset of the parcel that includes the specific road and exists after the specific parcel. And new updating means, characterized in that it comprises a.

[0008] The invention according to claim 5 is a map data updating method, comprising link data indicating a link corresponding to a road, and node data indicating a node corresponding to a predetermined point on the road, The link data force 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 a parcel indicating the order of each link in the parcel A storage step of storing map data including the internal ID in the storage unit, and when a new link is added on a specific road in the specific parcel, in the parcel after the new link in the specific parcel And an updating process for updating an ID and updating an offset of a parcel that includes the specific road and exists after the specific parcel. And wherein the Rukoto.

[0009] The invention described in claim 6 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 predetermined data on the road. Node data indicating a node corresponding to a point, and the link data indicates a road ID indicating a road, a parcel ID indicating a parcel, and an order of the first link in the parcel with reference to the start point of the road. Storage means for storing map data including an offset and an ID in the parcel indicating the order of each link in the parcel in the storage unit, and when adding a new link on a specific road in the specific parcel In the parcel after the new link in the specific parcel In addition to updating the ID, the computer is caused to function as an update means for updating an offset of a parcel that includes the specific road and exists after the specific parcel.

The invention according to claim 8 is a storage medium, and is 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 a parcel indicating the order of each link in the parcel. It is characterized by memorizing map data including link IDs composed of IDs.

Brief Description of Drawings

FIG. 1 schematically shows the configuration of map data used in an embodiment of the present invention.

[Figure 2] Shows an example of the structure of route calculation data.

[Figure 3] Shows an example of the structure of link data.

FIG. 4 is a diagram illustrating links and nodes.

[Figure 5] An example of the data structure of link data is shown.

[Figure 6] An example of link data before adding a new link is shown.

[Figure 7] An example of link data after adding a new link is shown.

FIG. 8 is a block diagram showing a configuration of a navigation device according to an embodiment.

[Figure 9] Shows an example of the data structure of link data update information.

FIG. 10 is a flowchart of data update processing for adding a new link.

FIG. 11 shows an example of a map data update system to which the present invention is applied.

Explanation of symbols

[0012] 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

BEST MODE FOR CARRYING OUT THE INVENTION

[0013] 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 includes 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 in-parcel indicating the order of each link in the parcel. Storage means for storing map data including a link ID composed of an ID in a storage unit, and when adding a new link on a specific road in a specific parcel, the new link in the specific parcel Update the parcel ID after that, and update the offset of the parcel that includes the specific road and exists after the specific parcel. Obtain Bei and update means.

The map data update device updates map data in response to addition of a link included in 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 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. Contains a link ID consisting of 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 that includes the road and exists after the parcel that includes the road is updated.

[0015] According to the map data update device described above, when a new link is added, in the parcel other than the parcel to which the new link is added, each link in the parcel may be changed by changing only the offset. It is not necessary to change the parcel ID corresponding to. Therefore, the burden of the map data update process can be reduced. In the preferred example, the new link is 1 When the number is increased, the updating unit increases the ID in the parcel and the offset by one each.

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 of the layers.

[0017] In another aspect of the map data updating device described above, the same intra-parcel ID is assigned to the same link in the plurality of layers, and the layers other than the lowest layer are supported. In the map data, the ID in the parcel corresponding to the specific link is determined by the first and last ID in the parcel corresponding to the specific link in the lowest layer, or the first ID in the parcel. This is indicated by the difference between the parcel ID and the last parcel ID, and the updating 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.

[0018] 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. The 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 a parcel indicating the order of each link in the parcel. A storage step of storing the map data including the internal ID in the storage unit, and when adding a new link on the specific road in the specific parcel, the ID in the parcel after the new link in the specific parcel And updating an offset of a parcel that includes the specific road and that exists after the specific parcel.

[0019] According to this method, when a new link is added, in the parcel other than the parcel to which the new link is added, the parcel corresponding to each link in the parcel can be changed by changing only the offset. Since it is not necessary to change the ID, the burden of the map data update process can be reduced.

[0020] 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 link data indicating a link corresponding to a road, 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 head in the parcel with reference to the start point of the road. Storage means for storing map data including an offset indicating the order of links and an intra-parcel ID indicating the order of each link in the parcel in the storage unit, and on a specific road in the specific parcel When a new link is added, the ID in the parcel after the new link in the specific parcel is updated, and the offset of the parcel that includes the specific road and exists after the specific parcel is calculated. The computer is caused to function as an update means for updating. By executing this program by a computer, the above map data updating apparatus can be realized. Further, this map data update program can be suitably handled in a state stored in a storage medium.

[0021] In another aspect of the present invention, including 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 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. There is provided a storage medium characterized by storing map data including.

Example

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

[0023] [Map data]

FIG. 1 schematically shows the structure 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 exemplifies map data of three layers for convenience of explanation, the map data may have a larger number of layer structures. In each layer, one unit of map data is called “Parcel! ³ ”. “Parcel” is a concept indicating a geographically wide range, and can also be expressed as “block”, “mesh”, or the like. In Figure 1, layer 3 is the top 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 divided by an intersection, etc., and 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. 4 (A) includes a plurality of nodes and links as shown in FIG. 4 (B). In FIG. 4B, each node is indicated by a node ID (such as N00001) and each link is indicated by a link ID (such as LOOOO 1).

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

[0028] A road ID (RID) is assigned to the road. Figure 3 shows a road with a road ID of “5015”. One road passes through several parcels. Within each parcel, an offset (OFST) is assigned. The offset indicates the order of the top links in each parcel with the starting point of the road as a reference. In other words, the offset indicates the starting link force in each parcel, and the number of links corresponding to the starting point of the road. The “first link” refers to the 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 with “Parcel ID: 1” is “7833”. This indicates that the top link in the parcel is the 7833th link, including 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 to each parcel independently. Multiple links included in each parcel are given “0”, “1”, .. in-parcel IDs in the order of the direction force close to the starting point of the road.

[0030] Thus, in this embodiment, the link ID indicating each link of the road is indicated as follows.

[0031] Link ID = Road ID + Offset + Parcel ID (1)

In other words, the number of the link counted from the starting point of the road is indicated by “offset + ID in parcel” that is not the serial number set in order of 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.

[0032] Specifically explaining the example of Fig. 3, the offset of the parcel of "PID: 1" is "7833" means that the number of start points of the road is counted and 7832 pieces of parcels are reached by the parcel. Indicates that a link exists. The first link in the parcel with “PID: 1” is assigned “ID in parcel (IPID): 0”, and the next link is assigned “IPID: 1”. That is, these links are the 7833th and 7834th (= 7833 + 1) th links, respectively, including 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 this parcel, and “IPID: 0” is assigned to that link. Therefore, this link is the 7835th link including 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, each with “IPID: 0”, “IPID: 1”, and “IPID: 2”. Thus, each link is the 7836th, 7837 (= 7836 + 1) th, and 7838 (= 7836 + 2) th links, counting the starting point of the road.

[0035] In this way, even if each link is indicated by “offset + parcel ID” that is not the serial number of the starting point force of the road, each link is unique while maintaining the order from the starting point of the road. Can be indicated by a simple link ID.

FIG. 5 shows an example of the data structure of link data. Figure 5 shows a link for a parcel. It is an example of data. In FIG. 5, the parcel ID is the ID of the parcel. Each road ID is an ID of an individual road passing through the parcel. For each road, an offset, link attributes, and multiple parcel IDs are set. As described above, the “offset” indicates the head link order (serial number) of each road in the parcel based on 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 type of the same road is the same. “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 a link on a 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, level 3 shows a parcel of “PID: 3-1”. Also, the power corresponding to a part of them is a parcel of level 2 “PID: 2-1”, and a part of that is a parcel of level 1 “PID: 1—1”. The

[0038] The ID in the parcel (IPID) of the lowest layer is indicated by a single number such as 0, 1, 2,. 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 the multiple 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.

[0039] Specifically, three links within the parcel of level 1 “Parcel ID: 1—1”, ie, “IPID: 0”, “IPID: 1” and “IPID: 2” The link in the parcel of Level 2 “P ID: 2-1” corresponding to “IPID: 0—2” is assigned. Also, links in the level 3 “PID: 3 1” parcel that correspond to multiple links in the level 2 “PID: 2—1” parcel are assigned ΓΐΡΙϋ: 0—100! RU Next, an example of updating link data when a link is added will be described. FIG. 7 shows an example in which 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 FIG. 6 and FIG.

[0041] In this case, for Level 1, the link of "IPID: 3" in Fig. 6 before the update is divided into two links of "IPID: 3" and "IPID: 4" in Fig. 7 after the update. Is done. The link of “IPID: 4” before update is changed to “IPID: 5”. However, for 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, so adding a link in one parcel does not affect the parcel ID in another parcel.

[0042] Further, in FIG. 6 before the update, the offset of the parcel of the level 1 “PID: 1-2” is “45”. In FIG. 7 after the update, the offset of the parcel is “46”. . This is because a new link was added in the “PID: 1-1” parcel 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.

[0043] Next, regarding level 2, an additional link is included in the parcel of "PID: 2-1"

ΓΐΡΙϋ: 3-9 ”is changed to“ IPID: 3-10 ”. In addition, the IDs in the parcels of all the links that follow are incremented by 1 for the “first link number” and “last link number” respectively. In other words, the IPIDs of the subsequent links in the parcel are all shifted by 1 so that “IPID: 30-45” becomes ΓΐΡΙϋ: 31-46, “IPID: 101-105” becomes “IPID: 102-106”, Each is changed.

[0044] For the "PID: 2-2" parcel that follows the "PID: 2-1" parcel including the additional link, the offset is changed from "OFST: 106" to "OFST: 107". In addition, all subsequent parcels are similarly incremented by one.

[0045] Next, for level 3, the link "IPID = 0—100" with additional links "IPID = 0 — In addition to changing to “101”, the IDs in the parcels of all subsequent links are also incremented by “first link number” and “last link number”, respectively. The IPIDs of the subsequent links in the parcel are all shifted by 1, and ΓΐΡΐϋ: 101-200 is changed to “IPID: 102—201” and “IPID: 201-300” is changed to “IPID: 202—301”. Is done.

In this way, in this embodiment, the link ID is indicated by “road ID + offset + in-parcel ID”. Therefore, when one new link is added to a road, the link of each level Only the following update process is required for the data.

[0047] (A) In the parcel to which a new link is added, the ID in the parcel of all links located behind the new link on the road is incremented by one.

[0048] (B) The offset is increased by 1 for all parcels that are located behind the parcel to which the new link is added, among the parcels that the road passes.

It should be noted that “backward” in the following description means a direction force method toward the rear, 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 assigned independently in units of parcels. As a result, for parcels other than the parcel to which a new link is added, it is only necessary to increase the offset by one, and no change in the parcel ID is required. In addition, the number of digits in the parcel ID can be reduced compared with the case where link IDs are assigned serially to all links without introducing an offset, resulting in a reduction in the overall data volume. can do.

[0051] [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, An audio output unit 50 and an input device 60 are provided.

The independent 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 the acceleration of the vehicle, and outputs acceleration data. The angular velocity sensor 12 also has a vibration gyro force, for example, detects the angular velocity of the vehicle when the vehicle changes direction, and outputs angular velocity data and relative bearing data. The The distance sensor 13 measures a vehicle speed pulse having a pulse signal force that is generated as the vehicle wheel rotates.

[0053] 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 device 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 bearing data, angular velocity data, GPS positioning data, absolute bearing 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 set in advance by the user via the input device 60 so as to be readable, and provides a working area to the CPU 22.

[0056] System controller 20, disk drive 31 such as CD-ROM drive or DVD-ROM drive, data storage unit 36, communication interface 37, display unit 40, audio output unit 50 and input device 60 are bus lines 30 They are connected to each other via.

The disc drive 31 reads out and outputs content data such as music data and video data from the disc 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.

[0058] 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.

[0059] The communication device 38 is, for example, an FM tuner, a beacon receiver, a mobile phone, or a dedicated communication device. It consists of communication cards, etc., and receives traffic information such as traffic congestion and traffic information distributed from the VICS (Vehicle Information Communication System) center and other information via the communication interface 37.

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 display memory 43 that temporarily stores data, a display controller 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, for example, a liquid crystal display device having a diagonal angle of about 5 to 10 inches and is mounted near the front panel in the vehicle.

[0061] The audio output unit 50 is a digital to analog (DZA) of audio digital data sent from the CD-ROM drive 31 or DVD-ROM 32 or RAM 24 via the bus line 30 under the control of the system controller 20. A DZA converter 51 that performs conversion, an amplifier (AMP) 52 that amplifies the audio analog signal output from the Ό / 51 converter 51, and a speaker 53 that converts the amplified audio analog signal into audio and outputs it to the vehicle. It is configured with.

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 arranged 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.

Note that the CPU 22 functions as the updating means 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 the data storage unit 36 as a storage unit. [0064] [Data update process]

Next, data update processing accompanying link tracking will be described.

First, link data update information will be described. Figure 9 (A) shows the format of link data update information. The link data update information is information that is prepared when one new link is added to a plurality of links constituting a road. The data update process described later executes data update accompanying the tracking of a new link based on this 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 the parcel ID, road, offset, parcel ID and link attribute for the new link to be added. The deleted link information includes the road ID, offset, and parcel ID of the link that will be deleted when the new link is added. The changed link information includes an intra-parcel ID and a link attribute that are changed as a new link is added.

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 FIGS. 6 and 7. As shown in Figure 7, in this example, a new link was added to the link of “IPID: 3” in the parcel of level 1 “PID: 1—1”. As a result, is divided into link: "4 0 ³ 10":: link "0 ³ 10 3" is "0 ³ 10 3" and link:: "5 IPID" link "IPID 4" is changed.

In this example, as shown in FIGS. 7 and 9B, the parcel ID in the additional link information is “1”.

The road ID is “0” and the offset is “40”. In addition, since the new link is added to the link of “IPID: 3”, the ID in the parcel in the additional link information is “3”.

[0069] Since the link of “IPID: 3” before addition is deleted as a new link is added, the road ID in the deletion link information is “0”, the offset is “40”, and the parcel ID Becomes "3". In addition, the original “IPID: 3” link will be deleted, and new “IPID: 3” and “IPID: 4” links will be added instead. 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, the data update process will be described. Figure 10 shows the flowchart of data update processing. Show. In this embodiment, when the CPU 22 executes the map data update program, the navigation device 100 operates as the map data update device and executes the data update process. Specifically, the map data update program for executing the above map data is executed on the navigation device, and the link data update information described above is input, so that it is stored in the navigation device. Map data can be updated.

[0072] It is assumed that the link data update information illustrated in FIGS. 9 (B) to 9 (D) is prepared in advance as a premise for executing the data update process. The flowchart shown in FIG. 10 corresponds to one level of map data. In this 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.

[0073] 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 refers to the deletion link information to generate a link to be deleted. Delete from data (step Sl l). Through this process, in the example of FIGS. 6 and 7, the link “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). Through this process, new links of “I PID: 3” and “IPID: 4” are created in the previous example.

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). As a result, in the previous example, the “IPID: 4” link in FIG. 6 is rewritten to “IPID: 5”.

[0076] 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 road has not reached the end of the road (step S14; No), it is determined whether or not the link to be processed has reached the boundary of the parcel (step S15). In this way, step S13 is repeated until reaching the boundary of the parcel to which a new link is added, and the intra-parcel IDs of all links existing after the new link are incremented by one.

[0077] When the intra-parcel IDs of all subsequent links in the parcel are rewritten and the link to be processed reaches the parcel boundary (step S15; Yes), the CPU 22 proceeds to the subsequent parcel. (Step S16) and rewrite the offset of the parcel (ie, increment it 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 the offset rewriting for all parcels located behind the parcel targeted for the new link follow-up.

[0078] 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 all the positions that are located behind the new link addition position are first added. Increase the parcel ID of the link by 1. In addition, the offset is increased by 1 for all parcels behind the target parcel for the new link. Thus, in this example, even if a new link is added, it is sufficient to update only the offset in the parcel other than the parcel to which the new link belongs, and it is not necessary to update the ID in the parcel. The amount of data update processing is greatly reduced.

[0079] [Modification]

In the above embodiment, the map data update device of the present invention is applied to a navigation device. The present invention can also be implemented in a terminal device such as a PC that handles map data. For example, as shown in FIG. 10, by downloading and executing the map data update program and link data update information from the server 101 to the terminal device 150 such as a PC or the navigation device 100 via the network 105, the terminal device 150 Map data in the navigation system can be updated.

[0080] 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 at the lowest level and data update processing is performed. For higher levels, link data update information is not prepared and the lowest level is prepared. It is also possible to update based on the link data after the data update.

[0081] 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. In other words, the parcel ID is expressed as “sub-offset + sub-parcel ID” in sub-parcel units. It is good as a thing.

[0082] In the above embodiment, in the map data corresponding to a layer other than the lowest layer, the intra-parcel ID corresponding to the specific link is a plurality of intra-parcel IDs corresponding to the link in the lowest layer. Of these, the first and last parcel ID are indicated. For example, the link 2 link corresponding to the links “0 ³ 10:10” to “0 ³ 10:15” going to 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 “1-10: 10 (in the first parcel 10) +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 parcel ID may be obtained by counting the number of links from the head of each parcel.

Further, in the example of FIG. 5, the force storing the offset for each parcel, instead, the offset corresponding to one road is separated as offset data independent of the data of each parcel. It may be configured. In this way, in the data update process for adding the new link, the offset rewrite process for the plurality of parcels only needs to be performed on the offset data, so that the processing time can be shortened. it can. Alternatively, a system may be used in which the offset data is replaced partially or entirely instead of rewriting independent offset data.

Furthermore, if a margin is provided in advance for offset, rewriting of offset becomes unnecessary, so that adjacent parcels are not affected at all, and processing for adjacent parcels can be made unnecessary.

[0086] In the above embodiment, the road ID and the offset are separate data. The road ID and the offset may be integrated data! /.

Industrial applicability

The present invention can be applied to various terminal devices that store and use map data. Specifically, it was downloaded from a server on the web in addition to the car navigation system. Map data is stored in HDD etc. and can be applied to terminal devices.

Claims

The scope of the claims

[1] 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 Map data including a link ID including an offset indicating the order of the first link in the parcel with respect to the starting point of the road and an ID in the parcel indicating the order of each link in the parcel in the storage unit. 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 specific parcel is updated, and the specific road is included. And updating means for updating an offset of a parcel existing after the specific parcel. New equipment.

[2] The updating means increases the ID in the parcel and the offset respectively! The map data updating device according to claim 1, wherein

[3] The map data is prepared for each of a plurality of layers corresponding to different scales.

2. The map data updating apparatus according to claim 1, wherein the updating unit updates each layer.

[4] In the plurality of layers, the same intra-parcel ID is assigned to the same link,

In map data corresponding to layers other than the lowest layer, the ID in the parcel corresponding to a specific link is the first and last parcel ID among the IDs in the parcel corresponding to the link in the lowest layer. Indicated by the ID or the difference between the first parcel ID and the last parcel ID,

The map data updating apparatus according to claim 3, wherein the updating means increases the first and last in-parcel IDs for layers other than the lowest layer.

[5] It includes link data indicating a link corresponding to a road and node data indicating a node corresponding to a predetermined point on the road. The link data includes a road ID indicating a road and a parcel ID indicating a parcel. And an offset indicating the order of the first link in the parcel with respect to the start point of the road, and the parcel indicating the order of each link in the parcel. A storage step of storing map data including the ID in the storage unit;

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 specific parcel is updated, and the specific road is included and includes the specific road. An update process for updating an offset of a parcel existing after the parcel, and a map data update method.

[6] A map data update program executed by a terminal device including a storage unit and a computer,

Link data indicating a link corresponding to a road, and node data 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, Storage means for storing, in the storage unit, map data including an offset indicating an order of the first link in the parcel with respect to a starting point of a road, and an intra-parcel ID indicating an order of each link in the parcel;

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 specific parcel is updated, and the specific road is included and includes the specific road. A map data update program for causing the computer to function as an update means for updating an offset of a parcel existing after the parcel.

[7] A storage medium storing the map data update program.

[8] 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. And map data including a link ID composed of 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. A storage medium characterized by