JP5444577B2 - Traffic information calculation device, program, and traffic information calculation method - Google Patents

Description

  The present invention relates to a traffic information calculation device, a program, and a traffic information calculation method.

  A travel time calculation system that calculates a travel time of a vehicle related to a travel link based on vehicle position information and time information at each position has been put into practical use (for example, see Patent Document 1 below). Probe data including vehicle position information and time information at each position is transmitted from the vehicle to the center device in units of data files including a predetermined amount of probe data. The center device refers to a link map on which various links are drawn, and based on the time when the vehicle enters a certain travel link and the time when the vehicle leaves the travel link, Calculate travel time.

  FIG. 12 is a diagram illustrating an example of a link map. In this example, a link L1 that connects the node N1 and the node N2, a link L2 that connects the node N2 and the node N3, and a link L3 that connects the node N3 and the node N4 are depicted. The black triangle is the probe data included in the data file F1, and the black square is the probe data included in the data file F2. Based on the time information included in the probe data Da closest to the node N1 and the time information included in the probe data Db closest to the node N2, the travel time of the vehicle related to the travel link L1 is calculated. Similarly, the travel time of the vehicle related to the travel link L3 is calculated based on the time information included in the probe data Dc closest to the node N3 and the time information included in the probe data Dd closest to the node N4. .

Japanese Patent No. 3775394

  The center apparatus according to the background art receives probe data in units of data files and performs travel time calculation processing in units of data files. Therefore, when the probe data corresponding to the start point of the travel link and the probe data corresponding to the end point are not included in one data file, the travel time is not calculated for the travel link.

  In the example shown in FIG. 12, the probe data corresponding to the traveling link L2 straddles two data files F1 and F2. That is, probe data Db corresponding to the start point (node N2) of the travel link L2 and probe data Dc corresponding to the end point (node N3) are not included in one data file. Accordingly, the travel time of the vehicle related to the travel link L2 is not calculated.

  The present invention has been made in view of such circumstances, a traffic information calculation device, a program, and a traffic information calculation method capable of calculating the travel time of a moving body even with respect to a travel link straddling a plurality of data files. The purpose is to obtain.

  The traffic information calculation apparatus according to the first aspect of the present invention obtains travel locus data including position information of a moving body and time information at each position in units of data files including a predetermined amount of travel locus data. And a calculation means for calculating a travel time of the mobile body with respect to a travel link that is a link that can be estimated that the mobile body is traveling based on the travel locus data acquired by the acquisition means. In the calculation device, the calculation unit may calculate the travel based on the plurality of data files when the travel locus data when the moving body travels the travel link is divided into the plurality of data files. The travel time of the mobile body related to the link is calculated.

  According to the traffic information calculation device according to the first aspect, the calculation means includes a plurality of data files even when the travel locus data when the mobile object travels the travel link is divided into a plurality of data files. Based on the data file, the travel time of the moving body related to the travel link is calculated. Therefore, it is possible to calculate the travel time of the mobile body even for travel links that span a plurality of data files.

  The traffic information calculation device according to the second aspect of the present invention is the traffic information calculation device according to the first aspect, particularly comprising an association means for associating the travel locus data with the travel link. When there is residual travel locus data that has not been associated with a travel link in the plurality of data files, the remaining travel locus data and a travel locus included in another data file Based on the data, the travel time of the moving body regarding another travel link is calculated.

  According to the traffic information calculation device according to the second aspect, when there is residual travel locus data that has not been associated with the travel link in the plurality of data files, the calculation means Based on the travel locus data and the travel locus data included in another data file, the travel time of the moving body related to another travel link is calculated. In this way, the remaining travel locus data is saved, and the remaining travel locus data and the travel locus data included in another data file are combined and associated with another travel link, so that The travel time of the moving body related to the travel link can be calculated.

  Note that “association of travel locus data with a travel link” means that travel locus data is associated with the entire travel link from the start point to the end point, and the travel locus data is associated with only a part of the travel link. If not, the travel locus data is not associated with the travel link.

  Further, the calculation means calculates a partial travel time related to another travel link based on the remaining travel trajectory data associated with the another travel link by the association means, and the correspondence Based on the travel locus data included in the another data file associated with the other travel link by the attaching means, another partial travel time for the another travel link is calculated, and the partial travel time is calculated. The travel time of the moving body related to the other travel link may be calculated based on the travel time and the other partial travel time. The aspect described here is a modification of the second aspect described above, and is similar to the second aspect in that the travel time of the moving body related to one traveling link is obtained based on a plurality of data files. Included within the scope of the first aspect. Further, in this aspect, the remaining travel locus data is associated with a part of another travel link, and the travel locus data included in another data file is associated with another part of the other travel link. . Therefore, exceptionally, “association” in this aspect means that traveling locus data is associated with a part of the traveling link.

  The traffic information calculation apparatus according to the third aspect of the present invention is the traffic information calculation apparatus according to the second aspect, particularly when there are a plurality of candidates for the travel link, Based on the conditions, one of the plurality of candidates is selected as the travel link, the travel track data is associated with the travel link, and the calculation means adds the travel track data associated with the travel link. The travel time of the moving body related to the travel link is calculated based on the travel link.

  According to the traffic information calculation device according to the third aspect, when there are a plurality of candidates regarding the travel link, one of the plurality of candidates is selected as the travel link, and the travel locus data is associated and selected. The travel time of the moving body related to the travel link is calculated. Therefore, in comparison with the case where the travel link is processed retrospectively after the candidate is determined, real-time processing is possible and the processing load can be reduced.

  The traffic information calculation apparatus according to the fourth aspect of the present invention is the traffic information calculation apparatus according to the third aspect, in particular, when there are a plurality of candidates for the other travel link, Among the plurality of candidates, the one that is connected to the travel link is selected as the other travel link, the remaining travel link data, the travel trajectory data included in the another data file, Are associated with each other.

  According to the traffic information calculation device according to the fourth aspect, when there are a plurality of candidates for another travel link, the associating means converts another one of the plurality of candidates connected to the travel link to another travel link. Select as. Therefore, when there are a plurality of candidates for the travel link and other travel links, it is possible to avoid the occurrence of a situation in which the selected travel link and the selected other travel link are not connected to each other.

  The traffic information calculation apparatus according to the fifth aspect of the present invention is the traffic information calculation apparatus according to the third aspect, in particular, when there are a plurality of candidates for the other travel link, Based on a predetermined condition, one of the plurality of candidates is selected as the other travel link, and the remaining travel trajectory data and the travel included in the other data file are included in the other travel link. It is characterized by associating with trajectory data.

  According to the traffic information calculation device according to the fifth aspect, when there are a plurality of candidates for another traveling link, the associating means selects one of the plurality of candidates based on a predetermined condition. Select as another travel link. Therefore, in the case where there are a plurality of candidates for different travel links and different travel links, it is possible to avoid the occurrence of a situation in which the selection of another travel link is erroneously accompanied when the selection of the travel link is incorrect. it can.

  The traffic information calculation apparatus according to a sixth aspect of the present invention is the traffic information calculation apparatus according to the second aspect, in particular, the association means is configured to perform the travel when only one travel link candidate exists. It is characterized by associating travel locus data with a link.

  According to the traffic information calculation device according to the sixth aspect, the association means associates the travel locus data with the travel link when there is only one travel link candidate. That is, only when the travel link is a deterministic travel link, travel trajectory data is associated with the travel link, and the travel time of the mobile body related to the travel link is calculated. Therefore, in the case where there are a plurality of travel link candidates, it is possible to avoid the occurrence of a situation in which an incorrect travel time is accumulated when the travel link is selected incorrectly.

  The traffic information calculation apparatus according to the seventh aspect of the present invention can be associated with the travel link particularly when there are a plurality of candidates for the travel link in the traffic information calculation apparatus according to the second aspect. When travel locus data is stored and one of the plurality of candidates is later selected as the travel link, the associating means associates the stored travel locus data with the selected travel link. In addition, the calculating means calculates the travel time of the moving body related to the travel link based on the travel locus data associated with the travel link by the association means.

  According to the traffic information calculation device according to the seventh aspect, in the case where there are a plurality of candidates for the travel link, when one of the plurality of candidates is selected later, the association means stores Corresponding travel trajectory data is associated with the selected travel link, and the calculating means calculates the travel time of the moving body related to the selected travel link. In this way, by processing the travel links retrospectively after the candidate is confirmed, it is possible to avoid the occurrence of a situation where an incorrect travel time is accumulated when the travel link is selected incorrectly.

  The traffic information calculation device according to an eighth aspect of the present invention is the traffic information calculation device according to the seventh aspect, in particular, wherein the associating means uses the plurality of travel locus data that can be associated with the travel link as the plurality of travel locus data. The calculation means is associated with one of the plurality of candidates based on the travel locus data associated with one of the plurality of candidates by the association means. When the travel time of the mobile body related to one is calculated and one of the candidates is not selected as the travel link later, the travel time calculated by the calculation means is the travel time related to the travel link. The travel time of the moving object is output.

  According to the traffic information calculation apparatus according to the eighth aspect, the travel time of the moving body related to the travel link is provisionally calculated, and if the travel link is not fixed later, the travel information is provisionally calculated. The travel time that was used is confirmed and output. Therefore, even if the travel link is not confirmed later, the travel time of the mobile body related to the travel link can be accumulated by forcibly confirming the provisional travel time.

  According to a ninth aspect of the present invention, there is provided a program for acquiring a computer in a data file unit including a predetermined amount of travel locus data including travel locus data including position information of a moving body and time information at each position. And a calculation means for calculating a travel time of the mobile body with respect to a travel link that is a link that can be estimated that the mobile body is traveling based on the travel trajectory data acquired by the acquisition means. In the program, the calculation means calculates the travel based on the plurality of data files when the travel locus data when the moving body travels on the travel link is divided into a plurality of data files. The travel time of the mobile body related to the link is calculated.

  According to the program according to the ninth aspect, the calculating means stores the plurality of data files even when the traveling locus data when the moving body travels the traveling link is divided into the plurality of data files. Based on the travel link, the travel time of the moving body related to the travel link is calculated. Therefore, it is possible to calculate the travel time of the mobile body even for travel links that span a plurality of data files.

  In the traffic information calculation method according to the tenth aspect of the present invention, (A) travel locus data including position information of a moving body and time information at each position is acquired in units of data files including a predetermined amount of travel locus data. And (B) calculating a travel time of the mobile body with respect to a travel link that is a link that can be estimated that the mobile body is traveling based on the travel locus data acquired in step (A). In the step (B), when the travel locus data when the moving body travels on a travel link is divided into a plurality of data files, Based on the data file, the travel time of the mobile body related to the travel link is calculated.

  According to the traffic information calculation method according to the tenth aspect, in step (B), when the travel locus data when the mobile body travels the travel link is divided into a plurality of data files, Based on the data file, the travel time of the moving body related to the travel link is calculated. Therefore, it is possible to calculate the travel time of the mobile body even for travel links that span a plurality of data files.

  ADVANTAGE OF THE INVENTION According to this invention, it becomes possible to calculate the travel time of a mobile body also regarding the travel link over a some data file.

  Hereinafter, embodiments of the present invention will be described in detail with reference to the drawings. In addition, the element which attached | subjected the same code | symbol in different drawing shall show the same or corresponding element.

  FIG. 1 is a diagram schematically showing an overall configuration of a traffic information providing system according to an embodiment of the present invention. In this traffic information providing system, a center device collects travel locus data (hereinafter referred to as “probe data”) including at least vehicle position information and time information at each position from a vehicle equipped with a specific in-vehicle device, The center device statistically processes the probe data collected from each vehicle, thereby providing each vehicle with various traffic information services such as guidance on traffic congestion on the road and guidance on the optimum route.

  Referring to FIG. 1, the traffic information providing system includes a vehicle 1, a base station 4, and a center device 5 (traffic information calculation device). Wireless communication is possible between the vehicle 1 and the base station 4. Further, the base station 4 and the center device 5 can perform wired mutual communication via the communication cable 6. However, the communication between the base station 4 and the center device 5 may be wireless.

  A vehicle-mounted device 2 is mounted on the vehicle 1. The in-vehicle device 2 includes a vehicle speed sensor, a direction sensor, a GPS receiver, a memory, a timer, and the like. The in-vehicle device 2 collects the probe data of the vehicle 1 at regular time intervals (for example, every few seconds) or at regular intervals (for example, every several tens of meters) and stores them in the memory. In addition, a mobile phone 3 can be connected to the in-vehicle device 2, and probe data stored in the memory can be transmitted to the outside via the mobile phone 3 in units of data files of a predetermined capacity. is there. The probe data transmitted from the vehicle 1 is sent to the center device 5 via the base station 4.

  The timing for transmitting the probe data is arbitrary. For example, when the passenger of the vehicle 1 desires to receive a traffic jam guidance service, the passenger transmits a request signal for the guidance service from the in-vehicle device 2 to the center device 5 via the mobile phone 3. To do. At that time, the probe data stored in the memory at that time is transmitted to the center device 5 together with the request signal.

  FIG. 2 is a diagram schematically showing the configuration of the center device 5. The center device 5 includes a transmission / reception unit 10, a processing device 11, a storage medium 12, a memory 13, and databases 14 and 15.

  The transmission / reception unit 10 controls transmission / reception of data between the base station 4 and the processing device 11. The processing device 11 is configured by a computer. The storage medium 12 is an arbitrary medium such as a hard disk or a DVD, and stores a program 16 for operating the processing device 11. The memory 13 is a semiconductor memory such as a ROM or a RAM. The database 14 stores probe data received from the vehicle 1. The database 15 stores map data. The map data includes a link map in which links are drawn in various ways.

  FIG. 3 is a diagram schematically illustrating a functional configuration of the processing apparatus 11. When the processing device 11 operates based on the program 16, the processing device 11 realizes functions as the acquisition unit 20, the association unit 21, and the calculation unit 22. In other words, the program 16 is a program for causing the processing device 11 to function as the acquisition unit 20, the association unit 21, and the calculation unit 22.

  FIG. 4 is a diagram illustrating an example of a link map. In this example, a link L1 that connects the node N1 and the node N2, a link L2 that connects the node N2 and the node N3, and a link L3 that connects the node N3 and the node N4 are depicted. The black triangle is the probe data included in the data file F1, and the black square is the probe data included in the data file F2 received next to the data file F1.

  FIG. 5 is a flowchart showing the flow of processing executed by the processing device 11 based on the program 16. Hereinafter, the traffic information calculation method according to the present embodiment will be described with reference to FIGS.

  First, in step P1, the processing device 11 (acquisition means 20) receives the data file F1 transmitted from the vehicle 1. The data file F1 is stored in the database 14. As shown in FIG. 4A, the data file F1 includes probe data corresponding to the entire link L1 and probe data corresponding to a part (upstream portion) of the link L2.

  Next, in step P2, the processing device 11 determines whether there is target probe data to be processed. At this time, since the data file F1 is stored in the database 14, the result of determination in step P2 is “YES”.

  Next, in step P3, the processing apparatus 11 determines whether or not there is remaining stored probe data. Since there is no remaining probe data (details will be described later) at this time, the result of determination in step P3 is “NO”.

  Next, in step P6, the processing device 11 (associating means 21) associates the probe data included in the data file F1 with any one of the links drawn on the link map. Here, a link in which probe data corresponding to the start point of the link and probe data corresponding to the end point are included in the data file F1 (that is, a link that can be estimated that the vehicle 1 is traveling. ") Is also associated with the probe data. As shown in FIG. 4A, the data file F1 includes probe data Da corresponding to the start point (node N1) of the link L1 and probe data Db corresponding to the end point (node N2). Yes. Accordingly, the traveling link L1 is associated with the probe data.

  On the other hand, the data file F1 includes probe data Db corresponding to the start point (node N2) of the link L2, but does not include probe data corresponding to the end point (node N3). Therefore, at this time, the link L2 is not associated with the probe data. In the present specification, probe data that is not associated with a travel link among a plurality of probe data included in a data file is referred to as “residual probe data”. Data G1 shown in FIG. 4B is the remaining probe data in the data file F1.

  Next, in step P7, the processing device 11 (calculating means 22) calculates the travel time of the vehicle 1 with respect to the travel link L1 associated with the probe data in step P6. Specifically, the processing device 11 determines the vehicle 1 related to the travel link L1 based on the time information included in the probe data Da closest to the node N1 and the time information included in the probe data Db closest to the node N2. Calculate travel time. Thereafter, as shown in FIG. 4B, the data file F <b> 1 corresponding to the completed process is deleted from the database 14.

  If the probe data acquisition interval is relatively rough and the acquisition position of the probe data Da is more than a predetermined distance from the position of the node N1, the passing time of the node N1 may be obtained as follows. . First, the probe data closest to the node N1 on the side opposite to the probe data Da (hereinafter referred to as “opposing probe data”) is specified. Here, it is assumed that the acquisition position of the probe data Da is upstream from the node N1, and the acquisition position of the opposing probe data is downstream from the node N1. Next, the time difference between the time information included in the probe data Da and the time information included in the opposing probe data is obtained. Further, the ratio of the distance between the acquisition position of the probe data Da and the position of the node N1 with respect to the distance between the acquisition position of the probe data Da and the acquisition position of the opposing probe data is obtained. Next, a value obtained by multiplying the time difference by the ratio is added to the time information included in the probe data Da. Thereby, the passage time of the node N1 of the vehicle 1 can be obtained by calculation. When the acquisition position of the probe data Da is on the downstream side of the node N1 and the acquisition position of the opposing probe data is on the upstream side of the node N1, the value obtained by multiplying the time difference by the above ratio is set as the counter probe. By adding to the time information included in the data, the passing time of the node N1 of the vehicle 1 can be obtained. Even when the acquisition position of the probe data Db is more than a predetermined distance from the position of the node N2, the passing time of the node N2 of the vehicle 1 can be obtained by calculation using the same method as described above.

  Next, in step P8, the processing device 11 determines whether or not there is residual probe data. Since data G1 exists as remaining probe data at this time, the result of determination in step P8 is “YES”.

  Next, in step P9, the processing apparatus 11 stores the remaining probe data (data G1) in the database 14.

  Next, in step P1, the processing device 11 (acquisition means 20) receives the data file F2 transmitted from the vehicle 1. The data file F2 is stored in the database 14. As shown in FIG. 4C, the data file F2 includes probe data corresponding to a part (downstream part) of the link L2 and probe data corresponding to the entire link L3.

  Next, in step P2, the processing device 11 determines whether there is target probe data to be processed. At this time, since the data file F2 is stored in the database 14, the result of determination in step P2 is “YES”.

  Next, in step P3, the processing apparatus 11 determines whether or not there is remaining stored probe data. Since the remaining probe data (data G1) exists at this time, the determination result in step P3 is “YES”.

  Next, in step P4, the processing device 11 determines whether or not a predetermined coupling condition is satisfied. For example, the time information included in the last probe data of the remaining stored probe data related to the vehicle 1 and the time included in the first probe data of the newly acquired data file F2 related to the same vehicle 1 The information is compared, and if the time interval between the two exceeds a predetermined value (for example, several tens of seconds), it is determined that the joining condition is not satisfied. Alternatively, the position information included in the last probe data of the remaining stored probe data regarding the vehicle 1 and the position included in the first probe data of the newly acquired data file F2 regarding the same vehicle 1 When the distance between the two exceeds a predetermined value (for example, several hundreds of meters), it is determined that the coupling condition is not satisfied.

  In the case of this example, the data file F2 is continuous with the data file F1, and the time interval and the distance interval are equal to or smaller than the predetermined value, so the determination result in step P4 is “YES”.

  Next, in step P5, the processing apparatus 11 combines the remaining probe data (data G1) stored before the probe data included in the data file F2.

  Next, in step P6, the processing device 11 (associating means 21) associates the combined probe data with one of the links drawn on the link map. Here, the remaining probe data (data G1) and a part of the probe data of the data file F2 are associated with the travel link L2. Also, the travel link L3 and the probe data are associated with each other.

  Next, in step P7, the processing device 11 (calculation means 22) calculates the travel time of the vehicle 1 with respect to the travel links L2 and L3 associated with the probe data in step P6. Specifically, the processing device 11 travels the vehicle 1 with respect to the travel link L2 based on the time information included in the first probe data of the data G1 and the time information included in the probe data Dc closest to the node N3. Calculate time. Further, the processing device 11 travels the vehicle 1 with respect to the travel link L3 based on the time information included in the probe data Dc closest to the node N3 and the time information included in the probe data Dd closest to the node N4. Calculate time. Thereafter, as shown in FIG. 4D, the data G1 and the data file F2 that have been processed are deleted from the database 14.

  Thereafter, the same processing as in step P8 and subsequent steps is performed. If the determination result in step P3 is “NO”, the processes in steps P4 and P5 are omitted. Further, when the result of the determination in step P4 is “NO”, the process in step P5 is omitted. If the determination result in step P8 is “NO”, the process in step P9 is omitted. If the result of determination in step P <b> 2 is “NO”, the process ends.

  According to the present embodiment, the calculation means 22 has a plurality of data files even when the probe data when the vehicle 1 is traveling on the travel link L2 is divided into the plurality of data files F1 and F2. Based on F1 and F2, the travel time of the vehicle 1 related to the travel link L2 is calculated. Therefore, the travel time of the vehicle 1 can be calculated for the travel link L2 that straddles the plurality of data files F1 and F2.

  Further, according to the present embodiment, if there is residual probe data (data G1) that is not associated with the travel link L1 among the plurality of probe data included in the data file F1, the association is performed. The means 21 associates the data G1 and a part of the probe data included in the data file F2 with the travel link L2. And the calculation means 22 calculates the travel time of the vehicle 1 regarding the travel link L2 based on these data matched with the travel link L2. As described above, even when the travel link L2 extends over the plurality of data files F1 and F2, the remaining probe data is stored, and the remaining probe data and the probe data included in the data file F2 are stored. By combining and associating with the travel link L2, the travel time of the vehicle 1 with respect to the travel link L2 can be calculated.

<First Modification>
FIG. 6 is a diagram illustrating an example of a link map. In this example, links L1a to L3a connected to each other and links L1b to L3b running in parallel with the links L1a to L3a are depicted. Link L1a and link L1b exist as candidates for the travel link L1 associated with the data file F1.

  The associating means 21 is close to the vehicle 1 among the links L1a and L1b based on the position coordinates of the links L1a and L1b at each point and the position coordinates of a plurality of probe data included in the data file F1. A link (link having the shortest distance) is selected and the data file F1 is associated. Then, information regarding the selected link is stored in the memory 13. However, the links L1a and L1b may be selected by other arbitrary methods.

  In this example, since the data file F1 is closer to the link L1a than the link L1b, the link L1a is selected as the traveling link, and the data file F1 is associated with the traveling link L1a. Information relating to the selection of the travel link L1a is stored in the memory 13. Note that, similarly to the above, the data G1 not associated with the travel link L1a is stored in the database 14.

  The calculation means 22 calculates the travel time of the vehicle 1 regarding the travel link L1a. The calculated travel time is output as definitive information that can be used to provide a service to the user.

  Next, regarding the data file F2, there exist a link L2a and a link L2b as candidates for the travel link L2 that associates the data G1 and the data file F2.

  The association means 21 refers to the memory 13 to select the link connected to the link L1a or L1b selected immediately before from the links L2a and L2b, and associates the data G1 and the data file F2.

  In this example, since the link selected immediately before is the travel link L1a, the link L2a connected to the travel link L1a is selected as the travel link, and the data G1 and the data file F2 are associated with the travel link L2a. Further, information relating to the selection of the travel link L2a is stored in the memory 13.

  The calculating means 22 calculates the travel time of the vehicle 1 regarding the travel link L2a. The calculated travel time is output as definitive information that can be used to provide a service to the user.

  According to the first modification, when there are a plurality of links L1a and L1b as candidates for the travel link L1, the association unit 21 selects one of the plurality of candidates and selects the data file F1. The association / calculation means 22 deterministically calculates the travel time of the vehicle 1 with respect to the selected travel link. Therefore, in comparison with the case where the travel link L1 is retroactively processed after waiting for a candidate to be determined later, real-time processing is possible and the processing load can be reduced.

  When a plurality of links L2a and L2b exist as travel link L2 candidates, the association unit 21 selects a link L2a connected to the upstream travel link L1a among the plurality of candidates as the travel link L2. Therefore, when there are a plurality of candidates for each of the travel links L1 and L2, a situation occurs in which the selected travel link L1 (for example, link L1a) and the selected travel link L2 (for example, link L2b) are not connected to each other. It can be avoided.

<Second Modification>
FIG. 7 is a diagram illustrating an example of a link map. Similarly to FIG. 6, links L1a to L3a connected to each other and links L1b to L3b running parallel to the links L1a to L3a are depicted.

  Link L1a and link L1b exist as candidates for the travel link L1 associated with the data file F1. Also in the second modification, the travel link L1a is selected by the same method as in the first modification. However, in the second modification, it is not necessary to store in the memory 13 information regarding the fact that the travel link L1a has been selected. Moreover, the calculation means 22 calculates the travel time of the vehicle 1 regarding the travel link L1a. The calculated travel time is output as definitive information that can be used to provide a service to the user.

  Next, regarding the data file F2, there exist a link L2a and a link L2b as candidates for the travel link L2 that associates the data G1 and the data file F2. In the second modification, the association unit 21 uses the links L2a, L2b based on the position coordinates of the links L2a and L2b and the position coordinates of the plurality of probe data included in the data G1 and the data file F2. A link having the shortest distance from the vehicle 1 in L2b (a link having the shortest distance) is selected as a travel link, and the data G and the data file F2 are associated with each other. However, the links L2a and L2b may be selected by other arbitrary methods.

  In this example, since the link L2b gives the shortest distance to the data file F2, the link L2b is selected as the travel link, and the data G1 and the data file F2 are associated with the travel link L2b.

  The calculation means 22 calculates the travel time of the vehicle 1 related to the travel link L2b. The calculated travel time is output as definitive information that can be used to provide a service to the user.

  According to the second modified example, when there are a plurality of links L2a and L2b as candidates for the travel link L2, the association unit 21 uses a plurality of links based on the distance between the vehicle 1 and the links L2a and L2b. One of the candidates is selected as the travel link L2. Therefore, in the case where there are a plurality of candidates for each of the travel links L1 and L2, it is possible to avoid occurrence of a situation in which if the selection of the upstream travel link L1 is wrong, the selection of the downstream travel link L2 is mistaken accordingly. be able to. That is, in the example shown in FIG. 7, the vehicle 1 is actually traveling on the link L1b → L2b → L3b, but the link L1a, not the link L1b, is erroneously selected in selecting the traveling link L1. Assuming that In this case, according to the first modification, the links L2a and L3a connected to the link L1a are erroneously selected as the traveling links L2 and L3. That is, the selection of all the links L2 and L3 downstream of the upstream link L1 is erroneously linked. On the other hand, in the second modification, the link L2 is independently selected from the links L2a and L2b, and the link L3 is independently selected from the links L3a and L3b. Therefore, even if the selection related to the upstream link L1 is wrong, a situation in which the selection of all the downstream links L2 and L3 is erroneously linked to the error is avoided.

<Third Modification>
Unlike the first and second modified examples, when there are a plurality of candidates for the travel link L1 associated with the data file F1, the data file F1 is not associated with the link L1a or the link L1b, and the travel link L1 is not associated. Can be operated so that the travel time of the vehicle 1 is not calculated. That is, as in the example illustrated in FIG. 4, when there is only one candidate for the travel link L1 that associates the data file F1, the association unit 21 associates the data file F1 and the travel link L1.

  According to the third modified example, when there are a plurality of links L1a and L1b as candidates for the travel link L1, the wrong travel time is accumulated when the travel link L1 is incorrectly selected. Therefore, it is possible to avoid occurrence of a situation in which erroneous information is provided to the user.

<Fourth Modification>
FIG. 8 is a diagram illustrating an example of a link map. In this example, links L1a, L2a, L4 connected to each other and links L1b, L2b, L5 connected to each other are drawn. The links L1a and L2a and the links L1b and L2b are running in parallel.

  Link L1a and link L1b exist as candidates for the travel link L1 associated with the data file F1. The associating means 21 is close to the vehicle 1 among the links L1a and L1b based on the position coordinates of the links L1a and L1b at each point and the position coordinates of a plurality of probe data included in the data file F1. The link (the link having the shortest distance) is selected as the travel link, and the data file F1 is temporarily associated with the link. However, the links L1a and L1b may be selected by other arbitrary methods.

  In this example, since the data file F1 is closer to the link L1b than the link L1a, the link L1b is selected as the travel link, and the data file F1 is provisionally associated with the travel link L1b. Similarly to the above, the data G1 that is not associated with the travel link L1b is stored in the database 14. Further, in the fourth modification, the probe data (data G2) provisionally associated with the travel link L1b is also stored in the database 14.

  The calculation means 22 tentatively calculates the travel time of the vehicle 1 related to the travel link L1b based on the data G2 provisionally associated with the travel link L1b. Since the travel time calculated temporarily is not definitive information, it is not output at this time.

  Regarding the data file F2, there are a link L2a and a link L2b as candidates for the travel link L2 that associates the data G1 and the data file F2.

  On the other hand, the link L4 and the link L5 extend in directions away from each other. Accordingly, by receiving the data file F2 and referring to the position information of the probe data included therein, the data file F2 can be definitely associated with one of the links L4 and L5. Then, the links L1a and L2a or the links L1b and L2b connected to the upstream of the associated travel link L4 or the travel link L5 can be identified retrospectively as deterministic travel links.

  In this example, since the data file F2 is associated with the travel link L5, the links L1b and L2b connected to the upstream of the travel link L5 are retrospectively specified as the definite travel links.

  Therefore, the calculation means 22 outputs the travel time that has been provisionally calculated for the travel link L1b as definitive information. If the travel time relating to the travel link L1a is tentatively calculated by mistake, the information is discarded and the data G2 stored in the database 14 is correctly associated with the travel link L1b. The travel time of the vehicle 1 related to the travel link L1b is deterministically calculated. Alternatively, the travel time for the travel link L1 may be calculated after the travel link L1 is determined later, instead of calculating the travel time temporarily.

  Further, the association means 21 positively associates the data G1 and a part of the data file F2 with the travel link L2b, and the calculation means 22 calculates the travel time of the vehicle 1 related to the travel link L2b. Further, the data file F2 and the travel link L5 are associated with each other, and the calculation unit 22 definitely calculates the travel time of the vehicle 1 related to the travel link L5.

  FIG. 9 is a flowchart showing a flow of processing executed by the processing device 11 in the fourth modification. In Step P10, it is determined whether or not the travel link whose travel time has been calculated in the immediately preceding Step P7 is a provisional travel link. In the above example, since the travel link L1b is a provisional travel link when the travel time related to the travel link L1b is provisionally calculated, the determination result in step SP10 is “YES”.

  Next, in step P11, probe data (data G2) corresponding to the provisional travel link L1b is stored in the database 14. Thereafter, the process proceeds to step P8. If the result of determination in step P10 is “NO”, the process in step P11 is omitted. Since the processing contents of each step other than steps P10 and P11 are the same as those in FIG.

  FIG. 10 is a diagram showing a link map similar to FIG. As shown in FIG. 10, when the data file F2 is not received and the candidates for the travel links L1 and L2 cannot be determined retrospectively, the travel time temporarily calculated for the travel link L1b is determined deterministically. The information is output from the calculation means 22 as information.

  According to the fourth modification, when there are a plurality of links L1a and L1b as candidates for the travel link L1, if one of the plurality of candidates is confirmed later, the association unit 21 stores the link. The calculated probe data (data G2) is associated with the confirmed travel link L1b, and the calculation means 22 calculates the travel time of the vehicle 1 related to the confirmed travel link L1b. As described above, the travel link L1 is processed retrospectively after the candidate is confirmed, thereby avoiding the occurrence of a situation in which an incorrect travel time is accumulated when the travel link L1 is erroneously selected. it can.

  Further, according to the fourth modification, the travel time of the vehicle 1 related to the travel link L1 is provisionally calculated, and if the travel link L1 is not fixed later, it is provisionally calculated. Travel time is fixed. Therefore, even if the travel link L1 is not confirmed later, the travel time of the vehicle 1 related to the travel link L1 can be obtained by forcibly confirming the provisional travel time.

<Fifth Modification>
FIG. 11 is a diagram illustrating an example of a link map. Instead of storing the remaining probe data (data G1), a partial travel time (hereinafter referred to as “partial travel time”) T1 calculated based on the data G1 may be stored in the database 14. The association unit 21 associates the data G1 with the travel link L2, and the calculation unit 22 includes time information included in the probe data Db closest to the node N2 and time information included in the final probe data Dc of the data G1. Based on the above, a partial travel time T1 corresponding to the data G1 is calculated.

  After receiving the data file F2, the associating unit 21 associates the data file F2 with the travel link L2, and the calculating unit 22 calculates the time information included in the first probe data Dd of the data file F2 and the node N3. The partial travel time T2 is calculated based on the time information included in the adjacent probe data De.

  And the calculation means 22 calculates the travel time T3 of the vehicle 1 regarding the link L2 by adding the partial travel time T1 and the partial travel time T2.

<Sixth Modification>
In the above description, the example in which the probe data is transmitted from the vehicle 1 to the center device 5 and the travel time calculation process is executed in the center device 5 has been described. However, the present invention is not limited thereto, and the in-vehicle device 2 may perform travel time calculation processing based on the probe data by connecting the databases 14 and 15 and the memory 13 to the in-vehicle device 2 of the vehicle 1.

  The embodiment disclosed this time should be considered as illustrative in all points and not restrictive. The scope of the present invention is defined not by the above-mentioned meaning but by the scope of claims for patent, and is intended to include all modifications within the scope and meaning equivalent to the scope of claims for patent.

It is a figure showing roughly the whole traffic information offer system composition concerning an embodiment of the invention. It is a figure which shows the structure of a center apparatus roughly. It is a figure which shows the functional structure of a processing apparatus roughly. It is a figure which shows an example of a link map. It is a flowchart which shows the flow of the process which a processing apparatus performs based on a program. It is a figure which shows an example of a link map. It is a figure which shows an example of a link map. It is a figure which shows an example of a link map. It is a flowchart which shows the flow of the process which a processing apparatus performs in the 4th modification. It is a figure which shows an example of a link map. It is a figure which shows an example of a link map. It is a figure which shows an example of a link map.

Explanation of symbols

DESCRIPTION OF SYMBOLS 1 Vehicle 5 Center apparatus 11 Processing apparatus 12 Storage medium 16 Program 20 Acquisition means 21 Correlation means 22 Calculation means

Claims (12)

Acquisition means for acquiring travel locus data including position information of the moving body and time information at each position in units of data files including a predetermined amount of travel locus data;
A traffic information calculation apparatus comprising: a calculation unit that calculates a travel time of the mobile body with respect to a travel link that is a link that can be estimated that the mobile body is traveling based on the travel locus data acquired by the acquisition unit. Because
When the traveling locus data when the moving body is traveling on a traveling link is divided into a plurality of data files, the calculating means is configured to determine the moving body related to the traveling link based on the plurality of data files. A traffic information calculation device configured to calculate travel time. When the travel locus data when the mobile body is traveling on the same travel link is divided into a plurality of data files, the calculation means is configured to generate the mobile body related to the travel link based on the plurality of data files. The traffic information calculation device according to claim 1, wherein the travel time is calculated. In the case where the traveling locus data when the moving body is traveling the starting point of the traveling link and the traveling locus data when traveling the end point of the traveling link are divided into a plurality of data files. The traffic information calculation device according to claim 2, wherein the travel time of the mobile body related to the travel link is calculated based on the plurality of data files. Further comprising an association means for associating the travel locus data with the travel link;
The calculation means includes, in the plurality of data files, when there is residual travel locus data that has not been associated with a travel link, the remaining travel locus data and another data file. The traffic information calculation device according to any one of claims 1 to 3, wherein a travel time of the moving body related to another travel link is calculated based on the travel trajectory data. If there are multiple candidates for the travel link,
The association means selects one of the plurality of candidates as the travel link based on a predetermined condition, associates the travel locus data with the travel link,
The traffic information calculation device according to claim 4 , wherein the calculation unit calculates a travel time of the moving body related to the travel link based on travel locus data associated with the travel link. When there are a plurality of candidates for the another travel link, the associating means selects, as the another travel link, the one that is connected to the travel link from among the plurality of candidates, and the other travel link The traffic information calculation device according to claim 5 , wherein the remaining traveling locus data is associated with traveling locus data included in the another data file. When there are a plurality of candidates for the another travel link, the association unit selects one of the plurality of candidates as the another travel link based on a predetermined condition, and The traffic information calculation device according to claim 5 , wherein the remaining travel locus data is associated with the travel locus data included in the another data file. The traffic information calculation apparatus according to claim 4 , wherein the association unit associates travel locus data with the travel link when only one travel link candidate exists. When there are a plurality of candidates for the travel link, travel locus data that can be associated with the travel link is stored,
If one of the candidates is later selected as the travel link,
The association means associates the stored travel locus data with the selected travel link,
The traffic information calculation device according to claim 4 , wherein the calculation unit calculates a travel time of the moving body related to the travel link based on the travel locus data associated with the travel link by the association unit. . The association means associates the travel locus data that can be associated with the travel link with one of the plurality of candidates,
The calculation means calculates travel time of the moving body related to one of the plurality of candidates based on the travel locus data associated with one of the plurality of candidates by the association means. And
The if one of the plurality of candidates is not selected after the said travel link, the travel time calculated by said calculating means is outputted as a travel time of the movable body in the traveling link, claim 9 The traffic information calculation device described in 1. Computer
Acquisition means for acquiring travel locus data including position information of the moving body and time information at each position in units of data files including a predetermined amount of travel locus data;
A program for causing a travel link, which is a link that can be estimated to be traveled, based on travel trajectory data acquired by the acquisition unit to function as a calculation unit that calculates travel time of the mobile unit Because
When the traveling locus data when the moving body is traveling on a traveling link is divided into a plurality of data files, the calculating means is configured to determine the moving body related to the traveling link based on the plurality of data files. A program characterized by calculating travel time. (A) obtaining travel locus data including position information of the moving body and time information at each position in units of data files including a predetermined amount of travel locus data;
(B) calculating a travel time of the mobile body with respect to a travel link that is a link that can be estimated that the mobile body is traveling based on the travel locus data acquired in step (A). A traffic information calculation method,
In the step (B), when the travel locus data when the moving body travels on the travel link is divided into a plurality of data files, the travel related to the travel link is based on the plurality of data files. A traffic information calculation method, wherein travel time of a body is calculated.

Images