JP2003330361A - Map data updating system and map data editing system - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To eliminate the necessity of re-imparting extended attribute of a road imparted before updating even when map data is updated in the revised version or the like. <P>SOLUTION: The map data updating system is provided with an extended road data identifying section 51 for identifying, based on road attribute of old map data 1 and new map data 3, the road prescribed by old road discrimination data 21 and the road prescribed by new road discrimination data 41 to be matched, and an extended road data conversion section 52 for converting old extended road attribute data 22 as the extended attribute data of the road prescribed by the new road discrimination data 41 identified by the extended road data identification section 51. <P>COPYRIGHT: (C)2004,JPO

Description

Detailed Description of the Invention

[0001]

TECHNICAL FIELD The present invention relates to a map data updating system and a map data editing system.

[0002]

2. Description of the Related Art As a conventional vehicle navigation system, for example, there is a map editing system for a vehicle navigation system described in Japanese Patent Laid-Open No. 2001-116571. In this map editing system, the computer interprets the information of the map data and displays it as a map screen on the display unit, and when the user specifies a desired position on the map screen with a mouse or the like, the computer is displayed near the specified position. When a certain road is appropriately selected and the attribute information for the selected road is added / edited / deleted by the user, the computer is configured to reflect the change of the road attribute information in the map data.

[0003]

However, in the above-mentioned conventional map editing system, since the road attribute information changed by the user is reflected in the original map data, the attribute information is not changed after the reflection. The road cannot be distinguished. Therefore, when the original map data is updated due to version upgrade or the like, it is necessary to re-enter the road attribute information from the beginning in order to reflect the road attribute information changed by the user in the new map data.

Further, the road network data included in the map data is composed of a unit called a node representing an intersection or the like and a link representing a road connecting the nodes or the like, and an identification number for identifying each node or link is in the map. Are assigned so that they do not overlap. Some map makers practice the convention that the identification numbers of nodes and links used once in the old map are never used in the new map. For example, in the old map, "1-
If you use the number "999", the new map will show "100
We practice the convention of using numbers after "0". In the map data based on such a rule, the same node or link cannot be identified between the old and new maps by using the identification numbers of the nodes and links, so when the user updates the map data in the future, the original map data will be There was a problem that extended road data could not be converted for new map data if there was not.

Further, since road network data changes due to addition or deletion of roads, change of road shape, addition or deletion of intersections, etc., even if maps of the same map maker, the same nodes and links are used between the old and new maps. A different identification number is given to each. That is, if a node or a link is added, the identification numbers of subsequent nodes and links will be offset by the addition. In this case as well, the same node or link cannot be identified between the old and new maps using the node and link identification numbers, so when the user updates the map data in the future, if there is no original map data, the new map There was a problem that extended road data could not be converted for data.

The present invention has been made in order to solve the above problems. Even when the map data is updated due to version upgrade or the like, it is necessary to re-add the extended attribute of the road given before the update. The purpose is to obtain a map data update system that does not exist. It is another object of the present invention to obtain a map data editing system that allows a user to convert extended road data for new map data without updating the original map data when updating the map data in the future. .

[0007]

A map data update system according to the present invention identifies first storage means for storing updated new map data and roads constituting road network data included in the new map data. For storing new road identification data and new extended road attribute data for the road defined by the new road identification data, and third storage means for storing the old map data before update. Fourth storage means for storing old road identification data for identifying roads that constitute road network data included in the old map data and old extended road attribute data of the road defined by the old road identification data; An extended road identifying means for identifying a road defined by the new road identification data that matches a road defined by the old road identification data based on the road attributes of the map data and the new map data, and an old extended road Those having an expanded road data converting means for converting the attribute data as an extended attribute data of the road extended road identifying means is defined by the new road identification data identified.

The extended road identifying means in the map data updating system according to the present invention is a new road matching the road defined by the old road identification data based on the position information and the road shape in the road attributes of the old map data and the new map data. It identifies the road defined by the road identification data.

In the map data updating system according to the present invention, when the extended road identifying means cannot identify the road defined by the new road identification data which matches the road defined by the old road identification data, the existence of the unidentifiable road exists. Is further provided.

The unidentification notifying means in the map data updating system according to the present invention relaxes the identification condition and matches the old extended road attribute data when the road defined by the matching new road identification data cannot be identified. The candidate is selected from the new map data and notified.

The map data updating system according to the present invention selects the road defined by the new road identification data existing near the position of the road defined by the old road identification data based on the road attribute, and selects the selected new road. The vehicle further comprises extended road data correction means for editing the extended road attribute of the road defined by the road identification data and storing it as new extended road attribute data.

The extended road data converting means in the map data updating system according to the present invention updates the old extended road data expression form when the extended road attribute expression form is different between the new map data and the old map data. It is to be converted into a representation format of extended road data.

The map data updating system according to the present invention includes a first storage means for storing the updated new map data, and a new road identification for identifying roads constituting road network data included in the new map data. Second storage means for storing the data and new extended road attribute data of the road defined by the new road identification data, and an old road for identifying the road network data included in the old map data before update Third storage means for storing the road identification data, the old extended road attribute data of the road defined by the old road identification data, and the old road identification data for identifying the nodes and links in the old map data before updating; Based on the road attributes of the old road identification data and the road attributes of the new map data, the roads specified by the new road identification data that match the roads specified by the old road identification data are identified. And extended road identifying means for, those having an extended road data conversion means for converting the extended attribute data of the road that the old extended road attribute data expanded road identifying means is defined by the new road identification data identified.

A map data editing system according to the present invention comprises a first storage means for storing map data to be edited, a road selecting means for selecting a road constituting road network data included in the map data, and a road. Extended road data editing means for editing the extended attributes of the road selected by the selecting means, and road identification data for identifying roads constituting road network data included in the map data edited by the extended map data editing means. An extension including extended road attribute data that stores extended attributes of a road specified by the road identification data and road identification data for identifying a road in other map data that matches the road specified by the road identification data And a second storage means for storing road data.

[0015]

BEST MODE FOR CARRYING OUT THE INVENTION An embodiment of the present invention will be described below. Embodiment 1. FIG. 1 is a block diagram showing the configuration of the map data updating system according to the first embodiment. In FIG. 1, 1 is a storage device (third storage means) for storing the old map data before updating, and 2 is a storage device (fourth storage) for storing the old extended road data obtained by expanding the road attributes of the old map data. Means), 3 is a storage device for storing the updated new map data (first storage device), 4 is a storage device for storing the new extended road data obtained by expanding the road attributes of the new map data 3 (the second storage device).
Storage means 5), 5 is a map data updating unit, 21 is old road identification data stored in the storage device 2, 22 is old extended road attribute data stored in the storage device 2, 41 is storage in the storage device 4. New road identification data, 42 is new extended road attribute data stored in the storage device 4, 51 is an extended road data identifying section (extended road identifying means) in the map data updating section 5, and 52 is in the map data updating section 5. It is an extended road data conversion unit (extended road data conversion means).

The storage device 1 for storing the old map data and the storage device 3 for storing the new map data are a CD-ROM (C
ompact Disc-Read Only M
memory) and DVD-ROM (Digital Ve)
It is composed of a recording medium such as an Rsatile Disc) and a driving device for driving the recording medium. The storage device 2 that stores the old extended road data and the storage device 4 that stores the new extended road data are rewritable HDDs (Hard Discs).
Drive) and other storage devices. The map data updating unit 5 is a CPU (Central Process).
ing Unit), memory, HDD, display, keyboard, mouse, etc.
(Operating System). As a recording medium for storing the old map data and the new map data, a magneto-optical disk or a DVD-RAM (Ran)
A rewritable medium such as a Dom Access Memory) or an HDD may be used.

For the sake of simplicity, the storage device 1 for storing the old map data will be referred to as the old map data 1, and the storage device 2 for storing the old extended road data will be referred to as the old extended road data 2 below. The storage device 3 that stores map data is referred to as new map data 3, and the storage medium 4 that stores new extended road data is referred to as new extended road data 4.

Next, a more detailed structure of FIG. 1 will be described. The old extended road data 2 is the old road identification data 21 for identifying the intersections and roads that form the road network data of the old map data 1, and the extended attributes of the intersections and roads defined by the old road identification data 21. It is composed of old extended road attribute data 22 that stores information. New extended road data 4
Is a new road identification data 41 for identifying intersections, roads, etc., which form the road network data of the new map data 3, and new attribute information for storing intersections, roads, etc. defined by the new road identification data 41. It is composed of extended road attribute data 42. The map data updating unit 5 determines the old road identification data 21 based on the road attributes of the old map data 1 and the new map data 3.
New map data 3 that matches intersections and roads specified in
Expanded road data identifying unit 51 for identifying intersections, roads, etc., and expanded road data for converting old expanded road attribute data 22 as expanded attribute information of intersections, roads, etc. in new map data 3 identified by expanded road data identification unit 51. The conversion unit 52 is included.

Next, an outline of map data and road-related data will be described. Old map data 1 and new map data 3
Is topographical data for displaying topography such as the sea and mountains, road shape data for displaying road shapes, building data for displaying buildings, name data for displaying place names, road names, etc. In addition, it includes road network data for route search.

FIG. 2 is a schematic diagram showing the relationship between the road shape and the road structure (this is called "road network data").
(A) shows the road shape, 101 is a plurality of intersections, 10
2 is a road connecting the intersections. 2 (b) is shown in FIG.
The road network data of (a) is expressed by nodes and links, 103 is a node (circle in FIG. 2), and 104 is a link connecting the nodes 103 (arrow in FIG. 2). An up / down bidirectional road is represented by two opposing links 104.

FIG. 3 is a schematic diagram showing the relationship between a mesh, which is a unit for dividing and managing road network data, and a link that spans a plurality of meshes. In FIG. 3, 105, 106
Is a plurality of meshes, 108, 109 and 110 are links that straddle the meshes 105 and 106, and 107 is a virtual boundary node generated at a mesh boundary. The boundary node 107 divides the link 108 and the link 109. FIG. 4 shows an example of the attribute information of the nodes forming the road network data of the old map data 1 and the new map data 3, and FIG. 5 shows an example of the link attribute information.

FIG. 6 is a flowchart showing the operation of the map data updating system according to the first embodiment, and FIG. 7 shows the overall structure of the extended road data corresponding to the old extended road data 2 and the new extended road data 4. It is a figure. FIG. 8 is an explanatory diagram showing a structural example of road identification data and extended road attribute data for a node, and FIG. 9 is an explanatory diagram showing a structural example of road identification data and extended road attribute data for a link.

Next, the operation will be described. Step S
At T1, the extended road data identification unit 51 checks whether or not the old road identification data 21 has ended. If unprocessed data remains, the process proceeds to step ST2, and if all data has been processed, The process ends. In the example of the extended road data shown in FIG. 7, the processing starts from the data number (1) and ends when the data number (N) is completed.

At step ST2, the extended road data identification section 51 determines the data number of the old road identification data 21 (for example,
The road identification data (road identification data (1) in FIG. 7) corresponding to the data number (1) in FIG. 7 is read, and step S
Proceed to T3. In the example of the road identification data shown in FIG. 8 and FIG. 9, the data to be read are the node / link type code, mesh code, and node / link number. In step ST3, the extended road data identification unit 51 determines the type of the data based on the node / link type code of the road identification data. If it is a node, the process proceeds to step ST4, and if it is a link, the process proceeds to step ST11. .

In step ST4 in the case of a node, the extended road data identification unit 51 sets the attribute information of the node (referred to as "the relevant node") defined by the combination of the mesh code of the road identification data and the node / link number to the old map. The data 1 is read and the process proceeds to step ST5. In step ST5, the extended road data identification unit 51 reads the attribute information of all the nodes included in the new map data 3,
Go to 6. In step ST6, the extended road data identification unit 51 compares the attribute information of the node with the attribute information of all the nodes acquired from the new map data 3, and matches the node in the new map data 3 (“new node” Yes) is identified and the process proceeds to ST7.

In order to execute the identification method, the extended road data identification unit 51 sequentially compares the node position of the node with the node position of each node in the new map data 3,
If the positions of the two are approximately the same, a new node that matches the node is identified, and if they are different, it is determined that they do not match. To determine whether the node positions are approximately the same, set a square (rectangular or circular) determination area around the node position of the node, and set the nodes that fall within this area to approximately the same position. You can judge that they are equal. However, when the nodes whose positions are substantially equal to each other are boundary nodes, they are virtual nodes that do not exist in the actual road network, and are not identified as new nodes that match the nodes.

The extended road data identification unit 51 stores the mesh code and the node number of the identified new node in a temporary variable at the time of identifying the new node that matches the node, and ends the node identification process. The mesh number of the new node and the variable for temporarily storing the node number are initialized to 0 at the start of the process. (However, the mesh code and node number are positive integers.)

In the next step ST7, the extended road data identification unit 51 checks the value of the variable in which the mesh code and the node number are temporarily stored, and if the variable values are both 0, the node cannot be identified. Judgment and Step ST1
Returning to, the processing of the next old road identification data 21 is tried. If the variable values are not both 0, it is determined that a new node matching the node has been identified, and the process proceeds to step ST8. At this time, the extended road data identification unit 51 outputs the mesh code and node number of the new node to the extended road data conversion unit 52.
Output to. In step ST8, the extended road data conversion unit 52 reads the old extended road attribute data 22 of the node, and proceeds to step ST9. In step ST9, the extension road data conversion unit 52 converts the old extension road attribute data 22 of the node as the extension road attribute data of the new node.

A method of converting the extended road attribute data of the node will be described below. In the example of FIG. 8, the extended road data conversion unit 5
The extended road attribute data to be converted by 2 is a plurality of intersection passage required times based on a combination of an entry node number, an exit node number, a day code, and a time zone code. For the ingress node and the egress node, the ingress node and the egress node in the new map data 3 matching these are identified by the same processing as in step ST4 to step ST6, and the mesh codes and node numbers of the identified ingress node and egress node are identified. It should be converted to the combination of.

The day of the week code and the time zone code do not need to be converted if they are added by the user's own specifications.
When the day code and the time zone code are based on the specifications of the old map data 1 and the same specifications exist in the new map data 3, the specifications of the new map data 3 can be easily converted. If there is no specification corresponding to the day code and time zone code in the new map data 3, it is used without conversion. In the next step ST10, the extended road data conversion unit 52 stores the conversion result in step ST9 in the new extended road data 4.

When the data is determined to be a link in step ST3 and the process proceeds to step ST11, the extended road data identification unit 51 uses the combination of the mesh code of the road identification data and the node / link number as in step ST4. The attribute data of the specified link (referred to as "the link") is read from the old map data 1 and step ST12
Go to.

In step ST12, the extended road data identifying section 51 reads the attribute information of all links included in the new map data 3, and proceeds to step ST13. Step ST13
Then, the extended road data identification unit 51 compares the attribute data of the link with the attribute information of all the links acquired from the new map data 3, and links in the new map data 3 that match the link (referred to as “new link”). Identify.

The link identification method is divided into the following two types according to the node types at both ends of the link. To check the node types at both ends of the link, the link mesh code and the node type codes of the two nodes defined by the node numbers 1 and 2 may be checked with reference to FIGS.

The nodes at both ends of the link are boundary nodes 10.
When 7 is not included, the extension road data identification unit 51
The attribute information of the nodes at both ends of the link is acquired from the old map data 1 based on the mesh code of the link, the node number 1 and the node number 2. Then, step ST4
~ New map data 3 by the same processing as step ST6
Among all the nodes of the above, two nodes having node positions matching the node positions at both ends of the link are searched, and these are identified as two new nodes matching the nodes at both ends of the link.

The extended road data identifying section 51 identifies the identified 2
After temporarily storing the mesh code and node number of one new node, the attribute information of all links is acquired from the new map data 3. Among all the links of the new map data 3, a link having the attribute information (mesh code, node number 1 and node number 2) of the link that matches the mesh code and the node number of the two new nodes is searched, and this is set as the relevant link. Identifies as a matching new link. Since the link direction can be determined by using the node number 1 → node number 2 in the link attribute information, it is only necessary to identify the link having the matching direction.

The extended road data identification unit 51 stores the identified new link mesh number and link number in a temporary variable. In this case, the mesh number of the new link and the variable for temporarily storing the link number are initialized to 0 at the start of processing. (However, the mesh code and link number are positive integers.)

FIGS. 10A and 10B show a road structure and its shape representation when there are a plurality of links connecting two nodes. In the figure, 111 and 112 are nodes at both ends of a start point and an end point, 113 and 114 are links of old roads and bypass roads connecting these two nodes 111 and 112, and 115 and 115 ′ are centers of gravity of shape complementation point sequences. . As shown in FIG. 10A, in a place where the old road link 113 and the bypass road link 114 coexist, there are a plurality of links in which the nodes 111 and 112 at both ends are the same. In such a case, since the link cannot be identified only by the mesh code, the node number 1 and the node number 2, the identification is performed by using the link shape in the link attribute information shown in FIG.

The extended road data identification unit 51 calculates the centroids 115 and 115 'of the shape complement point sequence from the link shape of the link, as shown in FIG. 10 (b). In the example of FIG. 10, the old road link 113 and the bypass road link 11
4, the center of gravity of the shape complementary point sequence is calculated, and these are compared with the center of gravity of the shape complementary point sequences 115 and 115 ′ of the link, and the one having a similar center of gravity is identified as a new link that matches the link. .

When the nodes at both ends of the link include the boundary nodes, the link is divided by the boundary nodes, and therefore the link before the division (referred to as "original link") is first reproduced. Here, it is assumed that the node defined by the node number 1 of the link is a boundary node and the link is divided into two. Whether or not it is the boundary node 107 as shown in FIG. 3 is determined by the node type code in the attribute information of the node.

The extended road data identification unit 51 acquires the attribute information of the boundary node (referred to as "boundary node 1") from the old map data 1 using the mesh code of the link and the node number 1. Then, the attribute information of the boundary node (referred to as “boundary node 1 ′”) in the adjacent mesh is acquired from the old map data 1 by using the adjacent mesh code and the adjacent mesh joint number of the boundary node 1.

When a boundary node is included, since the number of connecting links is always one, the node defined by the connecting node number 1 of the boundary node 1'is the end point of the original link. With this, the nodes at both ends of the original link can be identified. Once the nodes at both ends of the original link can be identified, the new link that matches the link can be identified later by the same processing as when boundary nodes are not included. Note that a long-distance link such as a highway link may span a large number of meshes, but the link before division can be reproduced using the same method as above.

In the next step ST14, the extended road data identifying section 51 checks the value of the variable in which the mesh code and the link number are temporarily stored, and if the variable values are both 0, the link cannot be identified. Judge and step ST
Returning to step 1, the processing of the next old road identification data 21 is tried.
If the variable values are not both 0, it is determined that a new link matching the link has been identified, and the process proceeds to step ST15. At this time, the extended road data identification unit 51 outputs the mesh code and the link number to the extended road data conversion unit 52. In step ST15, the extended road data conversion unit 52
Reads the extended road attribute data of the link, and step S
Proceed to T16. In step ST16, the extension road data conversion unit 52 converts the old extension road attribute data 22 of the link as extension road attribute data of the new link.

In the method of converting the extended road attribute data of the link, in the example of FIG. 9, the extended road attribute data to be converted by the extended road data conversion unit 52 is a plurality of travel speeds according to conditions by combination of day code and time zone code. Is. The conversion method in this case is the same as that in step ST9.

As described above, according to the first embodiment, the road in the new map data 3 that matches the road to which the extended attribute is added to the old map data 1 is connected to the latitude / longitude of both ends of the link or the latitude / longitude of the node. It is identified based on the road attributes such as, and the added extended attribute is converted as the extended attribute of the road in the new map data 3 that matches, so even if the map data is updated by version upgrade or the like, it is added before the update. The effect that there is no need to re-add the extended attribute of the road is obtained.

Further, according to the first embodiment, a new road matching the road defined by the old road identification data 21 based on the position information and the road shape in the road attributes of the old map data 1 and the new map data 3. Since the road defined by the identification data 41 is identified, the road identification process can be easily performed by identifying the road between the old and new map data with the position information such as latitude and longitude at both ends of the node or the link and the little information such as the road shape. The effect of becoming is obtained.

Further, according to the first embodiment, the road in the new map data 3 that matches the road to which the extended attribute is added to the old map data 1 is shown as a plurality of intersections as shown in FIG. It is the road attribute of the node, or FIG.
The new map data 3 that is identified based on the type of the road attribute of the link indicating at least one road connecting the plurality of intersections as shown in FIG.
Since the conversion is performed as the extended attribute of the road in (1), even if the map data is updated due to version upgrade or the like, it is not necessary to re-add the extended attribute of the road given before the update.

Further, according to the first embodiment, the extended road data identification unit 51 sequentially compares the node position of the node with the node position of each node in the new map data 3, as shown in FIG. When the positions of the two are approximately the same, the new node that matches the node is identified, so that there is an effect that the node of the old map data 1 and the node of the new map data 3 can be identified regardless of details.

Further, according to the first embodiment, when the type of the road attribute of the old map data 1 and the new map data 3 is the link, the road network data is divided and managed as shown in FIG. Since it is determined whether or not the boundary node 107 exists in the area to be identified at the boundary between the meshes 105 and 106, which are the units to be identified, and whether or not the road attributes of the links of both are matched, the boundary node 107 is determined. It is possible to obtain an effect that appropriate identification can be performed in consideration of a virtual node that does not exist on the actual road.

Embodiment 2. In the first embodiment described above, the example in which the entry node number and the exit node number are provided as the attribute information of the node in the map data as shown in FIG. 4 is used. As an example of using the entry node number and the exit node number as shown in FIG. On the other hand, in the second embodiment, the map data corresponding to the map data using the entry link number and the exit link number instead of the entry node number and the exit node number as the attribute information of the node is updated. In the case of such map data, the map data is updated using the entry link number and the exit link number as a combination condition for the intersection passage required time of the extended road attribute data for the node.

As described above, according to the second embodiment, in the map data using the entry link number and the exit link number, the road identification data (node / link number, etc.) is compatible between the old and new map data. Even without it, it becomes possible to identify the new node or new link in the new map data 3 that matches the old node or old link in the old map data 1 based on the position information of the node or link or the road shape. Since the old extended road data 2 set for the old map data 1 can be converted to the new map data 3, the user inputs the new extended road data 4 again for the new map data 3 when updating the map data. The effect is that there is no need to redo.

Embodiment 3. In the above-described first embodiment, as the attribute information of the links in the map data, an example having a travel speed as shown in FIG. 5 is used, and therefore, as an item of the extended road attribute data for the links, it is shown in FIG. An example using such travel speed by condition was explained. On the other hand, the third embodiment corresponds to the map data that uses the required transit time instead of the travel speed as the link attribute information. In the case of such map data, as items of extended road attribute data for the link,
Update the map data using the transit time.

As described above, according to the third embodiment, in the map data using the required transit time, even if the road identification data (node / link number, etc.) is not compatible between the old and new map data. , It becomes possible to identify the new node or new link in the new map data 3 that matches the old node or old link in the old map data 1 based on the position information of the node or link or the road shape, and the user can use the old map. Since the old extended road data 2 set for the data 1 can be converted to the new map data 3, the user needs to re-enter the new extended road data 4 for the new map data 3 when updating the map data. There is no effect.

Fourth Embodiment Further, in the above-described first and second embodiments, the example in which the attribute information of the node is the same between the old and new map data has been described, but in the fourth embodiment, the map data of different map makers is transferred. If you do, update the map data. In the map data of different map makers, the attribute information of the node may be different between the old and new map data (for example, the entry node number and the exit node number are used in the old map data 1 and the entry link number in the new map data 3). And use the exit link number). In such a case, the extended road data conversion unit 52
Must appropriately convert the entry node number and the exit node number of the old extended road attribute data 22 into the entry link and the exit link of the new map data 3 (the new entry link and the new exit link).

As a conversion method in that case, two nodes (“new entry node” and “new exit node”) in the new map data 3 that match the entry node number and the exit node number of the old extended road attribute data 22 are used. Yes), and a new node in the new map data 3 that matches the node in the old map data 1 can be identified by the same method as in the first embodiment. Since the new approach link is a link connecting between the new entry node and the new node, and the new exit link is a link connecting between the new node and the new exit node, these link numbers are stored in the new extended road attribute data. On the contrary, it is also possible to identify the entry node number and the exit node number of the new map data 3 from the entry link number and the exit link number of the old map data 1.

As described above, according to the fourth embodiment, when the map data of different map makers are updated, the road identification data (node.
Even if the link numbers are not compatible, identify the new node or new link in the new map data 3 that matches the old node in the old map data 1 or the old link based on the position information of the node or link or the road shape. Since the old extended road data 2 set by the user for the old map data 1 can be converted to the new map data 3, the user can use the new map data 3 for updating the map data. New extended road data 4
The effect that there is no need to input again is obtained.

Embodiment 5. In the fifth embodiment,
For example, the map data is updated when the travel speed is used in the old map data 1 and the transit time is used in the new map data 3 as the link attribute information. In such a case, the extended road data conversion unit 52 needs to appropriately convert the travel speed of the old extended road attribute data 22 into the required transit time of the new map data 3. As the conversion method, the travel time of the new link in the new map data 3 can be converted by multiplying the travel length of the link in the old map data 1 by the travel speed. On the contrary, it is possible to convert the time required to pass the link of the old map data 1 into the travel speed of the link of the new map data 3.

As described above, according to the fifth embodiment, when the travel speed is used in the old map data 1 and the transit time is used in the new map data 3 as the link attribute information, the old and new maps are used. Even if the road identification data (node / link number, etc.) is not compatible between the data, new map data 3 matching the old node and old link of the old map data 1 based on the position information of the nodes and links and the road shape. It becomes possible to identify a new node or new link in, and the old extended road data 2 set by the user for the old map data 1 can be converted to the new map data 3. Therefore, when updating the map data, The effect that the user does not need to input the new extended road data 4 again for the new map data 3 is obtained.

Sixth Embodiment In the first to fifth embodiments described above, an example of performing a fixed conversion operation determined in advance has been described as the operation of the extended road data conversion unit 52. However, in the sixth embodiment, the user can change the old and new map data. A conversion rule creating tool (not shown) is provided which can select a combination of items to be converted from attribute information of nodes or links between them and describe a conversion method for the selected items. As described above, as a method for the user to describe and execute a special conversion operation, a method using a macro language generally used in word processing software or spreadsheet software can be used.

As described above, according to the sixth embodiment, it is possible to convert the attribute information of nodes and links with more items.

Embodiment 7. FIG. 11 is a block diagram showing the configuration of the map data updating system according to the seventh embodiment. In FIG. 11, 23 is the old road identification data added in the old extended road data 2 in the first embodiment of FIG. Also, in FIG. 11, the old map data 1 of FIG. 1 is deleted. The other configurations are the same as the configurations shown in FIG. 1, and thus description thereof will be omitted.

Next, the operation will be described. The old road identification data 23 stores the node position as the attribute information of the node in the old map data 1 and the node positions and link shapes at both ends of the link as the attribute information of the link. The extended road data identification unit 51 can perform the same operation as the map data update system of FIG. 1 using the attribute information stored in the old road identification data 23.

As described above, according to the seventh embodiment, the old map data 1 in FIG. 1 becomes unnecessary, so that the CD-ROM or the DVD-ROM for storing the old map data 1 is used.
A storage medium such as a ROM and its drive device are not required. That is, the old road identification data 2 stored in the old map data 1
By including the road attribute defined by 1 in the old extended road data 2 as the old road identification data 23, it is possible to identify the matching roads between the new map data 3 without the old map data 1. The effect that the storage medium for storing the old map data 1 becomes unnecessary is obtained.

Embodiment 8. FIG. 12 is a block diagram showing the configuration of the map data updating system according to the eighth embodiment. In FIG. 12, 43 is the seventh embodiment of FIG.
It is the new road identification data added in the new extended road data 4 in. Other configurations are the same as the configurations shown in FIGS. 1 and 11, and the description thereof will be omitted.

Next, the operation will be described. The new road identification data 43 stores the node position as the attribute information of the node in the new map data 3 and the node positions and link shapes at both ends of the link as the attribute information of the link.

As described above, according to the eighth embodiment, it is possible to obtain the effect that the map data before the update becomes unnecessary even if the version upgrade of the map data is repeated.

Ninth Embodiment FIG. 13 is a block diagram showing the configuration of the map data update system according to the ninth embodiment. In FIG. 13, reference numeral 53 denotes an extended road data identification inability notification unit (identification inability notification means) provided in the map data updating unit 5 in the first embodiment of FIG. The other configurations are the same as the configurations of FIG.

Next, the operation will be described. Figure 14
27 is a flowchart showing the operation of the ninth embodiment. When the node and the link cannot be identified in step ST7 or step ST14, the process does not immediately return to step ST1 as in the operation of FIG. 6 in the first embodiment, but step ST18 or step ST, respectively.
It returns to step ST1 via 19.

In step ST18, the extended road data unidentification notifying section 53 generates a message indicating the identification failure of the node and displays it on the display of the computer. Add the attribute information of the node to the generated message, for example, "Node identification failed. (Node number: 123
4, node position: north latitude 35 degrees 10 minutes 20.3 seconds, east longitude 1
35 degrees 40 minutes 50.6 seconds) ”, the user can grasp the position of the node in addition to the number of the node for which the identification has failed.

In step ST19, the extended road data unidentification notifying section 53 generates a message indicating the identification failure of the link and displays it on the display of the computer.
Add the attribute information of the link to the message to be generated and add, for example, "Link identification failed. (Link number: 56
78, position of link end 1: north latitude 35 degrees 10 minutes 20.3
Second, 135 degrees 40 minutes 50.6 seconds east longitude, position of link end 2: 35 degrees 15 minutes 25.3 seconds north latitude, 135 degrees 45 minutes 55.6 seconds east longitude) "to identify the user. In addition to the link number that failed, you can grasp the positions of both ends of the link. Further, if such a message is stored in a file, the user can obtain the information of the node or link whose identification failed based on the contents of this file when needed.

As described above, according to the ninth embodiment, when the attribute information of the node or link in the new map data 3 that matches the attribute information of the node or link in the old map data 1 cannot be identified, the identification is performed. Since the failure is displayed, it is possible to grasp the information of the failed node or link.

Tenth Embodiment FIG. 15 shows the first embodiment.
It is a block diagram which shows the structure of the map data update system in 0. In FIG. 15, the ninth embodiment of FIG.
The extended road data unidentifiable notifying section 53 in is configured so that the information in the new map data 3 can be used. The other parts are the same as those in the configuration shown in FIG.

Next, the operation will be described. The extended road data unidentifiable notifying unit 53 generates a map screen based on the new map data 3 and displays it on the display of the computer, and also displays the node or the link for which identification has failed on the map screen. . The method of displaying the nodes or links that have failed in identification on the map screen can be realized by the same method as that used in the map data viewer or the like.

As described above, according to the tenth embodiment, the user can easily grasp the position of the node or the link whose identification has failed.

Eleventh Embodiment FIG. 16 shows the first embodiment.
It is a block diagram which shows the structure of the map data update system in 1. In FIG. 16, 6 is an extended road data correction unit (extended road data correction means), 61 is a road selection unit in the extended road data correction unit 6, and 62 is an extended road data input unit in the extended road data correction unit 6. . The other configuration is the same as that of the ninth embodiment shown in FIG. 13, and therefore the description thereof is omitted. That is, in the configuration of FIG. 16, in the configuration of FIG. 15 of the tenth embodiment, the extended road data identification inability notification unit 53 uses the information in the new map data 3 via the extended road data correction unit 6. It is composed.

Next, the operation will be described. When the identification of the node or the link fails, the extended road data unidentification notification unit 53 generates a map screen based on the new map data 3 and displays it on the display of the computer, as in the tenth embodiment. At the same time, the node and the link for which the identification has failed are overlaid and displayed on the map screen. In this case, the extended road data unidentification notification unit 53 instructs the road selection unit 61 to select a node or a link.

When the user designates the position of the node or the vicinity of the link on the display with a mouse or the like based on the instruction from the extended road data unidentification notifying unit 53, the road selecting unit 61 stores the new map data 3 in the new map data 3. Select a node or link existing near the specified position and display it on the screen by changing the color of the selection result. In addition, the road selection unit 61
Indicates to the extended road data input unit 62 that the selected node or link is a new node or new link.

The extended road data input unit 62 generates a dialog or the like for inputting extended road attribute data relating to the designated new node or new link, displays it on the display unit, and displays the extended road input via the dialog. The attribute data is stored in the new extended road data 4 in association with the specified new node or new link.

As described above, according to the eleventh embodiment, even when the user fails to identify the old extended road data 2, the user appropriately selects the corresponding node or link on the map screen and expands it. By being able to set the road attribute data, it is possible to obtain an effect that it is possible to prevent the loss of the extended attribute of the road due to the map data update.

Twelfth Embodiment The configuration of the map data updating system according to the twelfth embodiment is the same as that of the eleventh embodiment.
The configuration is the same as in. In the eleventh embodiment, when the identification of the old extension road data 2 fails, the extension road data unidentification notifying unit 53 unconditionally notifies that fact. However, when the identification fails, the identification condition Is selected to select a candidate in the new map data 3 that matches the old extended road data, and the user is notified of this candidate.

FIG. 17 shows the old map data 1 and the new map data 3 in the map data updating system according to the twelfth embodiment.
It is explanatory drawing which shows the change of the division of the road network data between
FIG. 17A is a shape representation of the old map data 1, which is shown in FIG.
7 (b) is a shape representation of the new map data 3. FIG. 17
In (a), 116 and 117 are old nodes, and 118 is an old link that connects the old node 116 and the old node 117 before division. In addition, in FIG.
0 is a new node, 121 is an additional node, 122 and 123 are two new links divided by the additional node 121,
Reference numeral 124 is an additional link connected to the additional node 121.

Next, the operation will be described. The extended road data unidentifiable notifying unit 53 can identify the old node 116 → new node 119 and the old node 117 → new node 120, but cannot identify a new link matching the old link 118. In this case, the old link 118 is the old node 116.
Since it is a link whose starting point is the old node 117 and whose ending point is the old node 117, the extension road data unidentification notifying unit 53 sets the identification condition of the old link 118 to “the new node 119 that matches the node 116 as the starting point and the old node 117. "One node terminating at the matching new node 120" to "node 11
The new node 119 that matches 6 is the starting point, and the old node 11
7), and try to identify.

When a node having the new node 120 as the leaving node number in the attribute information is searched for among the nodes defined by the leaving node number in the attribute information of the new node 119, only one additional node 121 is found. The extended road data unidentifiable notifying unit 53 uses the new node 119 as a starting point and the new node 122 as a new node ending with the additional node 121, and the additional node 121 as a starting point and the new node 12
Two new links 123 terminated with 0 are replaced with old links 118
Are displayed as candidates for new links that match with, and if there is no problem, the user adopts these as new links that match with old link 118.

As described above, according to the twelfth embodiment, even if the identification of the old extended road data 2 fails, the alternative node or link is indicated, so that the user can copy the old extended road data 2 The effect that it can be easily converted into the new extended road data 4 is obtained.

In the above first to twelfth embodiments,
A state including at least a part of the old extended road attribute data 22 before the update, or a state in which only the value of the old extended road attribute data 22 before the update is updated, that is, a state in which the attribute is maintained, The new extended road attribute data 42 may be stored. In this case, the effect that the old extended road attribute data 22 that can be used as it is or that can be used only by updating the numerical value without updating the attribute can be utilized as the new extended road attribute data 42 is obtained.

Thirteenth Embodiment FIG. 18 shows the first embodiment.
3 is a block diagram showing the configuration of a map data editing system in FIG. In FIG. 18, 7 is map data to be edited (stored), 8 is extended road data obtained by extending the road attribute of the map data 7, and 9 is input / edit extended road attribute information of the road selected in the map data 7. Then, a map data editing unit (map data editing means) to save as the extended road data 8, 81 is road identification data in the extended road data 8, 82 is extended road attribute data in the extended road data 8,
Reference numeral 83 is road identification data in the extended road data 8, 91 is a road data selecting unit in the map data editing unit 9, and 92 is an extended road data editing unit.

Next, the operation will be described. FIG. 19 is a flowchart showing the operation of the map data editing system of FIG. In step ST20, the road data selection unit 91 reads the map data 7 stored in a storage medium such as a CD-ROM. In step ST21, the road data selection unit 91 interprets the information of the map data 7 and generates a map screen. This method is the same as the method generally used in map viewer software or the like.

In step ST22, the road data selection section 91 displays the generated map screen on the display of the computer. In step ST23, the road data selection unit 91 receives the operation information of the user via the mouse or the keyboard,
It is determined whether or not the processing is terminated. When the processing end is requested, the processing is ended, and when the processing end is not requested, the process proceeds to step ST24 and the process is continued.

In step ST24, the road data selection section 91 waits until a user operation such as which position on the map screen the user has designated with the mouse is input. When the user operation is input, the process proceeds to step ST25.
In step ST25, the road data selection unit 91 searches for a node or link in the vicinity of the position designated by the user on the map screen, and selects, for example, the node or link having the shortest distance from the user's designated position. If the selection target is a node, the process proceeds to step ST26, and if it is a link, the process proceeds to step ST30. In this case, in the example of the road identification data and the extended road attribute data for the link as shown in FIG. 9, the road data selection unit 91 uses the mesh code and the node number of the selected node (referred to as “selected node”). Is output to the extended road data editing unit 92.

In step ST26 when the node is selected in step ST25, the extended road data editing unit 92 inputs the extended road attribute to the selected node.
Generate edit screen. In the example of the road identification data and the extended road attribute data for the link as shown in FIG. 8, the entry node number is set as the extended road attribute data of the selected node,
A screen for inputting / editing an exit node number, a day of the week code, a time zone code, and an intersection passage required time conditioned by a combination of these is generated. In this case,
From the attribute information of the selected node stored in the map data 7, the nodes that can enter and leave the selected node can be known in advance, so the entry node number and the exit node number for the selected node can be selected from these. By doing so, the operation becomes easy.

In the next step ST27, the extended road data editing section 92 outputs the generated extended road attribute data input / edit screen for the selected node to the display unit, and proceeds to step ST28. In step ST28, after the data input by the user via the input / edit screen of the extended road attribute data for the selected node is fetched, step ST2
Proceed to 9. In step ST29, the extended road data editing unit 92 appropriately stores data in the extended road data. The road identification data 81 stores the mesh code and the node number of the selected node, the extended road attribute data 82 stores the extended road attribute data input by the user, and the road identification data 83 stores the node position and the node of the selected node. The type code is stored.

Regarding each processing in steps ST30 to ST33, steps ST26 to S
Since the "node" in each process of T29 is replaced with the "link" and the road data selection unit 91 and the extended road data editing unit 92 perform substantially the same operation, the description thereof will be omitted.

As described above, according to the thirteenth embodiment, the extended road data 8 input by the user includes the road identification data 83 for identifying the node or the link even if the original map data 7 does not exist. Therefore, when the user updates the map data 7 in the future, the effect that the extended road data 8 can be converted for the new map data without the original map data 7 is obtained.

[0093]

As described above, according to the present invention, the map data update system comprises the first storage means for storing the updated new map data and the road network data included in the new map data. Second storage means for storing new road identification data for identifying roads and new extended road attribute data for roads defined by the new road identification data, and third storage for storing old map data before update Means and fourth storage means for storing old road identification data for identifying roads constituting road network data included in the old map data and old extended road attribute data of the road defined by the old road identification data And an extended road identifying means for identifying a road defined by the new road identification data that matches the road defined by the old road identification data based on the road attributes of the old map data and the new map data, and the old extension Since it is configured to have extended road data conversion means for converting the road attribute data as the extended attribute data of the road specified by the new road identification data identified by the extended road identification means, the extended attribute is set to the old map data. The road in the new map data that matches the assigned road is identified based on the road attributes such as the latitude and longitude of both ends of the link and the latitude and longitude of the node, and the assigned extended attributes are converted as the extended attributes of the road in the matching new map data. Therefore, even if the map data is updated due to version upgrade etc.,
There is an effect that it is not necessary to re-add the extended attribute of the road given before the update.

According to the present invention, the extended road identifying means in the map data updating system matches the road defined by the old road identification data based on the position information and the road shape in the road attributes of the old map data and the new map data. Since it is configured to identify the roads specified by the new road identification data, the roads between the old and new map data can be identified by the position information such as latitude and longitude at both ends of the node or the link and the little information such as the road shape. This has the effect of simplifying the road identification process.

According to the present invention, the map data updating system cannot identify the road when the extended road identifying means cannot identify the road defined by the new road identification data which matches the road defined by the old road identification data. Since it is configured so as to further have an unidentifiable notifying means for notifying the existence of the, the attribute information of the node or link in the old and new map data that matches the attribute information of the node or link in the old map data cannot be identified. Since the failure is displayed, there is an effect that the information on the failed node or link can be grasped.

According to the present invention, when the unidentifiable notifying means in the map data updating system cannot identify the road defined by the matching new road identification data, the identification condition is relaxed to the old extended road attribute data. Since it has been configured to select a matching candidate from the new map data and notify it,
Even if the identification of the old extended road data fails, the alternative nodes and links are shown, so that the user can easily convert the old extended road data into the new extended road data.

According to the present invention, the map data updating system selects and selects the road defined by the new road identification data existing near the position of the road defined by the old road identification data based on the road attribute. Since it is configured to further include extended road data correction means for editing the extended road attribute of the road defined by the new extended road identification data and storing it as new extended road attribute data, the user fails to identify the old extended road data. Even in such a case, it is possible to select a node or link corresponding thereto on the map screen as appropriate and set the extended road attribute data for the node or link, so that it is possible to prevent the loss of the extended attribute of the road due to the update of the map data.

According to the present invention, the extended road data conversion means in the map data update system is used to express the old extended road data when the new road map data and the old map data have different extended road attribute expression forms. Since it is configured to convert the expression format of the new extended road data, even if the expression format of the extended road attribute is different between the old and new map data, it can be converted to an appropriate expression format. The effect is that the extended road attribute data set for the new map data can be easily converted.

According to the present invention, the map data update system is provided with a new storage means for storing the updated new map data and a road for forming road network data included in the new map data. Second storage means for storing road identification data and new extended road attribute data of the road defined by the new road identification data, and for identifying roads forming road network data included in the old map data before update Storage means for storing the old road identification data, the old extended road attribute data of the road defined by the old road identification data, and the old road identification data for identifying the node and the link in the old map data before updating. And a road defined by the new road identification data that matches the road defined by the old road identification data based on the road attribute of the old road identification data and the road attribute of the new map data. Since it is configured to have an extended road identifying means for identifying and an extended road data converting means for converting the old extended road attribute data as the extended attribute data of the road defined by the new road identifying data identified by the extended road identifying means. , By identifying the roads specified by the old road identification data stored in the old map data as the old road identification data in the old extended road data, matching roads between the old and new map data can be identified even if there is no old map data. Therefore, there is an effect that a storage medium for storing the old map data is unnecessary.

According to the present invention, a map data editing system for vehicle navigation is provided with a first storage means for storing map data to be edited and a road for selecting roads constituting road network data included in the map data. Selection means,
Extended road data editing means for editing extended attributes of the road selected by the road selecting means, and road identification data for identifying roads forming road network data included in the map data edited by the extended map data editing means. And extended road attribute data that stores extended attributes of roads specified by the road identification data and road identification data for identifying roads in other map data that matches the road specified by the road identification data. Since it is configured to have the second storage means for storing the extended road data, when the user updates the map data in the future, the extended road data for the new map data can be stored even if there is no original map data. The effect is that it can be converted.

[Brief description of drawings]

FIG. 1 is a block diagram showing a configuration of a map data updating system according to a first embodiment.

FIG. 2 is a schematic diagram showing a relationship between a road shape and a road structure.

FIG. 3 is a schematic diagram showing a relationship of links across a plurality of meshes for dividing and managing road network data.

FIG. 4 is a diagram showing an example of attribute information of nodes of road network data.

FIG. 5 is a diagram showing an example of attribute information of links of road network data.

FIG. 6 is a flowchart showing an operation of the map data updating system according to the first embodiment.

FIG. 7 is an explanatory diagram showing the overall structure of extended road data.

FIG. 8 is a diagram showing a structural example of road identification data and extended road attribute data for a node.

FIG. 9 is a diagram showing a structural example of road identification data and extended road attribute data for a link.

FIG. 10 is a diagram showing a road structure and a shape representation thereof when there are a plurality of links connecting two nodes.

FIG. 11 is a block diagram showing a configuration of a map data updating system according to a seventh embodiment.

FIG. 12 is a block diagram showing the configuration of a map data updating system according to the eighth embodiment.

FIG. 13 is a block diagram showing the configuration of a map data updating system according to the ninth embodiment.

FIG. 14 is a flowchart showing the operation of the ninth embodiment.

FIG. 15 is a block diagram showing a configuration of a map data updating system according to the tenth embodiment.

FIG. 16 is a block diagram showing the configuration of a map data updating system according to the eleventh embodiment.

FIG. 17 is an explanatory diagram showing a change in division of road network data according to the twelfth embodiment.

FIG. 18 is a block diagram showing a configuration of a map data editing system according to a thirteenth embodiment.

FIG. 19 is a flowchart showing the operation of the map data editing system of the thirteenth embodiment.

[Explanation of symbols]

1 storage device, old map data (third storage means), 2
Storage device, old extended road data (fourth storage means), 3
Storage device, new map data (first storage means), 4 storage device, new extended road data (second storage means), 5 map data update unit, 6 extended road data correction unit (extended road data correction unit), 7 map data to be edited, 8 extended road data, 9 map data editing unit (map data editing means), 21 old road identification data, 22 old extended road attribute data, 23 old road identification data, 41 new road identification data, 42 New extended road attribute data, 43 New road identification data, 51 Extended road data identification unit (extended road identification means), 52 Extended road data conversion unit (extended road data conversion means), 53 Extended road data unidentifiable notification unit (identification not possible (Notification means), 61 road selection unit, 62 extended road data input unit, 81 road identification data, 82 extended road attribute data, 83 road identification data, 91 road data Data selecting unit, 92 extended road data editing unit, 101 intersections, 1
02 Road, 103,111,112,116,11
7,119,120,121 node, 104,10
8, 109, 110, 113, 114, 118, 12
2,123,124 link, 105,106 mesh, 107 boundary node, 115,115 ′ center of gravity of shape complementing point sequence.

Continued front page    (72) Inventor Makoto Mitsuri             2-3 2-3 Marunouchi, Chiyoda-ku, Tokyo             Inside Ryo Electric Co., Ltd. (72) Inventor Mitsuo Shimotani             2-3 2-3 Marunouchi, Chiyoda-ku, Tokyo             Inside Ryo Electric Co., Ltd. F-term (reference) 2C032 HB03 HB11                 2F029 AA01 AC14 AC19 AD07                 5B075 ND20 NR03 NR20 PQ02 PQ32                       UU14                 5H180 AA01 FF22 FF27

Claims (8)

[Claims] 1. First storage means for storing updated new map data, new road identification data for identifying roads constituting road network data included in the new map data, and new road identification data thereof. The second storage means for storing the new extended road attribute data of the road defined by 1., the third storage means for storing the old map data before the update, and the road network data included in the old map data. Fourth storage means for storing old road identification data for identifying roads and old extended road attribute data of roads defined by the old road identification data; and road attributes of the old map data and the new map data. An extended road identifying means for identifying a road defined by the new road identification data that matches a road defined by the old road identification data based on the extended road identification data; Map data updating system having a extended road data conversion means for converting the extended attribute data of the road on which the identification means is defined by the new road identification data identified. 2. The extended road identification means is defined by new road identification data that matches the road defined by the old road identification data based on the position information and the road shape in the road attributes of the old map data and the new map data. The map data updating system according to claim 1, characterized in that the road is identified. 3. An unidentifiable notifying means for notifying the existence of an unidentifiable road when the extended road identifying means cannot identify the road defined by the new road identifying data that matches the road defined by the old road identifying data. The map data updating system according to claim 1 or 2, further comprising: 4. The unidentifiable notifying means relaxes the identification condition and selects a candidate matching the old extended road attribute data from the new map data when the road defined by the matching new road identifying data cannot be identified. The map data update system according to claim 3, wherein the map data update system is notified. 5. A road defined by the new road identification data existing near the position of the road defined by the old road identification data based on the road attribute, and selected by the selected new road identification data. 4. The map data updating system according to claim 3, further comprising: an extended road data correction means for editing the extended road attribute of and storing it as new extended road attribute data. 6. The extended road data conversion means changes the expression form of the old extended road data to the expression form of the new extended road data when the expression forms of the extended road attributes are different between the new map data and the old map data. The map data updating system according to claim 1, wherein the map data updating system converts the map data. 7. First storage means for storing updated new map data, new road identification data for identifying roads constituting road network data included in the new map data, and new road identification data thereof. Second storage means for storing the new extended road attribute data of the road defined by 1., the old road identification data for identifying the roads constituting the road network data included in the old map data before the update, and the old road Third storage means for storing the old extended road attribute data of the road defined by the identification data and the old road identification data for identifying the nodes and links in the old map data before updating, and the road of the old road identification data Extended road identification for identifying a road defined by the old road identification data and a road defined by the new road identification data that matches the road defined by the old road identification data based on the attribute and the road attribute of the new map data A map data update system comprising: a means and an extended road data conversion means for converting the old extended road attribute data as extended attribute data of a road defined by the new road identification data identified by the extended road identifying means. 8. A first storage means for storing map data to be edited, a road selecting means for selecting roads constituting road network data included in the map data, and a road selecting means selected by the road selecting means. An extended road data editing means for editing extended attributes of roads; road identification data for identifying roads constituting road network data included in the map data edited by the extended map data editing means; Store extended road data including extended road attribute data that stores extended road attributes specified and road identification data for identifying a road in other map data that matches the road specified by the road identification data. A map data editing system having a second storage means.