Information processing device, information processing method, and program

The information processing device enhances traffic flow prediction by switching between prediction algorithms based on traffic flow characteristics and event occurrence, addressing the limitations of existing technologies in handling unexpected events and improving forecasting accuracy.

JP2024165479APending Publication Date: 2024-11-28OKI ELECTRIC INDUSTRY CO LTD

Patent Information

Application Number
JP2023081719
Authority / Receiving Office
JP · JP
Patent Type
Applications
Current Assignee / Owner
Filing Date
2023-05-17
Publication Date
2024-11-28

AI Technical Summary

Technical Problem

Existing traffic flow prediction technologies struggle to accurately predict traffic congestion caused by unexpected events, as they often lack sufficient data and uniformly apply prediction methods that fail to account for the distinct flow characteristics of congested and free flow sections, leading to reduced accuracy.

Method used

An information processing device and method that determines traffic flow characteristics using machine learning, switching between prediction algorithms based on the occurrence of traffic jams and the presence of unexpected events, employing percentile and pattern match predictions to enhance accuracy.

Benefits of technology

The solution enables more accurate traffic flow prediction by adapting prediction methods to traffic conditions, effectively handling unexpected events and improving forecasting accuracy.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure 2024165479000001_ABST
    Figure 2024165479000001_ABST
Patent Text Reader

Abstract

To meet the need for technology that makes it possible to predict a traffic flow with greater accuracy.SOLUTION: Provided is an information processing device comprising: a determination unit that, on the basis of a first traffic flow characteristic at a first time of day in a target cell among a plurality of cells constituting a road, determines whether or not there is occurrence of a congestion in the target cell at the first time of day; and a prediction unit that, on the basis of whether or not it is determined that there is occurrence of a congestion in the target cell at the first time of day, determines a predication algorithm for a second traffic flow characteristic at a second time of day that is later than the first time of day of the target cell, and predicts the second traffic flow characteristic by the determined prediction algorithm.SELECTED DRAWING: Figure 1
Need to check novelty before this filing date? Find Prior Art

Description

[Technical field]

[0001] The present invention relates to an information processing device, an information processing method, and a program. [Background technology]

[0002] In recent years, various techniques have been known for simulating traffic flow based on sensor data collected by sensors, which may include antennas.

[0003] As an example of a technology for simulating traffic flow, Patent Document 1 discloses, in paragraphs 0017-0019 and 0026-0037, a technology for selecting data from past travel time statistical data that has a similar time fluctuation trend to the travel time actual measurement data, and calculating future travel times based on the selected data.

[0004] As another example of a technology for simulating traffic flow, Patent Document 2, paragraphs 0016-0017 and 0030-0037, etc. disclose a technology in which a section including a point where an unexpected event (e.g., a traffic accident or traffic regulation) has occurred is set as a prediction target section. In this technology, the prediction target section is divided into a plurality of blocks each having a unit length, and the traffic density of each block is calculated from the accumulated past traffic density and traffic volume. Then, since it is possible to convert the traffic density into vehicle speed and calculate the travel time from the vehicle speed, the travel time of the prediction target section can be calculated by adding up the travel time of each block. [Prior art documents] [Patent documents]

[0005] [Patent Document 1] JP 2005-196238 A [Patent Document 2] JP 2007-219633 A Summary of the Invention [Problem to be solved by the invention]

[0006] Here, the technology described in Patent Document 1 is considered to be effective in cases where the location of congestion is limited to a bottleneck (for example, a location where the road width suddenly narrows). However, there may be cases where the time of congestion or the location of congestion is not limited, such as congestion caused by a sudden event. In such cases, the technology described in Patent Document 1 may not improve the accuracy of predicting future traffic flow, since there is little data similar to the actual travel time measurement data in the past travel time statistical data.

[0007] Furthermore, in the technology described in Patent Document 2, the prediction method applied to the prediction target section including the point where the unexpected event occurred is changed across the board. However, the tendency of the traffic flow changes over time is different between the congested flow section due to the unexpected event and the free flow section other than the congested flow section. Furthermore, the tendency of the traffic flow changes over time is also different between the free flow section located upstream of the congested flow section and the free flow section located downstream of the congested flow section. Therefore, if the prediction method applied to the prediction target section is changed to the same prediction method across the board, there is a possibility that the prediction accuracy of future traffic flow will not improve.

[0008] Therefore, it is desirable to provide a technology that enables more accurate traffic flow prediction. More specifically, it is desirable to determine whether a traffic jam has occurred based on the traffic flow characteristics, even if a traffic jam has occurred due to an unexpected event, and to change the traffic flow prediction method when a traffic jam has occurred, thereby more accurately predicting the traffic flow. [Means for solving the problem]

[0009] In order to solve the above problem, according to one aspect of the present invention, there is provided an information processing device comprising: a determination unit that determines whether or not congestion is occurring in a target cell at a first time based on a first traffic flow characteristic of the target cell at a first time among a plurality of cells that constitute a road; and a prediction unit that determines a prediction algorithm for second traffic flow characteristics of the target cell at a second time after the first time based on whether or not congestion is determined to be occurring in the target cell at the first time, and predicts the second traffic flow characteristics using the determined prediction algorithm.

[0010] In addition, the prediction of the second traffic flow characteristic may use learned model data obtained by machine learning.

[0011] The prediction unit may determine a first prediction algorithm as the prediction algorithm when it is determined that congestion is occurring in the target cell at the first time, and may determine a second prediction algorithm different from the first prediction algorithm as the prediction algorithm when it is determined that congestion is not occurring in the target cell at the first time.

[0012] The determination unit may determine whether a specified event that affects the first traffic flow characteristic has occurred based on event information that has occurred on the road, and if the specified event has occurred, determine whether congestion has occurred in the target cell at the first time.

[0013] The determination unit may determine the second prediction algorithm as the prediction algorithm when the predetermined event has not occurred.

[0014] When the determination unit determines that there is no congestion in the target cell at the first time, it may determine whether the target cell belongs to a predetermined range based on one or more congested cells among the multiple cells in which congestion is occurring at the first time, and the prediction unit may determine the first prediction algorithm as the prediction algorithm when the target cell belongs to the predetermined range.

[0015] The prediction unit may determine the second prediction algorithm as the prediction algorithm when the target cell does not belong to the predetermined range.

[0016] The information processing device may include a first learning unit that acquires a combination of a traffic density at a third time of each cell from an upstream cell based on the target cell to a downstream cell based on the target cell and a traffic density of the target cell at a fourth time after the third time as a pattern, and the first prediction algorithm may be an algorithm that predicts the second traffic flow characteristic based on the traffic density at the first time of each cell from the upstream cell to the downstream cell and the pattern.

[0017] The information processing device may include a second learning unit that calculates multiple average traffic densities based on traffic densities for a specified time period between specified points obtained based on a third time period, calculates a percentile value of each of the multiple average traffic densities in the multiple average traffic densities, and calculates a percentile value of each of the multiple traffic densities in the multiple traffic densities based on the multiple traffic densities of the target cell at the third time, and the second prediction algorithm may be an algorithm that calculates a first average traffic density based on traffic densities for a first time period between the specified points, and predicts the second traffic flow characteristics based on the first average traffic density, the multiple average traffic densities, the percentile value of each of the multiple average traffic densities, and the percentile value of each of the multiple traffic densities.

[0018] The first traffic flow characteristic may be a first traffic density, and the determination unit may determine whether or not congestion is occurring in the target cell at the first time based on whether or not the first traffic density is equal to or greater than a threshold.

[0019] The first traffic flow characteristic may be a first speed of vehicles traveling in the target cell, and the determination unit may determine whether or not congestion is occurring in the target cell at the first time based on whether or not the first speed is equal to or less than a threshold value.

[0020] The second traffic flow characteristic may be a second traffic density.

[0021] In addition, according to another aspect of the present invention, in order to solve the above-mentioned problem, there is provided an information processing method executed by a computer, which includes: determining whether or not congestion is occurring in a target cell at a first time based on a first traffic flow characteristic of the target cell at a first time among a plurality of cells constituting a road; determining a prediction algorithm for second traffic flow characteristics of the target cell at a second time after the first time based on whether or not congestion is determined to be occurring in the target cell at the first time, and predicting the second traffic flow characteristics using the determined prediction algorithm.

[0022] In addition, according to another aspect of the present invention, in order to solve the above-mentioned problem, there is provided a program that causes a computer to function as an information processing device including: a determination unit that determines whether or not congestion is occurring in a target cell at a first time based on a first traffic flow characteristic of the target cell among multiple cells that constitute a road at the first time; and a prediction unit that determines a prediction algorithm for second traffic flow characteristics of the target cell at a second time after the first time based on whether or not congestion is determined to be occurring in the target cell at the first time, and predicts the second traffic flow characteristics using the determined prediction algorithm. Effect of the Invention

[0023] As described above, according to the present invention, a technique is provided that enables traffic flow to be predicted with higher accuracy. [Brief description of the drawings]

[0024] [Figure 1] 1 is a diagram illustrating an example of a functional configuration of a traffic flow prediction device 1 according to an embodiment of the present invention. [Diagram 2] 2 is a diagram illustrating a detailed configuration example of a learning unit 141. FIG. [Diagram 3] 13 is a diagram illustrating a detailed configuration example of an inference unit 142. FIG. [Figure 4] 13 is a diagram showing an example of master data stored in a master data storage unit 126. FIG. [Diagram 5] 4 is a diagram showing an example of learning parameters stored in a learning parameter storage unit 127. FIG. [Figure 6] 13 is a diagram showing an example of free flow data stored by a free flow data storage unit 123. FIG. [Figure 7] 4 is a diagram showing an example of probe data stored by a probe data storage unit 122. FIG. [Figure 8] FIG. 1 is a diagram showing a set of traffic density (K) and speed (V) and the KV relational expression. [Figure 9] 13 is a diagram showing an example of the configuration of KV parameters stored in a learning parameter storage unit 127. FIG. [Figure 10] 13 is a flowchart showing an example of a KV parameter generation process executed by a KV parameter generation unit 1411. [Figure 11] 11 is a diagram for explaining an example of calculation of a passing time at a measurement point of a vehicle that has arrived at an estimation point; FIG. [Figure 12] 11 is a diagram for explaining an example of calculating a traffic volume at an estimation point from a traffic volume at a measurement point; FIG. [Figure 13] 13 is a flowchart showing an example of a traffic density calculation process executed by a traffic density calculation unit 1412. [Figure 14] FIG. 2 is a diagram showing a schematic diagram of traffic density data used for learning. [Figure 15] FIG. 1 is a diagram for explaining an overview of percentile learning. [Figure 16] A figure showing an example of average traffic density percentile data 731 as an example of learning model data 730. [Figure 17] A figure showing an example of mesh traffic density percentile data 732 as an example of learning model data 730. [Figure 18] 13 is a flowchart showing an example of a percentile learning operation by percentile learning unit 1414. [Figure 19] FIG. 2 is a diagram for explaining an overview of traffic density pattern learning. [Figure 20] FIG. 11 is a diagram showing an example of a pattern in which a traffic density pattern is associated with a next-hour traffic density of a target cell. [Figure 21] 13 is a flowchart showing an example of an operation of traffic density pattern learning by a traffic density pattern learning unit 1413. [Figure 22] FIG. 2 is a diagram illustrating a traffic density and speed to be predicted. [Diagram 23] FIG. 13 is a diagram illustrating a schematic representation of the application range of percentile prediction and the application range of pattern match prediction. [Figure 24] 13 is a flowchart showing an example of a percentile prediction operation by the percentile prediction unit 1424 according to the embodiment of the present invention. [Diagram 25] 13 is a flowchart showing an example of an operation of pattern match prediction by the pattern match prediction unit 1423 according to the embodiment of the present invention. [Figure 26] 13 is a flowchart showing an example of a traffic flow prediction process executed by an inference unit 142. [Figure 27] 13 is a flowchart showing an example of a traffic flow prediction operation by an inference unit 142 according to a modified example of the embodiment of the present invention. [Figure 28] 11 is a diagram showing a comparison between prediction results by a traffic flow prediction according to an embodiment of the present invention and prediction results by a traffic flow prediction according to a comparative example. FIG. [Figure 29]FIG. 1 is a diagram showing a hardware configuration of an information processing device 900 as an example of a traffic flow prediction device 1 according to an embodiment of the present invention. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0025] Hereinafter, preferred embodiments of the present invention will be described in detail with reference to the accompanying drawings. In this specification and the drawings, components having substantially the same functional configurations are designated by the same reference numerals, and duplicated explanations will be omitted.

[0026] 1. DETAILED DESCRIPTION OF THE EMBODIMENTS The following describes the details of the embodiments of the present invention.

[0027] (1-1. Configuration of the traffic flow prediction device) First, a configuration example of a traffic flow prediction device 1 according to an embodiment of the present invention will be described. Fig. 1 is a diagram showing a functional configuration example of the traffic flow prediction device 1 according to an embodiment of the present invention. The traffic flow prediction device 1 can be an example of an information processing device.

[0028] Referring to FIG. 1, vehicles M1 to M3 are shown as examples of vehicles traveling on a road. Referring further to FIG. 1, vehicles M1 and M2 are traveling in the back lane (vehicle M1 is traveling following vehicle M2), and vehicle M3 is traveling in the front lane in the opposite direction to vehicles M1 and M2 in the back lane. In this way, the embodiment of the present invention mainly assumes a case where the road is made up of multiple lanes, but the road may be made up of a single lane. Each of vehicles M1 to M3 is equipped with an on-board device. Note that a lane can also be referred to as a "lane."

[0029] The traffic flow prediction device 1 includes an event information input unit 150. The traffic flow prediction device 1 also includes an event information storage unit 120, a driving history data storage unit 121, a probe data storage unit 122, a free flow data storage unit 123, a traffic volume data storage unit 124, a traffic density data storage unit 125, a master data storage unit 126, a learning parameter storage unit 127, and a prediction result storage unit 128.

[0030] The traffic flow prediction device 1 also includes a statistical processing unit 131, a traffic volume calculation unit 133, and a processing unit 140. The processing unit 140 includes a learning unit 141 and an inference unit 142.

[0031] Fig. 2 is a diagram showing a detailed configuration example of the learning unit 141. As shown in Fig. 2, the learning unit 141 includes a KV parameter creation unit 1411, a traffic density calculation unit 1412, a traffic density pattern learning unit 1413, and a percentile learning unit 1414. These blocks included in the learning unit 141 mainly operate in the learning stage. Detailed functions of these blocks included in the learning unit 141 will be described later.

[0032] Fig. 3 is a diagram showing a detailed configuration example of the inference unit 142. As shown in Fig. 3, the inference unit 142 includes a determination unit 1421 and a prediction unit 1422. The prediction unit 1422 also includes a pattern match prediction unit 1423 and a percentile prediction unit 1424. These blocks included in the inference unit 142 mainly operate in the inference stage. Detailed functions of these blocks included in the inference unit 142 will be described later.

[0033] The driving history data storage unit 121 is connected to the probe antenna 112 , and the free flow data storage unit 123 is connected to the free flow antenna 114 .

[0034] The statistical processing unit 131, the traffic volume calculation unit 133, and the processing unit 140 each include a calculation device such as a CPU (Central Processing Unit) or a GPU (Graphics Processing Unit), and the functions of each unit can be realized by the calculation device expanding a program stored in a ROM (Read Only Memory) into a RAM and executing the program. At this time, a computer-readable recording medium on which the program is recorded can also be provided.

[0035] Alternatively, the statistical processing unit 131, the traffic volume calculation unit 133, and the processing unit 140 may be configured by dedicated hardware, or may be configured by a combination of multiple hardware. Data necessary for the calculation by the calculation device is appropriately stored in a storage unit (not shown).

[0036] The driving history data storage unit 121, the probe data storage unit 122, the free flow data storage unit 123, the traffic volume data storage unit 124, the traffic density data storage unit 125, the master data storage unit 126, the learning parameter storage unit 127, and the prediction result storage unit 128 are realized by a storage unit (not shown). Such a storage unit may be configured by a memory such as a RAM (Random Access Memory), a hard disk drive, or a flash memory.

[0037] (Master data storage unit 126) The master data storage unit 126 stores various master data in advance. The master data is data input by a user to the traffic flow prediction device 1 and managed by the traffic flow prediction device 1. Here, an example of the master data will be described with reference to FIG. 4.

[0038] Fig. 4 is a diagram showing an example of master data stored by the master data storage unit 126. As shown in Fig. 4, the master data storage unit 126 stores, as examples of master data, a driving history time width 611, a driving history section width 612, a simulation execution time interval 621, a simulation execution cell width 622, a congestion flow determination speed 641, and a congestion wave propagation speed 645. Details of these master data will be described later.

[0039] (Learning parameter storage unit 127) The learning parameter storage unit 127 can store various learning parameters. The learning parameters are parameters obtained by learning, and are stored in the learning parameter storage unit 127 in the learning stage. Also, the learning parameters are obtained from the learning parameter storage unit 127 in the inference stage. Here, examples of the learning parameters stored by the learning parameter storage unit 127 will be described with reference to FIG. 5.

[0040] Fig. 5 is a diagram showing examples of learning parameters stored by the learning parameter storage unit 127. As shown in Fig. 5, the learning parameter storage unit 127 may store, as examples of learning parameters, KV parameters 710, traffic density patterns 720, and learning model data 730. Details of these learning parameters will be described later.

[0041] (Event information input unit 150) The event information input unit 150 receives, from the user, the time and location of an unexpected event (hereinafter also referred to as "event") occurring on a road as event information. Here, the type of event is not limited. For example, the event may be any unexpected event that may cause congestion at a point on a road, and may be a traffic accident, traffic regulation, the presence of an obstacle on the road, or construction schedule.

[0042] For example, the event information input unit 150 may be configured with an input device such as a mouse or a keyboard. However, the event information input unit 150 may be configured with other input devices. For example, the event information input unit 150 may be configured with a touch panel or a button.

[0043] For example, assume that the starting point of the road "Point A" and the distance "24 km" from the starting point of the road "Point A" are input by the user as the location where the event occurs. Also assume that the simulation execution cell width 622 is "200 m." A cell corresponds to each block when a road is logically divided into a plurality of blocks at equal intervals, and the simulation execution cell width 622 is the width of one cell. In this case, the 120th cell (24 km / 200 m =) from the starting point of the road "Point A" is specified as the location where the event occurs.

[0044] The event information received from the user by the event information input unit 150 is output to the event information storage unit 120.

[0045] The event information input unit 150 may acquire the event information from a predetermined storage location (for example, a Web page including the event information). Alternatively, the event information input unit 150 may estimate whether an event has occurred for each time and for each cell based on the traffic volume data stored in the traffic volume data storage unit 124 and the probe data stored in the probe data storage unit 122.

[0046] (Event information storage unit 120) The event information storage unit 120 stores the event information output from the event information input unit 150 .

[0047] (Free Flow Antenna 114) The free flow antenna 114 functions as an example of a vehicle detection unit that detects vehicles traveling at each position on a road. That is, in the embodiment of the present invention, a case is mainly assumed in which the vehicle detection unit includes the free flow antenna 114. As a result, an ETC free flow antenna of an already constructed ETC (Electronic Toll Collection) system can be used as a vehicle detection unit, so there is no need to provide a new vehicle detection unit. However, instead of the free flow antenna 114, other vehicle detection units (for example, a vehicle detector, an infrared sensor, or an ultrasonic sensor) may be used.

[0048] More specifically, the free flow antenna 114 detects a vehicle in real time by receiving vehicle identification information (vehicle ID) from the vehicle through communication with an on-board unit mounted on the vehicle. In the embodiment of the present invention, a case is mainly assumed in which an ETC on-board unit is used as an example of the on-board unit. It is assumed that the free flow antenna 114 is compatible with a plurality of versions of ETC on-board units, whereas the probe antenna 112 described later is compatible with only a specific version of ETC on-board units. In other words, the free flow antenna 114 can detect more vehicles than the probe antenna 112.

[0049] In addition, the "positions" on the road where the vehicle is detected by the free flow antenna 114 are not particularly limited as long as they are vehicle positions that can be detected by the vehicle detection unit. In the following, each position on the road where the vehicle can be detected by the free flow antenna 114 may be simply referred to as a "free flow antenna position."

[0050] When the free flow antenna 114 detects a vehicle in real time by receiving a vehicle ID through communication with an on-board device mounted on the vehicle, it outputs the vehicle detection result (hereinafter also referred to as "free flow data") in real time to the free flow data storage unit 123. Then, the vehicle detection result output in real time from the free flow antenna 114 to the free flow data storage unit 123 can be used in real time by the traffic volume calculation unit 133.

[0051] Here, "real-time" may mean any short time between when a vehicle arrives at the free flow antenna position and when the traffic conditions on the road change. If a vehicle is detected at this time, some measure can be taken according to the traffic conditions at the time when the vehicle is detected before the traffic conditions on the road change.

[0052] (Free flow data storage unit 123) FIG. 6 is a diagram showing an example of free flow data stored by the free flow data storage unit 123. The free flow data corresponds to the detection result of a vehicle traveling through the free flow antenna position. As shown in FIG. 6, the free flow data is made up of a "vehicle ID" and a "passing time" associated with each other. The "vehicle ID" is vehicle identification information received by the free flow antenna 114 from the vehicle through communication between the free flow antenna 114 and an onboard device mounted on the vehicle. The "passing time" is the time when the vehicle ID is received from the vehicle by the free flow antenna 114, and may correspond to the time when the vehicle passed the free flow antenna position.

[0053] (Traffic volume calculation unit 133) The traffic volume calculation unit 133 acquires the free flow data from the free flow data storage unit 123. Then, based on the free flow data (vehicle IDs and passing times), the traffic volume calculation unit 133 calculates the number of vehicles that pass the free flow antenna position per unit time set in advance (in other words, the number of vehicle IDs detected per unit time by the free flow antenna 114) as the traffic volume at the free flow antenna position. The traffic volume calculation by the traffic volume calculation unit 133 may be repeatedly performed for each unit time.

[0054] Note that not all vehicles that pass the free flow antenna position are necessarily equipped with an on-board device capable of communicating with the free flow antenna 114. Therefore, not all vehicles that pass the free flow antenna position are necessarily detected by the free flow antenna 114. Therefore, if the ratio of vehicles equipped with on-board devices capable of communicating with the free flow antenna 114 to the total number of vehicles (including vehicles not equipped with on-board devices capable of communicating with the free flow antenna 114) is preset as the "on-board device installation ratio" and the number of vehicles detected by the free flow antenna 114 is set as the "number of detected vehicles," it is desirable for the traffic volume calculation unit 133 to more accurately estimate the traffic volume at the free flow antenna position using the following formula (1).

[0055] (Estimated traffic volume) = (Number of detected vehicles) ÷ (Proportion of vehicles equipped with on-board devices) (1)

[0056] However, such estimation may be omitted in cases where in-vehicle devices capable of communicating with the free flow antenna 114 are sufficiently widespread. The traffic volume estimated by the traffic volume calculation unit 133, the measurement time which is the end of the time corresponding to the traffic volume, and the free flow antenna position corresponding to the traffic volume are output to the traffic volume data storage unit 124 as traffic volume data every time the traffic volume is estimated.

[0057] (Traffic volume data storage unit 124) The traffic volume data storage unit 124 stores the traffic volume data output from the traffic volume calculation unit 133 .

[0058] (Probe Antenna 112) The probe antenna 112 functions as an example of a driving history data acquisition unit that acquires driving history data of a vehicle. That is, in the embodiment of the present invention, a case is mainly assumed in which the driving history data acquisition unit includes the probe antenna 112. As a result, an ETC probe antenna of an already constructed ETC system can be used as the driving history data acquisition unit, so there is no need to provide a new driving history data acquisition unit. However, instead of the probe antenna 112, another driving history data acquisition unit (for example, a mobile base station, etc.) may be used.

[0059] More specifically, when the probe antenna 112 acquires driving history data from the vehicle through communication with an on-board device mounted on the vehicle, the probe antenna 112 outputs the acquired driving history data to the driving history data storage unit 121 .

[0060] (Driving history data storage unit 121) The driving history data storage unit 121 stores the driving history data output from the probe antenna 112. The driving history data stored by the driving history data storage unit 121 can be used by the statistical processing unit 131.

[0061] The driving history data includes the speed of each vehicle traveling for each section (between kilometer posts) on the road defined by the driving history section width 612 (e.g., 100 m) and for each driving history time width 611 (e.g., 1 minute), and the collection time when the speed was collected by the probe antenna 112.

[0062] (Statistical processing unit 131) The statistical processing unit 131 acquires the driving history data from the driving history data storage unit 121, performs statistical processing on the driving history data, and outputs the driving history data after the statistical processing as probe data to the probe data storage unit 122. The probe data output from the statistical processing unit 131 to the probe data storage unit 122 can be mainly used by the learning unit 141.

[0063] For example, the statistical processing unit 131 performs a predetermined statistical process (e.g., averaging process, etc.) on the speed of one or more vehicles that have traveled for each section (between kilometer posts) on the road and for each driving history time range 611. This provides statistics on the vehicle speed for each section on the road and for each driving history time range 611. An example of the averaging process is a process of taking a harmonic mean.

[0064] (Probe data storage unit 122) Fig. 7 is a diagram showing an example of the probe data stored by the probe data storage unit 122. As shown in Fig. 7, the probe data includes a "passing time", a "kilometer post", a "speed", and a "collection time" that are associated with each other.

[0065] "Passing time" is the end time when a vehicle passes a distance marker (kilometer post) from the starting point of a road. For example, "Passing time: 2019-01-01 10:24" indicates that the end time when a vehicle passes a distance marker (kilometer post) is "2019-01-01 10:24." A "kilometer post" is a distance marker from the starting point of a road.

[0066] "Speed" is a statistic (e.g., average speed) of one or more vehicle speeds that traveled each section (between kilometer posts) on the road for each travel history time span 611 (between passing times). For example, "Speed: 80 km / h" is a statistic of the speed of one or more vehicles that traveled from "Kilopost: 100" to "Kilopost: 100.1" from "Passing Time: 2019-01-01 10:23" to "2019-01-01 10:24".

[0067] The “collection time” is the time when the vehicle speed was collected by the probe antenna 112 .

[0068] (KV parameter creation unit 1411) The KV parameter creation unit 1411 acquires, for each predetermined period, the speed and passing time for each free flow antenna position from the probe data storage unit 122. Furthermore, the KV parameter creation unit 1411 acquires, for each predetermined period, traffic volume data (traffic volume and measurement time) for each free flow antenna position from the traffic volume data storage unit 124.

[0069] The KV parameter creation unit 1411 creates parameters indicating the correspondence between traffic density (K) and speed (V) (in the following example, an approximation equation) for each free flow antenna position through machine learning based on the traffic volume and measurement time for a specified period of time, and the speed and passing time for the specified period of time.

[0070] More specifically, the KV parameter creation unit 1411 associates the traffic volume (Q) and the speed (V) corresponding to the same time and the same free flow antenna position. Then, the KV parameter creation unit 1411 calculates the traffic density (K) for each associated traffic volume (Q) and speed (V) by the following formula (2).

[0071] K = Q × 1 / (V × 60) (2)

[0072] where K indicates traffic density (vehicles / km), Q indicates traffic volume (vehicles / min), and V indicates speed (km / hour). The KV parameter creation unit 1411 approximates a pair of corresponding traffic density (K) and speed (V) in a predetermined relationship, and creates the parameters of the approximation equation (KV relational equation) obtained by the approximation as KV parameters.

[0073] Here, it is assumed that the KV parameter creation unit 1411 creates parameters of an approximation equation corresponding to a congestion flow. More specifically, the KV parameter creation unit 1411 creates parameters of a KV relational equation corresponding to a congestion flow by approximating a pair of a speed (V) equal to or lower than the congestion flow determination speed 641 (e.g., 55 km / h on a highway) and a traffic density (K) corresponding to that speed (V) in a predetermined relationship. For example, the KV relational equation corresponding to a congestion flow may be an exponential function expressed by the following equation (3).

[0074] V = a × exp(-b × K) (3)

[0075] where K indicates traffic density (vehicles / km), V indicates speed (km / hour), and a and b are KV parameters. In this specification, congested flow is used as a concept that is included in jammed flow, and can mean a state in which the speed is greater than a certain value even in a jammed flow.

[0076] Fig. 8 is a diagram showing pairs of traffic density (K) and speed (V) and the KV relational expression. In the example shown in Fig. 8, the horizontal axis indicates traffic density (K) and the vertical axis indicates speed (V). In the KV diagram, each pair of traffic density (K) and speed (V) corresponding to each other is plotted as each point. Also, referring to Fig. 8, an exponential function showing the KV relational expression obtained by approximating these pairs is shown.

[0077] The KV parameter generating unit 1411 stores the generated KV parameters in the learning parameter storage unit 127 as the KV parameters 710. Typically, the predetermined period may be one month. However, the predetermined period is not limited to one month. For example, the predetermined period may be one day.

[0078] Fig. 9 is a diagram showing an example of the configuration of KV parameters stored in the learning parameter storage unit 127. As shown in Fig. 9, the KV parameters include "parameter a" and "parameter b." Furthermore, since "parameter a" and "parameter b" are expected to differ depending on the road shape, the number of lanes, etc., it is desirable to create them for each vehicle detection position (each free flow antenna position).

[0079] Therefore, as shown in Fig. 9, it is preferable that "parameter a" and "parameter b" are associated with a "route code" and a "vehicle detection position ID." The "route code" is a code for identifying a route (a road from a starting point to an end point). The vehicle detection position ID is a code for identifying a free flow antenna position.

[0080] Furthermore, standard KV parameters according to the number of lanes may be further stored in the learning parameter storage unit 127. For example, when the number of lanes at the free flow antenna position is acquired, the standard KV parameters according to the number of lanes may be used as the initial values ​​of the KV parameters corresponding to the free flow antenna position.

[0081] 10 is a flowchart showing an example of a KV parameter creation process executed by the KV parameter creation unit 1411. First, the KV parameter creation unit 1411 acquires speeds and passing times for a predetermined period for each free flow antenna position from the probe data stored in the probe data storage unit 122 (S11). In addition, the KV parameter creation unit 1411 acquires traffic volume data (traffic volume and measurement time) for a predetermined period for each free flow antenna position from the traffic volume data storage unit 124 (S12).

[0082] The KV parameter creation unit 1411 associates the traffic volume (Q) and the speed (V) corresponding to the same time and the same free flow antenna position. Then, the KV parameter creation unit 1411 calculates the traffic density (K) for each associated traffic volume (Q) and speed (V) (S13).

[0083] The KV parameter creation unit 1411 creates parameters of a KV relational equation that indicates the relationship between traffic density (K) and speed (V) by machine learning (S14). More specifically, the KV parameter creation unit 1411 approximates a pair of corresponding traffic density (K) and speed (V) with a predetermined relationship (e.g., an exponential function, etc.), and creates the parameters of the KV relational equation obtained by the approximation as KV parameters. Here, it is assumed that the KV parameter creation unit 1411 creates parameters of an approximation equation that corresponds to a congestion flow.

[0084] The KV parameter generating unit 1411 stores the generated KV parameters as the KV parameters 710 in the learning parameter storage unit 127 (S15).

[0085] (Traffic density calculation unit 1412) The traffic density calculation unit 1412 acquires the speed and passing time for each section stored at a time later than the previous acquisition time of the probe data used to calculate the traffic density at a preset simulation execution time interval 621 (e.g., 5-minute intervals) from the probe data storage unit 122. In addition, the traffic density calculation unit 1412 acquires the traffic volume data (traffic volume and measurement time) for each free-flow antenna position stored at a time later than the previous acquisition time of the traffic volume data used to calculate the traffic density at the simulation execution time interval 621 from the traffic volume data storage unit 124.

[0086] The traffic density calculation unit 1412 calculates the traffic density for each section based on at least the speed. Here, the traffic density in each section may be calculated in any specific manner.

[0087] For example, the traffic density calculation unit 1412 may obtain KV parameters from the learning parameter memory unit 127 and calculate the traffic density in a target section on a road based on the speed in the target section and the KV relational equation defined by the KV parameters.

[0088] More specifically, the traffic density calculation unit 1412 may calculate the traffic density in a section that is a congested flow, that is, a target section where the speed is equal to or lower than the congested flow determination speed 641 (threshold value), based on the speed in the target section and the KV relational equation.

[0089] In addition, the traffic density calculation unit 1412 may set a point on the road corresponding to the target section as an estimated point, and calculate the traffic density in the target section based on the traffic volume at the estimated point and the speed in the target section. For example, the estimated point may be the starting point of the target section.

[0090] More specifically, the traffic density calculation unit 1412 may calculate the traffic density in the target section where the speed exceeds the congested flow judgment speed 641 based on the traffic volume at the estimation point and the speed in the target section. For example, the traffic density calculation unit 1412 may calculate the traffic volume at the estimation point based on the traffic volume at the measurement point calculated by the traffic volume calculation unit 133 and the speed for each section from the measurement point to the target section. For example, the measurement point may be a free flow antenna position upstream from the target section (for example, the free flow antenna position closest upstream from the target section).

[0091] An example of a method for calculating the traffic density in a target section based on the traffic volume at an estimation point and the speed in the target section will be described with reference to Figs.

[0092] Fig. 11 is a diagram for explaining an example of calculation of the passing time at a measurement point of a vehicle that has arrived at an estimated point. In the example shown in Fig. 11, the horizontal axis indicates distance on the road (the right direction is the downstream direction on the road), and the vertical axis indicates time (the downward direction is the direction of time passage). The speed corresponding to a section (between kilometer posts) and unit time (i.e., the time from a passing time to the passing time immediately before that passing time) in the probe data is indicated by the darkness of the color within a rectangle (space-time range) corresponding to that section and unit time. In this example, the darker the color within the rectangle, the lower the speed.

[0093] The traffic density calculation unit 1412 calculates a trajectory from the estimated point and the passing time at the estimated point to the measurement point upstream and in the past, based on the speed corresponding to each section and unit time. More specifically, the traffic density calculation unit 1412 calculates a trajectory from the estimated point and the time at the estimated point so that the vehicle moves within the rectangle along a straight line with a slope according to the speed corresponding to each section and unit time, and moves between adjacent rectangles at the boundary between the rectangles.

[0094] In this way, the traffic density calculation unit 1412 can obtain the time at the measurement point where the trajectory arrives as the passing time at the measurement point. Referring to Fig. 11, the trajectories of two vehicles are illustrated. Here, the traffic volume between the arrival times of the two vehicles at the estimated point and the traffic volume between the passing times of the two vehicles at the measurement point can be considered to be the same.

[0095] Fig. 12 is a diagram for explaining an example of calculating the traffic volume at the estimation point from the traffic volume at the measurement point. Referring to Fig. 12, the traffic volume Q between the arrival times at the estimation point and the traffic volume Q' between the passing times at the measurement point are shown. Here, the traffic volume between the passing times at the measurement point is stored in the traffic volume data storage unit 124. Therefore, the traffic density calculation unit 1412 can obtain the traffic volume Q' between the passing times at the measurement point from the traffic volume data storage unit 124.

[0096] The traffic density calculation unit 1412 may calculate the traffic volume at the estimation point from the traffic volume Q' between the passing times at the measurement point by the ratio of the arrival time difference at the estimation point to the passing time difference at the measurement point. For example, if the passing time difference at the measurement point is t1 and the arrival time difference at the estimation point is t2, the traffic density calculation unit 1412 may calculate the traffic volume Q at the estimation point by multiplying the traffic volume Q' between the passing times at the measurement point by t1 / t2. Hereinafter, the method of calculating the traffic volume Q at the estimation point from the traffic volume Q' at the measurement point in this way is also referred to as a traffic volume calculation method by "vehicle tracking".

[0097] 13 is a flowchart showing an example of a traffic density calculation process executed by the traffic density calculation unit 1412. First, the traffic density calculation unit 1412 acquires, from the probe data storage unit 122, probe data (speed and passing time for each section) stored at a time later than the previous acquisition time of the probe data used to calculate the traffic density, during a preset simulation execution time interval 621 (S21).

[0098] In addition, the traffic density calculation unit 1412 acquires traffic volume data (traffic volume and measurement time) for each free flow antenna position that is stored at a time later than the previous acquisition time of the traffic volume data used to calculate the traffic density during the simulation execution time interval 621 from the traffic volume data storage unit 124 (S22). The traffic density calculation unit 1412 determines whether the speed in the target section is the speed of a congested flow, that is, a speed equal to or lower than the congested flow determination speed 641 (S23).

[0099] If the speed in the target section is the congestion flow speed (i.e., a speed that is equal to or lower than the congestion flow judgment speed 641) ("YES" in S23), the traffic density calculation unit 1412 calculates the traffic density in the target section based on the speed in the target section and the KV relational equation (S24).

[0100] On the other hand, if the speed in the target section is the free flow speed (i.e., a speed higher than the congested flow judgment speed 641) ("NO" in S23), the traffic density calculation unit 1412 calculates the traffic volume at the measurement point by vehicle tracking, and calculates the traffic density in the target section based on the calculated traffic volume at the measurement point and the speed of each section from the measurement point to the target section (S25). The traffic density calculation unit 1412 outputs traffic density data in which the measurement time of the traffic volume, the section, and the traffic density are associated with each other to the traffic density data storage unit 125.

[0101] (Traffic density data storage unit 125) The traffic density data storage unit 125 stores the traffic density data output from the traffic density calculation unit 1412.

[0102] (Traffic density for study) In the above manner, the traffic density data in which the time, the section, and the traffic density are associated with each other is stored. In the following learning, the traffic density data in which the time, the cell, and the traffic density are associated with each other is used.

[0103] Here, the width of the section is defined by the driving history section width 612. On the other hand, the width of the cell is defined by the simulation execution cell width 622.

[0104] The width of the cell may be the same as the width of the section, or may be different from the width of the section. For example, the width of the section may be 100 m, whereas the width of the cell may be 500 m. As in this example, when the width of the cell is different from the width of the section, the learning unit 141 may identify a plurality of sections belonging to the cell, perform statistical processing on the traffic density corresponding to each of the plurality of sections, and obtain the traffic density after the statistical processing as the traffic density corresponding to the cell.

[0105] The time interval corresponding to the section is defined in a driving history time span 611. On the other hand, the time interval corresponding to the cell is defined in a simulation execution time interval 621.

[0106] The time interval corresponding to the cell may be the same as the time interval corresponding to the section, or may be different from the time interval corresponding to the section. For example, the time interval corresponding to the section may be 1 minute, whereas the time interval corresponding to the cell may be 5 minutes. As in this example, when the time interval corresponding to the cell is different from the time interval corresponding to the section, the learning unit 141 may identify the time corresponding to the section that belongs to the time corresponding to the cell, perform statistical processing on the traffic density corresponding to the identified time, and obtain the traffic density after statistical processing as the traffic density for the time corresponding to the cell.

[0107] FIG. 14 is a diagram showing a schematic diagram of traffic density data used for learning. Referring to FIG. 14, cells 1 to n are shown from the upstream side to the downstream side of a road. The upstream end of cell 1 is the start point of the road, and the downstream end of cell n is the end point of the road. i is an arbitrary integer satisfying 1≦i≦N, and cell i is a target cell. Δt is a time interval corresponding to a cell. m is an integer equal to or greater than 1.

[0108] Also, referring to FIG. 14, the traffic densities K1(t) to K n (t) (vehicles / km) is shown. For example, the time t may be the current time, but the time t is not limited to the current time. Similarly, the traffic densities K1(t-Δt) to K n (t-Δt) is shown, and the traffic density K1(t-mΔt)~K n (t-mΔt) is shown.

[0109] In learning by the learning unit 141, traffic density data in which times t to t-mΔt, cells 1 to N, and traffic density K are associated with each other is used. Examples of learning by the learning unit 141 include percentile learning by the percentile learning unit 1414 and traffic density pattern learning by the traffic density pattern learning unit 1413. Such percentile learning and traffic density pattern learning will be described below.

[0110] (Percentile Learning Section 1414) The percentile learning unit 1414 functions as an example of a second learning unit, and performs percentile learning. Here, an overview of the percentile learning will be described with reference to Figs.

[0111] FIG. 15 is a diagram for explaining an overview of percentile learning. Referring to FIG. 15, a speed corresponding to a time and a distance from a starting point is indicated by the color density of a rectangular area corresponding to the time and the distance from the starting point. The distance from the starting point may correspond to a cell. In the following, the rectangular area (space-time range) corresponding to the time and the distance from the starting point is also called a "mesh."

[0112] For example, according to percentile learning, a time change G1 in traffic density at a distance C1 from the origin is stored in the learning parameter storage unit 127 as an example of learning model data 730. Similarly, a time change G2 in traffic density at a distance C2 from the origin is stored in the learning parameter storage unit 127 as an example of learning model data 730, and a time change G3 in traffic density at a distance C3 from the origin is stored in the learning parameter storage unit 127 as an example of learning model data 730.

[0113] Fig. 16 is a diagram showing an example of average traffic density percentile data 731 as an example of the learning model data 730. As shown in Fig. 16, the average traffic density percentile data 731 is configured by associating "point-to-point distance", "time", "average traffic density", and "average traffic density learning percentile value". Each of these items included in the average traffic density percentile data 731 will be described with reference to Fig. 18.

[0114] Fig. 17 is a diagram showing an example of mesh traffic density percentile data 732 as an example of the learning model data 730. As shown in Fig. 17, the mesh traffic density percentile data 732 is configured by associating "cell", "time", "traffic density", and "mesh traffic density learning percentile value". Each of these items included in the mesh traffic density percentile data 732 will be described with reference to Fig. 18.

[0115] 18 is a flowchart showing an example of the operation of percentile learning by percentile learning unit 1414. An example of the operation of percentile learning by percentile learning unit 1414 will be described with reference to FIG.

[0116] First, when the current time (third time) reaches a preset learning time, the percentile learning unit 1414 acquires traffic density data for a predetermined target time period based on the current time from the traffic density data storage unit 125 as new traffic density data (S31). The new traffic density data is traffic density data that has not yet been used for learning. Note that the reference third time does not have to be the current time. The reference third time may be a past time.

[0117] For example, the study time may be 2:00 every Monday. In this case, the predetermined target time may be one week. However, the specific values ​​of the study time and the predetermined target time are not limited. In the following, it is mainly assumed that the predetermined target time based on the current time is a time that starts from a time that is the predetermined target time before the current time and ends at the current time. However, the predetermined target time based on the current time is not limited to such a time.

[0118] The percentile learning unit 1414 calculates the average traffic density for a predetermined processing time width between two predetermined points at a predetermined processing time interval based on new traffic density data acquired from the traffic density data storage unit 125 (S32). The percentile learning unit 1414 stores the average traffic density in the learning parameter storage unit 127 in association with the "point-to-point" and "time" corresponding to the traffic density used to calculate the average traffic density.

[0119] For example, the distance between the points may be between two interchanges. However, the distance between the two points is not limited to this example. The processing time range may be a time range from a time that precedes the measurement time by a predetermined time range (e.g., 30 minutes) to the measurement time. However, the processing time range is not limited to this example. The processing time interval may be a 5-minute interval. However, the processing time interval is not limited to this example.

[0120] In the average traffic density percentile data 731 (FIG. 16), "cells h to j" to which the target cell i belongs are recorded in the "point-to-point" field as an example of a cell corresponding to the traffic density used to calculate the average traffic density. In addition, in the "time" field, the current time t is recorded as an example of a time corresponding to the traffic density used to calculate the average traffic density. In addition, in the "average traffic density", "32 vehicles / km" and "40 vehicles / km" are recorded.

[0121] The percentile learning unit 1414 classifies the average traffic densities so that the average traffic densities between the same points, at the same time, and of the same type of day to which the time belongs are grouped together. The type of day may be the day of the week, or may be a day of the week attribute (e.g., weekday, day before a holiday, first day of a three-day holiday, etc.). The percentile learning unit 1414 then calculates the percentile value of each average traffic density relative to the total average traffic densities for each group (hereinafter also referred to as the "average traffic density learning percentile value") (S34).

[0122] More specifically, the percentile learning unit 1414 sorts all the average traffic densities for each group in ascending order of average traffic density. Then, the percentile learning unit 1414 assigns an average traffic density learning percentile value to each average traffic density for each group in ascending order of average traffic density. For example, the 0th percentile value is assigned to the smallest average traffic density, the 100th percentile value to the largest average traffic density, and the 50th percentile value to the median average traffic density.

[0123] The percentile learning unit 1414 associates the average traffic density learning percentile value with the point-to-point distance, time, and average traffic density, and stores the association in the learning parameter storage unit 127 (S35).

[0124] In the average traffic density percentile data 731 (FIG. 16), a percentile value of "41" for "32 vehicles / km" is recorded as an example of an "average traffic density learning percentile value" corresponding to "average traffic density" = "32 vehicles / km". Also, a percentile value of "42" for "40 vehicles / km" is recorded as an example of an "average traffic density learning percentile value" corresponding to "average traffic density" = "40 vehicles / km".

[0125] Furthermore, the percentile learning unit 1414 classifies each traffic density (first traffic density) based on new traffic density data acquired from the traffic density data storage unit 125 so that traffic densities in the same cell and in the same day type to which the time belongs are grouped together. Then, the percentile learning unit 1414 calculates the percentile value of each traffic density with respect to the total traffic density (hereinafter also referred to as "mesh traffic density learning percentile value") for each group (S36).

[0126] The percentile learning unit 1414 associates the point-to-point distance, time, average traffic density, and average traffic density learning percentile value with the cell and mesh traffic density learning percentile value, and stores them in the learning parameter storage unit 127.

[0127] In the mesh traffic density percentile data 732 (FIG. 17), a percentile value of "38" for "34 vehicles / km" is recorded as an example of a "mesh traffic density learning percentile value" corresponding to "traffic density" = "34 vehicles / km". Also, a percentile value of "40" for "38 vehicles / km" is recorded as an example of a "mesh traffic density learning percentile value" corresponding to "traffic density" = "38 vehicles / km".

[0128] (Traffic density pattern learning unit 1413) The traffic density pattern learning unit 1413 functions as an example of a first learning unit, and performs traffic density pattern learning. Here, an overview of traffic density pattern learning will be described with reference to Figs.

[0129] Fig. 19 is a diagram for explaining an overview of traffic density pattern learning. Referring to Fig. 19, similar to Fig. 15, the speed corresponding to the time and the distance from the starting point is shown by the color density of the rectangular area corresponding to the time and the distance from the starting point. The distance from the starting point may correspond to a cell.

[0130] For example, according to traffic density pattern learning, a traffic density pattern consisting of multiple traffic densities from the traffic density h11 of a cell two cells upstream of a cell at a certain time to the traffic density h17 of a cell four cells downstream of the cell at the same time is associated with the traffic density h23 of the cell at the time following the given time, and a pattern H1 is stored in the learning parameter memory unit 127.

[0131] Similarly, according to traffic density pattern learning, patterns H2 to H4 in which a traffic density pattern consisting of multiple traffic densities ranging from the traffic density of a cell two upstream of another cell at another time to the traffic density of a cell four downstream of the cell at the same time are associated with the traffic density of the cell at the time following the same time are stored in the learning parameter memory unit 127.

[0132] 19, the traffic density pattern (traffic densities h11 to h17) is configured to include traffic densities corresponding to seven cells. However, the number of traffic densities included in the traffic density pattern is not limited to seven.

[0133] Fig. 20 is a diagram showing an example of a pattern in which the traffic density pattern and the next-time traffic density of a target cell are associated with each other. As shown in Fig. 20, the pattern stored in the learning parameter storage unit 127 is configured by associating the next-time traffic density of a cell with a traffic density pattern (a plurality of traffic densities from the traffic density of the cell two upstream of the cell to the traffic density of the cell four downstream of the cell). Details of such a pattern will be described with reference to Fig. 21.

[0134] 21 is a flowchart showing an example of an operation of learning a traffic density pattern by the traffic density pattern learning unit 1413. With reference to FIG. 21, an example of an operation of learning a traffic density pattern by the traffic density pattern learning unit 1413 will be described.

[0135] First, when the current time (third time) reaches a preset learning time, the traffic density pattern learning unit 1413 acquires traffic density data for a predetermined target time period based on the current time from the traffic density data storage unit 125 as new traffic density data (S41). The new traffic density data is traffic density data that has not yet been used for learning. Note that the reference third time does not have to be the current time. The reference third time may be a past time.

[0136] Next, the traffic density pattern learning unit 1413 identifies an upstream cell of the target cell for each time and for each cell based on the acquired traffic density (S42). More specifically, the traffic density pattern learning unit 1413 calculates the required time assuming that a vehicle travels through each simulation execution cell width 622 at the average speed in each cell from the target cell toward the upstream, calculates the sum of the required times, and identifies a cell where the sum reaches a preset time width as an upstream cell. At this time, an upper limit value (e.g., 1 km) of the distance from the target cell to the upstream cell may be set.

[0137] In addition, the traffic density pattern learning unit 1413 calculates the vehicle's travel distance assuming that the vehicle travels at a preset congestion wave propagation speed (e.g., 18 km / h) for the preset simulation execution time interval 621, adds a preset prediction pattern downstream margin (e.g., 200 m) to the calculated travel distance, and identifies a cell whose distance from the target cell corresponds to the resulting distance as a downstream cell (S43).

[0138] The traffic density pattern learning unit 1413 generates a relationship between the traffic density pattern 720, which includes the traffic density from the upstream cell to the downstream cell, and the traffic density of the target cell at the next time (fourth time), by corresponding them, and stores the relationship as a pattern in the learning parameter memory unit 127 (S44).

[0139] (Traffic density and speed to be predicted) As described above, the learning model data 730 is generated by percentile learning, and the traffic density pattern 720 is generated by traffic density pattern learning. The inference unit 142 can predict the traffic density and speed at a time after the current time by inference using the learning model data 730 and the traffic density pattern 720.

[0140] FIG. 22 is a diagram showing traffic density and speed to be predicted. As shown in FIG. 14, the traffic density data used for learning is shown in FIG. 22. The traffic densities K1(t) to K n (t) (vehicles / km) is shown. For example, the time t may be the current time, but the time t is not limited to the current time.

[0141] Similarly, the traffic density K1(t+Δt)~K of cells 1~n at time t+Δt n (t+Δt) is shown, and the traffic density K1(t+MΔt)~K n (t+MΔt) is shown.

[0142] In the inference by the inference unit 142, traffic flow characteristics corresponding to times t+Δt to t+MΔt (fourth time) and cells 1 to N are predicted. The following describes the prediction of such traffic flow characteristics. Note that at least one of traffic density K and speed V is given as an example of the traffic flow characteristics.

[0143] (Summary of prediction by inference unit 142) Next, an overview of the prediction by the inference unit 142 will be described. The inference unit 142 predicts traffic flow characteristics corresponding to times t+Δt to t+MΔt and cells 1 to N, based on the traffic density pattern 720 and the learning model data 730 generated as described above.

[0144] More specifically, the determining unit 1421 determines whether or not congestion occurs in the target cell i at the current time based on the traffic flow characteristic (first traffic flow characteristic) of the target cell i among the cells 1 to N at the current time.

[0145] The prediction unit 1422 determines a prediction algorithm for traffic flow characteristics (second traffic flow characteristics) of the target cell i at a time t+Δt to t+MΔt (second time) after the current time, based on whether or not it is determined that congestion occurs in the target cell i at the current time. Then, the prediction unit 1422 predicts the traffic flow characteristics of the target cell i using the determined prediction algorithm.

[0146] By such prediction, even if a traffic jam occurs due to an unexpected event, it can be determined whether a traffic jam has occurred or not according to the traffic flow characteristics. Then, when it is determined that a traffic jam has occurred, the traffic flow prediction algorithm is changed. This makes it possible to predict the traffic flow with higher accuracy. Moreover, the prediction unit 1422 predicts the traffic flow characteristics corresponding to the cells 1 to N by making a prediction while changing the target cell i among the cells 1 to N.

[0147] Here, the traffic flow characteristic used for the determination by the determining unit 1421 may be the traffic density (first traffic density) of the target cell at the current time. That is, the determining unit 1421 may determine whether or not congestion occurs in the target cell at the current time depending on whether or not the traffic density of the target cell at the current time is equal to or higher than a threshold.

[0148] However, in the following description, an example will be mainly described in which the traffic flow characteristic used in the determination by the determining unit 1421 is the speed (first speed) corresponding to the target cell at the current time. That is, the determining unit 1421 determines whether or not congestion occurs in the target cell at the current time depending on whether or not the speed corresponding to the target cell at the current time is equal to or less than a threshold.

[0149] The traffic flow characteristics (second traffic flow characteristics) predicted by the prediction unit 1422 may include at least one of a traffic density (second traffic density) and a speed (second speed).

[0150] When it is determined that a traffic jam occurs in the target cell at the current time, there is a possibility that the change in the traffic flow in the target cell does not match the data after statistical processing. Therefore, in such a case, the prediction unit 1422 may determine a prediction algorithm using the traffic density pattern 720 by the pattern match prediction unit 1423 (hereinafter, also referred to as "pattern match prediction") as the prediction algorithm. The pattern match prediction is an example of the "first prediction algorithm."

[0151] On the other hand, if it is determined that there is no congestion in the target cell at the current time, there is a possibility that the change in the traffic flow in the target cell matches the data after statistical processing. Therefore, in such a case, the prediction unit 1422 may determine, as the prediction algorithm, a prediction algorithm (hereinafter also referred to as "percentile prediction") using the learning model data 730 by the percentile prediction unit 1424. The percentile prediction is an example of a "second prediction algorithm" different from the "first prediction algorithm."

[0152] When the determination unit 1421 determines that the target cell is not congested at the current time, it identifies one or more congested cells that are congested at the current time, and determines whether the target cell belongs to a predetermined range based on the congested cells. This congested cell may be downstream of the congested section (downstream of the congested section) or at the end of the congested section (end of the congested section). Then, the prediction unit 1422 determines the pattern match prediction as the prediction algorithm when the target cell belongs to the predetermined range.

[0153] On the other hand, when the target cell does not belong to the predetermined range, the prediction unit 1422 determines the percentile prediction as the prediction algorithm. As a result, the pattern match prediction can be applied to the cell that does not belong to any of the congestion section, the congestion downstream section, and the congestion tail section.

[0154] FIG. 23 is a diagram that shows a schematic representation of the application range of percentile prediction and the application range of pattern match prediction. Referring to FIG. 23, the speed corresponding to the time and the position is shown. The darker the color of the spatiotemporal range, the lower the speed in that spatiotemporal range (the higher the traffic density). The "target time" corresponds to the current time, and the "prediction part" corresponds to the part of the traffic flow that is to be predicted.

[0155] 23, the "congested section due to an event" is a section in which congestion is determined to occur because the speed at the "target time" is equal to or lower than the congested flow determination speed 641. Therefore, pattern matching prediction is applied to the "congested section due to an event."

[0156] Furthermore, in addition to the "congested section due to an event", the "downstream of the traffic jam" and the "tail of the traffic jam" are also sections that are determined to be affected by the event. Therefore, pattern matching prediction is also applied to the "downstream of the traffic jam" and the "tail of the traffic jam". Percentile prediction is applied to the other sections.

[0157] (Percentile prediction unit 1424) 24 is a flowchart showing an example of the operation of percentile prediction by the percentile prediction unit 1424 according to the embodiment of the present invention. With reference to FIG. 24, an example of the operation of percentile prediction by the percentile prediction unit 1424 according to the embodiment of the present invention will be described.

[0158] First, the percentile prediction unit 1424 acquires probe data for a predetermined target time (first time) based on the current time (first time) from the probe data storage unit 122 as the latest probe data. Furthermore, the percentile prediction unit 1424 acquires traffic volume data for a predetermined target time based on the current time from the traffic volume data storage unit 124 as the latest traffic volume data (S51). Note that the first time serving as a reference does not have to be the current time. The first time serving as a reference may be a time in the past.

[0159] For example, the predetermined target time may be one hour. However, the specific value of each predetermined target time is not limited. In the following, the predetermined target time based on the current time is mainly assumed to be a time that starts from a time that is the predetermined target time before the current time and ends at the current time. However, the predetermined target time based on the current time is not limited to such a time.

[0160] Next, the percentile prediction unit 1424 calculates the traffic density of each cell between two preset points based on the acquired latest probe data and the latest traffic volume data (S52). Note that the traffic density calculation method described with reference to FIG. 13 can be applied to the calculation of the traffic density here.

[0161] Next, the percentile prediction unit 1424 calculates an average traffic density (first average traffic density) for a predetermined processing time span between points based on the traffic density for a predetermined target time span based on the current time. In the embodiment of the present invention, the percentile prediction unit 1424 calculates the average traffic density for the processing time span according to the current time (S53).

[0162] For example, the processing time range may be a time range from a time preceding the current time by a predetermined time range (e.g., 30 minutes) to the current time, but the processing time range is not limited to this example.

[0163] Next, the percentile prediction unit 1424 predicts the traffic density at a time after the current time based on the calculated average traffic density and the average traffic density, average traffic density learning percentile value, and mesh traffic density learning percentile value stored by the learning parameter memory unit 127.

[0164] For example, the percentile prediction unit 1424 acquires from the learning parameter storage unit 127 the average traffic density associated with a time that coincides with the reference time and with the same location-to-location pair as the location-to-location pair for which the average traffic density was calculated.

[0165] Alternatively, the percentile prediction unit 1424 may obtain from the learning parameter memory unit 127 an average traffic density that is associated with a time that matches the current time and is further associated with a time that belongs to the same type of day as the type of day to which the current time belongs.

[0166] Then, the percentile prediction unit 1424 obtains a predicted percentile value based on the calculated average traffic density and the acquired average traffic density (S54).

[0167] More specifically, the percentile prediction unit 1424 may specify, as the predicted percentile value, the average traffic density learned percentile value associated with the acquired average traffic density that is closest to the calculated average traffic density.

[0168] Alternatively, the percentile prediction unit 1424 may calculate the acquired average traffic density that is greater than the calculated average traffic density and closest to the calculated average traffic density as the upper average traffic density. Furthermore, the percentile prediction unit 1424 may calculate the acquired average traffic density that is less than the calculated average traffic density and closest to the calculated average traffic density as the lower average traffic density. Then, the percentile prediction unit 1424 may calculate the predicted percentile value by linear interpolation based on the upper average traffic density and the lower average traffic density.

[0169] The percentile prediction unit 1424 obtains from the learning parameter memory unit 127 the time, cell, and mesh traffic density learning percentile value associated with the same location-to-location pair for which the average traffic density was calculated from the current time to a predetermined set time later (e.g., two hours later).

[0170] Alternatively, the percentile prediction unit 1424 may acquire from the learning parameter memory unit 127 a time, cell, and mesh traffic density learning percentile value that is associated with the same location-to-location pair as the location-to-location pair for which the average traffic density was calculated from the current time until a predetermined set time later (e.g., two hours later), and that is associated with a time that belongs to the same type of day as the type of day to which the current time belongs.

[0171] The percentile prediction unit 1424 obtains a mesh traffic density learning percentile value corresponding to the predicted percentile value for each cell of the simulation execution cell width at the simulation execution time interval based on the time, cell, and mesh traffic density learning percentile value obtained from the learning parameter memory unit 127.

[0172] For example, the percentile prediction unit 1424 may obtain the mesh traffic density learned percentile value that is closest to the predicted percentile value.

[0173] Alternatively, the percentile prediction unit 1424 may calculate a mesh traffic density learning percentile value that is greater than the predicted percentile value and closest to the predicted percentile value as the upper mesh traffic density learning percentile value. Furthermore, the percentile prediction unit 1424 may calculate a mesh traffic density learning percentile value that is smaller than the predicted percentile value and closest to the predicted percentile value as the lower mesh traffic density learning percentile value. Then, the percentile prediction unit 1424 may calculate the predicted percentile value by linear interpolation based on the average traffic density on the upper side and the average traffic density on the lower side or linear interpolation by harmonic mean.

[0174] The percentile prediction unit 1424 obtains the traffic density associated with the mesh traffic density learned percentile value thus obtained as a predicted traffic density for each cell of the simulation execution cell width and for the simulation execution time interval.

[0175] Furthermore, the percentile prediction unit 1424 may calculate a predicted speed corresponding to the predicted traffic density for each cell of the simulation execution cell width and for each simulation execution time interval (S55). For example, the percentile prediction unit 1424 may calculate a predicted speed corresponding to the predicted traffic density by the KV relational expression shown by the above formula (3). The percentile prediction unit 1424 outputs the prediction result to the prediction result storage unit 128 (S56).

[0176] (Pattern match prediction unit 1423) 25 is a flowchart showing an example of an operation of the pattern match prediction by the pattern match prediction unit 1423 according to the embodiment of the present invention. With reference to FIG. 25, an example of the operation of the pattern match prediction by the pattern match prediction unit 1423 according to the embodiment of the present invention will be described.

[0177] First, the pattern match prediction unit 1423 acquires probe data for a predetermined target time period (first time period) based on the current time (first time period) from the probe data storage unit 122 as the latest probe data. Furthermore, the pattern match prediction unit 1423 acquires traffic volume data for a predetermined target time period based on the current time from the traffic volume data storage unit 124 as the latest traffic volume data (S61). Note that the first time period used as the reference does not have to be the current time. The first time period used as the reference may be a time in the past.

[0178] Using the same method as S42, the pattern match prediction unit 1423 calculates the traffic density of each cell between two preset points based on the acquired latest probe data and the latest traffic volume data (S62). Note that the method of calculating traffic density described with reference to FIG. 13 can also be applied to the calculation of the traffic density here.

[0179] Next, the pattern match prediction unit 1423 identifies upstream and downstream cells of the target cell for each time and for each cell based on the calculated traffic density (S63). The pattern match prediction unit 1423 predicts the traffic density of the target cell at the next time based on the traffic density pattern including the traffic density from the upstream cell to the downstream cell, the traffic density pattern stored in the learning parameter storage unit 127, and the traffic density associated with the traffic density pattern.

[0180] More specifically, the pattern matching prediction unit 1423 acquires a traffic density pattern similar to the traffic density pattern including the traffic densities from the upstream cell to the downstream cell from the learning parameter storage unit 127 (S64). Note that the pattern matching prediction unit 1423 may determine whether the traffic density patterns are similar to each other by determining whether an error calculated by the mean square error between the traffic density patterns is smaller than a predetermined error.

[0181] The pattern match prediction unit 1423 predicts the traffic density associated with the acquired traffic density pattern as the traffic density of the target cell at the next time (S65).

[0182] Furthermore, the pattern matching prediction unit 1423 may calculate a predicted speed corresponding to the predicted traffic density for each cell of the simulation execution cell width and for each simulation execution time interval (S66). For example, the pattern matching prediction unit 1423 may calculate a predicted speed corresponding to the predicted traffic density by the KV relational expression shown by the above formula (3).

[0183] Alternatively, when the predicted speed of the target cell at the next time is greater than the congested flow determination speed 641, the pattern match prediction unit 1423 may set the speed at the current time of the cell closest to the target cell among the cells located upstream of the target cell and whose speed at the current time is greater than the congested flow determination speed 641 as the predicted speed of the target cell at the next time. The pattern match prediction unit 1423 outputs the prediction result to the prediction result storage unit 128 (S67).

[0184] (Traffic flow prediction processing) Fig. 26 is a flowchart showing an example of a traffic flow prediction process executed by the inference unit 142. An example of the traffic flow prediction process executed by the inference unit 142 will be described with reference to Fig. 26. The traffic flow prediction process is a process for predicting a traffic flow at a time later than the current time based on a past traffic flow. The inference unit 142 makes a prediction by switching between percentile prediction and pattern match prediction according to the current traffic flow characteristics.

[0185] First, the inference unit 142 attempts to acquire event information corresponding to the current time and the target cell from the event information storage unit 120 (S71). For example, the event may be a predetermined event that affects the traffic flow characteristics of the target cell. If the inference unit 142 does not acquire event information corresponding to the current time and the target cell from the event information storage unit 120 ("NO" in S72), the percentile prediction unit 1424 performs percentile prediction for all times and all cells to be predicted from the current time until a predetermined set time (e.g., two hours later) (S75).

[0186] On the other hand, when event information corresponding to the current time and the target cell is obtained from the event information storage unit 120 ("YES" in S72), the inference unit 142 obtains the probe data stored in the probe data storage unit 122 (or from the prediction result storage unit 128) and the speed corresponding to the current time and the target cell (S73).

[0187] If the acquired speed is equal to or less than the congested flow judgment speed 641 ("YES" in S74), the inference unit 142 uses the pattern match prediction unit 1423 to perform pattern match prediction for the traffic density and speed of the target cell at the next time (S76). On the other hand, if the acquired speed is greater than the congested flow judgment speed 641 ("NO" in S74), the inference unit 142 uses the pattern match prediction unit 1423 to perform percentile prediction for the traffic density and speed of the target cell at the next time (S77).

[0188] As described above, instead of determining whether the speed is equal to or lower than the congested flow determination speed 641, it may be determined whether the traffic density is equal to or higher than a threshold. Also, when the predicted speed as a result of the pattern match prediction of the target cell by the pattern match prediction unit 1423 is equal to or higher than the congested flow determination speed 641, the speed corresponding to the target cell may be predicted again by the percentile prediction unit 1424, and the result of the pattern match prediction may be overwritten by the result of the re-prediction.

[0189] If the inference unit 142 has not completed prediction for all times and all cells to be predicted ("NO" in S78), it returns to S73, obtains the speeds for cells for which prediction has not been performed, and performs the operations from S74 onwards again. On the other hand, if the inference unit 142 has completed prediction for all times and all cells to be predicted ("YES" in S78), it ends the traffic flow prediction.

[0190] (Prediction result storage unit 128) The prediction result storage unit 128 stores the prediction results output from the prediction unit 142 (the pattern match prediction unit 1423 and the percentile prediction unit 1424).

[0191] The details of the embodiment of the present invention have been described above.

[0192] (1-2. Modifications) Next, a modified example of the embodiment of the present invention will be described. The modified example of the embodiment of the present invention is different from the embodiment of the present invention in the function of the inference unit 142. Therefore, the following describes the inference unit 142 according to the modified example of the embodiment of the present invention.

[0193] (Inference part 142) Fig. 27 is a flowchart showing an example of a traffic flow prediction operation by the inference unit 142 according to the modified example of the embodiment of the present invention. An example of an inference operation by the inference unit 142 according to the modified example of the embodiment of the present invention will be described with reference to Fig. 27.

[0194] Here, in the flowchart shown in Fig. 26, the prediction algorithm is switched according to the speed corresponding to the target cell. However, even if the speed corresponding to the target cell is higher than the congested flow judgment speed, if the time fluctuation of the traffic flow of the target cell becomes different from the conventional time fluctuation due to the influence of an event, it is preferable that the prediction is performed by the pattern match prediction unit 1423. Such a modified example will be described with reference to Fig. 27.

[0195] 27, in the modified example of the embodiment of the present invention as well, S71 to S78 are executed by the inference unit 142. These steps S71 to S78 are executed in the same manner as steps S71 to S78 (FIG. 26) according to the embodiment of the present invention.

[0196] However, due to the sudden restriction of traffic flow in the event occurrence section, the traffic density becomes extremely low in the free flow downstream of the event occurrence section (downstream of the congestion), and the time fluctuation of the traffic flow downstream of the congestion may become different from the usual time fluctuation.Alternatively, the free flow at the end of the congestion caused by the event is strongly affected by the extension or removal of the congestion, and the time fluctuation of the traffic flow at the end of the congestion may become different from the usual time fluctuation.

[0197] Therefore, when the speed is equal to or lower than the congested flow judgment speed 641 ("NO" in S74), the judgment unit 1421 judges whether or not the target cell is affected by an event (S81). If the target cell is affected by an event ("YES" in S81), the process switches to pattern match prediction (S76) by the pattern match prediction unit 1423. On the other hand, when the target cell is not affected by an event ("NO" in S81), the judgment unit 1421 performs percentile prediction (S77) by the percentile prediction unit 1424.

[0198] The above describes the modified embodiment of the present invention.

[0199] (1-3. Effects) As described above, according to the embodiment and the modified example of the present invention, the traffic density is calculated based on the driving history data and the traffic volume data, and percentile learning and traffic density pattern learning are performed based on the calculated traffic density. Then, switching is performed between percentile prediction and pattern match prediction according to the traffic flow characteristics. This allows the traffic flow to be predicted with high accuracy even if congestion occurs due to an unexpected event such as a traffic accident or traffic regulation.

[0200] Fig. 28 is a diagram showing a comparison between a prediction result by the traffic flow prediction according to the embodiment of the present invention and a prediction result by the traffic flow prediction according to the comparative example. With reference to Fig. 28, a description will be given of how the traffic flow prediction result differs between the traffic flow prediction according to the embodiment of the present invention and the traffic flow prediction according to the comparative example (an example in which the same prediction method is applied regardless of whether an event has occurred).

[0201] "Actual Measurement (before enlargement)" in Figure 28 is the actual measurement result on a day when congestion occurred due to the occurrence of an event. In the actual measurement result, the darker the space-time range, the higher the traffic density. "Actual Measurement (after enlargement)" is the result of enlarging the space-time range enclosed by the dotted frame R1 in "Actual Measurement (before enlargement)".

[0202] "Prediction by Comparative Example" is a result of enlarging the range corresponding to the spatiotemporal range enclosed by the dotted frame R1 among the prediction results by the traffic flow prediction according to the comparative example.

[0203] In the "prediction by the comparative example", pattern matching prediction is applied regardless of whether an event has occurred. However, since there is a possibility that a past traffic density pattern similar to the traffic density pattern at the location where the event has occurred cannot be found, it is difficult to predict the traffic flow at the location where the event has occurred. For example, according to the "prediction by the comparative example", it is difficult to accurately predict the free flow flowing into the congestion flow, and the traffic flow flowing into the congestion flow cannot be accurately predicted, so the extension of the congestion is not correctly predicted.

[0204] It should be noted that since a method of statistically predicting from past data, such as percentile prediction, has low accuracy, an example in which percentile prediction is applied regardless of whether an event has occurred is not shown as a comparative example.

[0205] "Prediction in this embodiment" is a result of expanding the range corresponding to the spatiotemporal range surrounded by the dotted frame R1 in the prediction result by the traffic flow prediction according to the embodiment of the present invention. In "prediction in this embodiment," the free flow flowing into the congestion flow is predicted with high accuracy by percentile prediction. Furthermore, by switching to pattern matching prediction when predicting the congestion section, it is possible to make a highly accurate prediction even if a congestion caused by an event occurs, and it can be understood that a prediction result close to the actual measurement result can be obtained.

[0206] The effects achieved by the traffic flow prediction device 1 according to the embodiment of the present invention and its modified examples have been described above.

[0207] (2. Hardware configuration example) Next, an example of the hardware configuration of the traffic flow prediction device 1 according to the embodiment of the present invention will be described.

[0208] In the following, an example of the hardware configuration of the information processing device 900 will be described as an example of the hardware configuration of the traffic flow prediction device 1 according to the embodiment of the present invention. Note that the example of the hardware configuration of the information processing device 900 described below is merely one example of the hardware configuration of the traffic flow prediction device 1. Therefore, in the hardware configuration of the traffic flow prediction device 1, unnecessary components may be deleted from the hardware configuration of the information processing device 900 described below, or new components may be added.

[0209] 29 is a diagram showing a hardware configuration of an information processing device 900 as an example of the traffic flow prediction device 1 according to an embodiment of the present invention. The information processing device 900 includes a CPU (Central Processing Unit) 901, a ROM (Read Only Memory) 902, a RAM (Random Access Memory) 903, a host bus 904, a bridge 905, an external bus 906, an interface 907, an input device 908, an output device 909, a storage device 910, and a communication device 911.

[0210] The CPU 901 functions as an arithmetic processing device and control device, and controls the overall operation of the information processing device 900 in accordance with various programs. The CPU 901 may also be a microprocessor. The ROM 902 stores programs and arithmetic parameters used by the CPU 901. The RAM 903 temporarily stores programs used in the execution of the CPU 901 and parameters that change appropriately during the execution. These are connected to each other by a host bus 904 consisting of a CPU bus etc.

[0211] The host bus 904 is connected to an external bus 906, such as a PCI (Peripheral Component Interconnect / Interface) bus, via a bridge 905. It is not necessary to configure the host bus 904, bridge 905, and external bus 906 separately, and these functions may be implemented in a single bus.

[0212] The input device 908 is composed of input means such as a mouse, keyboard, touch panel, button, microphone, switch, and lever for the user to input information, and an input control circuit that generates an input signal based on the user's input and outputs it to the CPU 901. A user who operates the information processing device 900 can input various data to the information processing device 900 and instruct the information processing device 900 to perform processing operations by operating this input device 908.

[0213] The output device 909 includes, for example, a display device such as a CRT (Cathode Ray Tube) display device, a Liquid Crystal Display (LCD) device, an OLED (Organic Light Emitting Diode) device, or a lamp, and an audio output device such as a speaker.

[0214] The storage device 910 is a device for storing data. The storage device 910 may include a storage medium, a recording device for recording data in the storage medium, a reading device for reading data from the storage medium, and a deleting device for deleting data recorded in the storage medium. The storage device 910 is configured, for example, with an HDD (Hard Disk Drive). This storage device 910 drives a hard disk and stores programs executed by the CPU 901 and various data.

[0215] The communication unit 911 is, for example, a communication interface configured with a communication device for connecting to a network, etc. Also, the communication unit 911 may be compatible with either wireless communication or wired communication.

[0216] An example of the hardware configuration of the traffic flow prediction device 1 according to the embodiment of the present invention has been described above.

[0217] (3. Summary) Although the preferred embodiment of the present invention has been described in detail above with reference to the accompanying drawings, the present invention is not limited to such an example. It is clear that a person having ordinary knowledge in the technical field to which the present invention pertains can conceive of various modified or altered examples within the scope of the technical ideas described in the claims, and it is understood that these also naturally belong to the technical scope of the present invention. [Explanation of symbols]

[0218] 1. Traffic flow prediction device 112 Probe Antenna 114 Free Flow Antenna 120 Event information storage unit 121 Driving history data storage unit 122 Probe data storage unit 123 Free Flow Data Storage Unit 124 Traffic volume data storage unit 125 Traffic density data storage unit 126 Master Data Storage Unit 127 Learning parameter memory unit 128 Prediction result memory unit 131 Statistical Processing Unit 133 Traffic Volume Calculation Department 140 Processing section 141 Learning Department 1411 KV Parameter Creation Section 1412 Traffic density calculation section 1413 Traffic Density Pattern Learning Unit 1414 Percentile Learning Department 142 Reasoning part 1421 Judgment section 1422 Prediction Department 1423 Pattern Match Predictor 1424 Percentile Prediction Section 150 Event information input section

Claims

1. a determination unit that determines whether or not congestion is occurring in a target cell at a first time based on a first traffic flow characteristic of the target cell at a first time among a plurality of cells that configure a road; a prediction unit that determines a prediction algorithm for a second traffic flow characteristic of the target cell at a second time that is after the first time, based on whether or not it is determined that congestion has occurred in the target cell at the first time, and predicts the second traffic flow characteristic using the determined prediction algorithm; An information processing device comprising:

2. The prediction unit is When it is determined that congestion occurs in the target cell at the first time, a first prediction algorithm is determined as the prediction algorithm; determining, when it is determined that no congestion occurs in the target cell at the first time, a second prediction algorithm different from the first prediction algorithm as the prediction algorithm; The information processing device according to claim 1 .

3. the determination unit determines whether or not a predetermined event affecting the first traffic flow characteristic has occurred based on event information occurring on the road, and, if the predetermined event has occurred, determines whether or not congestion has occurred in the target cell at the first time; The information processing device according to claim 2 .

4. The determination unit determines the second prediction algorithm as the prediction algorithm when the predetermined event has not occurred. The information processing device according to claim 3 .

5. When it is determined that no congestion occurs in the target cell at the first time, the determination unit determines whether or not the target cell belongs to a predetermined range based on one or more congested cells in which congestion occurs at the first time among the plurality of cells; The prediction unit determines the first prediction algorithm as the prediction algorithm when the target cell belongs to the predetermined range. The information processing device according to claim 2 .

6. The prediction unit determines the second prediction algorithm as the prediction algorithm when the target cell does not belong to the predetermined range. The information processing device according to claim 3 .

7. The information processing device includes: a first learning unit that acquires a combination of a traffic density at a third time of each cell from an upstream cell with respect to the target cell to a downstream cell with respect to the target cell, and a traffic density of the target cell at a fourth time after the third time, as a pattern; The first prediction algorithm comprises: an algorithm for predicting the second traffic flow characteristic based on a traffic density at the first time of each cell from the upstream cell to the downstream cell and the pattern; The information processing device according to claim 2 .

8. The information processing device includes: a second learning unit that calculates a plurality of average traffic densities based on traffic densities for a predetermined time period acquired based on a third time period between predetermined points, calculates a percentile value of each of the plurality of average traffic densities in the plurality of average traffic densities, and calculates a percentile value of each of the plurality of traffic densities in the plurality of traffic densities based on a plurality of traffic densities of the target cell at the third time period; The second prediction algorithm comprises: an algorithm for calculating a first average traffic density based on a traffic density for a first time period acquired based on the first time between the specified points, and predicting the second traffic flow characteristic based on the first average traffic density, the plurality of average traffic densities, percentile values ​​of each of the plurality of average traffic densities, and percentile values ​​of each of the plurality of traffic densities; The information processing device according to claim 2 .

9. the first traffic flow characteristic is a first traffic density; The determination unit determines whether or not congestion occurs in the target cell at the first time based on whether or not the first traffic density is equal to or greater than a threshold. The information processing device according to claim 1 .

10. the first traffic flow characteristic is a first speed of a vehicle traveling in the target cell; The determination unit determines whether or not congestion occurs in the target cell at the first time based on whether or not the first speed is equal to or less than a threshold. The information processing device according to claim 1 .

11. the second traffic flow characteristic is a second traffic density; The information processing device according to claim 1 .

12. determining whether or not congestion is occurring in a target cell at a first time based on a first traffic flow characteristic of the target cell at a first time among a plurality of cells constituting a road; determining a prediction algorithm for a second traffic flow characteristic of the target cell at a second time after the first time based on whether or not congestion has occurred in the target cell at the first time, and predicting the second traffic flow characteristic using the determined prediction algorithm; 2. An information processing method implemented by a computer, comprising:

13. Computer, a determination unit that determines whether or not congestion is occurring in a target cell at a first time based on a first traffic flow characteristic of the target cell at a first time among a plurality of cells that configure a road; a prediction unit that determines a prediction algorithm for a second traffic flow characteristic of the target cell at a second time that is after the first time, based on whether or not it is determined that congestion has occurred in the target cell at the first time, and predicts the second traffic flow characteristic using the determined prediction algorithm; A program that causes the information processing device to function as an information processing device having the above-mentioned.

Citation Information

Patent Citations

  • Travel time prediction method, device and program

    JP2005196238A

  • Travel time prediction device and method

    JP2007219633A

Cited By

  • Traffic overflow detection method and system, computer equipment and computer program product

    CN121148160A