JP2010230810A - Electronic map data updating method, electronic map data storage device, electronic map updating data, and electronic map data updating system - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a technology of efficiently updating map data. <P>SOLUTION: Update data for updating the generation of a storage device for storing the map data including nodes and links includes an additional data section and a virtual node section. The additional data section defines an element to be added, which is nodes and links to be newly added in the second generation. When defining nodes arranged at both ends of a link to be deleted in the second generation, of a first generation network, as nodes to be deleted, the virtual node section defines virtual nodes common to both generations and arranged in all first connection links, which connect nodes to be deleted with non-deletion nodes other than the nodes to be deleted. The element to be added includes a virtual node terminal link having a virtual node as a terminal for all the virtual nodes, and is related to the first generation network at only the virtual node. <P>COPYRIGHT: (C)2011,JPO&INPIT

Description

  The present invention relates to an electronic map network data update method, an electronic map data storage device, an electronic map update data, and a map data update system.

  It is possible to display information on facilities and roads on the ground surface on the display of electronic devices, including technology that provides route guidance to cars and pedestrians using computerized map data that can be used on computers. Widely done. By the way, the road conditions in the real world are maintained and updated as needed. For this reason, in the map data, road information is updated according to the road conditions in the real world (for example, Patent Document 1).

JP 2008-90195 A JP 2008-96706 A

  A technique for efficiently updating such map data is required.

  An object of the present invention is to provide a technique for efficiently updating map data.

  The present invention can be realized as the following forms or application examples in order to solve at least a part of the above-described problems.

Application Example 1 A method in which a computer updates electronic map data including a network including a plurality of nodes and a link connecting the nodes.
(A) in the network before update, setting a deletion target link that is a link that is entirely deleted by the update; and
(B) setting nodes arranged at both ends of the deletion target link as deletion target nodes;
(C) In the network before update, among all the deletion end nodes connected via a link to the non-deletion node that is not the deletion target node among the deletion target nodes,
(1) The deleted end node is set as a virtual node. (2) The virtual node is arranged on all the connection links to be separated that are links connecting the deleted end node and the non-deleted node. Setting the virtual node;
(D) When there is the separation target connection link in which the virtual node is arranged, all of the separation target connection links are connected to the deletion connection link that connects the virtual node and the deletion end node, and the virtual Separating a node and a remaining connection link connecting the non-deletion node;
(E) A step of preparing an addition target element that is a node and a link of update data added by the update, and the addition target element includes all virtual node termination links that are links that terminate the virtual node. Including the virtual node and being prepared not to have a connection with the network before the update except for the virtual node;
(F) The deletion target link and the deletion target node are deleted from the network before update, and when the deletion connection link exists, the deletion connection link is deleted and the addition target is added to the network before update. Updating the network data by adding elements;
A method for updating electronic map data, including

  According to the method in the first application example, the generation update of the map data can be easily realized by simply replacing the deletion target link, the deletion target node, and the second connection link with the addition target element via the virtual node.

[Application Example 2] The electronic map data update method according to claim 2, wherein, in the step (c), the deletion end node and the non-deletion node are connected to all the deletion end nodes. An electronic map data update method in which virtual nodes are set by arranging virtual nodes on all of the separation target connection links that are links.
In this way, it is possible to realize reliable generation update only by confirming the consistency of the link connected to the virtual node.

[Application Example 3] The electronic map data updating method according to Application Example 1 or Application Example 2,
The electronic map data includes an attribute database that stores attribute data associated with the node or link;
The method further comprises:
(G) setting the deletion target attribute data that is the attribute data to be deleted by the update from the attribute data before the update;
(H) preparing additional attribute data which is the attribute data added by the update;
(I) deleting the deletion target attribute data from the pre-update attribute database and updating the update attribute database by adding the additional attribute data to the pre-update attribute database;
A method for updating electronic map data, including
In this way, it is possible to easily update the generation of map data including attribute data.

[Application Example 4] The electronic map data updating method according to any one of Application Example 1 to Application Example 3,
The deletion target link, the deletion target node, the deletion connection link, and the addition target element are associated with the same identification information,
In the step (f), the deletion target link, the deletion target node, and the deletion connection link associated with the same identification information are deleted, and the addition target element associated with the same identification information is added. , Update method of electronic map data.
In this way, generation updates can be easily managed using the identification information.

Application Example 5 An electronic map data storage device that stores electronic map data including at least a network including a plurality of nodes and a link connecting the nodes,
A pre-update data storage unit for storing the pre-update network as data;
An update data storage unit that stores, as data, an addition target element that is a node and a link that should be newly added at the time of update;
With
When the nodes arranged at both ends of the deletion target link that is the link that is to be deleted after the update in the network before the update are defined as the deletion target nodes, the deletion target node and the deletion target node Storing virtual nodes arranged in all of the connection links to be separated, which are links connecting non-deletion nodes that are not, as nodes common to the network before the update and the network after the update,
The addition target element includes a virtual node termination link that terminates the virtual node for all the virtual nodes, and does not include nodes and links associated with the network before update other than the virtual nodes. Storage device.

  According to the map data device in Application Example 5, map data can be stored for a plurality of generations with a small amount of information. Furthermore, map data for a plurality of generations can be stored in a state in which the generation update of the map data can be easily realized by simply replacing the addition target element with the deletion target element via the virtual node.

Application Example 6 The electronic map data storage device according to Application Example 5,
In the network before update, the separation target connection link is separated into a deletion connection link that connects the virtual node and the deletion target node, and a remaining connection link that connects the virtual node and the non-deletion node. Electronic map data storage device stored.
In this way, the generation update of the map data can be easily realized by simply replacing the deletion target link, the deletion target node, and the deletion connection link with the addition target element via the virtual node.

[Application Example 7] The electronic map data storage device according to Application Example 5,
The electronic map data includes an attribute database that stores attribute data associated with the node or link;
The pre-update data storage unit stores pre-update attribute data that is the attribute data associated with the first generation network,
The post-update data storage unit stores the attribute data to be newly added at the time of the update.
In this way, map data can be easily stored for a plurality of generations including attribute data.

[Application Example 8] The map data storage device according to Application Example 5 further includes:
The deletion connection link that connects the deletion target link and the virtual node of the deletion target connection link and the deletion target node is deleted from the pre-update data storage unit, and the addition target element is converted to the pre-update data. An electronic map data device comprising an update processing unit for updating the pre-update data storage unit by adding to the storage unit.
In this way, generation change can be easily performed by the update processing unit.

Application Example 9 A receiving unit that receives electronic map update data;
A deletion connection link that connects all of the separation target connection links to the virtual node defined in the received electronic map update data and the deletion target node, and a remaining connection link that connects the virtual node and the non-deletion node; A link separation unit that separates into
An update unit that deletes the deletion target element and the deletion connection link from the storage device, and updates the network before the update to the updated network in the storage device by adding the addition target element to the storage device;
An electronic map update data used by a computer of the storage device having an additional data part that defines the addition target element that is a node and a link to be newly added after the update;
When defining nodes that are arranged at both ends of the deletion target link that is a link that is to be deleted entirely after the update in the network before the update, among the deletion target nodes, For all of the deletion end nodes, the nodes connected via the link with the non-deletion node that is not the deletion target node,
(1) The deleted end node is set as a virtual node. (2) The virtual node is set on all the connection links to be separated that are links connecting the deleted end node and the non-deleted node. A virtual node part that defines the virtual node that has been
With
The addition target element includes a virtual node termination link that terminates the virtual node for all the virtual nodes, and includes electronic nodes and links that do not include nodes and links associated with the network before update other than the virtual nodes. .
In this way, the computer of the storage device can receive the electronic map update data and easily update the network before the update.

  Note that the present invention can be realized in various forms. For example, a reception-side information processing device that stores electronic map data including a network before update, and an electronic map for the reception-side information processing device. The present invention can be realized in the form of a map data update system, an electronic map data update program, a recording medium on which the computer program is recorded, and the like.

Explanatory drawing which shows schematic structure of the map display system as an Example. The figure explaining the content of the database stored in the navigation apparatus and the frozen map data server. The 1st figure which shows notionally the content of the database stored in the main map data server. The 2nd figure which shows notionally the content of the database stored in the main map data server. The 3rd figure which shows notionally the content of the database stored in the main map data server. The figure which shows node data notionally among network data. The figure which shows link data notionally among network data. The figure which shows the content of an attribute database notionally. The flowchart which shows the process step of a maintenance process. The figure explaining maintenance and delivery of difference data. The figure which shows an example of difference data notionally. The flowchart which shows the process routine of an update process. The 1st figure which shows notionally the update process using difference data. The 2nd figure which shows notionally the update process using difference data. The 1st figure which shows an example of map update. The 2nd figure which shows an example of map update. The figure explaining the update of the network data using the conventional difference data. Explanatory drawing explaining the 1st modification.

  Hereinafter, embodiments of the present invention will be described based on examples with reference to the drawings.

A. Example:
・ Configuration of map display system:
FIG. 1 is an explanatory diagram showing a schematic configuration of a map data update system 10 as an embodiment. As shown in the figure, the map data update system 10 of the embodiment includes a main map data server 100, a frozen map data server 150, a base station BS, and a navigation device 200 as a client device using map data. Yes. The main map data server 100, the frozen map data server 150, and the base station BS are communicably connected via the Internet INT. The navigation device 200 can wirelessly communicate with the base station BS. As a result, the navigation device 200 can communicate with the main map data server 100 via the base station BS.

  The navigation device 200 according to the present embodiment functions as a storage device that stores map data, and can also function as a map display device that displays a map based on the map data. The navigation device 200 includes a GPS receiver 201 and has a function of performing route guidance using this and the map display function. The navigation device 200 may be mounted on a moving body such as a car, or may be a portable device that can be carried by a user.

  The navigation device 200 includes a GPS receiver 201, a display panel 202, a touch panel 203, an audio output unit 204, a key input unit 205, a wireless communication circuit 206, and an external storage device 207 that functions as a map data storage device. The main control unit 210 is provided.

  The GPS receiver 201 is a device that receives radio waves transmitted from artificial satellites that constitute a GPS (Global Positioning System / Global Positioning System).

  The display panel 202 includes a liquid crystal display and a drive circuit that drives the liquid crystal display. The liquid crystal display has a resolution of, for example, 480 pixels × 640 pixels (VGA). The display panel 202 is not limited to a liquid crystal display, and various display devices such as an organic EL display can be employed.

  The touch panel 203 detects a press with a finger or a touch pen, and outputs an electric signal indicating the pressed position to the main control unit 210. The touch panel 203 is colorless and transparent, and is laminated over the entire image display surface of the display panel 202. As a result, the user of the navigation device 200 operates the navigation device 200 by, for example, pressing a graphical user interface (GUI) such as an icon included in the screen displayed on the display panel 202 with a finger or a touch pen. be able to.

  The voice output unit 204 includes a speaker for outputting voice during route guidance, a circuit for driving the speaker, and the like.

  The key input unit 205 includes a group of keys such as operation keys for receiving a request for the navigation device 200 from a user. The user of the navigation device 200 can perform various operations by using these keys.

  The wireless communication circuit 206 is a circuit for performing data communication with the base station BS. The wireless communication circuit 206 functions as a data receiving unit that receives data from the main map data server 100 via the base station BS.

  The external storage device 207 can be composed of a hard disk, a flash memory, a memory card, and the like. The external storage device 207 stores an image database CD1, a route database CD2, and an attribute database CD3 as map data. These contents will be described later.

  The main control unit 210 of the navigation device 200 is a computer for controlling the above-described units 201 to 207 of the navigation device 200. The main control unit 210 includes a central processing circuit (CPU) (not shown) and an internal storage device such as a ROM or a RAM.

  A navigation program for map display and route guidance is stored in the internal storage device of the navigation device 200. This program may be distributed via the Internet INT and the base station BS, for example, by an operator operating the frozen map data server 150 or the main map data server 100. The main control unit 210 implements processing / functions to be described later by executing this program.

  The main map data server 100 includes a communication unit 102, a control unit 104, and a storage unit 105. The control unit 104 is a computer for controlling the communication unit 102 and the storage unit 105 of the main map data server 100 described above. The communication unit 102 can communicate with the frozen map data server 150 via the independent line, and with the navigation device 200 via the Internet INT and the base station BS, respectively. The storage unit 105 stores an image database MD1, a route database MD2, and an attribute database MD3 as map data. The contents of these databases will be described later.

  The frozen map data server 150 includes a communication unit 152, a control unit 154, and a storage unit 155. The storage unit 155 stores an image database FD1, a route database FD2, and an attribute database FD3 as map data. The contents of these databases will be described later. The control unit 154 is a computer for controlling the above-described communication unit 152 and storage unit 155 of the frozen map data server 150. The communication unit 152 can communicate with the main map data server 100 via a dedicated independent line.

  The control unit 104 of the main map data server 100 and the control unit 154 of the frozen map data server 150 each include a CPU (not shown) and an internal storage device such as a ROM and a RAM. Programs that handle map data are stored in the internal storage devices of the control unit 104 and the control unit 154. The control unit 104 and the storage unit 105 execute various programs / functions described later by executing these programs.

  In the present embodiment, the frozen map data server 150 and the main map data server 100 are connected via a dedicated independent line, but may be connected via a LAN (local area network). . Further, the main map data server 100 and the frozen map data server 150 can be configured by one server computer.

  FIG. 2 is a diagram for explaining the contents of the database stored in the navigation device 200 and the frozen map data server 150. The image database FD1, the route database FD2, and the attribute database FD3 stored in the frozen map data server 150 are stored in the main map data server 100 in the first period, and are in the latest state in the first period. It is created based on MD1, route database MD2, and attribute database MD3. As will be described later, the image database MD1, the route database MD2, and the attribute database MD3 stored in the main map data server 100 are maintained depending on the current or future road conditions. As described above, the image database FD1, the route database FD2, and the attribute database FD3 stored in the frozen map data server 150 are stored on the basis of the image database MD1, the route database MD2, and the attribute database MD3 that are in the latest state at a predetermined time. This creation is called “freezing”. The image database CD1, the route database CD2, and the attribute database CD3 stored in the navigation device 200 are commercialized by copying the image database FD1, the route database FD2, and the attribute database FD3 stored in the frozen map data server 150, respectively. The contents are the same. FIG. 2 conceptually shows the contents of the image databases CD1, FD1, the route databases CD2, FD2, and the attribute databases CD3, FD3.

  In the image databases CD1 and FD1, data representing a map image (map image data) is stored in a vector data format. The map image data may be stored in a raster data format such as a bitmap format or a JPEG data format instead of the vector data format. The map image data includes data representing the shape of topography, buildings, roads, and the like.

  The route databases CD2 and FD2 store route data related to traffic routes existing in an area corresponding to the map image represented by the map image data. The route data is data representing a network indicating the arrangement of traffic routes on the ground surface. The network data includes node data representing an element point N1 (referred to as a node) in a traffic route and link data representing a line segment L1 (referred to as a link) connecting the nodes. The node N1 represents, for example, an intersection, a branch point, an end point, a start point, a boarding / exiting position such as a station. The link L1 represents a traffic route such as a roadway, a track, and a pedestrian road.

  Attribute data is stored in the attribute databases CD3 and FD3. The attribute data is information associated with the node N1 or the link L1 and indicating the attribute. The attribute data includes various data related to the node N1 and the link L1. For example, the attribute data associated with the link L1 includes the name of the link L1 (for example, the name of the road), the type of the link L1 (for example, that it is a highway), and other information related to the link L1 (for example, the highway) For example, a section fee) and the name of the node N1 (for example, the name of an intersection or a station). The attribute data associated with the node N1 is image data representing an image related to the associated node N1, specifically, for example, a schematic diagram showing a branching situation of the node N1 (for example, an intersection or a station) or an image showing a guide board. Alternatively, a captured image around the node N1 may be included. The attribute data associated with one node N1 or link L1 may be one or plural. Further, the attribute databases CD3 and FD3 do not have to be a single database. For example, attribute data related to a highway and attribute data related to a property such as a store or a station may be separate databases.

  FIG. 3 is a first diagram conceptually showing the contents of the database stored in the main map data server 100. FIG. 4 is a second diagram conceptually showing the contents of the database stored in the main map data server 100. FIG. 5 is a third diagram conceptually showing the contents of the database stored in the main map data server 100.

  The image database MD1 is the same as the image databases CD1 and FD1 stored in the navigation device 200 and the frozen map data server 150. On the other hand, the route database MD2 includes current generation data GE1, first next generation data GE2, and second next generation data GE3. The current generation data GE1 is route data including the same link L1 and node N1 as the route database CD2 frozen in the frozen map data server 150 in the first period described above. The first next-generation data GE2 is a traffic route that has changed or is scheduled to change in the period from the first time when freezing has been performed to the second time after the first time. Is route data including network data (consisting of node N2 and link L2). The second next-generation data GE3 is network data that represents a traffic route that has changed or is scheduled to change during the period from the second period to the third period after the second period. Route data including node N3 and link L3.

  Here, the current generation data GE1, the first next generation data GE2, and the second next generation data GE3 include space-time nodes FN1, FN2, and FN3 that are different from the normal nodes N1, N2, and N3, respectively. The spatiotemporal node FN2 included in the first next generation data GE2 is associated with the spatiotemporal node FN1 included in the current generation data GE1 in a one-to-one relationship, as indicated by a dashed arrow in FIG. It has been. The space-time node FN3 included in the second next-generation data GE3 is associated with the space-time node FN1 included in the current-generation data GE1 in a one-to-one relationship, as indicated by the dashed arrows in FIG. It has been. The spatio-temporal nodes corresponding to each other are completely coincident in the coordinates on the ground surface, that is, the latitude and longitude (and altitude if having an altitude). The pair of space-time nodes in this embodiment corresponds to the virtual nodes in the claims.

  FIG. 4 shows the details of the configuration of the first next generation data GE2 together with the details of the configuration of the current generation data GE1 related to the first next generation data GE2. In FIG. 4, the node N1, the link L1, and the space-time node FN1 included in the current generation data GE1, and the node N2, the link L2, and the space-time node FN2 included in the first next-generation data GE2, are further described at the end. Numbers are attached and shown one by one.

  The content of the first next-generation data GE2 is differential data that includes only data relating to a portion that will be changed in the second period with respect to the content of the current generation data GE1. The first next-generation data GE2 includes four nodes N201 to N204 as nodes to be added in the second period. The first next-generation data GE2 includes links L202 to L205 that connect two of the four nodes. Furthermore, the first next-generation data GE2 has a link in which one end is connected to a normal node and the other end (termination) is connected to a space-time node. Specifically, one end is connected to the node N201, the end is connected to the space-time node FN21, the other end is connected to the node N204, and the end is connected to the space-time node FN22. L206 is included. The network data (nodes and links) included in the first next generation data GE2 is associated with the network data of the current generation data GE1 only in the space-time nodes FN21 and FN22. Other elements of the network data of the first generation data GE2 are not associated with the network data of the current generation data GE1. All the spatiotemporal nodes FN2 are terminated with only one link connected thereto. In this embodiment, the nodes N201 to N204 and the links L201 to L206 to be added in the second period correspond to the addition target elements in the claims.

  When the data of the first next generation data GE2 is reflected on the current generation data GE1, that is, when the generation change to update the current generation data GE1 to the road condition at the second time is performed, In the example of FIG. 4, the link (deletion target link) that is entirely deleted from the current generation data GE1 is the link L103. Nodes N102 and N103 connected to both ends of the link L103 are automatically set as deletion target nodes (deletion target nodes). The deletion target link and the deletion target node are set by the operator when creating the first next generation data GE2, for example.

  On the other hand, in the current generation data GE1, the nodes N101 and N104 are nodes (non-deletion nodes) that are not deleted when the generation change using the first next generation data GE2 is performed. All the links that connect the non-deletion node and the deletion target node are links in which the spatiotemporal node FN1 is arranged (spatiotemporal node arrangement link). When the first next generation data GE2 is created, in the current generation data GE1, the spatiotemporal node arrangement link is arranged with the spatiotemporal node FN1, and is divided into two by the spatiotemporal node FN1. Specifically, as shown in FIG. 4, a spatio-temporal node FN11 is arranged on the link connecting the deletion target node N102 and the non-deletion node N101, and connects the non-deletion node N101 and the spatio-temporal node FN11. The link is divided into a non-deletion side link L101 and a deletion side link L102 that connects the spatiotemporal node FN11 and the deletion target node N102. As shown in FIG. 4, a spatiotemporal node FN12 is arranged on the link connecting the deletion target node N103 and the non-deletion node N104, and the non-deletion side connecting the non-deletion node N104 and the spatiotemporal node FN12. The link L105 is divided into a deletion-side link L104 that connects the space-time node FN12 and the deletion target node N103. The non-deletion side link in this embodiment corresponds to the remaining connection link in the claims, and the deletion side link in this embodiment corresponds to the deletion connection link in the claims.

  FIG. 5 shows details of the configuration of the second next generation data GE3 along with details of the configuration of the current generation data GE1 related to the second next generation data GE3. In FIG. 5, as in FIG. 4, the node N1, the link L1, and the space-time node FN1 included in the current generation data GE1, and the node N3, the link L3, and the space-time node FN3 included in the second next-generation data GE3. In addition, a number is added to the end of each, and each is distinguished and illustrated.

  The content of the second next-generation data GE3 is differential data including only data relating to a portion that is changed in the third period with respect to the content of the current generation data GE1. The second next-generation data GE3 includes six nodes N301 to N306 as nodes to be added in the third period. The second next generation data GE3 includes links L307 to L312 that connect two of the six nodes. Further, the second next-generation data GE3 has a link in which one end is connected to a normal node and the other end (termination) is connected to a space-time node. Specifically, a link L301 connecting the node N301 and the space-time node FN33, a link L302 connecting the node N302 and the space-time node FN34, a link L303 connecting the node N303 and the space-time node FN35, A link L304 that connects the node N304 and the space-time node FN36, a link L305 that connects the node N305 and the space-time node FN37, and a link L306 that connects the node N306 and the space-time node FN38 are included. The network data (nodes and links) included in the second next generation data GE3 is associated with the network data of the current generation data GE1 only in the space-time nodes FN33 to FN38. The other elements of the network data of the second generation data GE3 are not associated with the network data of the current generation data GE1. All the spatio-temporal nodes FN3 are terminated with only one link connected. In this embodiment, the nodes N301 to N306 and the links L301 to L212 to be added in the third period correspond to the addition target elements in the claims.

  When the data of the second next generation data GE3 is reflected on the current generation data GE1, that is, when the generation change to update the current generation data GE1 to the road condition at the third time is performed, The deletion target link that is entirely deleted from the current generation data GE1 is the link L112 in the example of FIG. Nodes N108 and N109 connected to both ends of the link L112 are automatically set as deletion target nodes. The deletion target link and the deletion target node are set by the operator when creating the second next generation data GE3, for example.

  On the other hand, in the current generation data GE1, the nodes N105 to N107 and N110 to N112 are non-deleted nodes that are not deleted when a generation change using the second next-generation data GE3 is performed. All the links connecting the non-deletion node and the deletion target node are spatiotemporal node arrangement links in which the spatiotemporal node FN1 is arranged. When the second next generation data GE3 is created, in the current generation data GE1, the spatiotemporal node arrangement link is arranged with the spatiotemporal node FN1, and is divided into two by the spatiotemporal node FN1. Specifically, as shown in FIG. 5, a spatio-temporal node FN13 is arranged on the link connecting the deletion target node N108 and the non-deletion node N105, and the non-deletion node N105 and the non-deletion node FN13 are connected to each other. The deletion side link L106 is divided into a deletion side link L107 that connects the spatiotemporal node FN13 and the deletion target node N108. Also, as shown in FIG. 5, a spatiotemporal node FN14 is arranged in the link connecting the deletion target node N108 and the non-deletion node N106, and the non-deletion side link connecting the non-deletion node N106 and the spatiotemporal node FN14. It is divided into L108 and a deletion side link L109 connecting the space-time node FN14 and the deletion target node N108. As shown in FIG. 5, a spatiotemporal node FN18 is arranged on the link connecting the deletion target node N108 and the non-deletion node N112, and the non-deletion side link L111 connecting the non-deletion node N112 and the spatiotemporal node FN18 The space-time node FN18 and the deletion target node N108 are divided into a deletion-side link L110. Similarly, a space-time node FN15 is arranged on a link connecting the deletion target node N109 and the non-deletion node N107, and a non-deletion side link L113 connecting the non-deletion node N107 and the space-time node FN15, The node is divided into a deletion side link L114 that connects the node FN15 and the deletion target node N109. Similarly, a spatiotemporal node FN16 is arranged in the link connecting the deletion target node N109 and the non-deletion node N110, and the non-deletion side link L118 connecting the non-deletion node N110 and the spatiotemporal node FN16, The node is divided into a deletion side link L117 that connects the node FN16 and the deletion target node N109. Similarly, a spatio-temporal node FN17 is arranged on the link connecting the deletion target node N109 and the non-deletion node N111, and the non-deletion side link L116 connecting the non-deletion node N111 and the spatio-temporal node FN17, This is divided into a deletion side link L115 that connects the node FN17 and the deletion target node N109.

  FIG. 6 is a diagram conceptually illustrating node data among network data corresponding to the above-described configuration of the route database MD2. In the node data shown in FIG. 6, data related to one node is described in one line. For the sake of easy understanding, the same reference numerals as the reference numerals of the nodes shown in FIGS. 4 and 5 are used as the reference numbers. Actually, it may be omitted or may be a simple integer serial number.

  The future system ID is attached to a node related to the generation change. For example, “001” is assigned as the future system ID to the node related to the generation change of the second period shown in FIG. Specifically, the normal nodes N201 to N204 and the spatio-temporal nodes FN21 and FN22 included in the first next-generation data GE2 in FIG. 4 are all assigned “001” as the future system ID. Similarly, among the nodes belonging to the current generation data GE1, the deletion target nodes N102 and N103 that are deleted in the generation change performed using the first next generation data GE2 are all set with “001” as the future system ID. It is attached. Similarly, among the nodes belonging to the current generation data GE1, the space-time nodes FN11 to FN12 corresponding to the space-time nodes FN21 and FN22 included in the first next-generation data GE2 are all set to the future system ID “001”. "Is attached.

  Similarly, “002” is assigned as the future system ID to the node related to the generation change of the third period shown in FIG. Specifically, the normal nodes N301 to N306 and the space-time nodes FN33 to FN38 included in the second next-generation data GE3 in FIG. 5 are all assigned “002” as the future system ID. Similarly, among the nodes belonging to the current generation data GE1, the deletion target nodes N108 and 109 to be deleted in the generation change performed using the second next generation data GE3 are all set to “002” as the future system ID. It is attached. Similarly, among the nodes belonging to the current generation data GE1, the space-time nodes FN13 to FN18 corresponding to the space-time nodes FN33 to FN38 included in the second next-generation data GE3 are all set to “002” as future system IDs. "Is attached.

  The addition / deletion code is added or deleted for each node with a future ID. For example, “addition” is added to the normal nodes N201 to N204 and the space-time nodes FN21 and FN22 included in the first next-generation data GE2 in FIG. Of the nodes belonging to the current generation data GE1, “deleted” is attached to the deletion target nodes N102 and N103 to be deleted in the generation change performed using the first next generation data GE2. Similarly, among the nodes belonging to the current generation data GE1, the space-time nodes FN11 and FN12 corresponding to the space-time nodes FN21 and FN22 included in the first next-generation data GE2 are similarly marked with “deleted”. Yes.

  “Addition” is attached to the normal nodes N301 to N306 and the space-time nodes FN33 to FN38 included in the second next-generation data GE3 in FIG. Of the nodes belonging to the current generation data GE1, “deletion” is given to the deletion target nodes N108 and N109 that are deleted in the generation change performed using the second next generation data GE3. Of the nodes belonging to the current generation data GE1, the space-time nodes FN13 to FN18 corresponding to the space-time nodes FN33 to FN38 included in the second next-generation data GE3 are marked with “deleted”.

  The type describes whether each node is a normal node or a space-time node. In the latitude and longitude, coordinates on the ground surface of each node are described by latitude and longitude values. Here, a pair of spatiotemporal nodes corresponding to each other have the same latitude and longitude. For example, as shown in FIG. 6, it can be seen that the spatiotemporal node FN11 and the spatiotemporal node FN21 corresponding to each other describe x13 and y13 which are the same latitude and longitude.

  The corresponding node describes a corresponding space-time node for each space-time node. For example, the space-time node FN12 describes a space-time node FN22 as a corresponding node, and the space-time node FN22 describes a space-time node FN12 as a corresponding node. Thereby, it is understood that the space-time node FN12 and the space-time node FN22 are a pair of space-time nodes corresponding to each other.

  FIG. 7 is a diagram conceptually showing link data among the network data corresponding to the above-described configuration of the route database MD2. In the link data shown in FIG. 7, data relating to one link is described in one line. For the sake of easy understanding, the reference numbers are the same as the reference numerals of the links given in FIGS. 4 and 5. Actually, it may be omitted or may be a simple integer serial number.

  The future ID is attached to a link related to the generation change. For example, the link related to the generation change of the second period shown in FIG. 4 is assigned “001” as the future ID. Specifically, all the links included in the first next-generation data GE2 in FIG. 4, that is, the normal links L202 to N205 and the links L201 and 206 that terminate at the space-time nodes FN21 and 22 are all future. “001” is assigned as the system ID. Similarly, among the links belonging to the current generation data GE1, the deletion target link L103 that is entirely deleted in the generation change performed using the first next generation data GE2 is similarly assigned “001” as the future system ID. Has been. Also, among the links belonging to the current generation data GE1, the deletion side links L102 and L104 described above are all assigned “001” as the future system ID.

  The addition / deletion code is added or deleted for each link with a future ID. For example, all the links included in the first next generation data GE2 in FIG. 4, that is, the normal links L202 to L205 and the links L201 and L206 terminated with the space-time nodes FN21 and FN22, are all “added”. It is attached. Of the nodes belonging to the current generation data GE1, “delete” is attached to the deletion target link L103 and the deletion side links L102 and L104 to be deleted in the generation change performed using the first next generation data GE2. Has been.

  All the links included in the second next-generation data GE3 in FIG. 5, that is, the normal links L307 to L312 and the links L301 to L306 that terminate at the space-time nodes FN33 and FN38, are all added. ing. In addition, among the nodes belonging to the current generation data GE1, the deletion target link L112 and the deletion side links L107, L109, L110, L114, L115, and L117 that are deleted in the generation change performed using the second next generation data GE3. Are all marked with “delete”.

  The type describes that each link is a link. A node to which one end of each link is connected is described in the first end node, and a node to which the other end of each node is connected is described in the second end node. For example, it is understood that the link L101 is a node that connects the node N101 and the space-time node FN11.

  The restriction information is described when there is a restriction on each link. In the restriction information, for example, when the route represented by the link is a one-way road, this is described. For example, in the link L108, it is described as restriction information that the vehicle is allowed to pass only in the direction from the first end node to the second end node. Further, the link L113 describes, as the restriction information, that the vehicle is only allowed to pass in the direction from the second end node to the first end node. A link in which no restriction information is described represents an ordinary road that can be passed in both directions. Such links may be clearly described as “both passages” as regulatory information.

  FIG. 8 is a diagram conceptually showing the contents of the attribute database MD3. In the attribute data shown in FIG. 7, one attribute data is described in one line. The reference numbers are the same as those shown in FIGS. 1, 4 and 5 for easy understanding. Actually, it may be omitted or may be a simple integer serial number.

  The future system ID is attached to attribute data related to the generation change. For example, “001” is assigned as the future system ID to the attribute data Z21 and Z22 related to the generation change of the second period shown in FIG. Similarly, “002” is assigned as the future system ID to the attribute data Z31, Z32, Z13 related to the generation change of the third period shown in FIG.

  The addition / deletion code is added or deleted for each attribute data with a future system ID. For example, the attribute data Z21 and Z22 added in the second generation change shown in FIG. 4 and the related attribute data Z31 added in the third change generation shown in FIG. “Addition” is attached to Z32. Of the nodes belonging to the current generation data GE1, attribute data (not shown in FIG. 4) to be deleted in the generation change performed using the first next generation data GE2, or the generation performed using the second next generation data GE3 “Delete” is attached to the attribute data Z13 to be deleted in the alternation.

  The corresponding element describes a node or link associated with each attribute information. For example, it can be seen that the attribute data Z13 is associated with the link L114. The item is the content of the attribute information, and there may be a plurality of items as described above. As described above, the item includes a link name, type, other information, a node name, a schematic diagram showing a node branching state, an image showing a guide board, and the like.

  Here, the process of adding the first next-generation data GE2 and the second next-generation data GE3 as needed to the path database MD2 (including only the current generation data GE1) after being frozen once. (Maintenance processing) will be described. FIG. 9 is a flowchart showing the processing steps of the maintenance process.

  The maintenance process is performed, for example, when a road scheduled to be opened is actually present and the data is not stored in the route database MD2. When the maintenance process is started, first, a deletion target link is set (step S110). For example, the maintenance process for adding the first next generation data GE2 shown in FIG. 4 will be described as an example. First, the link L103 is set as the deletion target link. Specifically, in the link data shown in FIG. 7, “delete” is described in the addition / deletion code of the link L103. For example, the operator sets the deletion target link.

  When the deletion target link is set, the nodes located at both ends of the deletion target link are set as the deletion target node (step S120). The maintenance process for adding the first next-generation data GE2 shown in FIG. 4 will be described as an example. First, the nodes N103 and N104 located at both ends of the link L103 are set as deletion target nodes. Specifically, in the node data shown in FIG. 6, “delete” is described in the addition / deletion codes of the nodes N103 and N104. The setting of the deletion target node may be executed by an operator, or may be automatically performed by a computer.

  When the deletion target node is set, a spatiotemporal node is arranged (step S130). First, the spatiotemporal node is arranged on all the spatiotemporal node arrangement links that connect the set deletion target node and the non-deletion node in the current generation data GE1. The maintenance process for adding the first next-generation data GE2 shown in FIG. 4 will be described as an example. The spatiotemporal node FN12 is arranged on the spatiotemporal node arrangement link that connects the deletion target node N103 and the non-deletion node N104, and is deleted. A spatiotemporal node FN11 is arranged on a spatiotemporal node arrangement link that connects the target node N102 and the non-deletion node N101. Specifically, in the node data shown in FIG. 6, the data of the space-time node FN11 and the space-time node FN12 are added. Further, a next generation spatiotemporal node corresponding to the spatiotemporal node arranged in the current generation data GE1 is arranged. Specifically, in the node data shown in FIG. 6, the data of the space-time nodes FN12 and FN22 respectively corresponding to the space-time nodes FN11 and FN12 are added. The space-time nodes FN11 and FN12 described in the current generation data GE1 have the addition / deletion code described as “deletion”, and the space-time nodes FN21 and FN22 described in the first next-generation data GE2 have the addition / deletion code. It is described as “add”. The arrangement of the spatiotemporal nodes is executed by an operator, for example.

  When the space-time node is arranged, the space-time node arrangement link where the space-time node is arranged in the current generation data GE1 is separated by the space-time node (step S140). The maintenance process for adding the first next-generation data GE2 shown in FIG. 4 will be described as an example. The spatiotemporal node arrangement link connecting the deletion target node N103 and the non-deletion node N104 is the non-deletion side link L105 and the deletion side. It is separated into a link L104. Specifically, in the link data shown in FIG. 7, the spatio-temporal node arrangement link that has been described as one link so far is described separately as the non-deletion side link L105 and the deletion side link L104. The spatiotemporal node arrangement link that connects the deletion target node N102 and the non-deletion node N101 is separated into a non-deletion side link L101 and a deletion side link L102. Specifically, in the link data shown in FIG. 7, the spatiotemporal node arrangement link that has been described as one link so far is described separately as the non-deletion side link L101 and the deletion side link L102. Here, the addition / deletion code of the deletion side link L102 and the deletion side link L104 is described as “deletion”.

  Next, the addition target node and the addition target link are recorded (step S150). The maintenance process for adding the first next generation data GE2 shown in FIG. 4 will be described as an example. All normal nodes N101 to N104 included in the first next generation data GE2 are recorded in the node data shown in FIG. Is done. Also, all the links included in the first next-generation data GE2, that is, the normal links L202 to N205 and the links L201 and 206 terminating in the space-time nodes FN21 and 22 are recorded in the link data shown in FIG. The The addition target node and the addition target link are recorded, for example, by an operator.

  Next, deletion attribute data is set (step S160). In the maintenance process for adding the first next-generation data GE2 shown in FIG. 4, since there is no attribute data to be deleted, this step is omitted. On the other hand, in the maintenance process for adding the second next generation data GE3 shown in FIG. 5, the attribute data Z13 is set as the deletion attribute data. Specifically, in the attribute data shown in FIG. 8, “deletion” is described in the addition / deletion code of the attribute data Z13. The setting of the deletion attribute data is executed by an operator, for example.

  Next, additional attribute data is set (step S170). The maintenance process for adding the first next-generation data GE2 shown in FIG. 4 will be described as an example. In the attribute data shown in FIG. 8, attribute data Z21 and Z22 are described. The setting of the additional attribute data is executed by an operator, for example.

  Next, the future system common to the deletion target link, deletion target node, spatio-temporal node, deletion side link, addition target node, addition target link, deletion attribute data, and additional attribute data set in the above-described steps S110 to S170. An ID is set (step S180). The maintenance process for adding the first next-generation data GE2 shown in FIG. 4 will be described as an example. In the node data shown in FIG. 6, the deletion target nodes N102 and N103, and the space-time nodes FN11, FN12, FN21, FN22, and The future system ID “001” is assigned to the addition target nodes N201 to N204. Similarly, in the link data shown in FIG. 7, the same future system ID “001” is assigned to the deletion side links L102 and L104, the deletion target link L103, and the addition target links L201 to L206. Further, in the attribute data shown in FIG. 8, the same future system ID “001” is added to the additional attribute data Z21 and Z22.

  When the future ID is set, the maintenance process is terminated. Note that the order of steps S110 to S180 can be arbitrarily changed, and is not limited to the order shown in FIG. For example, the future ID can be set first.

  FIG. 10 is a diagram illustrating maintenance and distribution of difference data. The maintenance process of the first next-generation data GE2 and the second next-generation data GE3 is preferably performed in advance using a road maintenance plan or the like before the actual target route is opened. For example, immediately after the target route is actually opened, the difference data based on the first next-generation data GE2 reflecting the route is used as a utilization device (for example, a navigation device) of the current generation data GE1 that is data at the time of freezing. 200).

  FIG. 11 is a diagram conceptually illustrating an example of difference data. FIG. 11 shows difference data DF001 distributed to the navigation device 200 that uses the current generation data GE1. The difference data DF001 is data for updating the generation by reflecting the contents of the first next generation data GE2 in the current generation data GE1. Specifically, the difference data includes node difference data, link difference data, and attribute difference data. The node difference data is data obtained by extracting a row with the future system ID “001” from the node data shown in FIG. The link difference data is data obtained by extracting the row with the future ID “001” from the link data shown in FIG. The attribute difference data is data obtained by extracting the row with the future ID “001” from the attribute data shown in FIG. As described above, the difference data DF001 for reflecting the contents of the second period in the current generation data GE1 uses the future ID “001” to extract the target data from the data shown in FIGS. You can easily create it. Although illustration is omitted, the difference data DF002 for updating the generation by reflecting the contents of the first next generation data GE2 in the current generation data GE1 uses the future system ID “002” as shown in FIG. It can be easily created simply by extracting the target data from the data shown in FIG.

  FIG. 12 is a flowchart showing a processing routine of update processing executed in the navigation device 200. The update process is a process for updating the route database CD2 and the attribute database CD3 included in the navigation device 200 using the difference data.

  The update process is executed when the difference data DF is received in the navigation device 200 (step S210). When the difference data DF is received, the main control unit 210 of the navigation device 200 arranges the space-time node FN1 described in the difference data DF in the current generation data GE1 (step S220). Since the difference data DF describes the coordinates (latitude and longitude) of the spatio-temporal node FN1, the navigation apparatus 200 refers to the coordinates so that the navigation apparatus 200 places the spatio-temporal node on any link of the current generation data GE1. FN1 can be arranged. The case where the difference data DF001 shown in FIG. 11 is received will be described. The main control unit 210 places the space-time node FN11 on the link connecting the node N101 and the node N102. In addition, the main control unit 210 arranges the spatiotemporal node FN12 on a link connecting the node N103 and the node N104 (FIG. 4).

  When the space-time node FN1 is arranged, the main control unit 210 separates the link where the space-time node FN1 is arranged at the space-time node FN1 (step S230). The case where the difference data DF001 shown in FIG. 11 is received will be described. The main control unit 210 separates the link connecting the node N101 and the node N102 into the link L101 and the link L102, and the node N103 and the node N104. Are separated into link L104 and link L105.

  When the separation is completed, the main control unit 210 deletes the element to be deleted from the route database CD2 and the attribute database CD3 (step S240). The elements to be deleted are links, nodes, and attribute data whose addition / deletion code is “deleted” in the difference data DF. Therefore, the main control unit 210 can easily recognize the element to be deleted. The case where the difference data DF001 shown in FIG. 11 is received will be described. The main control unit 210 deletes N102 and N103 and the space-time nodes FN11 and FN12 included in the current generation data GE1 from the path database CD2. In addition, the main control unit 210 deletes the deletion target link L103 and the deletion side links L102 and L104 from the route database CD2.

  When the element to be deleted is deleted, the main control unit 210 adds the element to be added to the route database CD2 and the attribute database CD3 (step S250). The elements to be added are links, nodes, and attribute data whose addition / deletion code is “added” in the difference data DF. Therefore, the main control unit 210 can easily recognize the element to be added. The case where the difference data DF001 shown in FIG. 11 is received will be described. The main control unit 210 adds N201 to N204 and the spatio-temporal nodes FN21 and FN22 included in the node difference data to the route database CD2. Further, the main control unit 210 adds the links L201 to L206 to be added to the route database CD2. Further, the main control unit 210 adds the attribute data Z21 and Z22 to be added to the attribute database CD3.

  When the element to be added is added, the main control unit 210 confirms the consistency of the link connected to the space-time node FN2 in the route database CD2 after the addition (step S260). Specifically, the non-deletion side link and the newly added link should be connected to the space-time node FN2. Therefore, the main control unit 210 checks whether or not the restriction information of the non-deletion side link connected to the space-time node FN2 and the newly added link match. The space-time node FN2 is actually a node virtually placed on a link corresponding to a single road that does not change, so that the regulation information changes across the space-time node FN2 after generation update. There is no. For example, when the space-time node FN2 is one-way in a predetermined direction before the generation change, the restriction information of the non-deleted link connected to the space-time node FN2 and the newly added link are both the same. Should be described as one-way in direction. For this reason, if the generation update is performed normally, the restriction information of the non-deleted link and the newly added link should match in all the spatiotemporal nodes FN2. The main control unit 210 can determine whether or not generation update has been performed normally by checking this step. The case where the difference data DF001 shown in FIG. 11 is received will be described. The main control unit 210 matches the restriction information of the non-deletion side link L101 connected to the space-time node FN21 and the newly added link L201. Check whether or not. Further, it is confirmed whether or not the restriction information of the non-deletion side link L105 connected to the space-time node FN22 and the newly added link L206 match.

  Although illustration is omitted, as a result of the confirmation of this step, the main control unit 210, in any one of the space-time nodes FN2, if the restriction information of the non-deletion side link and the newly added link do not match, It may be determined that the difference data DF reception error has occurred, the main map data server 100 may be requested to redistribute the difference data DF, the difference data DF may be received again, and the update process may be performed again.

  The main control unit 210 deletes the spatiotemporal node FN2 when the restriction information of the non-deletion side link and the newly added link match in all the spatiotemporal nodes FN2 (step S270). In other words, the route database CD2 is rewritten so that the non-deleted link and the newly added link become one link. The case where the difference data DF001 shown in FIG. 11 is received will be described. The main control unit 210 converts the non-deletion side link L101 connected to the spatiotemporal node FN21 and the newly added link L201 to the non-deletion node N101. The newly added node N201 is replaced with a single link for connection. The main control unit 210 also connects the non-deleted side link L105 connected to the spatiotemporal node FN22 and the newly added link L206 to the non-deleted node N104 and the newly added node N204. Replace with a link. The space-time node FN2 may be left in the route database CD2 as a normal node without being deleted. When the space-time node FN2 is deleted, an increase in the data amount of the route database CD2 can be suppressed.

  FIG. 13 is a diagram conceptually showing an update process using the difference data DF001. FIG. 13 shows the update process until the time-space node FN2 is deleted (up to step S260). Deletion target elements FN1, L1, and N1 that are terminated with the spatio-temporal node FN1 are indicated by a symbol DS1. It can be seen that the addition target elements FN2, N2, and L2 are added to the route database CD2 with the spatiotemporal node FN2 as a joint instead of the deletion target element DS1. It can also be seen that additional attribute data Z21 and Z22 have been added.

  FIG. 14 is a diagram conceptually illustrating an update process using the difference data DF002. FIG. 14 shows the update process until the time-space node FN3 is deleted (up to step S260). The deletion target elements FN1, L1, N1, and the deleted attribute data Z13, which are terminated with the spatio-temporal node FN1, are indicated by the symbol DS2. It can be seen that the addition target elements FN3, N3, and L2 are added to the route database CD2 with the spatiotemporal node FN3 as a joint instead of the deletion target element DS2. It can also be seen that additional attribute data Z31 and Z32 have been added.

  This update process is easy to understand if you imagine a network. Of the parts constituting the net, all the strings connecting the knots to be separated and the knots not to be separated are cut so as to completely separate the knots and knots to be separated. As a result, the string and knot to be separated fall down. Then, a string and a knot to be newly added are prepared so as to include all the strings to be joined to the end of the cut string. Then, by joining the end of the cut string and the end of the prepared string, a string and a knot to be newly added are added to the net. The space-time node FN1 in this embodiment corresponds to the end of the cut string, and the space-time nodes FN2 and FN3 in this embodiment correspond to the end of the string joined to the end of the cut string. is there.

  In the above, a simple example with only one deletion target link has been described for easy understanding. However, if the method in this embodiment is used, more complicated map data can be easily updated. FIG. 15 is a first diagram illustrating an example of map update. FIG. 16 is a second diagram illustrating an example of map update. FIG. 15 illustrates a current road situation in a certain area and a future road situation in the same area. FIG. 16 illustrates network data indicating the current road condition in FIG. 15 and future maintenance data for updating the network data indicating the current road condition to the future network data in FIG. In the example shown in FIG. 15, a thick solid line HW indicates a highway, and a thin solid line NO indicates a general road. A point CR indicates an intersection. The situation shown in FIG. 15 is an example of typical road maintenance in which the general road NO entering the highway HW is made into two sections at the interchange of the highway HW. The road situation shown in FIG. 15 is represented by a node NCR corresponding to the intersection CR and links LHW and LNO corresponding to the highway HW and the general road NO as shown in FIG.

  As shown on the left side of FIG. 16, nodes NCR located at both ends of a link representing a road to be deleted in a future road situation are set as deletion target nodes. Then, the spatio-temporal node FN is arranged on all the links connecting the deletion target node and the non-deletion target node. Then, as shown on the right side of FIG. 16, the addition target elements (addition target nodes, links, and attribute data) are added to the future maintenance data so that the addition target links that end with the spatiotemporal nodes are included for all the spatiotemporal nodes. Prepare as. If the future maintenance data is managed with the future system ID, the current network data and a plurality of generations of future maintenance data can be easily managed in the same storage device. Further, regarding the contents of the future maintenance data, when updating the current network data, the deletion code is associated with the constituent elements of the current network data to be deleted, and the additional code is associated with the future maintenance data. In this way, it is possible to easily update the generation of network data by deleting the component associated with the deletion code from the current network data and adding the future maintenance data associated with the additional code to the current network data. It can be performed.

  Furthermore, as described above, the difference data for updating the current network data stored in the navigation device 200 to reflect the contents of the future maintenance data can be easily created using the future system ID. FIG. 17 is a diagram for explaining updating of network data using conventional difference data. Since the conventional maintenance database 1050 could not manage the current road situation and the future road situation in a multi-layered manner, the conventional maintenance database 1050 was normally updated after the road situation actually changed. For this reason, the maintenance time of the maintenance database 1050 was delayed. Conventionally, when the maintenance database 1050 is to be maintained in advance, it has been necessary to copy and store the maintenance database 1050 and perform maintenance on the copied maintenance database 1050. For this reason, an enormous storage device and time for storing the copy are required. In addition, when the conventional maintenance database 1050 is updated, the updated maintenance database 1050 is frozen to create the latest frozen database 1550, and the previous frozen database 1550 and the latest frozen database previously frozen. Compared with 1550, difference data DF was created. For this reason, enormous time and cost were required for the comparison work. These problems can be solved according to the present embodiment.

  Further, in the conventional difference data DF, the area of the ground surface is divided into a mesh such as a rectangle, and a portion different from the predecessor in mesh units is set as difference data. For this reason, the difference data includes a portion that is not changed, and there is a problem that the data amount of the difference data increases. As described above, the difference data DF in the present embodiment includes a spatio-temporal node, an addition target element, and a deletion target element, so that the data amount of the difference data can be suppressed compared to the conventional case.

B. Modifications-First modification:
FIG. 18 is an explanatory diagram for explaining the first modification. In the above embodiment, the spatio-temporal node is arranged on the link connecting the non-deletion node and the deletion target node (separation target connection link), but instead of this, the non-deletion target node among the deletion target nodes A node connected via a link (deletion end node) may be used as a spatiotemporal node. In the example shown in FIG. 18, among the links L101 to L107 constituting the current generation data GE1, the links L102 to L104 are deletion target links that are deleted when the generation is updated. Of the nodes N101 to N108 constituting the current generation data GE1, the nodes N101 to N104 are deletion target nodes that are deleted when the generation is updated. Among the nodes to be deleted, the node N101 and the node N104 are deletion end nodes and are used as space-time nodes. In this case, in the next generation data GE2, as in the embodiment, the nodes N101 and N104 as the spatiotemporal nodes in the current generation data GE1 and the associated spatiotemporal nodes FN21 and FN22 are set, respectively. The The next-generation data GE2 includes nodes N201 to N204 and links L201 to L206, which are addition targets when the generation is updated, as in the embodiment. The links L201 and L206 are links in which one end is connected to a normal node and the other end (termination) is connected to a space-time node. The network data (node and link) included in the next generation data GE2 is associated with the network data of the current generation data GE1 only in the space-time nodes FN21 and FN22, as in the embodiment.

  In the first modification, the generation update is executed by deleting the deletion target node from the current generation data GE1 and adding the addition target node and the spatiotemporal node in the next generation data GE2 to the GE2.

  According to this modification, the same operation and effect as the embodiment can be obtained. Furthermore, the amount of data in the current generation data GE1 can be reduced as compared with the case where a new space-time node is set on the link. Further, as in the embodiment, the processing for separating the link where the space-time node is arranged into the deletion side link and the non-deletion side link becomes unnecessary, so that the processing amount for generation management and generation update can be reduced.

Also, a spatio-temporal node arranged on the link and a spatio-temporal node using an existing node may be mixed. In general, for all deleted end nodes,
1) The deleted end node itself is a virtual node.
2) The virtual nodes are arranged on all the separation target connection links that are links connecting the deleted end node and the non-deleted node.
It is only necessary to set a virtual node by executing one of the above.

・ Second modification:
In the above embodiment, the difference data DF includes data about the element to be deleted, but these may not be included. If it is possible to specify which side of the spatiotemporal node FN1 is to be deleted for each of the spatiotemporal nodes FN1, the deletion target element can be specified in the navigation device 200. For this reason, for example, information (for example, a direction vector) for specifying which side of the space-time node FN1 is a deletion target for each space-time node FN1 may be included in the difference data DF. In this way, the data about the deletion target element can be reduced from the difference data DF, so that the size of the difference data DF can be further suppressed.

・ Third modification:
In the above embodiment, the route database CD2 and the attribute database CD3 are updated. However, in addition to this, it is preferable to update the image described in the image database CD1. That is, it is preferable that image data representing an image corresponding to the addition target element and the deletion target element is also included in the difference data DF. In this case, the image is divided into meshes, a deletion / addition code is attached in units of meshes, and the deletion target mesh and the addition target mesh are multi-layered by the future system ID, thereby centrally managing in the image database MD1. It is preferable. And it is preferable to include the image data about the mesh with the future system ID in the difference data DF. In this way, the navigation apparatus 200 that has received the difference data DF can easily update the image described in the image database CD1.

-Fourth modification:
In the above-described embodiment, generation management of network data is performed using only future system IDs, but it may be difficult to update actual network data for each route. In such a case, it is preferable to further add a future group ID to which a plurality of types of future IDs belong. In this way, a plurality of updates with a plurality of types of future IDs can be extracted using the future group ID. For example, different future system IDs may be attached for each route to be updated, and future system group IDs may be attached to groups of routes to be updated at the same update time. In this way, the difference data DF for updating a plurality of routes can be easily created using the future group ID. Moreover, since the difference data DF can be created using the future system ID and the difference data DF can be created using the future system group ID, it is possible to update the route unit or to group the plurality of routes. Can be easily updated.

-5th modification:
The main map data server 100 includes an update processing unit that updates its own current generation data GE1 to reflect the first next generation data GE2 and the second next generation data GE3 stored therein. Is preferred. The update method is the same as steps S240 to S270 of the update process in the navigation apparatus 200 described with reference to FIG. By doing so, it is possible to suppress an increase in the number of generations to be managed by updating the current generation data GE1 as needed.

-6th modification:
In the above embodiment, a part of the configuration realized by hardware may be replaced with software, and conversely, a part of the configuration realized by software may be replaced by hardware.

  As mentioned above, although the Example and modification of this invention were demonstrated, this invention is not limited to these Example and modification at all, and implementation in a various aspect is possible within the range which does not deviate from the summary. It is.

DESCRIPTION OF SYMBOLS 10 ... Map data update system 100 ... Main map data server 102 ... Communication part 104 ... Control part 105 ... Memory | storage part 150 ... Freezing map data server 152 ... Communication part 154 ... Control part 155 ... Memory | storage part 200 ... Navigation apparatus 201 ... GPS reception Machine 202 ... Display panel 203 ... Touch panel 204 ... Audio output unit 205 ... Key input unit 206 ... Wireless communication circuit 207 ... External storage device 210 ... Main control unit

Claims (10)

A method for updating electronic map data including a network comprising a plurality of nodes and links connecting the nodes, the computer comprising:
(A) in the network before update, setting a deletion target link that is a link that is entirely deleted by the update; and
(B) setting nodes arranged at both ends of the deletion target link as deletion target nodes;
(C) In the network before update, among all the deletion end nodes connected via a link to the non-deletion nodes that are not the deletion target nodes among the deletion target nodes,
(1) The deleted end node is set as a virtual node. (2) The virtual node is arranged on all the connection links to be separated that are links connecting the deleted end node and the non-deleted node. Setting the virtual node;
(D) When there is the separation target connection link in which the virtual node is arranged, all of the separation target connection links are connected to the deletion connection link that connects the virtual node and the deletion end node, and the virtual Separating a node and a remaining connection link connecting the non-deletion node;
(E) A step of preparing an addition target element that is a node and a link of update data added by the update, and the addition target element includes all virtual node termination links that are links that terminate the virtual node. Including the virtual node and being prepared not to have a connection with the network before the update except for the virtual node;
(F) The deletion target link and the deletion target node are deleted from the network before update, and when the deletion connection link exists, the deletion connection link is deleted and the addition target is added to the network before update. Updating the network data by adding elements;
A method for updating electronic map data, including The electronic map data update method according to claim 1,
In the step (c), for all of the deletion end nodes, the virtual nodes are arranged on all of the separation target connection links that are links that connect the deletion end node and the non-deletion nodes. How to update electronic map data. An electronic map data updating method according to claim 1 or 2, wherein:
The electronic map data includes an attribute database that stores attribute data associated with the node or link;
The method further comprises:
(G) setting deletion target attribute data, which is the attribute data deleted by the update, from the attribute data before the update;
(H) preparing additional attribute data which is the attribute data added by the update;
(I) deleting the deletion target attribute data from the pre-update attribute database, and updating the pre-update attribute database by adding the additional attribute data to the pre-update attribute database;
A method for updating electronic map data, including A method for updating electronic map data according to any one of claims 1 to 3,
The deletion target link, the deletion target node, the deletion connection link, and the addition target element are associated with the same identification information,
In the step (f), the deletion target link, the deletion target node, and the deletion connection link associated with the same identification information are deleted, and the addition target element associated with the same identification information is added. , Update method of electronic map data. An electronic map data storage device for storing electronic map data including at least a network including a plurality of nodes and a link connecting the nodes,
A pre-update data storage unit for storing the pre-update network as data;
An update data storage unit that stores, as data, an addition target element that is a node and a link that should be newly added at the time of update;
With
In the pre-update network, when the nodes arranged at both ends of the deletion target link that is the link that should be deleted after the update are defined as the deletion target nodes, the deletion target among the deletion target nodes For all deleted end nodes, connect nodes that are not deleted nodes to non-deleted nodes via links.
(1) The deleted end node is set as a virtual node. (2) The virtual node is set on all the connection links to be separated that are links connecting the deleted end node and the non-deleted node. Storing the virtual node as a node common to the network before the update and the network after the update,
The addition target element includes a virtual node termination link that terminates the virtual node for all the virtual nodes, and does not include nodes and links associated with the network before update other than the virtual nodes. apparatus. The electronic map data storage device according to claim 5,
In the network before update, the separation target connection link is separated into a deletion connection link that connects the virtual node and the deletion target node, and a remaining connection link that connects the virtual node and the non-deletion node. Electronic map data storage device stored. The electronic map data storage device according to claim 5,
The electronic map data includes an attribute database that stores attribute data associated with the node or link;
The pre-update data storage unit stores pre-update attribute data that is the attribute data associated with the network before the update,
The post-update data storage unit is an electronic map data device that stores the attribute data to be newly added after the update. The map data storage device according to claim 5 further includes:
The deletion connection link that connects the deletion target link and the virtual node of the deletion target connection link and the deletion target node is deleted from the pre-update data storage unit, and the addition target element is converted to the pre-update data. An electronic map data device comprising an update processing unit for updating the pre-update data storage unit by adding to the storage unit. A receiver for receiving electronic map update data;
A deletion connection link that connects all of the separation target connection links to the virtual node defined in the received electronic map update data and the deletion target node, and a remaining connection link that connects the virtual node and the non-deletion node; A link separation unit that separates into
An update unit that deletes the deletion target element and the deletion connection link from the storage device, and updates the network before the update to the network after the update in the storage device by adding the addition target element to the storage device;
An electronic map update data used by a computer of the storage device having an additional data part that defines the addition target element that is a node and a link to be newly added after the update;
When defining nodes that are arranged at both ends of the deletion target link that is a link that is to be deleted entirely after the update in the network before the update, among the deletion target nodes, For all of the deletion end nodes, the nodes connected via the link with the non-deletion node that is not the deletion target node,
(1) The deleted end node is set as a virtual node. (2) The virtual node is set on all the connection links to be separated that are links connecting the deleted end node and the non-deleted node. A virtual node part that defines the virtual node that has been
With
The addition target element includes a virtual node termination link that terminates in the virtual node for all the virtual nodes, and also includes electronic map update data that does not include nodes and links associated with the pre-update network other than the virtual nodes. . A receiving side information processing device for storing map data including the network before update;
A transmission-side information processing apparatus that transmits the electronic map update data according to claim 8 to the reception-side information processing apparatus before the update,
The receiving side information processing apparatus
A receiving unit for receiving the electronic map update data;
A deletion connection link that connects the virtual node defined in the received update data and the node to be deleted, and a remaining connection link that connects the virtual node and the non-deletion node, all of the separated connection links A link separating part that separates into
The deletion target element and the deletion connection link are deleted from the storage device, and the addition target element is added to the storage device, whereby the network before update in the storage device is updated to the network after update. An update unit to
An electronic map data update system.

Images