JP2012003343A - Travel time providing apparatus, travel time providing method, and travel time providing program - Google Patents

Abstract

PROBLEM TO BE SOLVED: To set a plurality of link travel times in one link for every approaching link or retreating link.SOLUTION: A travel time providing apparatus 1 includes a map information storage unit 21, a position information detection unit 12, a link matching process unit 31, a matching result storage unit 32, and a link travel time calculation unit 37. The link travel time calculation unit 37 calculates a link travel time of an object link L, or a calculation object of the link travel time, for every approaching link approaching to the object link L or retreating link retreating from the object link, based on the matching result.

Description

  The present invention relates to a technique for measuring travel time required for moving a travel link and a travel route of a route estimated that the mobile body has moved by associating position information of the mobile body with a link indicating a road or the like on a map. About.

  Conventionally, link matching is used as a technique for measuring the position of a moving body such as a vehicle using GPS or the like and associating the position of the moving body with a link on a map. For example, there is a technique described in Patent Document 1 as a technique for determining a travel link and calculating a link travel time of the confirmed travel link.

JP 2004-101504 A

  By the way, when there are a left turn lane, a straight lane, and a right turn lane in the link connected to the upstream of the intersection, it is often observed that only the right turn lane is congested when the intersection is congested. Further, at the junction, the vehicle speed may be different between the junction lane and the straight lane. Therefore, it is desired to set the link travel time for each travel lane (for each link that leaves or for each link that has traveled).

  However, in many conventional travel time providing devices, the average travel time of all lanes is set as the travel time of the link. One of the reasons is that it is not possible to identify each link separately for each exiting link or each proceeding link.

  Therefore, an object of the present invention is to set a plurality of link travel times for one link for each progressing link or for each leaving link.

  Another object of the present invention is to give identification information for each link that has entered the link or for each link that leaves the link to one link.

  Another object of the present invention is to calculate the route travel time of the route from the departure point to the destination with high accuracy.

  A link travel time providing device according to an embodiment of the present invention stores a map information storage unit that stores map information composed of nodes and links, and mobile body position information indicating the position of the mobile body at different times. Based on the position information storage unit, the map information and the mobile object position information, a link match processing unit for matching each position of the mobile object at the different time to one link, the mobile object position information and the matching A link travel time calculation unit that calculates a link travel time of a target link that is a target for calculating a link travel time based on the result of each of the entering links that enter the target link or an exit link that exits the target link And a link travel time calculation unit that calculates a link travel time of the target link.

  In a preferred embodiment, the link travel time calculation unit specifies a mobile body that has passed through the target link, and sets the time required for the specified mobile body to pass through the target link for each of the entry links or the exit. You may make it calculate the link travel time for every said approach link or every exit link after distinguishing for every link.

  In a preferred embodiment, the link travel time for each incoming link or each outgoing link is associated with the combined identification information obtained by combining the identification information of the target link with the identification information of the incoming link or the identification information of the outgoing link. A link travel time storage unit that additionally stores the information may be further provided.

  In a preferred embodiment, the identification information of the target link is specified by identification information of nodes at both ends of the target link, and the identification information of the entry link or the identification information of the exit link is the both ends of the target link. Is identified using identification information of a node connected to one of the nodes via the entry link or the exit link, and the combination identification information includes identification information of nodes at both ends of the target link and the node It may be specified by the identification information of three or more nodes using identification information of a node connected to one of the nodes at both ends of the target link via the entry link or the exit link.

  In a preferred embodiment, the route setting unit sets a route from the starting point to the destination based on the starting point and the destination specified by the operator, and is included in the route set by the route setting unit. A route travel time calculation unit that calculates a route travel time based on a link travel time of each link, and for a link having a link travel time for each of the entering links or for each leaving link, entering the set route The route travel time calculation unit using a link travel time corresponding to a link or an exit link may be further included.

It is a block diagram of the link travel time provision system which concerns on one Embodiment of this invention. An example of the data structure of a probe data storage part is shown. An example of the data structure of a matching result memory | storage part is shown. An example of the data structure of a daily link travel time memory | storage part is shown. An example of the relationship between the link and node in the intersection in 1st Embodiment, and link ID is shown. An example of the relationship between the link and node in the intersection in 1st Embodiment, and link ID is shown. An example of the data structure of a statistics link travel time memory | storage part is shown. It is a flowchart which shows the link travel time process in 1st Embodiment. It is a flowchart which shows the calculation process of route travel time when the inquiry of route travel time in 1st Embodiment is received. An example of the relationship between the link and node in an intersection in a 2nd embodiment, and link ID is shown. It is a flowchart which shows the process which calculates the link travel time of the link L connected to the upstream of the intersection which has multiple nodes in 2nd Embodiment.

  Hereinafter, a travel time providing apparatus, a travel time providing method, and a travel time providing program of the present invention will be described using two embodiments.

  First, the first embodiment will be described. In the present embodiment, as described later, it is assumed that there is one node in the intersection.

  The travel time providing apparatus 1 according to the present embodiment is mainly configured by a computer including a central processing unit, a storage device, an input / output device, and a communication device. Each component or function of the travel time providing apparatus 1 described below with reference to FIG. 1 executes the travel time providing program of the present embodiment installed in the travel time providing apparatus 1 of the present embodiment as a computer program. Is realized. These travel time providing programs according to the present embodiment are computer programs for specifically realizing the travel time providing method according to the present embodiment when a computer is used, for example, a travel device such as a storage device of the travel time providing apparatus 1. The time providing device 1 is stored in a readable recording medium.

  As shown in FIG. 1, the travel time providing device 1 of the present embodiment includes a map information storage unit 21, a position information detection unit 12, a link match processing unit 31, a matching result storage unit 32, and a link travel time calculation unit 37. . Further, the travel time providing device 1 of the present embodiment includes a daily link travel time storage unit 41, a statistical processing unit 45, a statistical link travel time storage unit 43, a link travel time output unit 39, as optional components or functions. A route setting unit 51, a route travel time calculation unit 52, and a route travel time output unit 53 are further provided.

  The map information storage unit 21 stores map information of the road network. This map information includes information on a large number of nodes N and links L constituting the road, and is defined in units of links. That is, in the map information, the identification information of each node N or each link L and the position information of the link L indicated by the latitude and longitude are stored. When identifying each link L, it is possible to identify all the links L included in the map information as long as at least one of each node N or each link L has identification information.

  The position information detection unit 12 is a component that detects the position information of the moving body, and includes a probe information reception unit 11 and a probe information storage unit 13 as shown in FIG.

  The probe information receiving unit 11 acquires probe information from a probe information providing system (not shown). The probe information includes, for example, position information (latitude and longitude) detected by a position information detection device mounted on a moving body such as a vehicle and the time at that time. The position information detection device is an information processing device having a function of detecting a position using, for example, a GPS (Global Positioning System) function. For example, a vehicle-mounted or portable car navigation on-vehicle device or a device with a GPS function is provided. A mobile phone may be used.

  The probe information storage unit 13 stores the probe information acquired by the probe information reception unit 11. FIG. 2 shows an example of the information structure of the probe information storage unit 13. As shown in FIG. 2, the probe information storage unit 13 includes a vehicle ID 133, a date and time 135, and a vehicle position 137 as data items. The vehicle ID 133 is identification information of each vehicle. The date and time 135 indicates the date and time 135 at which the vehicle exists at the vehicle position 137. The vehicle position 137 is vehicle position information indicated by the latitude and longitude at the date and time 135.

  That is, the probe information storage unit 13 accumulates probe information collected every moment. In the present embodiment, a vehicle position 137 at a certain time of a vehicle with one information record is shown. Therefore, probe information collected at different times for a certain vehicle is stored in the probe information storage unit 13 as one information record.

  The link match processing unit 31 performs link match processing for associating probe information (position information of the moving body) with one link L. For example, the link match processing unit 31 compares the moving object position information (vehicle position 137) included in the position information (probe information) of the moving object with the map information of the link L included in the map information, and performs each movement. One link L for the body position information (vehicle position 137) is extracted. For example, the link match processing unit 31 performs link match processing for each record of probe information stored in the probe information storage unit 13.

  The matching result storage unit 32 stores the matching result by the link match processing unit 31. FIG. 3 shows an example of the information structure of the matching result storage unit 32. As shown in FIG. 3, the probe information storage unit 13 includes a vehicle ID 133, a date and time 135, and a link ID 139 as data items. The link ID 139 is identification information indicating a link L (hereinafter referred to as a target link) L that associates the vehicle position 137 of the date and time indicated by the date and time 135 of the vehicle indicated by the vehicle ID 133 by a link match. The link ID 139 is identification information of the target link L alone, which is different from the link ID 415 described later, and does not consider the incoming link or the outgoing link.

  The link travel time calculation unit 37 calculates the link travel time of the target link L that is the target of link travel time calculation, based on the moving body position information indicated by the probe data and the matching result by the link match processing unit 31. For example, the link travel time calculation unit 37 refers to the date and time 135 of the probe information, and calculates the link travel time required for each vehicle to travel each link L. The link travel time calculated by the link travel time calculation unit 37 is a substantially real-time travel time shortly after the probe information is acquired.

  The daily link travel time storage unit 41 stores the link travel time data calculated by the link travel time calculation unit 37.

  As shown in FIG. 4, the daily link travel time storage unit 41 includes a date 411, a time zone 413, a link ID 415, and a travel time 417 as data items. The daily link travel time storage unit 41 stores almost real-time travel time shortly after the probe data is acquired. Here, the identification information of the target link L is combined with the identification information of the incoming link L or the identification information of the outgoing link L, or both the identification information of the incoming link L and the identification information of the outgoing link L. Binding identification information is stored. The approach link L and the exit link L will be described below.

  A description example of the link ID 415 will be described with reference to FIGS. 5 and 6. The link ID 415 in FIG. 5 indicates identification information (binding identification information) obtained by combining the identification information of the leaving link L that is a link that has traveled immediately after the vehicle has left the target link L. The exit link L is directly connected to the node that is the end point of the target link L. Thus, by setting different identification information for each outgoing link for the target link L, one target link can be substantially divided into a plurality of links. Similarly, the link ID 415 in FIG. 6 indicates identification information (combined identification information) obtained by combining identification information of the approach link L that is a link traveled immediately before the vehicle enters the target link L. The incoming link L is directly connected to the node that is the starting point of the target link L. Thus, by setting different identification information for each incoming link for one target link L, the target link can be substantially divided into a plurality of links.

  As shown in FIG. 5A, when the target link L is the link L1, and the exit link L is the link L2 (A exit course), the link L3 (B exit course) or the link L4 (C exit course), the A exit course, Different link IDs 415 are set for the B exit course and the C exit course. For example, the link ID 415 of the link L1 when the A exit course is selected is “L1-oL2” (link method) or “1-4-o2” (node method) as shown in FIG. 5B. Here, the link method in the link ID 415 in the table of FIG. 5B indicates the notation of the link ID 415 when identification information is attached to the link L. On the other hand, the node method indicates the notation of the link ID 415 when identification information is attached to the node N. That is, the link L1 is represented by “L1” in the link method, and “1-4” (meaning a link from the node 1 to the node 4) in the node method. Further, “o” attached to “oL2” and “o2” is identification information indicating the exit (out) link L, and “L2” (link method) indicates that the exit link is the link L2. “2” (node method) indicates that the identification information of the end node N of the outgoing link is “2”. Similarly, the link ID 415 of the link L1 when the B exit course or the C exit course is selected is as shown in the table of FIG. 5B.

  On the other hand, as shown in FIG. 6A, when the target link L is the link L4 and the approach link L is the link L1 (D approach course), the link L2 (E approach course) or the link L3 (F approach course), the D approach Different link IDs 415 are set for the course, the E approach course, and the F approach course. For example, the link ID 415 of the link L4 when the D approach course is selected is “iL1-L4” (link method) or “i1-4-5” (node method) as shown in the table of FIG. 6B. Here, the notation method of the link method and the node method is the same as in the case of FIG. Also, “i” attached to “iL1” and “i1” is identification information indicating the ingress (in) link L, and “L1” (link method) indicates that the ingress link is the link L1, “1” (node method) indicates that the identification information of the starting node N of the incoming link is “1”. Similarly, the link ID 415 of L4 when the E approach course or the F approach course is selected is as shown in the table of FIG. 6B.

  In addition, as a notation method of the identification information of the target link L, the identification information for each leaving link and the identification information for each entering link may be combined. That is, as shown in FIG. 6, the link ID 415 of the link L4 when the target link L is the link L4, the entry link L is the link L3 (F entry course), and the exit link L is the link L6 (G exit course). Becomes “iL3-L4-oL6” (link system) or “i3-4-5-o6” (node system). In this specification, the case where identification information for each exit link or identification information for each entry link is mainly used will be described. However, even if it is not particularly described, identification information for each exit link and each entry link is displayed. It can also be applied.

  Whether the link ID 415 is expressed in the link method or the node method is arbitrary. In this embodiment, according to the node method, the link ID 415 in the table of FIG. 5 or 6 is specified by the identification information of the two nodes N at both ends of the target link L. Furthermore, the identification information of the incoming link L or the identification information of the outgoing link L is adjacent to one of the nodes N at both ends of the target link L (connected via the incoming link or the outgoing link). It may be specified by the identification information of N. The link ID 415 (binding identification information) is the identification information of the node N that identifies one ingress link associated with one of the two nodes N representing the target link L and the two nodes N. Or you may make it identify with the identification information of 3 or more nodes N using the identification information of at least one of the identification information of the node N which specifies a leaving link.

  Returning to the description of the link travel time calculation unit 37, the link travel time calculation unit 37 calculates the link travel time of the target link for each incoming link that enters the target link or for each outgoing link that leaves the target link. For example, the link travel time calculation unit 37 identifies the mobile body that has passed the target link, and after identifying the time required for the identified mobile body to pass the target link for each incoming link or each outgoing link, The link travel time for each incoming link or each outgoing link is calculated. That is, the link travel time calculation unit 37 is matched with the target link L that is the target of link travel time calculation based on the matching result shown in the link ID 415 in FIG. 3, FIG. 5 or FIG. The ID 133 is specified, and the time required for the vehicle with the vehicle ID 133 to pass through the target link L is totaled for each entry link entering the target link L or for each exit link leaving the target link L. For example, for a certain vehicle, the link travel time of link L1 when passing the A exit course shown in FIG. 5 is 2 minutes, the link travel time of link L1 when passing the B exit course is 1 minute, and the C exit course The link travel time of the link L1 when passing is calculated as 5 minutes. Thus, one target link L has a plurality of link travel times for each incoming link or outgoing link.

  In addition, you may make it provide the coupling | bonding identification information for every exit link or every entrance link in the step in which the link match process part 31 performs a link match. That is, after the link match processing unit 31 matches one vehicle position 137 to one link, and after the exit link or the entry link for the matched link of the vehicle with the vehicle ID 133 is determined, each exit link or entry You may make it fix link ID for every link.

  The statistical processing unit 45 statistically processes the daily link travel time data stored in the daily link travel time storage unit 41 to generate statistical link travel time data. The statistical link travel time data is stored in the statistical link travel time storage unit 43. For example, the statistical processing unit 45 reads the link travel time data, calculates the average travel time for each day of the week, for each time zone, and for each link ID 415 as shown in FIG. Store.

  The statistical link travel time storage unit 43 stores statistical link travel time data obtained by statistically processing the link travel time stored in the daily link travel time storage unit 41. Then, the average travel time for each link calculated by the statistical processing unit 45 based on the statistical link travel time data stored in the statistical link travel time storage unit 43 in a predetermined total unit (for example, day of the week, fifty days). The statistical link travel time storage unit 43 stores the average travel time for each link.

  As shown in FIG. 7, the statistical link travel time storage unit 43 includes a day of the week 431, a time zone 413, a link ID 415, and an average travel time 437 as data items.

  The link travel time output unit 39 refers to the daily link travel time storage unit 41 or the statistical link travel time storage unit 43, and links the link travel for each link ID 415 to an external device such as a car navigation system installed in the vehicle. Output time. For example, if data exists in the daily link travel time storage unit 41, it may be output. When there is no data in the daily link travel time storage unit 41, the link travel time corresponding to the current day of the week and time zone may be output with reference to the statistical link travel time storage unit 43. For example, the link travel time output unit 39 may periodically output the link travel time, or may output the link travel time in response to a request from an external device.

  The route setting unit 51 refers to the map information storage unit 21 and sets a route from the departure point to the destination based on the departure point and the destination designated by the operator. The route setting unit 51 may be disposed in the travel time providing apparatus 1 together with the position information detecting unit 12 and the like as in the present embodiment, or may be disposed in an external device such as a car navigation system mounted on the vehicle. May be.

  For example, the route setting unit 51 sets a plurality of routes from a designated departure point to a destination when receiving a route search request from an in-car device of a car navigation system or a mobile phone with a GPS function. One route may be output as a response to the route search request based on the route travel time of the set route calculated by the route travel time calculation unit 52. When the route setting unit 51 receives an inquiry about the travel time from the departure place to the destination from the in-vehicle device of the car navigation system, the mobile phone with GPS function, or another information processing device, the route setting unit 51 starts from the designated departure place. Set up multiple routes to your destination.

  The route travel time calculation unit 52 is a travel time required for traveling along a route based on the set route and the link travel times of the plurality of target links L output from the link travel time output unit 39. Calculate route travel time. Similarly to the route setting unit 51, the route travel time calculation unit 52 may be arranged in an external device (for example, a device on the user side such as an in-vehicle device).

  When the route setting unit 51 sets a plurality of routes, the route travel time calculation unit 52 adds the link travel times of the links included in each route, and the route travel time for each route from the departure point to the destination Is calculated. At that time, for the target link for which the link travel time is set for each exit link, each entry link, or each exit link and the entry link, each exit link, each entry link or each exit link and the entry link for the target link in the route Use the corresponding link travel time. When a link travel time for each outgoing link and a link travel time for each incoming link are set for one link, the link travel time for each outgoing link may be preferentially applied. This is because the link travel time is considered to be more affected by the exit link.

  The route travel time output unit 53 outputs the route travel time described above when, for example, an inquiry about the travel time from the departure place to the destination is received. The route travel time output unit 53 may output the shortest route travel time from the departure place to the destination, or may output the route travel time for each of a plurality of routes. Similar to the route setting unit 51 and the route travel time calculation unit 52, the route travel time output unit 53 may be disposed in an external device (for example, a user-side device such as an in-vehicle device).

  Next, the link travel time calculation processing of this embodiment will be described using the flowchart shown in FIG.

  First, the probe information receiving unit 11 receives probe information and stores it in the probe information storage unit 13 (S11).

  Next, the link match processing unit 31 specifies a link at a position corresponding to each vehicle position 137 in the probe information stored in the probe information storage unit 13 and performs a link match (S12).

  And the link travel time calculation part 37 discriminate | determined the travel time of the object link L memorize | stored in the matching result memory | storage part 32 for every exit link which leaves the target link L for every approach link which enters the target link L. Calculated above and stored in the daily link travel time storage unit 41 (S13).

  According to the present embodiment, a plurality of link travel times are set for each entry link, for each exit link, or for each entry link and exit link, for the link travel time of one target link L that is a target for link travel time calculation. be able to. That is, according to the present embodiment, the link travel time of a link upstream of a certain intersection can be calculated for each traveling direction (for example, left turn, straight advance, right turn, etc.) ahead of the intersection. Or according to this embodiment, the link travel time of the link downstream of a certain intersection can be calculated according to the direction (for example, left turn, straight advance, right turn, etc.) which entered the intersection.

  Therefore, even when the congestion state of the vehicle in the target link L differs according to the approach link L or the exit link L, the link travel time of the target link L corresponding to the vehicle can be calculated.

  Next, a route travel time calculation process when an inquiry about route travel time is accepted will be described using the flowchart shown in FIG.

  First, when the route setting unit 51 receives an inquiry about the route travel time, the route setting unit 51 refers to the map information storage unit 21 and generates a plurality of routes from the designated departure point to the destination (S21).

  The route travel time calculation unit 52 calculates the route travel time of each route generated by the route setting unit 51 (S22). At this time, with regard to links for which the link travel time for each exit link or entry link is set, the route travel time is calculated using the link travel time corresponding to the exit link or entry link included in each route. calculate.

  The route travel time output unit 53 outputs a plurality of route travel times calculated by the route travel time calculation unit 52 (S23).

  In the present embodiment, when calculating the route travel time, the link travel time for each exit link or entry link is used. Therefore, when the link travel time of the target link L is different for each exit link or entry link, it is suitable for each. The route travel time can be calculated using the link travel time. For example, when the link travel time of the target link differs between when going straight at an intersection downstream of the target link and when turning right, the route travel time of the target link differs between the route going straight through the intersection and the route turning right Time is applied and route travel time can be calculated more accurately.

  According to the embodiment described above, a plurality of link travel times can be set for one link for each exiting link or each proceeding link. Furthermore, according to the embodiment, identification information for each link exiting from the link or for each link entering the link can be given to one link. Alternatively, according to the embodiment, the route travel time of the route from the departure point to the destination can be calculated with high accuracy.

  Next, a second embodiment will be described. In this embodiment, as will be described later, it is assumed that there are a plurality of nodes in an intersection. As an example of the case where there are a plurality of nodes N in an intersection, there is an intersection between relatively large roads (for example, three lanes or more on one side) in which opposite lanes are separated by a median strip or the like.

  The travel time providing apparatus 1 according to the present embodiment is mainly configured by a computer including a central processing unit, a storage device, an input / output device, and a communication device. Each component or function of the travel time providing apparatus 1 described below with reference to FIG. 1 executes the travel time providing program of the present embodiment installed in the travel time providing apparatus 1 of the present embodiment as a computer program. Is realized or exhibited. These travel time providing programs according to the present embodiment are computer programs for specifically realizing the travel time providing method according to the present embodiment when a computer is used, for example, a travel device such as a storage device of the travel time providing apparatus 1. The time providing device 1 is stored in a readable recording medium.

  As shown in FIG. 1, the travel time providing device 1 of the present embodiment includes a map information storage unit 21, a position information detection unit 12, a link match processing unit 31, a matching result storage unit 32, and a link travel time calculation unit 37. . Further, the travel time providing device 1 of the present embodiment includes a daily link travel time storage unit 41, a statistical processing unit 45, a statistical link travel time storage unit 43, a link travel time output unit 39, as optional components or functions. A route setting unit 51, a route travel time calculation unit 52, and a route travel time output unit 53 are further provided.

  Map information storage unit 21, position information detection unit 12, link match processing unit 31, matching result storage unit 32, daily link travel time storage unit 41, statistical processing unit 45, statistical link travel time storage unit 43, link travel time output The unit 39, the route setting unit 51, the route travel time calculation unit 52, and the route travel time output unit 53 are the same as those in the first embodiment.

  Similarly to the first embodiment, the link travel time calculation unit 37 refers to the matching result storage unit 32 and calculates the link travel time for each exit link or entry link. In the present embodiment, in addition to this, when the link travel time calculation unit 37 calculates the link travel time, the following processing is performed. That is, when the link L connected to the upstream side of the intersection having a plurality of nodes N in the intersection is set as the target link L, the link travel time calculation unit 37 sets the target link L for each exit link or each entrance link with respect to the intersection. And the time required to pass through the intersection is calculated as the link travel time of the target link L.

  The link travel time calculation unit 37 identifies the vehicle that has passed through the target link L and its intersection, classifies the time required for the identified vehicle to pass through the target link L and its intersection, for each exit link L, The link travel time of the target link L for each leaving link is calculated. For example, the link travel time calculation unit 37 specifies the vehicle ID 133 matched with the target link L and the link L in the intersection. Further, the link travel time calculation unit 37 classifies and summarizes the time required for the vehicle with the vehicle ID 133 to pass through the target link L and the link in the intersection for each exit link, and the target for each exit link L. Let it be the link travel time of link L. That is, as a result, the travel time of the link L in the intersection is also allocated to the link travel time of the target link L, and the link travel time of the link in the intersection becomes zero.

  For example, the link travel time calculation unit 37 may function as a replacement processing unit that replaces a plurality of nodes N at the intersection with one virtual node NT. The link travel time calculation unit 37 specifies the link ID 415 for each of the entering link L and the leaving link L in the link configuration in which the plurality of nodes N at the intersection are replaced with the virtual node NT. The link travel time calculation unit 37 calculates the link travel time for the link ID 415 directly connected to the virtual node NT specified in this way. After calculating the link travel time using the virtual node NT in this way, the link travel time calculation unit 37 converts the virtual node NT to the link L upstream of the virtual node NT among the plurality of original nodes N in the intersection. Return to node N connected to. As a result, the link travel time of the intra-intersection link L can be set to 0, and that amount can be included in the link travel time of the link L upstream of the virtual node NT. Hereinafter, this process will be described in detail with reference to FIG.

  FIG. 10A shows a case where a plurality of nodes N exist at the intersection, and the link ID 415 in the table of FIG. 10B shows correspondence identification information in which the outgoing link L is associated with the target link L. . The traveling direction of the vehicle with respect to each link L in FIG.

  As shown in FIG. 10A, when the link L1 directly connected to the virtual node NT is set as the target link L, links other than the target link L directly connected to the virtual node NT become exit links. When the exit link L is L2 (A exit course), L6 (B + C exit course) or L9 (B + D + E exit course), different link IDs 415 are set for the A exit course, the B + C exit course, and the B + D + E exit course, respectively. Is done. Therefore, the link travel time of the link L1 for each exit course is calculated as follows.

  First, the four nodes N (identification information “4”, “5”, “7”, and “8”) in the intersection are replaced with one virtual node NT (identification information “T1”). In this case, for example, links in the intersection such as the links L4 and L5 (links connecting the nodes N of the identification information “4”, “5”, “7”, and “8”) are treated as not existing. It will be. Note that the nodes in the intersection are specified in advance.

  First, a case where the link ID 415 is expressed using the node method will be described. In the above case, the link ID 415 of the link L1 when the A leaving course is selected is “1-4-o2”. Here, the node “4” is replaced with the virtual node “T1”. Therefore, the link ID 415 of the link L1 after replacement is “1-T1-o2” (node method) as shown in the table of FIG. 10B.

  After calculating the link travel time, “T1” included in the link ID 415 is returned to “4”, which is the node N connected to the link L upstream of the virtual node NT. That is, in the above process, the link travel time of the link ID 415 “1-4-o2” of the link L1 is calculated.

  Next, when the B + C exit course is selected, the link ID 415 of the link L1 is “1-4-o5”, and the link ID 415 of the link L4 is “4-5-o6”. Here, both the node “4” and the node “5” are replaced with the virtual node “T1”. As a result, since the link L4 is treated as not existing, the link ID 415 of the link L1 after replacement is “1-T1-o6” as shown in the table of FIG. 10B.

  After calculating the link travel time, “T1” included in the link ID 415 is returned to “4”, which is the node N connected to the link L upstream of the virtual node NT. That is, in the above process, the link travel time of the link ID 415 “1-4-o6” of the link L1 is calculated. Here, the node “6” is not directly connected to the node “4”, but the exit link needs to be outside the intersection, and thus remains as it is.

  Similarly, when the B + D + E exit course is selected, the link ID 415 of the link L1 is “1-4-o5”, the link ID 415 of the link L4 is “4-5-o8”, and the link ID 415 of the link L5 is “5-8−”. o9 ". Here, the node “4”, the node “5”, and the node “8” are all replaced with the virtual node “T1”. As a result, since the link L4 and the link L5 are treated as not existing, the link ID 415 of the replaced link L1 is “1-T1-o9” as shown in the table of FIG. 10B.

  After calculating the link travel time, “T1” included in the link ID 415 is returned to “4”, which is the node N connected to the link L upstream of the virtual node NT. That is, in the above process, the link travel time of the link ID 415 “1-4-o9” of the link L1 is calculated. Here, similarly to the above, the node “9” is not directly connected to the node “4”. However, since the outgoing link needs to be outside the intersection, it remains as it is.

  As a result, the link travel time for the intra-intersection link (L4, L5) is also included in the link travel time of the link L1 represented by the link ID 415 described above.

  On the other hand, when the link ID 415 is expressed using the link method, the link travel time calculation unit 37 performs a process of changing the link travel time of the intra-intersection link L to the link L directly connected to the upstream side of the virtual node T1. That is, the link travel time calculation unit 37 aggregates the link travel times of the links in the intersection for each exit link L, assigns the calculated link travel times of the links in the intersection to the link travel times of the target link L, and within the intersection The link travel time of the link may be set to zero. For example, when the B + C exit course is selected, the link ID 415 of the link L1 is “L1-oL4”, and the link ID 415 of the link L4 is “L4-oL6”. At this time, the link travel time calculation unit 37 replaces the link travel time of the link L4 with the link L1, and sets the link ID 415 of the link L1 to “L1-oL6”. Similarly, when the B + D + E exit course is selected, the link ID 415 of the link L1 is “L1-oL4”, the link ID 415 of the link L4 is “L4-oL5”, and the link ID 415 of the link L5 is “L5-oL9”. At this time, the link travel time calculation unit 37 replaces the link travel times of the link L4 and the link L5 with the link L1, and sets the link ID 415 of the link L1 to “L1-oL9”.

  Note that whether the link ID 415 is identified by the link method or the node method is the same as in the first embodiment.

  Next, processing for calculating the link travel time of the link L connected to the upstream of the intersection having a plurality of nodes will be described using the flowchart of FIG. Here, the link ID 415 is expressed by a node method.

  First, the link travel time calculation unit 37 refers to the matching result storage unit 32, from the link L directly connected to the upstream side of the intersection having a plurality of nodes N to the link L connected to the downstream side of the intersection L. The link travel time for each exit link L is calculated (S31).

  Then, the link travel time calculation unit 37 replaces the identification information of the plurality of nodes N in the intersection included in the link ID 415 with the identification information of one virtual node NT (S32).

  Here, for a link whose start point and end point of the link ID 415 expressed by the node method are both virtual nodes NT, the link travel time calculation unit 37 replaces the link travel time with the adjacent link on the upstream side (S33). ).

  Next, the link travel time calculation unit 37 returns the identification information of the virtual node NT included in the link ID 415 to the original identification information of the node N connected to the link L upstream of the virtual node NT (S34).

  According to the present embodiment, the link travel time for each outgoing link in the link upstream of the intersection having a plurality of nodes N can also be obtained in the same manner as in the case of a single node intersection.

  Further, according to the present embodiment, when the route travel time calculation unit 52 calculates the route travel time using this result, an intersection having a plurality of nodes is included in the route from the departure point to the destination. Even so, the route travel time can be accurately calculated.

  The above-described embodiments of the present invention are examples for explaining the present invention, and are not intended to limit the scope of the present invention only to those embodiments. Those skilled in the art can implement the present invention in various other modes without departing from the gist of the present invention.

DESCRIPTION OF SYMBOLS 1 Travel time provision apparatus, 11 Probe information receiving part, 12 Position information detection part, 13 Probe information storage part, 21 Map information storage part, 31 Link match processing part, 32 Matching result storage part, 37 Link travel time calculation part, 39 Link travel time output unit, 41 Daily link travel time storage unit, 43 Statistical link travel time storage unit, 51 Route setting unit, 52 Route travel time calculation unit, 53 Route travel time output unit

Claims (7)

A map information storage unit for storing map information composed of nodes and links;
A position information storage unit for storing moving object position information indicating the position of the moving object at different times;
Based on the map information and the mobile object position information, a link match processing unit that matches each position of the mobile object at the different time with one link,
A link travel time calculation unit that calculates a link travel time of a target link that is a target of link travel time calculation based on the moving body position information and the matching result, and for each incoming link that enters the target link or A link travel time providing device comprising: the link travel time calculation unit that calculates the link travel time of the target link for each exit link that exits the target link.   The link travel time calculation unit specifies a mobile body that has passed through the target link, and distinguishes the time required for the specified mobile body to pass through the target link for each entry link or each exit link. The link travel time providing device according to claim 1, wherein the link travel time is calculated for each entry link or each exit link.   Link travel for storing the link travel time for each entry link or each exit link and the combined identification information obtained by combining the identification information of the target link with the identification information of the entry link or the identification information of the exit link The travel time providing device according to claim 1, further comprising a time storage unit. The identification information of the target link is specified by identification information of nodes at both ends of the target link,
The identification information of the incoming link or the identification information of the outgoing link is specified using identification information of a node connected to one of the nodes at both ends of the target link via the incoming link or the outgoing link. And
The combined identification information uses identification information of nodes at both ends of the target link and identification information of nodes connected to one of the nodes at both ends of the target link via the ingress link or the egress link. The travel time providing apparatus according to claim 3, which is specified by identification information of at least nodes. A route setting unit for setting a route from the departure place to the destination based on the departure place and the destination designated by the operator;
A route travel time calculation unit that calculates a route travel time based on a link travel time of each link included in the route set by the route setting unit, and has a link travel time for each entry link or each exit link The travel according to any one of claims 1 to 4, further comprising: a link travel time calculation unit that uses a link travel time corresponding to an incoming link or an outgoing link on the set route. Time providing device. A link travel time providing apparatus having a map information storage unit storing map information composed of nodes and links,
Storing the moving body position information indicating the position of the moving body at different times in the position information storage unit;
Based on the map information and the mobile object position information, matching each of the positions of the mobile objects at the different times to one link;
Based on the moving body position information and the result of the matching, a step of calculating a link travel time of a target link that is a target of link travel time calculation, for each incoming link that enters the target link or from the target link A link travel time providing method for performing, for each exit link to be exited, calculating a link travel time of the target link. A computer program for a link travel time providing device having a map information storage unit storing map information composed of nodes and links,
Storing the moving body position information indicating the position of the moving body at different times in the position information storage unit;
Based on the map information and the mobile object position information, matching each of the positions of the mobile objects at the different times to one link;
Based on the moving body position information and the result of the matching, a step of calculating a link travel time of a target link that is a target of link travel time calculation, for each incoming link that enters the target link or from the target link A computer program that causes the link travel time providing device to execute a step of calculating a link travel time of the target link for each exit link to exit.

Images