JP5371906B2 - Map information processing device - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a map information processing device capable of using, in common, information notifying the service start or stop of a road whose service is planned to start or stop, independently of map data creation time. <P>SOLUTION: Using update information having an invariable update road group identifier provided to each update road group composed of roads whose service is planned to start or stop in map data indicating a map divided by mesh and information indicating that the service of the roads in the update road group specified by the update road group identifier has started or stopped, the update road group corresponding to the update road group identifier is specified from roads indicated by the map data acquired by a map data acquisition unit 9 on the basis of association information in which the update road group identifier is associated with roads indicated by the map data, and service information of the roads in the update road group is updated on the basis of the update information. <P>COPYRIGHT: (C)2012,JPO&amp;INPIT

Description

  The present invention relates to a map information processing apparatus used in a mobile object such as a car navigation apparatus, a mobile phone, and a portable information terminal or a fixed computer.

Patent Document 1 discloses an information processing apparatus in which, in map data, an availability flag indicating availability of a road is provided in the road shape data representing the shape of the road. In this device, the availability flag of the road in service is set to be usable, while the availability flag of the planned road opening is set to be unusable. Here, when opening flag information indicating that the planned opening road is opened from the outside, the availability flag of the planned opening road is changed to usable.
In the opening flag information, the road to be opened is specified using the address of the road network data in the map information.

JP 2010-8344 A

In the conventional technique represented by Patent Document 1, a road to be opened is specified using an address of road network data in map data.
However, the map data released at a certain time and the map data released one year later differ in the creation time of the map data constituting them, and the situation of the road network also differs. For this reason, even in the same road, the address of the road network data is different.
Therefore, it is necessary to provide different opening flag information every time map data is released, even if the opening flag information notifies the opening of the same road, and the opening flag information does not depend on the release date and cannot be used in common. There was a problem.

  This invention has been made to solve the above-described problems, and information that informs the start or abolition of the operation of a road that is scheduled to be in service or abolished does not depend on the timing of map data creation. Another object is to obtain a map information processing apparatus that can be used in common.

  The map information processing apparatus according to the present invention includes an update road group that is given invariably for each update road group that is composed of roads scheduled to be started or abolished in map data representing a map partitioned for each mesh. An update information acquisition unit that acquires the update information from an external device that manages the update information having the identifier and information indicating that the road of the update road group specified by the update road group identifier has been started or abandoned And map data representing a map partitioned for each mesh, update information acquired by the update information acquisition unit, and an updated road group identifier and map data. An information storage unit that stores correspondence information that associates roads to be represented, a map data acquisition unit that acquires map data from the information storage unit, and a correspondence information stored in the information storage unit. The update road group corresponding to the update road group identifier of the update information acquired by the update information acquisition unit is identified among the roads represented by the map data acquired by the map data acquisition unit, and the roads of this update road group And an update unit that updates the service information based on the update information.

According to the present invention, in the map data representing a map partitioned for each mesh, an updated road group identifier assigned to each updated road group consisting of roads scheduled to be started or abolished, and updated Corresponding information for associating the updated road group identifier with the road represented by the map data by using update information having information indicating that the road of the updated road group specified by the road group identifier has been started or abandoned Based on the road represented by the map data acquired by the map data acquisition unit, the update road group corresponding to the update road group identifier is specified, and the service information of the road of the update road group is updated based on the update information. .
In this way, the updated road group identifier that identifies the updated road group consisting of roads that are scheduled to be started or abolished is unchanged. It is possible to identify the updated road group. For this reason, there exists an effect that the update information which notifies the start or abolition of the service in the road of the said road group can be used in common.

It is a block diagram which shows the structure of the map information processing system to which the map information processing apparatus by Embodiment 1 of this invention is applied. It is a block diagram which shows the function structure of a processor. It is a figure which shows an example of the data structure of map information. It is a figure which shows an example of road network data. It is a figure which shows an example (the 1) of the road network in the meshes M1, M2, M3, and M4 in the hierarchy of the hierarchy number 0. It is a figure which shows an example (the 2) of the road network in the meshes M1, M2, M3, and M4 in the hierarchy of the hierarchy number 0. It is a figure which shows an example of the data structure of conversion information. It is a figure which shows an example (the 1) of conversion information. It is a figure which shows an example (the 2) of conversion information. It is a figure which shows an example of the data structure of update information. It is a figure which shows an example of update information. 4 is a flowchart showing a flow of update information acquisition processing by the map information processing apparatus of the first embodiment. 4 is a flowchart showing a flow of update processing by the map information processing apparatus of the first embodiment. It is a flowchart which shows the detail of a process of step ST220 of FIG. It is a figure which shows the example of a road drawing (the 1). It is a figure which shows the example of a road drawing (the 2).

Embodiment 1 FIG.
1 is a block diagram showing a configuration of a map information processing system to which a map information processing apparatus according to Embodiment 1 of the present invention is applied. As shown in FIG. 1, the map information processing system includes a map information processing apparatus 1 and an information providing apparatus 8. The map information processing apparatus 1 according to the first embodiment performs map information processing based on various types of information acquired from the information providing apparatus 8. The configuration includes an input unit 1a, a position detection unit 2, an information storage unit 3, a processor 4, a display unit 5, an audio output unit 6, and an information acquisition unit 7.

  The input unit 1a is an operation switch group that gives an instruction signal to the processor 4 in accordance with a user operation or instruction, and functions as an input unit. As an input means, a touch panel mounted on the display surface of the display unit 5, a remote control switch, or the like may be used in addition to the operation switch group.

  The position detection unit 2 is position detection means using, for example, a GPS (Global Positioning System) receiver, a vehicle speed sensor, an acceleration sensor, an angular velocity sensor, and the like, and is a mobile body (for example, an automobile) on which the map information processing apparatus 1 is mounted. The current position of the vehicle is detected, and position information indicating the detected current position is provided to the processor 4. The information storage unit 3 is a map information storage unit configured by, for example, a hard disk drive using a hard disk as a storage medium for map information, and stores map information and conversion information in the information storage unit 3 in advance.

  The processor 4 performs various types of map information processing using the instruction signal given from the input unit 1a, the position information indicating the current position obtained from the position detection unit 2, and the map information read from the information storage unit 3. It functions as a map information processing means. The processor 4 has a drawing memory, a drawing processing unit, and a display control unit, which will be described later with reference to FIG. 2, and the drawing processing unit draws a required graphic in the drawing memory, and the display control unit displays the contents of the drawing memory. Displayed on the display unit 5. Further, the map information acquired from the information storage unit 3 is updated based on the information acquired by the information acquisition unit 7 and the conversion information of the information storage unit 3.

As the contents of the various types of map information processing described above, the current position of the moving object is estimated based on the position information indicating the current position acquired from the position detection unit 2 and the map information read from the information storage unit 3. Map matching processing, route search processing to calculate the route from the departure point to the destination, route guidance processing to guide from the departure point to the destination according to the route obtained by the route search processing, display processing of the map around the current position , Various search processes for searching various information such as cities, roads, facilities, addresses, telephone numbers, intersections, and the like.
In addition, the map information processing is performed as a result of map information processing on the map drawing process centered on the current position estimated by the map matching process based on the map information read from the information storage unit 3. Obtained by drawing the current position of the mobile object, a suitable route obtained by route search processing, and drawing processing of guidance information for guiding from the departure point to the destination according to the route, drawing processing of various input information, and search A drawing process using a drawing processing unit such as a drawing process of various kinds of information is also included.

The display unit 5 is a display unit that displays the contents drawn in the drawing memory by the various drawing processes described above according to the control of the display control unit, and includes, for example, a liquid crystal display.
The voice output unit 6 is a voice output unit that presents information obtained as a result of various types of map information processing by the processor 4 to the user by voice. The voice output unit 6 presents, to the user, voice guidance information for performing guidance from the departure point to the destination according to a suitable route obtained by the route search process, various information obtained by the search, and the like. .

The information acquisition unit 7 functions as an information acquisition unit that acquires necessary information from the information providing apparatus 8 via a communication unit such as a cellular phone data communication or a wireless local area network (LAN).
The information acquisition unit 7 may be provided with a reading device for various storage media such as a memory card, and the required information may be acquired from the storage media.

  FIG. 2 is a block diagram showing a functional configuration of the processor of FIG. 2, the processor 4 includes an update information acquisition unit 7a, a map data acquisition unit 9, an update unit 10, a drawing processing unit 11, a drawing memory 12, a display control unit 13, a route search unit 14, and a map matching processing unit 15. . The information storage unit 3 stores update information and conversion information, which will be described later, in addition to the map information.

  The update information acquisition unit 7 a is a configuration unit that acquires update information indicating a road that has been started or abandoned from the information providing device 8 through the information acquisition unit 7.

  The update information is information for updating road network data managed by the map information processing apparatus 1 in accordance with the road service status. Specifically, an updated road group defined in association with the updated road group in order to identify the updated road group consisting of one or more roads scheduled to be started or abolished in the road represented by the map data It has information indicating that the road in the updated road group specified by the identifier and the updated road group identifier has been started or abolished. The updated road group identifier of the same updated road group is constant regardless of the map data creation time.

The conversion information is information for associating the link in the road network data of the map information stored in the information storage unit 3 with the link of each road in the updated road group corresponding to the updated road group identifier.
In addition, the number of links corresponding to the updated road group identifier is set in advance in the conversion information. Therefore, when the number of links to be updated for which update information is acquired matches the number of corresponding links set in the conversion information, all the update information included in the update road group indicated by the conversion information can be acquired. Can be recognized.

The map data acquisition unit 9 is a component that acquires map data from the map information stored in the information storage unit 3, and stores the acquired map data in the memory 9a.
The update unit 10 is a component that updates the service information of the map data acquired by the map data acquisition unit 9 and stored in the memory 9 a based on the update information read from the information storage unit 3.
Further, when the same updated road group is to be updated, the update unit 10 can specify the updated road group with the same updated road group identifier regardless of the version of the map data including the road network data of the road group. Therefore, the update unit 10 can perform update processing using the same update information regardless of the version of the map data when a change occurs in a road in the same update road group.

  The drawing processing unit 11 uses the map data stored in the memory 9a, the processing result of the route searching unit 14, or the processing result of the map matching processing unit 15 to generate required graphic data to be displayed on the map and to generate the drawing memory 12. To draw. The display control unit 13 displays the contents of the drawing memory 12 on the display unit 5. The route search unit 14 is a component that executes route search processing for calculating a route from the departure point to the destination in the map information processing described above, and the map matching processing unit 15 is acquired from the position detection unit 2. It is a component that executes a map matching process for estimating the current position of the moving body based on the position information indicating the current position and the map information read from the memory 9a.

  The update information acquisition unit 7a, the map data acquisition unit 9, the update unit 10, the drawing processing unit 11, the drawing memory 12, the display control unit 13, the route search unit 14, and the map matching processing unit 15 are included in the processor 4 according to the present invention. By executing the map information processing program according to the above, it is realized as a specific means in which hardware and software cooperate.

  In the present invention, the map information creation range is a quadrilateral surrounded by latitude lines and meridians at predetermined intervals. The map information is hierarchized according to the degree of detail of the information, and the map information creation range is divided into meshes that are areas surrounded by latitude lines and meridians at predetermined intervals for each hierarchy and managed. . Here, in order to identify the hierarchy, numbers 0, 1, 2,... Are assigned to the hierarchies in order from the most detailed hierarchy (detailed display) to the coarser (wide area display), and this is used as the hierarchy number.

  Further, in order to identify the mesh within one layer, a unique number is assigned to each mesh, and this is used as the mesh number. For example, when the map information creation range of a certain hierarchy is divided into 256 areas obtained by dividing the map information into 16 parts in the latitude direction and 16 parts in the longitude direction, and each area is a mesh, A mesh number of ~ 255 is given.

FIG. 3 is a diagram illustrating an example of a data structure of map information stored in the information storage unit of FIG. As map information, it has map management information and map data provided corresponding to each level of mesh. The map management information includes version information indicating the version of the map information and hierarchy management information for managing each map data for each hierarchy.
The hierarchy management information has information such as the mesh number of each mesh, the storage position of the map data in the map information, and the data size for each hierarchy.
The version of the map information is a consecutive number such as 1, 2, 3,... In the order in which the map information is created. The version of the map information is also the version of the map data included in the map information.

The map data is information including a map data header, road network data, background data, name data, and route guidance data. The map data header has information for managing each data in the map data, and the road network data has information representing the road network in the mesh.
The background data includes surface data representing rivers, seas, etc., line data representing linear rivers, railways, etc., point data representing facility symbols, etc., and route guidance data is used for route guidance at intersections, etc. It has the necessary information. The search data is information for searching various points such as cities, roads, facilities, addresses, telephone numbers, intersections, etc., and has information such as the name and position of each point.

  FIG. 4 is a diagram illustrating an example of the road network data of FIG. As shown in FIG. 4, the road network data represents a road network represented by using a node representing an intersection or a point on the road and a link representing a road connecting the nodes, and includes a road network header, a node list, It consists of a link list and a shape list.

The road network header includes the number of nodes, the number of links, and list management information as information necessary for managing the road network data.
The number of nodes is information indicating the number of nodes existing in the mesh. The number of links is information indicating the number of links existing in the mesh. The list management information is information indicating each storage position and data size of the node list, link list, and shape list.

The node list is information including node records provided corresponding to the nodes existing in the mesh. The order of node records in the node list is the node number.
As shown in FIG. 4, the node record has a node record size, node coordinates, the number of connected links, connection information, and inter-link regulation information.
The node record size is information indicating the data size of the node record. The node coordinates are information representing the geographical position of the node. The number of connected links is information indicating the number of links connected to the node. The connection information is information representing a link connected to the node. The inter-link regulation information is information representing a regulation related to traffic between links connected to the node.

The link list is information consisting of link records provided corresponding to the links existing in the mesh. The order of link records in the link list is the link number.
The link record has service information, plan information, link identifier, start point node number, end point node number, link attribute information, and shape record storage position.
The service information is information indicating whether the link is in service or in service (not in service). When the service information is 0, it indicates that the road indicated by the link is in service. When the service information is 1, the road indicates that the road indicated by the link is not in service. By referring to this service information, it can be determined whether or not the link can be used for map information processing such as map display, map matching, and route search.
The service information is updated so as to reflect the latest state of the link indicated by the acquired update information, and map information processing reflecting the latest state of the link becomes possible.

As for the plan information, at the time when the map information is created, whether the road of the link is already in service and is not scheduled to be abolished (no plan), or is in service or scheduled to be abolished (planned) It is information which shows. Here, when the plan information is 0, it indicates that there is no plan, and when the plan information is 1, the plan is present.
By referring to the plan information, it can be seen that the road is scheduled to start or be abandoned regardless of the value of the service information. For this reason, by referring to the plan information together with the service information at the time of displaying the map, it is possible to distinguish and display the road scheduled to start service, the road scheduled to be closed, the road started service, and the road that has been closed.

The link identifier is a number unique to the link associated with the link in order to identify the link within the map information creation range. All links within the map information creation range have different link identifiers. When a plurality of links are included in one link of a hierarchy having a hierarchy number of 1 or more in the hierarchy having a hierarchy number of 0, consecutive numbers are associated with the plurality of links of the hierarchy having a hierarchy number of 0.
It should be noted that the link identifier of a link having a hierarchy number of 1 or more is the same as the link identifier of a link having a hierarchy number of 0 when the link matches one link of a hierarchy having a hierarchy number of 0. .
In addition, when the link identifier of a link having a hierarchy number of 1 or more includes a plurality of links having a hierarchy number of 0, the minimum number and the maximum number of the link identifiers of the plurality of links are used. , A set of a minimum number and (maximum number−minimum number).

The start point node number is the node number of the node on the start point side of the link, and the end point node number is the node number of the node on the end point side of the link.
The link attribute information is information that represents various attributes such as the road type, width, and link length of the link. Furthermore, the shape record storage position indicates the storage position in the shape list of the shape record corresponding to the link.

The shape list is information composed of shape records provided corresponding to links existing in the mesh. The shape record has a shape point number and a shape point list.
The number of shape points indicates the number of shape points of the road shape of the link. The shape point list is information in which the road shape of the link is represented by a broken line, and the geographical positions of the shape points that are the vertices of the broken line are listed.

  FIG. 5 is a diagram showing an example (part 1) of the road network in the meshes M1, M2, M3, and M4 in the hierarchy of the hierarchy number 0, and the hierarchy number of the version 1 map information created in April X A road network in the zero hierarchy is shown. In FIG. 5, the road network of the mesh M1 includes nodes N1A0 to N1A4 and links L1A0 to L1A3. The road network of the mesh M2 includes nodes N2A0 to N2A8 and links L2A0 to L2A9. The road network of the mesh M3 includes nodes N3A0 to N3A4 and links L3A0 to L3A3. The road network of the mesh M4 includes nodes N4A0 to N4A7 and links L4A0 to L4A6.

  Further, 1000, 1001, 1002, 1003, and 1004 are associated as link identifiers with the links L1A0, L1A1, L2A0, L2A1, and L2A2, respectively. The links L3A0, L3A1, L4A0, L4A1, and L4A2 are associated with 2000, 2001, 2002, 2003, and 2004 as link identifiers, respectively. The links L3A2, L3A3, L1A2, and L1A3 are associated with 3000, 3001, 3002, and 3003 as link identifiers, respectively. The links L4A3, L4A4, L2A3, L2A4, and L2A5 are associated with 4000, 4001, 4002, 4003, and 4004 as link identifiers, respectively. Each of the links L4A5, L4A6, and L2A7 is associated with 5000, 5001, and 5002 as link identifiers. 6000 and 6001 are associated with the links L2A8 and L2A9, respectively, as link identifiers. Assume that 7000 is associated with the link L2A6 as a link identifier.

  When one link of the hierarchy number 1 is obtained by integrating the links L4A5, L4A6, L2A7 of the hierarchy number 0 shown in FIG. 5, that is, the links L4A5, L4A6, L2A7 (link identifiers are 5000, 5001, 5002). ) Includes a pair of 5000 and 2 (= 5002-5000). Further, when one link of the hierarchy number 1 is the same as the link L1A0 of the hierarchy number 0 shown in FIG. 5 (the link identifier is 1000), the link identifier of the link of the hierarchy number 1 is 1000. It is to be noted that a higher-level link is a single link in which a link with a hierarchy number 0 scheduled to start or abolish is mixed with a link with a hierarchy number 0 that is not scheduled to start or abandon It shall not be integrated. For example, in the hierarchy number 1, the link L1A0 and the link L1A1 shown in FIG. 5 are not integrated into one link.

  The links L1A0, L2A1, L2A2, L2A7, L4A5, and L4A6 indicated by the dotted lines are links that are scheduled to start operation, but become unavailable because the map information is not created. It is a link. Links other than the above are links that are in use at the time the map information is created and can be used. The link L2A6 of the mesh M2 indicated by a thin solid line is a road that is scheduled to be closed.

The node list corresponding to the above node is stored in the node list of the road network data of the meshes M1, M2, M3, and M4, and the link record and the shape record corresponding to the link are stored in the link list and the shape list. Is done.
Here, the node NmAn corresponds to the nth (starting from 0th) node record of the node list of the mesh Mm. The link LmAn corresponds to the nth (starting from 0th) link record in the link list of the mesh Mm. The link LmAn corresponds to the nth (starting from 0th) shape record in the shape list of the mesh Mm.
For example, in the road network data of mesh M1, the node list stores five node records in the order of nodes N1A0 to N1A4. In the link list, four link records are stored in the order of links L1A0 to L1A3. In the shape list, four shape records are stored in the order of links L1A0 to L1A3.

The service information and the plan information are set as follows when the map information is created.
In the road network data of the mesh M1, in the link record corresponding to the dotted link L1A0, the service information is set to the value 1 (non-service), and the plan information is set to the value 1 (planned). In a link record corresponding to a link other than the link L1A0, a value 0 (in-service) is set in the service information, and a value 0 (no plan) is set in the plan information.
In the road network data of the mesh M2, in the link records corresponding to the dotted links L2A1, L2A2, and L2A7, the value 1 (non-service) is set for the service information, and the value 1 (has a plan) is set for the plan information. Is done.
In the link record corresponding to the dotted link L2A6, the service information is set to the value 0 (in-service), and the plan information is set to the value 1 (planned).
In a link record corresponding to a link other than the links L2A1, L2A2, and L2A7, the service information is set to a value 0 (in-service) and the plan information is set to a value 0 (no plan).
Furthermore, in the road network data of the mesh M3, the value 0 (in service) is set in the service information and the value 0 (no plan) is set in the plan information in the link records of all the links.
Further, in the road network data of the mesh M4, in the link record corresponding to the dotted links L4A5 and L4A6, the value 1 (non-service) is set in the service information, and the value 1 (planned) is set in the plan information. . In link records corresponding to links other than the links L4A5 and L4A6, the service information is set to a value of 0 (in-service) and the plan information is set to a value of 0 (no plan).

FIG. 6 is a diagram showing an example (part 2) of the road network in the meshes M1, M2, M3, and M4 in the hierarchy of the hierarchy number 0, and the hierarchy number of the version 2 map information created in April X + 1. A road network in the zero hierarchy is shown. In FIG. 6, the links L1A0, L2A1, and L2A2 in FIG. 5 are changed during operation, the link L2A6 is deleted, and the links L1B6, L1B7, and L4B7 scheduled to start operation are added.
The road network of the mesh M1 includes nodes N1B0 to N1B7 and links L1B0 to L1B7. The road network of the mesh M2 includes nodes N2B0 to N2B7 and links L2B0 to L2B7. The road network of the mesh M3 includes nodes N3B0 to N3B4 and links L3B0 to L3B3. The road network of the mesh M4 includes nodes N4B0 to N4B7 and links L4B0 to L4B7.

Also, 1000, 1001, 1002, 1003, 1004, and 1005 are associated as link identifiers with the links L1B0, L1B1, L1B2, L2B0, L2B1, and L2B2, respectively. The links L3B0, L3B1, L4B0, L4B1, and L4B2 are associated with 2000, 2001, 2002, 2003, and 2004 as link identifiers, respectively. The links L3B2, L3B3, L1B3, L1B4, and L1B5 are associated with 3000, 3001, 3002, 3003, and 3004 as link identifiers, respectively.
The links L1B6 and L1B7 are associated with 4000,4001 and the links L4B3, L4B4, L2B3, and L2B4 are associated with 5000, 5001, 5002, and 5003 as link identifiers. 6000, 6001, 6002 are associated as link identifiers with the links L4B5, L4B6, and L2B5, respectively. 7000 and 7001 are associated with the links L2B6 and L2B7 as link identifiers. 8000 is associated with link L4B7 as a link identifier.

  The links L1B6, L1B7, L2B5, L4B5, L4B6, and L4B7 indicated by dotted lines are links that are scheduled to start operation, but are unavailable because they are not used when the map information is created. It is a link. Links other than the above are links that are in use at the time the map information is created and can be used.

The node list corresponding to the above node is stored in the node list of the road network data of the meshes M1, M2, M3, and M4, and the link record and the shape record corresponding to the link are stored in the link list and the shape list. Is done.
The node NmBn corresponds to the nth (starting from 0th) node record in the node list of the mesh Mm. The link LmBn corresponds to the nth (starting from 0th) link record of the link list of the mesh Mm. The link LmBn corresponds to the nth (starting from 0th) shape record in the shape list of the mesh Mm.
For example, in the road network data of mesh M1, eight node records are stored in the node list in the order of nodes N1B0 to N1B7. In the link list, eight link records are stored in the order of links L1B0 to L1B7. In the shape list, eight shape records are stored in the order of links L1B0 to L1B7.

The service information and the plan information are set as follows when the map information is created.
In the road network data of the mesh M1, in the link records corresponding to the dotted links L1B6 and L1B7, the value 1 (non-service) is set as the service information, and the value 1 (with plan) is set as the plan information. In a link record corresponding to a link other than the links L1B6 and L1B7, the service information is set to a value of 0 (in-service) and the plan information is set to a value of 0 (no plan).
In the road network data of the mesh M2, in the link record corresponding to the dotted link L2B5, the service information is set to a value of 1 (non-service), and the plan information is set to a value of 1 (planned). In a link record corresponding to a link other than the link L2B5, a value 0 (in-service) is set in the service information, and a value 0 (no plan) is set in the plan information.
In the road network data of the mesh M3, the value 0 (in service) is set in the service information and the value 0 (no plan) is set in the plan information in the link records of all the links.
In the road network data of the mesh M4, in the link records corresponding to the dotted links L4B5, L4B6, and L4B7, the service information is set to value 1 (non-service) and the plan information is set to value 1 (planned). .
In link records corresponding to links other than the links L4B5, L4B6, and L4B7, the service information is set to a value of 0 (in-service) and the plan information is set to a value of 0 (no plan).

When creating map information, a unique number is associated with each updated road group in order to identify the updated road group scheduled to start or be abolished. This number is used as an updated road group identifier.
Each time the map information is created, the updated road group that has not been created at the time of creation is associated with the next consecutive number after the number used as the updated road group identifier by the creation time. Moreover, in the existing update road group, the number of this update road group is used as an update road group identifier.
As described above, different update road group identifiers are associated with different update road groups for map information created at any time, and the same update road group identifier is assigned to the same update road group. Correspond. In addition, the oldest version of the map data representing the updated road group is set as the version of the updated road group.

In the version 1 map information created in April X shown in FIG. 5, an updated road group is set as follows. In FIG. 5, an update road group RG0 composed of links L1A0, an update road group RG1 composed of links L2A1 and L2A2, an update road group RG2 composed of links L2A6, and an update road group RG3 composed of links L4A5, L4A6 and L2A7.
Here, numbers 0, 1, 2, and 3 are associated as update road group identifiers with the update road groups RG0, RG1, RG2, and RG3, respectively.

Further, in the version 2 map information created in April X + 1 shown in FIG. 6, an updated road group is set as follows. In FIG. 6, an update road group RG4 composed of links L1B6 and L1B7, an update road group RG5 composed of links L4B7, and an update road group RG3 composed of links L4B5, L4B6, and L2B5.
Here, since the update road groups RG4 and RG5 are different from any of the update road groups RG0, RG1, RG2 and RG3, the numbers 4 and 5 are associated with the update road group identifiers, respectively.
Since the updated road group RG3 in FIG. 6 is the same as the updated road group RG3 in FIG. 5, the number 3 is associated as the updated road group identifier.
The version of the updated road group RG0, RG1, RG2 is the oldest version 1 assigned to the map data of these updated road groups.
The versions of the updated road groups RG4 and RG5 are the oldest version 2 assigned to the map data of these updated road groups.
The updated road group RG3 is represented by the map data of both versions 1 and 2. In this case, the version of the updated road group RG3 is the version 1 of the oldest map data.
In this way, for the same updated road group, the updated road group can be specified using the same updated road group identifier regardless of the version of the map data. Thereby, when the same update road group is changed, the update using the same update information is possible irrespective of the version of map data.

FIG. 7 is a diagram illustrating an example of a data structure of conversion information stored in the information storage unit 3. The conversion information (correspondence information) is information for associating the link in the road network data of the map information stored in the information storage unit 3 with the updated road group identifier, and includes a conversion information header and a conversion list.
The conversion information header is information including the number of conversion records included in the conversion list.
The conversion list includes conversion records provided in association with updated road groups of map information.
The conversion record includes a corresponding updated road group identifier, the number of acquired links, the number of corresponding links, and corresponding link information.

  The corresponding updated road group identifier is an updated road group identifier of the updated road group corresponding to the conversion record. The number of acquired links is the number of links that have already acquired in-service update information on the updated road group. At the time when the conversion list is created, the value 0 is set as the initial value of the number of acquired links. Each time update information related to the updated road group is acquired, the number of acquired links is increased by the number of links whose update information is to be updated. As a result, if the number of acquired links matches the number of corresponding links, it can be determined that all the update information related to the updated road group has been acquired.

  The number of corresponding links is the number of links corresponding to the updated road group. Corresponding link information is arranged corresponding to the link corresponding to the updated road group, and includes a corresponding mesh number and a corresponding link identifier. The corresponding mesh number is the mesh number of the mesh in which the corresponding link exists. The corresponding link identifier is the link identifier of the corresponding link.

  FIG. 8 is a diagram showing an example (part 1) of the conversion information. The setting value of the conversion record of the conversion information regarding the updated road group of the map data of version 1 created in April X shown in FIG. Show. In FIG. 8, m1, m2, and m4 are mesh numbers of the meshes M1, M2, and M4, respectively. For example, since the corresponding update road group identifier is 1 in the conversion record 1, the update road group RG1 with the update road group identifier 1 is the link L2A1 with the link identifier 1003 in the mesh M2, and the link L2A2 with the link identifier 1004 It shows that it corresponds to each.

  FIG. 9 is a diagram showing an example (part 2) of the conversion information. The setting value of the conversion record of the conversion information related to the updated road group of the map data of version 2 created in April X + 1 shown in FIG. Show. In FIG. 9, m1, m2, and m4 are mesh numbers of the meshes M1, M2, and M4, respectively. For example, since conversion record 1 has a corresponding update road group identifier of 4, update road group RG4 with update road group identifier of 4, link L1B6 with link identifier of 4000 in mesh M1, and link with link identifier of 4001 It corresponds to L1B7 respectively.

The conversion record 3 in FIG. 8 and the conversion record 0 in FIG. 9 both have the corresponding update road group identifier 3, so the same update road group with the update road group identifier 3 is linked to the map data of each version. Is associated with.
That is, the conversion record 3 in FIG. 8 is associated with the link L4A5 with the link identifier 5000, the link L4A6 with the link identifier 5001, and the link L2A7 with the link identifier 5002 in the version 1 map data.
9 is associated with the link L4B5 with the link identifier 6000, the link L4B6 with the link identifier 6001, and the link L2B5 with the link identifier 6002 in the map data of version 2.

  As described above, by using the conversion information, the updated road group indicated by the updated road group identifier can be associated with the map data link held by the map information processing apparatus 1 regardless of the version of the map data. The conversion information may be provided for each layer, and an offset or a link number indicating the storage position of the link record of the link corresponding to the updated road group may be used instead of the corresponding link identifier of the conversion record.

The update information is information for updating the road network data handled by the map information processing apparatus 1 according to the road service status, and how to change the link record service information according to the actual road service status. Is shown.
FIG. 10 is a diagram illustrating an example of the data structure of the update information. As shown in FIG. 10, the update information includes an update information header and an update list. The update information header has update version information, an update road group version range, and an update record number.
The update version information is information indicating the version of the update.
The update road group version range is information representing the version of the map data of the update road group to be updated, and is represented by the minimum value and the maximum value of the map data version of the update road group appearing in the update list. If the updated road group version range is newer than the version of the map data, the road group to be updated with the update information is determined after the creation time of the map information. It turns out that the map data cannot be updated.
In addition, if the updated road group version range includes the version of the map data or the updated road group version range is older than the version of the map data, the road group to be updated with the update information is created by the above map data. It is determined before the time or creation time, and it is understood that there is a possibility that the map data can be updated with the update information.
The number of update records is the number of update records in the update list.

The update list includes update records provided corresponding to the road group to be updated, and includes an update road group identifier, update service information, a partial flag, and update range information.
The update road group identifier is an update road group identifier of the update road group to be updated.
The partial flag is a flag that indicates whether to update some links or all links in the updated road group indicated by the updated road group identifier. When the value of the partial flag is 0, it indicates that all links are updated, and when the value is 1, it indicates that some links are updated.

  The update range information is information indicating a range in which the link of the update road group indicated by the update road group identifier is updated when the value of the partial flag is 1. The update range information consists of the top number and the number of update links. The start number indicates the number of links from the top of the update road group to be updated, and the number of update links indicates how many links from that link. Indicates whether to update.

  The updated service information indicates whether all links of the updated road group indicated by the updated road group identifier are started or abolished when the value of the partial flag is 0, and updated when the partial flag is 1. This is information indicating whether the use of the link indicated by the update range information in the updated road group indicated by the road group identifier has been started or abolished. When the value of the updated service information is 0, it indicates that the service has started, and when the value is 1, the service is abolished.

FIG. 11 is a diagram illustrating an example of update information provided by the information providing apparatus 8. In FIG. 11, update information 1 is update information provided in response to the start of use of all links (link L1A0 in FIG. 5) of the update road group RG0 in July X (T1). .
The update information 2 starts to be used for a part of the updated road group RG1 (link L2A1 in FIG. 5) in September X2 (T2), and a part of the updated road group RG2 (link L2A6 in FIG. 5). ) Is updated information provided in response to the abolition of the service.
The link L2A1 in FIG. 5 starts to operate on the 0th link from the top of the update road group RG1 only in one of the links L2A1 in FIG. For this reason, the value of the partial flag of update record 0 of update information 2 is set to 1, the start number of update range information is set to 0, and the number of update links is set to 1.
The update information 3 is update information provided in response to the start of use of a part of the links of the updated road group RG1 (link L2A2 in FIG. 5) in November X (T3).
The link L2A2 in FIG. 5 starts to be used in the first link from the head of the update road group RG1 only in one of the links L2A2 in FIG. For this reason, the value of the partial flag of update record 0 of update information 3 is set to 1, the start number of update range information is set to 1, and the number of update links is set to 1.
The update information 4 is update information provided in response to the start of use of all links (links L1B6 and L1B7 in FIG. 6) of the update road group RG4 in June X + 1 (T4).
The update information 5 is started in August X + 1 (T5) when all the links of the updated road group RG3 (links L4A5, L4A6, L2A7 in FIG. 5 and links L4B5, L4B6, L2B5 in FIG. 6) are started. This is update information provided in response to the start of service of all the links of the group RG5 (link L4B7 in FIG. 6).
The version of the update information is a consecutive number, and the versions of the update information 1 to the update information 5 are 1 to 5.

Next, the operation will be described.
(1) Update information acquisition process The map information processing apparatus 1 performs a process of acquiring update information from the information providing apparatus 8 in parallel with the map information processing. At this time, an operation for acquiring update information, which will be described later, is repeated every predetermined period. The update information may be acquired when the map information processing apparatus 1 is activated or when requested by the user.

FIG. 12 is a flowchart showing a flow of update information acquisition processing by the map information processing apparatus of the first embodiment.
First, the update information acquisition unit 7a measures the current date and time measured by a calendar clock (not shown in FIG. 2) built in the processor 4, and the creation date information of the map information stored in the information storage unit 3. And the current date is determined whether a predetermined period has elapsed since the date of the creation date information (step ST100). If the current date has passed a predetermined period from the date of creation date information (step ST100; YES), the update information acquisition process is terminated. On the other hand, if the current date does not pass a predetermined period from the date of creation date information (step ST100; NO), the process proceeds to step ST110.

At a point in time after a certain period of time has elapsed since the creation of map data, accurate information regarding roads that are scheduled to start or be abandoned cannot be obtained. For this reason, for example, after two years from the creation of the map data, the road data scheduled to be started or abolished is not stored in the map data.
Therefore, if two years or more have elapsed since the creation of the map data, there is no possibility that update information for the map information processing apparatus 1 will be obtained with the passage of time.
Therefore, it is possible to prevent unnecessary processing from occurring by not performing processing for acquiring update information for a predetermined period, for example, three years or later.
In addition, even after the lapse of the predetermined period, when there is an updated road group that has not yet been updated, the updated information may be acquired according to a user instruction, and the frequency of acquiring the updated information is lower. May be.

  The update information acquisition unit 7a determines whether or not the update information of all the update road groups has been acquired (step ST110). In other words, the update information acquisition unit 7a refers to the conversion information stored in the information storage unit 3 and searches for a conversion record in which the acquired link number is smaller than the corresponding link number. Here, if the number of acquired links matches the number of corresponding links in all the conversion records, it is determined that the update information of all the updated road groups has been acquired (step ST110; YES), and the update information acquisition process Exit. If a conversion record having a smaller number of acquired links than the number of corresponding links is found (step ST110; NO), the process proceeds to step ST120.

The number of links that can be updated with the update information acquired so far in relation to the links constituting the updated road group in step ST170 described later is stored in the acquired number of links in the conversion record. If the number of acquired links matches the number of corresponding links, it can be understood that all update information related to the updated road group has been acquired. That is, if the number of acquired links of all the conversion records matches the number of corresponding links, necessary update information is acquired for all the updated road groups. For example, in the conversion information shown in FIG. 8, the acquisition link numbers of conversion records 0, 1, 2, and 3 are 1, 2, 1, and 3, respectively, and match the corresponding link numbers of update records 0, 1, 2, and 3, respectively. When it does, it turns out that required update information was able to be acquired about the update road group whose update road group identifier is 0-3, and an update information acquisition process is complete | finished.
By this step, it is possible to prevent the update information from being acquired even though the update information of all the update road groups has been acquired.

  Next, the update information acquisition unit 7a transmits information requesting an update information header to the information providing device 8 together with terminal identification information for identifying the own device via the information acquisition unit 7, and a response to this request. Then, an update information header is acquired from the information providing device 8 via the information acquisition unit 7 (step ST120).

Note that each time the road is updated, the information providing device 8 obtains the update information of the road from the outside and stores it in an update information storage unit (not shown in FIG. 1) in the device. Whenever the header is requested, the update information header of the update information held is transmitted to the requesting map information processing apparatus 1, and when the update information header has been sent for all the update information held, Information indicating the end of provision of update information is transmitted to the map information processing apparatus 1 as the request source.
Moreover, the information provision apparatus 8 may acquire the information which shows the start or abolition of use of a road from the outside, and may make it update information regarding the said road.

For example, the update information 1 is stored in the update information storage unit of the information providing device 8 on the due date T1, and the update information 2 is stored in the update information storage unit of the information providing device 8 on the due date T2. Also, the update information 3 is stored in the update information storage unit of the information providing device 8 on the due date T3, the update information 4 is stored in the update information storage unit of the information providing device 8 on the due date T4, and the update information 5 is stored on the due date T5. It is stored in the providing device 8.
Further, in the period before the due date T2 to the due date T3, the information providing device 8 holds the update information 1 and the update information 2 shown in FIG. 9, and the map information processing device 1 requests the first update information header. On the other hand, the update information header of the update information 1 is transmitted to the requesting map information processing apparatus 1. Thereby, the map information processing apparatus 1 acquires the update information header.
Further, when there is a second request from the map information processing apparatus 1, the information providing apparatus 8 transmits an update information header of the update information 2 to the requesting map information processing apparatus 1. Thereby, the map information processing apparatus 1 acquires the update information header.
Further, when the information providing apparatus 8 has received the third request from the map information processing apparatus 1, the information providing apparatus 8 has finished providing the update information header of the update information 1 and the update information 2. Is transmitted to the requesting map information processing apparatus 1, and the map information processing apparatus 1 acquires the information via the information acquisition unit 7.

  In step ST130, the update information acquisition unit 7a determines whether or not the provision of update information has been completed. That is, the determination is made based on whether or not the information indicating the end of provision of the update information is acquired from the information providing apparatus 8. If information indicating the end of provision of update information has been acquired, it is determined that the provision of update information has ended (step ST130; YES), and the update information acquisition process ends. Further, when the update information header is acquired and it is determined that the provision of the update information is continued (step ST130; NO), the process proceeds to step ST140.

The update information acquisition unit 7a compares the update information version of the update information header acquired in step ST120 with the update information version of the update information header of the update information stored in the information storage unit 3, and acquires the acquired update. It is determined whether it is an information version (step ST140). If there is update information in which both the update information versions described above match, it is determined that the update information has been acquired (step ST140; YES), and the process returns to step ST120. On the other hand, if there is no update information that matches the update information version in the update information header of the update information stored in the information storage unit 3, it is determined that the update information has not been acquired (step ST140; NO), and the step Transition to ST150 processing.
By this step, it is possible to prevent the update information already stored in the information storage unit 3 from being obtained redundantly.

  Next, the update information acquisition unit 7a compares the version of the map data stored in the information storage unit 3 with the update road group version range of the update information header acquired in step ST120, and updates the update road group version range. Is determined to be newer than the version of the map data (step ST150). Here, if it is newer than the version of the map data (step ST150; YES), the process returns to step ST120. If the updated road group version range includes the version of the map data or is old (step ST150; NO), the process proceeds to step ST160.

For example, in the map information processing apparatus 1 in which the version of the map data stored in the information storage unit 3 is “1”, the update information header of the update information 1, 2, 3, 5 shown in FIG. Since the range is 1 (minimum) to 1 (maximum) or 1 (minimum) to 2 (maximum) and includes the version “1” of the map data, the process proceeds to step ST160.
On the other hand, in the update information header of the update information 4, since the update road group version range is 2 (minimum) to 2 (maximum) and is newer than the version “1” of the map data, the process returns to step ST120. Thereby, acquisition of the update list of the update information 4 which does not have the new record which updates the map data of version 1 can be prevented.

  Further, in the map information processing apparatus 1 in which the version of the map data stored in the information storage unit 3 is “2”, the update information header of the update information 1 to 5 shown in FIG. 1 (minimum) to 1 (maximum) or 2 (minimum) to 2 (maximum) or 1 (minimum) to 2 (maximum), and since all the map data versions “2” are included, the process goes to step ST160. become.

In step ST160, the update information acquisition unit 7a transmits information requesting an update list of update information together with the terminal identification information to the information providing device 8 via the information acquisition unit 7, and in response thereto, the information providing device 8 The update list transmitted from is acquired via the information acquisition unit 7.
For example, in the map information processing apparatus 1 in which the version of the map data stored in the information storage unit 3 is “1”, when the update information header of the update information 1 shown in FIG. An update list of update information 1 is acquired. This acquisition time is assumed to be T1 ′. In the same manner as described above, the update list of the update information 2, 3, and 5 shown in FIG. 11 is acquired. These acquisition times are T2 ′, T3 ′, and T5 ′, respectively.
In the map information processing apparatus 1 in which the version of the map data stored in the information storage unit 3 is “2”, the update list of the update information 1 to 5 shown in FIG. The These acquisition times are T1 ′, T2 ′, T3 ′, T4 ′, and T5 ′, respectively.

  By the processing of step ST150 and step ST160 described above, it is possible to acquire only the update list of update information that may update the map data stored in the information storage unit 3, and prevent acquisition of unnecessary update information. .

Next, the update information acquisition unit 7a stores the update information header acquired in step ST120 and the update list acquired in step ST160 in the information storage unit 3 as update information (step ST170). Then, it returns to step ST120.
In storing the update list, the update record is stored only when the update road group identifier of the update record matches the corresponding update road group identifier of any conversion record of the conversion information.
When all the update records of the update list are not stored in the information storage unit 3, the update information header is not stored in the information storage unit 3, and therefore the update information is not stored.
By adopting such a storage method, it is possible to prevent storage of update records relating to an updated road group that is not included in the map data, or an updated road group that has already been started or abolished when the map data is created.

Further, the update information acquisition unit 7a updates the acquisition link number of the conversion record of the conversion information having the corresponding update road group identifier that matches the update road group identifier of the update record stored in the information storage unit 3. For example, when the value of the partial flag of the update record is 0, the number of acquisition links of the conversion record is rewritten to the same value as the number of corresponding links of the conversion record, and when the value of the partial flag is 1, the acquisition link of the conversion record The number is increased by the number of update links indicated by the update range information in the update record.
By doing in this way, when the update information of all the links of an update road group is obtained, the acquisition link number of a conversion record will correspond with the number of corresponding records of the said conversion record. As a result, by comparing the number of acquired links with the number of corresponding records, it is possible to determine whether or not update information for all links in the updated road group has been obtained.

For example, in the map information processing apparatus 1 in which the version of the map data stored in the information storage unit 3 is “1”, the update information shown in FIG. 11 is stored in the information storage unit 3 as follows. Update the update record of the conversion information shown in FIG.
(A) Update information 1 is stored on due date T1 ′. The number of acquired links of conversion record 0 is rewritten to the corresponding number of links (1), and is set to 1.
As a result, it is understood that the number of acquired links in the conversion record 0 matches the number of corresponding links, and update information regarding all the links in the updated road group whose updated road group identifier is 0 is acquired.
(B) Storing update information 2 on due date T2 ′ The number of acquired links of conversion record 1 is increased by the number of update links (1) of update range information of update record 0 in update information 2 to 1.
The acquired link number of the conversion record 2 is rewritten to the corresponding link number (1), and is set to 1.
Thereby, it can be seen that the update information regarding all the links of the update road group having the update road group identifier of 2 is acquired.
(C) Update information 3 is stored on due date T3 ′. The number of acquired links of conversion record 1 is increased by the number of update links (1) of update range information of update record 0 in update information 3, and is set to 2.
As a result, it is understood that the number of acquired links in the conversion record 1 matches the number of corresponding links, and update information relating to all the links in the updated road group whose update road group identifier is 1 is acquired.
(D) Renewal information 5 is stored on update date T5 ′, and the number of acquired links in storage conversion record 3 is rewritten to the corresponding number of links (3).
As described above, it can be seen that the update information regarding all the links of the update road group having the update road group identifier 3 is acquired.
However, in the update information 5, the update road group identifier of the update record 1 is 5, which does not match the corresponding update road group identifier of any conversion record of the conversion information shown in FIG. It is not stored in part 3.

In the map information processing apparatus 1 in which the version of the map data stored in the information storage unit 3 is “2”, the update information shown in FIG. 11 is stored in the information storage unit 3 as shown in FIG. Update the conversion information update record shown.
(A) Due dates T1 ', T2', T3 '
The update road group identifiers of the update records of update information 1, 2 and 3 in FIG. 11 are 0 to 2 and do not match the corresponding update road group identifiers of any conversion record of the conversion information shown in FIG. Records are also not stored in the information storage unit 3. Therefore, the update information 1, 2, 3 is not stored in the information storage unit 3.
(B) Store update information 4 on due date T4 ′. Rewrite the number of acquired links in conversion record 1 to the number of corresponding links (2), and set it to 2.
Thereby, it can be seen that the update information regarding all the links of the update road group whose update road group identifier is 4 has been acquired.
(C) Update information 5 is stored on due date T5 ′. The number of acquired links of conversion record 0 is rewritten to the corresponding number of links (3) and set to 3.
The acquired link number of the conversion record 2 is rewritten to the corresponding link number (1), and is set to 1.
As a result, it is understood that the update information regarding all the links of the update road group whose update road group identifier is 3, 5 has been acquired.

(2) Update processing In map information processing such as map display processing, route search processing, and map matching processing, the map data acquisition unit 9 of the processor 4 first reads map data of a required mesh from the information storage unit 3. And stored in the memory 9a. The update unit 10 updates the road network data in the map data stored in the memory 9a. Hereinafter, the details of the update process of the road network data stored in the memory 9a of the processor 4 will be described.

  FIG. 13 is a flowchart showing a flow of update processing by the map information processing apparatus of the first embodiment. First, in step ST200, every time the update unit 10 comes to this step, the link record is acquired one by one from the top of the link list of the road network data stored in the memory 9a.

  Next, the update unit 10 checks the plan information of the link record acquired in step ST200, and determines whether or not the link has no plan (step ST210). If the plan information is 0 (step ST210; YES), it is determined that the link has no plan, and the process proceeds to step ST270. If the plan information is not 0 (step ST210; NO), it is determined that the link has a plan, and the process proceeds to step ST220.

  For example, in the map information processing apparatus 1 in which the version of the map data stored in the information storage unit 3 is “1”, the link records of the links L2A1, L2A2, L2A6, L2A7 in the road network data of the mesh 2 in FIG. Since the plan information is value 1 (there is a plan), the process proceeds to step ST220. Since the link record of links other than the links L2A1, L2A2, L2A6, and L2A7 has a plan information value of 0 (no plan), the process proceeds to step ST270.

  Subsequently, the update unit 10 examines each update record of all update information stored in the information storage unit 3 and searches for an update record for updating the link record acquired in step ST200 (step ST220). It is checked whether there is an update record (step ST230). Here, when an update record for updating the link record acquired in step ST200 is found (step ST230; YES), the update unit 10 transitions to the process of step ST240, assuming that there is an update record. If not found (step ST230; NO), it is determined that there is no update record, and the process proceeds to step ST270. Details of the operation in step ST220 will be described later with reference to FIG.

For example, in the map information processing apparatus 1 in which the version of the map data stored in the information storage unit 3 is “1”, in the road network data of the mesh 2 in FIG. 5, from the due date T3 ′ to the due date T5 ′ shown in FIG. In the previous period, update information 1, update information 2, and update information 3 shown in FIG.
Accordingly, the update record 0 of the update information 2 is found as an update record for updating the link record of the link L2A1, the update record 1 of the update information 2 is found as an update record for updating the link record of the link L2A6, and the link L2A2 The update record 0 of the update information 3 is found as an update record for updating the link record of “No.”, and “update record exists” is set for these link records.
On the other hand, an update record for updating the link record of the link L2A7 is not found, and “no update record” is set for this link record.
When the update information 5 shown in FIG. 11 is further stored in the information storage unit 3 after the date T5 ′ shown in FIG. 11, the update record 0 of the update information 5 is an update record for updating the link record of the link L2A7. Found, “update record exists” for this link record.

  Further, in the map information processing apparatus 1 in which the version of the map data stored in the information storage unit 3 is “2”, the update information shown in FIG. 11 after the date T5 ′ in the road network data of the mesh M2 in FIG. 4 and update information 5 are stored in the information storage unit 3. Therefore, an update record 0 of the update information 5 is found as an update record for updating the link record of the link L2B7, and “update record exists” is set for this link record.

In step ST240, the update unit 10 checks the update service information of the update record found in step ST200, and determines whether or not the link has been started.
Here, when the update service information is the value 0 (service start) (step ST240; YES), the process proceeds to step ST250, and when the update service information is the value 1 (repealed) (step ST240; NO), The process proceeds to step ST260.

Next, the update unit 10 identifies the same link record as the link record acquired in step ST220 from the road network data stored in the memory 9a of the processor 4, and the service information of the link record has a value 0 (in service). Is set (step ST250). Then, the process proceeds to step ST270.
In step ST260, the update unit 10 identifies the same link record as the link record acquired in step ST220 from the road network data stored in the memory 9a of the processor 4, and sets the value 1 in the service information of the link record. Set (not in service).

For example, in the map information processing apparatus 1 in which the version of the map data stored in the information storage unit 3 is “1”, the period before the date T5 ′ from the date T3 ′ in the road network data of the mesh M2 in FIG. Then, update information 1, update information 2, and update information 3 shown in FIG. 11 are stored in the information storage unit 3. In this case, since the update service information of the update record 0 of the update information 2 has the value 0, the service information of the link record of the link L2A1 is set to the value 0 (in service).
Further, since the update service information of the update record 1 of the update information 2 is the value 1, the service information of the link record of the link L2A6 is set to the value 1 (non-service).
Further, since the update service information of the update record 0 of the update information 3 has the value 0, the service information of the link record of the link L2A2 is set to the value 0 (in service).
In the period after the date T5 ′, the update information 5 shown in FIG. Accordingly, since the value of the update service information of the update record 0 of the update information 5 is 0, the value of the service information of the link record of the link L2A7 is set to 0 (in service).

  On the other hand, in the map information processing apparatus 1 in which the version of the map data stored in the information storage unit 3 is “2”, in the road network data of the mesh M2 in FIG. 6, the period after the date T5 ′ is shown in FIG. Update information 4 and update information 5 are stored in the information storage unit 3. Accordingly, since the update service information of the update record 0 of the update information 5 has the value 0, the service information of the link record of the link L2B7 is set to the value 0 (in service).

  As can be seen from the above description, in the first embodiment, some links in the updated road group can be updated, such as the link L2A1 and the link L2A2. Further, the same update record can be applied to update of different versions of map data, such as update record 0 of update information 5 shown in FIG.

In step ST270, the update unit 10 determines whether or not acquisition of the link record in step ST200 has been completed for all link records in the link list of the road network data. If acquisition of all link records has not been completed (step ST270; NO), the process returns to step ST200, and if completed (step ST270; YES), the update process is terminated.

FIG. 14 is a flowchart showing details of the process in step ST220 of FIG.
In the process of FIG. 14, the update unit 10 identifies a conversion record having a corresponding update road group identifier that is the same as the update road group identifier of the update record for each update record stored in the information storage unit 3. It is checked whether or not the record has a corresponding link identifier that matches the link identifier of the link record acquired in step ST200. Here, when it has a corresponding link identifier that matches the link identifier of the link record acquired in step ST200, an update record having an updated road group identifier that matches the corresponding updated road group identifier of the conversion record is stored in the link record. This is an update record for updating.

In step ST300, first, the update unit 10 sequentially acquires update records one by one from all the update information stored in the information storage unit 3 every time this step is reached.
For example, in the map information processing apparatus 1 in which the version of the map data stored in the information storage unit 3 is “1”, the update information 1 and the update information shown in FIG. 11 are displayed in the period before the due date T3 ′ to the due date T5 ′. 2 and update information 3 are stored in the information storage unit 3. For this reason, every time this step is reached, update records 0 are acquired in the order of update record 0 of update information 1, update record 0 of update information 2, update record 1 of update information 2, and update record 0 of update information 3.

In the next step ST310, the updating unit 10 sequentially acquires conversion records one by one from the conversion information stored in the information storage unit 3 every time it comes to this step.
For example, when the conversion information shown in FIG. 8 is stored in the information storage unit 3, the conversion record is acquired in the order of conversion record 0, conversion record 1, conversion record 2, and conversion record 3 each time this step is reached. .

  Next, the update unit 10 compares the corresponding update road group identifier of the conversion record acquired in step ST310 with the update road group identifier of the update record acquired in step ST300, and is the conversion record corresponding to the update record? It is determined whether or not (step ST320). If the corresponding updated road group identifier matches the updated road group identifier (step ST320; YES), it is determined that the conversion record acquired in step ST310 is a conversion record corresponding to the update record, and the step Transition to ST330. On the other hand, if they do not match (step ST320; NO), it is determined that they are not corresponding conversion records, and the process proceeds to step ST390.

  For example, the conversion records corresponding to update record 0 of update information 1, update record 0 of update information 2, update record 1 of update information 2, and update record 0 of update information 3 shown in FIG. Record 0, conversion record 1, conversion record 2, and conversion record 1. Therefore, the combination of the update record acquired in step ST300 and the conversion record acquired in step ST310, which is used for the processing from step ST330 to step ST370 described later, is the update record 0 of update information 1 in FIG. 11, update record 0 in update information 2 in FIG. 11, conversion record 1 in FIG. 8, update record 1 in update information 2 in FIG. 11, conversion record 2 in FIG. 8, update record 0 in update information 3 in FIG. 11. And converted record 1 in FIG.

Subsequently, the update unit 10 determines whether or not the update record acquired in step ST300 indicates an update of all links (step ST330). Here, if the value of the partial flag of the update record is 0, it is determined that all links are updated (step ST330; YES), and the process proceeds to step ST340. On the other hand, when the value of the partial flag is 1 and it is determined that the link is updated (step ST330; NO), the process proceeds to step ST350.
For example, since the value of the partial flag of update record 0 of update information 1 and update record 1 of update information 2 in FIG. 11 is 0 (all links are updated), the process proceeds to step ST340. Further, since the partial flags of the update record 0 of the update information 2 and the update record 0 of the update information 3 in FIG. 11 have a value of 1 (update some links), the process proceeds to step ST350.

In step ST340, the update unit 10 sets the search start position of the corresponding link information in the conversion record acquired in step ST310 to the top, that is, “0”, and sets the number of searches to the number of corresponding links in the conversion record acquired in step ST310.
For example, when the update record 0 of the update information 1 shown in FIG. 11 is acquired in step ST300, the search start position is set to “0”, and the number of searches is “1”, which is the number of links corresponding to the conversion record 0 of FIG. Set to. When the update record 1 of the update information 2 shown in FIG. 11 is acquired in step ST300, the search start position is set to “0”, and the number of searches is “1”, which is the number of links corresponding to the conversion record 2 of FIG. Set to.

In step ST350, the update unit 10 sets the search start position of the corresponding link information in the conversion record acquired in step ST310 as the start number of the update range information of the update record acquired in step ST300, and sets the number of searches as the update range. The number of information update links. Then, the process proceeds to step ST360.
For example, when the update record 0 of the update information 2 shown in FIG. 11 is acquired in step ST300, the search start position is set to “0” which is the top number of the update range information of the update record 0, and the number of searches is updated. It is assumed that “1” is the number of update records of the range information.
When the update record 0 of the update information 3 shown in FIG. 11 is acquired in step ST300, the search start position is set to “1” which is the top number of the update range information of the update record 0, and the number of searches is the update range. Set to “1”, which is the number of updated records of information.

  Next, the update unit 10 checks the corresponding link information in the conversion record acquired in step ST310 by the number of searches from the search start position set in step ST340 or step ST350 (step ST360), and there is no corresponding corresponding link information. Is determined (step ST370). Thus, if there is corresponding link information having a corresponding link identifier that matches the link identifier of the link record acquired in step ST200, it is determined that “corresponding corresponding link information exists” (step ST370; NO), and the process proceeds to step ST380. To do. On the other hand, if there is no corresponding link information having a corresponding link identifier that matches the link identifier of the link record acquired in step ST200, it is determined that there is no corresponding corresponding link information (step ST370; YES), and the process proceeds to step ST390. .

For example, when the update record 0 of the update information 1 shown in FIG. 11 is acquired in step ST300, one corresponding link information of the conversion record 0 of FIG. 8 is checked from the head (0th).
At this time, when the link record acquired in step ST200 is the link of the mesh M2 in FIG. 5, the link identifier of the link record is 1000, which is the corresponding link identifier of the corresponding link information 0 of the conversion record 0 in FIG. Are different, and “No corresponding link information” is displayed.

Further, in step ST300, when the update record 1 of the update information 2 shown in FIG. 11 is acquired, the corresponding link information of the conversion record 2 of FIG. 8 is checked from the head (0th).
When the link record acquired in step ST200 is the link L2A6 of the mesh M2 in FIG. 5, the link identifier of the link record is 7000, and 7000 is the corresponding link identifier of the corresponding link information 0 of the conversion record 2 in FIG. Therefore, “corresponding link information is present” is displayed.

Furthermore, when the update record 0 of the update information 2 shown in FIG. 11 is acquired in step ST300, the corresponding link information of the conversion record 1 of FIG.
When the link record acquired in step ST200 is the link L2A1 of the mesh M2 in FIG. 5, the link identifier of the link record is 1003, and the corresponding link identifier of the corresponding link information 0 of the conversion record 1 in FIG. 8 is 1003. Therefore, “corresponding link information is present” is displayed.

Furthermore, when the update record 0 of the update information 3 shown in FIG. 11 is acquired in step ST300, the corresponding link information of the conversion record 1 of FIG. 8 is checked from the first one.
When the link record acquired in step ST200 is the link L2A2 of the mesh M2 in FIG. 5, the link identifier of the link record is 1004, and the corresponding link identifier of the corresponding link information 1 of the conversion record 1 in FIG. 8 is 1004. Therefore, “corresponding link information is present” is displayed.

In step ST380, the update unit 10 sets the update record acquired in step ST300 as an update record for updating the link record acquired in step ST200, sets the search result as “update record present”, and ends the update information search. .
For example, when the link record acquired in step ST200 is the link L2A6 of the mesh M2 in FIG. 5, in step ST300, the update record 1 of the update information 2 shown in FIG. 11 is updated to update the link record. As a result, the search result is “update record exists”.

  If the link record acquired in step ST200 is the link L2A1 of the mesh M2 in FIG. 5, the update record 0 of the update information 2 shown in FIG. 11 is updated to update the link record in step ST300. As a record, the search result is “update record exists”.

  Furthermore, when the link record acquired in step ST200 is the link L2A2 of the mesh M2 in FIG. 5, in step ST300, the update record 0 of the update information 3 shown in FIG. 11 is updated to update the link record. As a record, the search result is “update record exists”.

  In step ST390, the update unit 10 determines whether or not acquisition of the conversion record in step ST310 has been completed for all the conversion records of the conversion information. If acquisition of all conversion records has not been completed (step ST390; NO), the process returns to step ST310. If completed (step ST390; YES), the process proceeds to step ST400.

  In step ST400, the update unit 10 determines whether or not acquisition of the update record in step ST300 has been completed for all update records of all update information. If acquisition of all update records has not been completed (step ST400; NO), the process returns to step ST300. If completed (step ST400; YES), the process proceeds to step ST410.

  In step ST410, the update unit 10 sets the search result to “no update record” and ends the update information search.

(3) Map display process In the map display process, as described above, the map data acquisition unit 9 reads map data of a required mesh from the information storage unit 3 into the memory 9a, and the update unit 10 reads the map data in the map data. Update road network data. In the map display processing, the drawing processing unit 11 draws the background, road, and name in the drawing memory 12 using the background data, road network data, and name data of the updated map data, and the display control unit 13 The map drawn in the drawing memory 12 is displayed on the display unit 5.

  In the road drawing, the drawing processing unit 11 sequentially extracts the link records from the link list of the road network data stored in the memory 9a, and when the service information of the link record is 1 (non-service), the road shape of the link Is drawn, and the link record is extracted from the link shape list of the link only when the service information of the link record is 0 (in-service), and the road shape of the link is extracted based on the shape list of the extracted shape record Draws a line that represents In this drawing process, the color and pattern of the road shape are drawn based on the link attribute information of the link record.

FIG. 15 is a diagram showing a road drawing example (part 1), showing a road drawing example of the mesh M2 in FIG. 5 in a period before the date T1 ′ in which the update information 1 in FIG. 11 is not acquired. Yes. In FIG. 15, since the links L2A1, L2A2, and L2A7 are not started on the due date T1 ′, the service information of those link records has the value 1 (non-service), and the road shapes of these links are not drawn. .
In addition, since the service of the link L2A6 has not been abolished, the service information of the link record has a value of 0 (in service), and the road shape of this link is drawn.
Since the service information of the link records L2A0, L2A3, L2A4, L2A5, L2A8, and L2A9 other than the above in the mesh M2 in FIG. 5 has the value 0 (in service), the road shapes of these links are drawn.

FIG. 16 is a diagram illustrating a road drawing example (part 2), and a road drawing example of the mesh M2 of FIG. 5 in the period from the date T1 ′ after the update information 1 of FIG. 11 is acquired to the date T2. Show. In FIG. 16, since the service of the link L2A1 has been started in the above-described period and the service information of the link record has the value 0 (in service), the road shape of this link is drawn.
Further, since the service of the link L2A6 has been abolished, the service information of the link record is set to the value 1 (non-service), and the road shape of this link is not drawn.
Other links are the same as in the case of FIG.
Since the road is displayed according to the service information in this way, the user can immediately recognize whether or not each road can be used only by looking at the displayed map.

(4) Route Search Processing Also in the route search processing, the map data acquisition unit 9 reads map data of a required mesh from the information storage unit 3 to the memory 9a as described above, and the update unit 10 stores it in the memory 9a. The road network data in the map data is updated, and the route search unit 14 performs a route search using the updated road network data. In this route search process, the route search unit 14 refers to the service information of the link record, and performs a route search using only the link whose value is 0 (in service).

  As an example, the route search unit 14 uses the road network data of the meshes M1, M2, M3, and M4 in FIG. 5 to perform a route search of the node N4A3 as the starting point and the node N2A8 as the destination. Here, when the route search is executed in a period before the due date T1 ′ in which the update information 1 in FIG. 11 is not acquired, the link represented by the route search unit 14 using the dotted line in FIG. Route search is performed using links other than. As a result of this route search, a route of L4A2, L4A1, L4A4, L2A3, L2A6, and L2A8 is obtained.

When the route search is executed in the period after T5 ′ when the update information 1, update information 2, update information 3, and update information 5 in FIG. 11 are acquired, the route search unit 14 links the mesh M2 in FIG. Route search is performed using a link other than L2A6. As a result of this route search, a route of L4A2 → L4A6 → L2A7 is obtained.
In this way, the road network data is updated with the update information, and the route search process is performed using only the links in use at the time, so that a suitable route in accordance with the actual road condition can be obtained.

(5) Map matching process In the map matching process, the map data acquisition unit 9 reads map data of a required mesh from the information storage unit 3 to the memory 9a as described above, and the update unit 10 stores the map stored in the memory 9a. The road network data in the data is updated, and the map matching processing unit 15 moves using the updated road network data and the current position of the mobile body on which the map information device 1 detected by the position detection unit 2 is mounted. Find the link the body is running on and the current location on the link.
In this map matching process, the map matching processing unit 15 refers to the service information of the link record, and performs map matching using only the link whose value is 0 (in service).

  An example will be described in which the mobile body travels from the node N2A2 in FIG. 5 to the node N2A6 through the link L2A9. In this case, the map matching processing unit 15 searches for the link record of the link list from the road network data of the mesh M2 in FIG. 5 stored in the memory 9a, and the link whose service information is 0 (in service). Only get its shape record. Thereafter, the map matching processing unit 15 compares the road shape represented by the shape point list with the current position detected by the position detection unit 2, and finds a link located in a predetermined vicinity of the current position.

Before the date T2 ′ in which the update information 2 in FIG. 11 is not acquired, the mobile object passes through the node N2A2 and soon, is located in a predetermined vicinity of the current position, and the service information has a value of 0 (in service) ) Links L2A6 and L2A9 can be found.
In addition, since the link L2A1 has not started in service on this date, the service information has a value of 1 (non-service), and thus is excluded from link candidates located in a predetermined vicinity.
Furthermore, when the moving body continues to travel toward the node N2A6, the distance between the road shape of the link L2A6 and the current position increases, and the link L2A6 is excluded from the link candidates located in a predetermined vicinity. Thereby, it is determined that the mobile body is traveling on the link L2A9.

On the other hand, in the period after the date T2 ′ when the update information 2 in FIG. 11 is acquired, the service of the link L2A1 is started, the service information is updated to the value 0 (in service), and the service of the link L2A1 is abolished. The service information is updated to the value 1 (non-service). For this reason, it is possible to find the links L2A9 and L2A1 that are located in a predetermined vicinity of the current position and the service information has the value 0 (in service) immediately after the mobile object passes through the node N2A2.
Further, when the mobile body continues to travel toward the node N2A6, the distance between the road shape of the link L2A1 and the current position increases, and the link L2A1 is excluded from the link candidates located in a predetermined vicinity. Thereby, it is determined that the mobile body is traveling on the link L2A9.

  As described above, the road network data is updated with the update information, and the map matching process is performed using only the links in use at the time, so that suitable map matching in accordance with actual road conditions is possible.

As described above, according to the first embodiment, in the map data representing the map sectioned for each mesh, it is given indefinitely for each updated road group composed of roads scheduled to be started or abolished. The updated road group identifier and the map data are updated using updated information having the updated road group identifier and information indicating that the road of the updated road group specified by the updated road group identifier has been started or abandoned. Based on the correspondence information for associating the road to be represented, the update road group corresponding to the update road group identifier is identified from the road represented by the map data acquired by the map data acquisition unit 9, and the service information of the road of this update road group Is updated based on the update information.
In this way, the updated road group identifier that identifies the updated road group consisting of roads that are scheduled to be started or abolished is unchanged. It is possible to identify the updated road group. For this reason, the update information which notifies the start or abolition of the service in the road of the said road group can be used in common.
Also, by using the correspondence information, it becomes easy to associate the updated road group identifier of the update information with the road of the map data, which contributes to shortening of the update process.

  Further, according to the first embodiment, the update information is provided with partial designation information for designating a part of the road of the updated road group identified by the updated road group identifier, and the update unit 10 is stored in the information storage unit 3. Based on the stored conversion information, among the roads represented by the map data acquired by the map data acquisition unit 9, the update road group corresponding to the update road group identifier of the update information acquired by the update information acquisition unit 7a is specified. Then, the service information of the road designated by the partial designation information of the update information in the identified update road group is updated based on the update information. In this way, a part of the update road group indicated by the update road group identifier can be updated.

  Furthermore, according to the first embodiment, since the conversion information is information that associates the road number that identifies the road represented by the map data with the updated road group identifier, the updated road group identifier of the update information and the road of the map data And the update process becomes easy.

  Further, according to the first embodiment, the update information has update version information of the update road group to be updated, and the update version information is the oldest version of the map data representing the update road group. Therefore, acquisition of update information unnecessary for the map information processing apparatus 1 can be prevented.

  Furthermore, according to the first embodiment, the update information acquisition unit 7a does not acquire update information having update version information indicating a version newer than the version of the map data stored in the information storage unit 3. When the updated version information indicates a version newer than the version of the map data stored in the information storage unit 3, the updated road group of the version newer than the map data of the map information processing apparatus 1 is the map data of the map information processing apparatus 1. Therefore, it is possible to prevent unnecessary update information from being acquired by the map information processing apparatus 1 as described above.

  Furthermore, according to this Embodiment 1, when the update information acquisition part 7a completes the update of all the update road groups of the map data memorize | stored in the information storage part 3, since update information is not acquired after this, Unnecessary update information can be prevented from being acquired.

  Furthermore, according to this Embodiment 1, since the update information acquisition part 7a does not acquire update information when a predetermined period elapses from the creation time of the map data stored in the information storage part 3, the predetermined period elapses. Thus, it is possible to prevent the update information acquisition process from being executed even though the update information for the map information processing apparatus 1 is no longer provided.

  DESCRIPTION OF SYMBOLS 1 Map information processing apparatus, 1a input part, 2 Position detection part, 3 Information storage part, 4 Processor, 5 Display part, 6 Voice output part, 7 Information acquisition part, 7a Update information acquisition part, 8 Information provision apparatus, 9 Map Data acquisition unit, 9a memory, 10 update unit, 11 drawing processing unit, 12 drawing memory, 13 display control unit, 14 route search unit, 15 map matching processing unit.

Claims (7)

Identified by the updated road group identifier given to each updated road group consisting of roads scheduled to be in service or abandoned in the map data representing the map partitioned for each mesh, and the updated road group identifier An update information acquisition unit that acquires the update information from an external device that manages the update information having information indicating that the roads of the updated road group are in service or have been discontinued;
In-service information indicating whether a road is in service, map data representing a map partitioned for each mesh, the update information acquired by the update information acquisition unit, and the updated road group identifier and the An information storage unit that stores correspondence information that associates roads represented by map data;
A map data acquisition unit for acquiring the map data from the information storage unit;
Based on the correspondence information stored in the information storage unit, among roads represented by the map data acquired by the map data acquisition unit, an update road group identifier of the update information acquired by the update information acquisition unit The map information processing apparatus provided with the update part which specifies the update road group corresponding to and updates the said service information of the road of this update road group based on the said update information. The update information is provided with partial designation information for designating a part of the road of the updated road group identified by the updated road group identifier,
The update unit
Based on the correspondence information stored in the information storage unit, among roads represented by the map data acquired by the map data acquisition unit, an update road group identifier of the update information acquired by the update information acquisition unit And updating the service information of the road designated by the partial designation information of the update information in the identified update road group based on the update information. Item 2. The map information processing apparatus according to item 1.   The map information processing apparatus according to claim 1, wherein the correspondence information is information that associates a road number that identifies a road represented by the map data with the updated road group identifier. The update information includes update version information of an update road group to be updated,
The map information processing apparatus according to claim 1, wherein the updated version information is an oldest version of the map data representing the updated road group.   The update information acquisition unit does not acquire update information having the update version information indicating a version newer than the version of the map data stored in the information storage unit. The map information processing apparatus according to any one of the above.   The update information acquisition unit, after completing update of all the update road groups of the map data stored in the information storage unit, does not acquire update information thereafter. The map information processing apparatus according to claim 5.   The update information acquisition unit does not acquire update information when a predetermined period elapses from the creation time of the map data stored in the information storage unit. The map information processing apparatus according to claim 6.

Images