Information processing apparatus, information processing method, and information processing program

Abstract

To provide an information processor for associating road links of different road maps with each other.SOLUTION: The information processing device includes a first acquisition unit configured to acquire a first road map in which a road is represented by one link, a second acquisition unit configured to acquire a second road map in which a road is represented by at least two parallel links, an association unit configured to associate, when a link of the first road map is included in a region including the two parallel links of the second road map, the two parallel links of the second road map with the link of the first road map, and an extension unit configured to extend the region toward an integrated intersection when an end of the region is in contact with the integrated intersection. When a link of the first road map is included in the extended area, the association unit associates the two parallel links of the second road map with the link of the first road map.SELECTED DRAWING: Figure 1

Description

[Technical Field]

[0001] The present invention relates to an information processing device that associates links between different maps, an information processing method, and an information processing program. [Background technology]

[0002] In road maps that represent roads with nodes and links, the node and link settings may differ between different road maps. Since manually associating links between these different road maps requires a lot of time and effort, it is desirable to be able to automatically associate them. Patent Document 1 discloses a technology for different road network data, in which adjacent reference nodes and reference connection links connecting to the reference nodes are extracted from first road network data, and reference nodes adjacent to the reference nodes and reference connection links connecting to the reference nodes are extracted from second road network data, and the reference connection links and reference connection links are associated with each other based on the comparison results of the reference connection links and the reference connection links. [Prior art documents] [Patent documents]

[0003] [Patent Document 1] JP 2016-71490 A Summary of the Invention [Problem to be solved by the invention]

[0004] However, it can be difficult to associate links between a road map in which a road is represented by a single link (for example, a single-link road map) and a road map in which a road is represented by at least two links (for example, a double-link road map) due to differences in the position of each link relative to the road and the settings in the road map. In particular, in intersection areas, the configuration of links and nodes can become complex, making it difficult to associate links.

[0005] Therefore, an object of the present invention is to provide an information processing device, an information processing method, and an information processing program that can associate links between a road map in which a road is represented by a single link (e.g., a single-link road map) and a road map in which a road is represented by at least two links (e.g., a double-link road map). [Means for solving the problem]

[0006] In order to solve the above problem, an information processing device according to one embodiment of the present invention includes a first road map that represents roads by connecting nodes with links, the first road map representing roads with a single link; a second acquisition unit that acquires a second road map that represents roads by connecting nodes with links, the second road map representing roads with at least two parallel links; a matching unit that matches two parallel links of the second road map with a link of the first road map when the link of the first road map is included within an area of ​​the second road map that includes the two parallel links; and an extension unit that extends the area toward the integrated intersection when the end of the area borders the integrated intersection, and the matching unit matches the two parallel links of the second road map with the link of the first road map when the link of the first road map is included within the extended area.

[0007] In addition, in order to solve the above problem, an information processing method according to one embodiment of the present invention includes a first acquisition step in which a computer acquires a first road map in which roads are represented by links connecting nodes, the first road map representing roads with a single link; a second acquisition step in which a computer acquires a second road map in which roads are represented by links connecting nodes, the second road map representing roads with at least two parallel links; a correspondence step in which, if a link of the first road map is included within an area of ​​the second road map containing two parallel links, the two parallel links of the second road map are associated with the link of the first road map; and an extension step in which, if an end of the area borders the integrated intersection, the area is extended toward the integrated intersection; and the correspondence step in which, if a link of the first road map is included within the extended area, the two parallel links of the second road map are associated with the link of the first road map.

[0008] In addition, in order to solve the above-mentioned problem, an information processing program according to one embodiment of the present invention has a computer that implements a first acquisition function for acquiring a first road map in which roads are represented by links connecting nodes together, the first road map being a first road map in which roads are represented by a single link; a second acquisition function for acquiring a second road map in which roads are represented by links connecting nodes together, the second road map being a second road map in which roads are represented by at least two parallel links; a correspondence function for associating two parallel links of the second road map with a link of the first road map when the link of the first road map is included within an area containing the two parallel links of the second road map; and an extension function for extending the area toward the integrated intersection when the end of the area borders the integrated intersection, and the correspondence function associates the two parallel links of the second road map with the link of the first road map when the link of the first road map is included within the extended area.

[0009] In addition, in order to solve the above problem, another information processing device according to one embodiment of the present invention includes a first road map that represents roads by connecting nodes with links, the first road map representing roads with a single link; a second acquisition unit that acquires a second road map that represents roads by connecting nodes with links, the second road map representing roads with at least two parallel links; a matching unit that, when a link of the first road map is included in an area containing two parallel links of the second road map, matches the two parallel links of the second road map with the link of the first road map; and an extension unit that, when an unmatched link that is not matched by the matching unit and that borders the integrated intersection exists, extends the area to which the unmatched link borders toward the integrated intersection, and when a link of the first road map is included in the extended area, the matching unit matches the two parallel links of the second road map with the link of the first road map.

[0010] In addition, in order to solve the above problem, another information processing method according to one embodiment of the present invention includes a first acquisition step in which a computer acquires a first road map in which roads are represented by links connecting nodes, the first road map representing roads with a single link; a second acquisition step in which a computer acquires a second road map in which roads are represented by links connecting nodes, the second road map representing roads with at least two parallel links; a correspondence step in which, if a link of the first road map is included in an area of ​​the second road map containing the two parallel links, the two parallel links of the second road map are associated with the link of the first road map; and an extension step in which, if an uncorresponded link that is not associated by the correspondence step and that borders the integrated intersection exists, the area to which the uncorresponded link borders is extended toward the integrated intersection; and in the correspondence step, if a link of the first road map is included in the extended area, the two parallel links of the second road map are associated with the link of the first road map.

[0011] In addition, in order to solve the above problem, another information processing program according to one embodiment of the present invention has a computer that implements a first acquisition function for acquiring a first road map in which roads are represented by links connecting nodes, the first road map being a first road map in which roads are represented by a single link; a second acquisition function for acquiring a second road map in which roads are represented by links connecting nodes, the second road map being a second road map in which roads are represented by at least two parallel links; a correspondence function for associating two parallel links of the second road map with a link of the first road map when the link of the first road map is included within an area containing the two parallel links of the second road map; and an extension function for extending an area to which the uncorresponding link is adjacent toward the integrated intersection when an uncorresponding link that is not associated by the correspondence function and that is adjacent to the integrated intersection exists; and the correspondence function associates the two parallel links of the second road map with the link of the first road map when the link of the first road map is included within the extended area.

[0012] In the information processing device, the extension section may extend the region by a predetermined distance.

[0013] In the information processing device, the decompression unit may decompress the area until a new node is included in the area.

[0014] In the information processing device, the extension unit may extend the area so that the node farthest from the area is included among the group of nodes included in the integrated intersection.

[0015] In the information processing device, the extension unit may extend the area so as to include a range surrounding a group of nodes that make up the integrated intersection. [Effects of the Invention]

[0016] An information processing device according to one embodiment of the present invention is capable of associating links of a first road map in which roads are represented by connecting nodes with links, with links of the first road map in which roads are represented by a single link, with links of a second road map in which roads are represented by connecting nodes with links, with links of the second road map in which roads are represented by at least two parallel links. [Brief explanation of the drawings]

[0017] [Figure 1] FIG. 1 is a block diagram illustrating an example of the configuration of an information processing device. [Figure 2] (a) is a diagram showing an example of a road map, (b) is a diagram showing an example of a road map in which the road map shown in (a) is expressed by links and nodes of single roads, and (c) is a diagram showing an example of a road map in which the road map shown in (a) is expressed by links and nodes of double roads. [Figure 3] 10A and 10B are diagrams showing examples of region configurations. [Figure 4] 1A is a diagram showing an example of a first road map, and FIG. 1B is a diagram showing an example of a second road map of a location corresponding to the first road map shown in FIG. [Figure 5] 1A and 1B are diagrams showing examples of region extension, in which FIG. 1A shows an example before region extension, and FIG. 1B shows an example after region extension. [Figure 6] 10 is a flowchart illustrating an example of the operation of the information processing device. [Figure 7] 10 is a flowchart illustrating another example of the operation of the information processing device. [Figure 8] FIG. 10 is a diagram showing a first example of association when a link is set for each lane. [Figure 9] FIG. 10 is a diagram showing a second example of association when a link is set for each lane. [Figure 10] FIG. 10 is a block diagram showing another example of the configuration of the information processing device. DETAILED DESCRIPTION OF THE INVENTION

[0018] Hereinafter, an information processing device according to an aspect of the present invention will be described in detail with reference to the drawings.

[0019] <Embodiment> <Configuration> As shown in FIG. 1, an information processing device according to an embodiment of the present invention includes a first acquisition unit (see 105 in FIG. 1) that acquires a first road map (see 141 in FIG. 1) in which roads are represented by connecting nodes with links, with each road being represented by a single link; a second acquisition unit (see 105 in FIG. 1) that acquires a second road map (see 142 in FIG. 1) in which roads are represented by connecting nodes with links, with each road being represented by at least two parallel links; The road map display device includes a matching unit (see 105 in Figure 1) that matches two parallel links of the second road map with the link of the first road map when a link of the first road map is included in an area containing two parallel links, and an extension unit (see 105 in Figure 1) that extends the area toward the integrated intersection when the end of the area contacts the integrated intersection, and the matching unit matches the two parallel links of the second road map with the link of the first road map when the link of the first road map is included in the extended area.

[0020] As shown in FIG. 1, an information processing device according to an embodiment of the present invention includes a first road map (see 141 in FIG. 1) that represents roads by connecting nodes with links, and a first acquisition unit (see 105 in FIG. 1) that acquires the first road map in which the roads are represented by one link; a second road map (see 142 in FIG. 1) that represents roads by connecting nodes with links, and the roads are represented by at least two parallel links; and a second acquisition unit (see 105 in FIG. 1) that acquires the second road map in which the roads are represented by connecting nodes with links, and the first road map in which the roads are represented by one link. The system includes a correspondence assignment unit (see 105 in FIG. 1) that associates two parallel links of the second road map with the link of the first road map when the link of the road map is included, and an extension unit (see 105 in FIG. 1) that extends an area where the uncorresponding link is adjacent toward the integrated intersection when there is an uncorresponding link that is not associated by the correspondence assignment unit and that is adjacent to the integrated intersection, and when the link of the first road map is included within the extended area, the correspondence assignment unit associates the two parallel links of the second road map with the link of the first road map. This will be explained in detail below.

[0021] The information processing device 100 is a computer system implemented by a server device, a PC, or the like, but is not limited thereto and may be implemented by a mobile device such as a smartphone or a tablet terminal. The information processing device 100 may be a device that associates links in different road maps with each other. Associating links with each other may mean storing identification information of a link in a first road map and identification information of a link in a second road map in association with each other. Alternatively, associating links with each other may mean establishing a link from a link in a first (second) road map to a link in a second (first) road map. For example, when a link in the first road map is selected, the second road map of a predetermined range including the link in the second road map associated with the link can be automatically displayed, thereby linking the data between the first road map and the second road map to construct a data structure for each road map.

[0022] 1 is a block diagram showing an example of the configuration of an information processing device 100. As shown in FIG. 1, the information processing device 100 includes a communication unit 101, an input unit 102, an output unit 103, a storage unit 104, and a CPU 105.

[0023] The communication unit 101 has a function of transmitting and receiving information to and from other devices via wired or wireless communication. The communication unit 101 may, for example, receive a first road map 141 from an external device and transmit it to the CPU 105. The communication unit 101 may also, for example, receive a second road map 142 from the external device and transmit it to the CPU 105. The external device may be a server device or system that stores road maps. The communication unit 101 may also, in response to an instruction from the CPU 105, transmit information associating links on the first road map 141 with links on the second road map 142 to the external device.

[0024] The input unit 102 has a function of accepting input from the user of the information processing device 100 and transmitting it to the CPU 105. The input unit 102 can be realized, for example, by hardware keys provided on the information processing device 100, or soft keys such as a touch panel or touch keys. Note that input to the input unit 102 may be input by voice, in which case the input unit 102 is realized by a microphone. For example, the input unit 102 may accept input of information specifying a link to be associated on the first road map 141 or the second road map 142 from the user of the information processing device 100, and transmit the input to the CPU 105.

[0025] The output unit 103 has a function of outputting instructed data in accordance with an instruction from the CPU 105. The output of information by the output unit 103 may be output as text or images to a monitor (display device) attached to or connected to the information processing device 100, or may be output as audio from a speaker attached to or connected to the information processing device 100, or may be output by communication to an external device via the communication unit 101. For example, the output unit 103 may output information indicating the associated links of the first road map 141 and the second road map 142 in accordance with an instruction from the CPU 105.

[0026] The storage unit 104 is a recording medium that stores various programs and various data required for the operation of the information processing device 100. The storage unit 104 is realized by, for example, a hard disk drive (HDD), a solid state drive (SSD), a flash memory, etc., but is not limited to these. The storage unit 104 may also function as a memory (ROM, RAM) when a program is executed. The storage unit 104 may store a first road map 141 and a second road map 142. The storage unit 104 may also store a program for associating links on the first road map 141 with links on the second road map 142. The storage unit 104 may also be realized by cloud storage accessible by the information processing device 100.

[0027] The first road map 141 is road map information that represents roads by connecting nodes with links. The first road map 141 may be a road map that represents roads with a single link, or it can be said to be a road map that represents unified roads. A unified road may be a road that is represented by a single line, that is, a road that is represented without distinguishing between inbound and outbound lanes.

[0028] The second road map 142 is road map information that represents roads by connecting nodes with links. The second road map 142 may be a road map that represents roads with at least two parallel links, and can also be said to be a road map that represents roads as two-lane roads. A two-lane road may be a road that represents roads with a distinction between inbound and outbound lanes.

[0029] The first road map 141 and the second road map 142 will now be described with reference to Fig. 2. Fig. 2(a) is a diagram showing the outline of an intersection in map information. Fig. 2(a) is a part of the map information, and shows an example of an intersection where roads with one lane going up and one lane going down intersect with each other.

[0030] In such a map of an intersection with an outline, the first road map 141, which is expressed as a single road, is expressed by one link and nodes connecting the links, without distinguishing between inbound and outbound lanes, as shown in Fig. 2(b), for example. In Fig. 2(b), black circles represent nodes, and solid lines connecting the nodes represent links.

[0031] On the other hand, in a map of an outer diameter intersection as shown in Figure 2, it is represented as a two-way road. In the second road map 142, for example, as shown in Figure 2(c), inbound and outbound lanes are represented as links. In Figure 2(c), black circles represent nodes, and solid lines connecting nodes represent links.

[0032] In this way, the first road map 141 and the second road map 142 are road map information in which roads are represented by links connecting nodes.

[0033] The road map information can also be called road network data.

[0034] The CPU 105 is a processor that executes the processes to be executed by the information processing device 100, using various programs and various data stored in the storage unit 104. That is, the CPU 105 executes the information processing program stored in the storage unit 104, and associates the links of the first road map 141 with the links of the second road map 142.

[0035] The CPU 105 may function as a first acquisition unit, a second acquisition unit, an association unit, and an expansion unit.

[0036] The first acquisition unit acquires the first road map 141. The first acquisition unit may acquire the first road map 141 from the storage unit 140, or may acquire it from an external device or the like via the communication unit 110. The first road map 141 acquired by the first acquisition unit may be a part of the entire map information. The first road map 141 acquired by the first acquisition unit includes location information (longitude and latitude information) of locations where actual roads, etc. exist.

[0037] The second acquisition unit acquires the second road map 142. The second acquisition unit may acquire the second road map 142 from the storage unit 140, or may acquire it from an external device or the like via the communication unit 110. The second road map 142 acquired by the second acquisition unit may be a part of the entire map information. The second road map 142 acquired by the second acquisition unit includes location information (longitude and latitude information) of locations where actual roads and the like exist.

[0038] When a link of the first road map 141 is included within an area containing two parallel links of the second road map 142, the association unit associates the two parallel links of the second road map 142 with the link included within the area of ​​the first road map 141.

[0039] The association unit may superimpose the first road map 141 and the second road map 142 based on the position information in the second road map 142 and the position information in the first road map 141 so that matching positions overlap, and in this state, when a link of the first road map 141 is included in an area including two parallel links of the second road map 142, associate the two parallel links of the second road map 142 with the link included in the area of ​​the first road map 141. Note that, for ease of understanding, it is described here that the first road map 141 and the second road map 142 are superimposed, but the superimposition is not essential, and the association may be performed when the position coordinates set for the link of the first road map 141 fall within a range indicated by the position coordinates of the area including the two parallel links of the second road map 142.

[0040] The association unit forms an area based on two parallel links in the second road map 142. Here, the area is an area including two parallel links and is a virtual area. The two parallel links may be links on the same road that are within a predetermined distance from each other in the second road map 142. For example, links that are within a predetermined distance from each other may be a first link and a second link such that the distance from one end of the first link to one end of the second link and the distance from the other end of the first link to the other end of the second link are both within a predetermined distance. Note that the first link and the second link do not have to be parallel, but they must be parallel. Furthermore, one of the two parallel links may be a link that is connected in a straight line (even if the links are curved, they are considered to be straight when they are continuously connected). In other words, the links used to define the area may have nodes along their length.

[0041] Here, the area will be described using FIG. 3. FIGS. 3(a) and 3(b) are diagrams showing an example of a second road map 142, illustrating an example of an area. As shown in FIG. 3(a), the second road map 142 is a map including a link 20a connecting nodes 10a and 10b and a link 20b parallel to the link 20a connecting nodes 10c and 10d. The second road map 142 also includes a link 20c connecting nodes 10e and 10f, a link 20d adjacent to link 20c connecting nodes 10f and 10g, a link 20e parallel to link 20c connecting nodes 10h and 10i, and a link 20f adjacent to link 20e connecting nodes 10i and 10j.

[0042] As shown in FIG. 3(a), the association portion forms an area 301 that surrounds (includes) two parallel links 20a and 20b.

[0043] Alternatively, the association unit may treat link 20c and link 20d as one of two parallel links, and link 20e and link 20f as the other of the two parallel links, to form region 302. Forming a region by treating a state in which multiple links are connected as one link, as in region 302, may be done when none of the links in the first road map 141 are included in the region (to widen the region to be formed).

[0044] The area may also be curved, as shown in Figure 3(b). As shown in Figure 3(b), the second road map 142 is a map that includes a link 20g connecting node 10k and node 10l, and a node 20h that is parallel to link 20g and connects node 10m and node 10n. The second road map 142 also includes a link 20i connecting node 10o and node 10p, a link 20j that is adjacent to link 20i and connects node 10p and node 10q, a link 20k that is parallel to link 20i and connects node 10r and node 10s, and a link 20l that is adjacent to link 20k and connects node 10s and node 10t.

[0045] As shown in FIG. 3(b), the association portion forms an area 303 that surrounds (includes) two parallel links 20g and 20h.

[0046] Alternatively, the association unit may form the region 304 by treating the link 20i and the link 20j as one of two parallel links and the link 20k and the link 20l as the other of the two parallel links.

[0047] As shown in areas 301 to 304, the shape of an area depends on the shapes of the two links included in the area.

[0048] 3 (301-304) may be formed by, for example, connecting the endpoints of line segments that have the same shape as the two links that form the basis of the region and that are moved a predetermined distance away from the two links and lengthened by a predetermined factor. Alternatively, the region may be formed by connecting each of the endpoints (four points) of the two links with a point located a predetermined distance away from the center of gravity of the endpoints (four points) of the two links.

[0049] When a link on the first road map 141 is included in the formed area, the association unit associates two links on the second road map 142 that form the area with the link on the first road map 141 that is included in the area.

[0050] The extension unit may extend the area formed by the association unit when an edge of the area formed by the association unit contacts the combined intersection, and extend the area toward the combined intersection. The combined intersection is an intersection that includes multiple nodes and that is registered in the second road map 142 as a single group (intersection). In other words, it may be an intersection that includes multiple nodes. When extending the area, the extension unit may extend it by a predetermined distance. When extending the area, the extension unit may extend it until a node of the combined intersection (a node of the second road map 142) that was not included in the area before extension is newly included. When extending the area to newly include a node of the combined intersection that was not included in the area before extension, the extension unit may extend it so that the node closest to the area is included, or the node farthest from the area within the combined intersection is included, or the extension unit may extend it so that a range including all of the nodes within the combined intersection is included in the area.

[0051] Link association by the association unit and region extension by the extension unit will be described with reference to FIGS.

[0052] 4(a) is an example of a first road map 141, and as shown, it shows links and nodes at a certain intersection. As shown in FIG. 4(a), near the intersection, the first road map 141 includes a link 40a connecting node 30a and node 30b, a link 40b that is linearly adjacent to link 40a and connects node 30b and node 30c, a link 40c that connects node 30b and node 30d, a link 40d that is linearly adjacent to link 40c and connects node 30d and node 30e, and a link 40e that is linearly adjacent to link 40d and connects node 30e and node 30f.

[0053] On the other hand, Fig. 4(b) is an example of the second road map 142, which shows links and nodes at an intersection showing the same location (aligned location) as the first road map 141 shown in Fig. 4(a). As shown in Fig. 4(b), near the intersection, the second road map 142 shows a link 60a connecting node 50a and node 50b, a link 60b linearly adjacent to link 60a and connecting node 50b and node 50c, a link 60c linearly adjacent to link 60b and connecting node 50c and node 50d, a link 60d linearly adjacent to link 60c and connecting node 50d and node 50e, a link 60e parallel to link 60a and connecting node 50f and node 50g, a link 60f linearly adjacent to link 60e and connecting node 50g and node 50h, a link 60f linearly adjacent to link 60f and connecting node 50h and node 50h, and a link 60c linearly adjacent to link 60f and connecting node 50h and node 50h. The intersection shown in Figure 5(b) includes four nodes: link 60g connecting node 50i to node 50i, link 60h adjacent to link 60g and connecting node 50i to node 50j, link 60i connecting node 50c to node 50h, link 60k adjacent to link 60i in a straight line and connecting node 50h to node 50k, link 60m adjacent to link 60k in a straight line and connecting node 50k to node 50m, link 60j parallel to link 60i and connecting node 50d to node 50i, link 60l connected in a straight line to link 60j and connecting node 50i to node 50l, and link 60n connected in a straight line to link 60l and connecting node 50l to node 50n. The intersection shown in Figure 5(b) is an integrated intersection because it includes four nodes: node 50c, node 50d, node 50h, and node 50i.

[0054] Consider the correspondence between the links of the first road map 141 shown in FIG. 4(a) and the links of the second road map 142 shown in FIG. 4(b).

[0055] Fig. 5(a) is a diagram in which the first road map 141 shown in Fig. 4(a) is superimposed on the second road map 142 shown in Fig. 4(b). Here, it is assumed that the association unit forms an area 501 by treating the link 60k and the link 60l of the second road map 142 as two parallel links.

[0056] In this case, the area 501 includes the link 40d that connects the node 30d and the node 30e on the first road map 141. Therefore, the association unit can associate the link 60k with the link 40d, and the link 60l with the link 40d.

[0057] Incidentally, an end of the area 501 is adjacent to the combined intersection. Therefore, the extension unit extends the area 501 toward the combined intersection. FIG. 5(b) shows an area 502 obtained by extending the area 501 a predetermined distance toward the combined intersection. Therefore, the association unit associates the two links 60k and 60l used to form the area 502 with the links 40c and 40d of the first road map 141 included in the area 502.

[0058] 5(b) shows an example of region 502 obtained by extending region 501 by a predetermined distance, but if region 501 is to be extended to include a new node at the merged intersection rather than a predetermined distance, region 501 may be extended to include node 50c and / or node 50d in the example of FIG. 5(b) to form region 502. If there is a difference in distance from the end of region 501 between node 50c and node 50d, region 501 may be extended to include the node within the merged intersection that is farthest from region 501. Alternatively, region 501 may be extended to include the new node at the merged intersection that is closest to the end of region 501.

[0059] Information on the links associated in this manner may be stored as association information in the storage unit 140. Taking Fig. 5(b) as an example, the association information includes information in which the identification information of link 40c of the first road map 141 is associated with the identification information of link 60k of the second road map 142, the identification information of link 40c of the first road map 141 is associated with the identification information of link 60l of the second road map 142, the identification information of link 40d of the first road map 141 is associated with the identification information of link 60k of the second road map 142, and the identification information of link 40d of the first road map 141 is associated with the identification information of link 60l of the second road map 142.

[0060] Alternatively, information about links associated with each road map may be registered as metadata, for example. For example, identification information of links 60k and 60l on the second road map 142 may be recorded as metadata in association with link 40c on the first road map 141, and identification information of links 40c and 40d on the first road map 141 may be recorded as metadata in association with link 60k on the second road map 142.

[0061] The CPU 105 may further output, via the output unit 103 or the communication unit 101, information (identification information) indicating the link of the first road map 141 and the link of the second road map 142 associated by the association unit.

[0062] The above is an example of the configuration of the information processing device 100.

[0063] <Example of operation of information processing device> FIG. 6 is a flowchart showing an example of the operation of the information processing device 100.

[0064] As shown in FIG. 6, in the information processing device 100, the first acquisition unit of the CPU 105 acquires the first road map 141 in which roads are expressed as unified roads (step S601).

[0065] The second acquisition unit of the CPU 105 acquires the second road map 142 that represents roads as two-row roads (step S602).

[0066] The association unit of the CPU 105 forms an area including two parallel links on the second road map 142 (step S603). Then, the association unit determines whether an edge of the formed area contacts the integrated intersection (step S604). This determination can be made, for example, by determining whether the position information (range) of the set area partially overlaps with the intersection area of ​​the intersection where multiple nodes are set.

[0067] If the area edge abuts the combined intersection (YES in step S604), the extension unit of CPU 105 forms an area including the two parallel links of the second road map 142. That is, the extension unit extends the area formed based on the two parallel links toward the combined intersection (step S605), and proceeds to the processing of step S606. If the area edge does not abut the combined intersection (NO in step S604), the area is not extended and proceeds to the processing of step S606.

[0068] In step S606, the association unit determines whether or not the area contains links from the first road map 141 (step S606). If links from the first road map 141 are included (YES in step S606), the association unit associates the links from the second road map 142 that form the area with the links from the first road map 141 that are included in the area (step S607), and ends the process. If links from the first road map 141 are not included in the area (NO in step S606), no association is performed.

[0069] The information processing device 100 can associate links of the first road map 141 with links of the second road map 142 for the entire map by repeatedly executing the process shown in FIG.

[0070] The above is an example of the operation of the information processing device 100.

[0071] <Summary> As described above, the information processing device 100 can associate links between a road map in which roads are represented by a single link (for example, a single-link road map) and a road map in which roads are represented by at least two links (for example, a double-link road map) by forming an area with two parallel links and identifying the links included in that area. Furthermore, near an integrated intersection where link association is difficult, the formed area can be extended in the direction of the integrated intersection, thereby expanding the area within a certain range and preventing links from being omitted from association. <Supplementary information>

[0072] The information processing device according to the above embodiment is not limited to the above embodiment, and may be realized by other methods. Various modifications will be described below.

[0073] (1) In the above embodiment, the extension unit of the information processing device 100 extends an area when the edge of the area formed by two parallel links on the second road map 142 abuts on an integrated intersection. However, the condition for extension is not limited to this, and other methods can be used to achieve the same. Figure 7 is a flowchart showing another example of the operation of the information processing device 100. In the flowchart shown in Figure 7, the processing up to step S603 in the flowchart shown in Figure 6 is the same, so the processing thereafter will be described.

[0074] 7, after forming an area, if a link of the first road map is included in the formed area, the associating unit associates the link of the second road map that forms the area with the link of the first road map that is included in the area (step S701). After forming an area for the entire first road map 141 and the second road map 142 (or the same predetermined range) and associating the links, the associating unit determines whether there is an unassociated link in the first road map 141 (step S702). If there is no unassociated link (NO in step S702), the process ends.

[0075] If there is an unassociated link (YES in step S702), the location on the first road map 141 is identified, and it is determined whether or not that location (unassociated link) borders on a combined intersection on the second road map 142 (step S703). If the unassociated link does not border on a combined intersection (NO in step S703), the process ends.

[0076] If an unmatched link borders an integrated intersection (YES in step S703), the matching unit identifies the area that the link borders in the extension direction of the link, and extends that area toward the integrated intersection (step S704).

[0077] Then, the association unit determines whether the expanded area includes links from the first road map 141, and if so, associates the links from the second road map that form the expanded area with the links from the first road map that are included in the expanded area (step S705), and ends the processing.

[0078] This processing method can also achieve the same results as the processing of the flowchart shown in FIG. 6 in the above embodiment.

[0079] (2) In the above embodiment, an example is shown in which links are associated between the second road map 142 represented by two-lane roads and the first road map 141 represented by one-lane roads, but the second road map 142 may also be a road map in which links are set for each lane.

[0080] This will be explained in detail using Figure 8. Figure 8(a) is a diagram showing an example of a road map in which a link is set for each lane in the second road map 142. Figure 8(a) shows an example in which a link is set for each lane on a road with two lanes going up and two lanes going down.

[0081] On the other hand, FIG. 8(b) shows a first road map 141 expressed as a single road.

[0082] In such a case, the association unit may form an area using the outermost links of the road as the two links for forming the area in the second road map 142. That is, in the example of Fig. 8(a), an area 801 may be formed by the link 80a connecting the node 70a and the node 70b and the link 80b connecting the node 70c and the node 70d.

[0083] Then, when a link of the first road map 141 is included in the formed area 801, the associating unit may associate the link with a link of the second road map 142 in the area 801.

[0084] In the example of FIG. 8, link 80a of the second road map 142 within area 801 may be associated with link 80e connecting node 70e and node 70f of the first road map 141. Similarly, link 80b of the second road map 142 may be associated with link 80e of the first road map 141. Furthermore, in such a case, links 80c and 80d are also included within the formed area 801, and these links 80c and 80d may also be associated with link 80e. In this way, the information processing device 100 may associate links between a road map in which links are set for each lane and a road map represented by unified roads.

[0085] Even in such a case, if the area is adjacent to the combined intersection, the information processing device 100 may extend the area 801 toward the combined intersection and perform the association.

[0086] (3) In the above embodiment, an example is shown in which links are associated between the second road map 142 represented by two-track roads and the first road map 141 represented by one-track roads. However, the information processing device may also be a device that associates links of a road map represented by two-track roads with links of a road map in which links are set for each lane.

[0087] This will be explained in detail using Figure 9. Figure 9(a) is a diagram showing an example of a road map in which a link is set for each lane in the second road map 142. Figure 9(a) shows an example in which a link is set for each lane on a road with two lanes going up and two lanes going down.

[0088] On the other hand, FIG. 9(b) shows the first road map 141 of the same location, which is represented by two-row roads, but in which no links are set for each diagonal line.

[0089] In such a case, the associating unit may form an area using the two outermost links of the up-bound lane links in the second road map 142 as the two links for forming the area. In the example of Fig. 9(a), the area 901 may be formed using the link 95a connecting the node 90a and the node 90b and the link 95b connecting the node 90c and the node 90d as the two links for forming the area.

[0090] When a link of the first road map 141 is included in the formed area 901, the associating unit may associate the link with a link of the second road map 142 in the area 901.

[0091] In the example of FIG. 9, link 95a of the second road map 142 in area 901 may be associated with link 95c connecting node 90e and node 90f of the first road map 141. Similarly, link 95b of the second road map 142 may be associated with link 95c of the first road map 141. The information processing device 100 also performs similar processing on the outbound lane side, forming an area with link 95e and link 95f, and associating link 95e with link 95d, and link 95f with link 95d. In this way, the information processing device 100 may associate links between a road map in which links are set for each diagonal line and a road map represented by two-row roads.

[0092] Even in such a case, if the area is adjacent to the combined intersection, the area 901 may be extended toward the combined intersection.

[0093] (4) In the above embodiment, the information processing device associates links on the first road map 141 with links on the second road map 142 by executing a predetermined program or the like through the processor of the information processing device. However, this may be realized by a logic circuit (hardware) or dedicated circuit formed in an integrated circuit (IC (Integrated Circuit) chip, LSI (Large Scale Integration)) or the like. Furthermore, these circuits may be realized by one or more integrated circuits, and the functions of the multiple functional units described in the above embodiment may be realized by a single integrated circuit. LSIs are sometimes referred to as VLSIs, super LSIs, ultra LSIs, etc., depending on the degree of integration. That is, as shown in FIG. 10, the information processing device 100 may be composed of a communication circuit 101a, an input circuit 102a, an output circuit 103a, a memory circuit 104a, and a control circuit 105a, which correspond to the communication unit 101, the input unit 102, the output unit 103, the memory unit 104, and the CPU 105, respectively.

[0094] The program may be recorded on a processor-readable recording medium, which may be a "non-transitory tangible medium" such as a tape, disk, card, semiconductor memory, or programmable logic circuit. The program may be supplied to the processor via any transmission medium capable of transmitting the program (such as a communication network or broadcast waves). That is, the program may be downloaded from a network and executed using an information processing device such as a smartphone. The present invention may also be realized in the form of a data signal embedded in a carrier wave, in which the program is embodied by electronic transmission.

[0095] The above program can be implemented using, for example, scripting languages ​​such as ActionScript and JavaScript (registered trademark), or object-oriented programming languages ​​such as Objective-C, Java (registered trademark), C++, Python, and R, but these languages ​​are just examples.

[0096] (5) The various examples shown in the above embodiments may be combined as appropriate. [Explanation of symbols]

[0097] 100 Information processing device 101 Communications Department 102 Input section 103 Output section 104 Storage section 105 CPU (first acquisition unit, second acquisition unit, association unit, decompression unit) 141 Road Map No. 1 142 Second Road Map

Claims

1. a first acquisition unit that acquires a first road map in which roads are represented by connecting nodes with links, the first road map representing roads as a single link; a second acquisition unit that acquires a second road map in which roads are represented by connecting nodes with links, and roads are represented by at least two parallel links; a correspondence unit that, when a link of the first road map is included in an area including two parallel links of the second road map, associates the two parallel links of the second road map with the link of the first road map; an extension section that extends the area toward the merged intersection when an end of the area contacts the merged intersection, When a link of the first road map is included in the extended area, the associating unit associates the two parallel links of the second road map with the link of the first road map. Information processing device.

2. a first acquisition unit that acquires a first road map in which roads are represented by connecting nodes with links, the first road map representing roads as a single link; a second acquisition unit that acquires a second road map in which roads are represented by connecting nodes with links, and roads are represented by at least two parallel links; a correspondence unit that, when a link of the first road map is included in an area including two parallel links of the second road map, associates the two parallel links of the second road map with the link of the first road map; an extension unit that, when there is an uncorresponded link that is not associated by the association unit and that is adjacent to the integrated intersection, extends an area where the uncorresponded link is adjacent toward the integrated intersection, When a link of the first road map is included in the extended area, the associating unit associates the two parallel links of the second road map with the link of the first road map. Information processing device.

3. The extension section extends the region by a predetermined distance.

3. The information processing apparatus according to claim 1, wherein the information processing apparatus is a computer.

4. The extension unit extends the region until it includes a new node.

3. The information processing apparatus according to claim 1, wherein the information processing apparatus is a computer.

5. The extension unit extends the area so that the node farthest from the area is included among the nodes included in the integrated intersection.

3. The information processing apparatus according to claim 1, wherein the information processing apparatus is a computer.

6. The extension unit extends the area so as to include a range surrounding a group of nodes that constitute the integrated intersection.

3. The information processing apparatus according to claim 1, wherein the information processing apparatus is a computer.

7. The computer a first acquisition step of acquiring a first road map in which roads are represented by connecting nodes with links, the first road map representing roads by a single link; a second acquisition step of acquiring a second road map in which roads are represented by connecting nodes with links, and the second road map represents roads by at least two parallel links; a correspondence step of associating, when a link of the first road map is included in an area including two parallel links of the second road map, the two parallel links of the second road map with the link of the first road map; an extension step of extending the region toward the merging intersection when an end of the region contacts the merging intersection; The association step associates the two parallel links of the second road map with the link of the first road map when the link of the first road map is included in the extended area. Information processing methods.

8. The computer a first acquisition step of acquiring a first road map in which roads are represented by connecting nodes with links, the first road map representing roads by a single link; a second acquisition step of acquiring a second road map in which roads are represented by connecting nodes with links, and the second road map represents roads by at least two parallel links; a correspondence step of associating, when a link of the first road map is included in an area including two parallel links of the second road map, the two parallel links of the second road map with the link of the first road map; an extension step of extending an area where the uncorresponding link is in contact with the integrated intersection when the uncorresponding link that is not associated by the association step exists, toward the integrated intersection; The association step associates the two parallel links of the second road map with the link of the first road map when the link of the first road map is included in the extended area. Information processing methods.

9. On the computer, a first acquisition function for acquiring a first road map in which roads are represented by connecting nodes with links, the first road map representing roads by a single link; a second acquisition function for acquiring a second road map in which roads are represented by connecting nodes with links, and the second road map represents roads by at least two parallel links; a correspondence function for associating two parallel links of the second road map with a link of the first road map when the link of the first road map is included in an area including the two parallel links of the second road map; and an extension function for extending the area toward the integrated intersection when an end of the area contacts the integrated intersection, The association function associates the two parallel links of the second road map with the link of the first road map when the link of the first road map is included in the expanded area. Information processing program.

10. On the computer, a first acquisition function for acquiring a first road map in which roads are represented by connecting nodes with links, the first road map representing roads by a single link; a second acquisition function for acquiring a second road map in which roads are represented by connecting nodes with links, and the second road map represents roads by at least two parallel links; a correspondence function for associating two parallel links of the second road map with a link of the first road map when the link of the first road map is included in an area including the two parallel links of the second road map; and an extension function for extending an area where an uncorresponding link that has not been associated by the association function and that is adjacent to an integrated intersection exists, toward the integrated intersection, The association function associates the two parallel links of the second road map with the link of the first road map when the link of the first road map is included in the expanded area. Information processing program.

Images