EP2323115A1 - Method and apparatus for predicting traffic jam area - Google Patents

Method and apparatus for predicting traffic jam area Download PDF

Info

Publication number
EP2323115A1
EP2323115A1 EP10190190A EP10190190A EP2323115A1 EP 2323115 A1 EP2323115 A1 EP 2323115A1 EP 10190190 A EP10190190 A EP 10190190A EP 10190190 A EP10190190 A EP 10190190A EP 2323115 A1 EP2323115 A1 EP 2323115A1
Authority
EP
European Patent Office
Prior art keywords
traffic jam
jam
time
mesh
traffic
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Withdrawn
Application number
EP10190190A
Other languages
German (de)
English (en)
French (fr)
Inventor
Jun Yamazaki
Takumi Fushiki
Kenichiro Yamane
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Hitachi Ltd
Original Assignee
Hitachi Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Hitachi Ltd filed Critical Hitachi Ltd
Publication of EP2323115A1 publication Critical patent/EP2323115A1/en
Withdrawn legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G08—SIGNALLING
    • G08G—TRAFFIC CONTROL SYSTEMS
    • G08G1/00—Traffic control systems for road vehicles
    • G08G1/01—Detecting movement of traffic to be counted or controlled
    • G08G1/0104—Measuring and analyzing of parameters relative to traffic conditions

Definitions

  • This invention relates to a navigation system, or in particular, to a system for calculating a traffic jam area and providing a route avoiding the traffic jam area.
  • the technique to lead and guide an automotive vehicle along a route from the present place to a destination using a navigation system has extended, in which the user searches for an optimum route by setting the conditions such as the shortest time, the shortest distance and the priority of an ordinary road.
  • the car navigation system searches for a route of the shortest time required to the destination using the real-time traffic information and the statistical traffic information.
  • the range of a traffic jam area expected to prevail on the route of the shortest time at about the time when the vehicle is scheduled to arrive at the traffic jam area is predicted, and at an intersection before the predicted traffic jam area, the vehicle begins to follow a detour route meeting the conditions desired by the user thereby to avoid the predicted traffic jam area.
  • JP-A-2008-268149 discloses a technique whereby the size of an area to be avoided is calculated in accordance with the time elapsed from the occurrence of an accident and a route to avoid the particular area is searched for.
  • JP-A-2007-285998 In applying the technique described in JP-A-2007-285998 to an unexpected traffic jam, though capable of predicting and avoiding the extension or shrinkage of the unexpected traffic jam on the predicted route of the shortest time along which the vehicle is being led and guided, it is impossible to predict a traffic jam which may occur on a detour route. In order to avoid an unexpected traffic jam positively, a traffic jam which may occur unexpectedly on the detour route is also required to be predicted, and the vehicle, if liable to be involved in it, is required to find another detour route.
  • the search process is required to be repeated to avoid an unexpected traffic jam positively. This increases both the number of times the route search is made and the calculation amount. In such a case, a recommended route is liable to change frequently very inconveniently for the user. Further, in view of the fact that a route is set without taking the future situation into consideration, the probability is high that no traffic jam can be avoided.
  • the jam-affected area an area affected by the traffic jam
  • a method of predicting a traffic jam area comprising a step of acquiring the traffic information including the information on an unexpected event, a traffic jam arrival time prediction step for predicting, for each mesh, at least one of the starting time and the ending time of the traffic jam due to the unexpected event, a step of predicting the arrival time from the starting place for each mesh around a starting position based on the starting position and the starting time, and a jam-affected area calculation step for calculating the area expected to be affected by the traffic jam in the future, and an apparatus for executing the method.
  • a method of predicting a traffic jam area preferably further comprising a display step for displaying a plurality of jam-affected areas in superposed relation to each other on a map, and/or a step of searching for a route by resetting the jam-affected areas in such a manner as to increase a link cost of the link contained in the jam-affected areas thus determined.
  • a jam-affected area is set as an area where a traffic jam is liable to be encountered in the future.
  • the mesh data 210 includes a mesh ID 211 and an in-mesh average speed 212.
  • the mesh ID 211 indicates the identification code of each mesh and is assigned regularly in accordance with the position of the mesh on the map.
  • a mesh ID of a mesh adjacent to a given mesh can be determined from the mesh ID 211 of the given mesh.
  • the in-mesh average speed 212 is stored as the average value of a travel speed 224 described later for the link included in a mesh.
  • the link data 220 is configured of a link ID 221 indicating the identification code of each link, a road category 222 classified into a toll road and an ordinary national road, a link length 223 indicating the length of each link, a travel speed 224 indicating the average speed to pass through the link and a travel time 225 indicating the time required for passing through the link.
  • the restricted speed for each link is stored as the travel speed 224.
  • the travel speed 224 may alternatively be the statistical traffic information generated in accordance with the day type (day of the week, weekday/Saturday/holiday, "gotohbi"-days in which loads are apt to be crowded due to a certain old Japanese custom, weather, etc.) of the days for prediction. Assuming that a plurality of past days correspond to the day type of the prediction day, the statistical value such as the central value or the average value of the travel speed on a link for the same time zone of the plurality of the days corresponds to the statistical travel time of the link. In the case where the statistical traffic information is used, the traffic information for each time zone of each day type is stored for each one of the links.
  • the travel time 225 may alternatively be a value obtained by dividing the link length 223 by the travel speed 224.
  • the prediction unit 130 is configured of a traffic information receiver 131, a present position acquisition unit 132, a traffic jam determining unit 133, a traffic jam arrival time prediction unit 134, an arrival time prediction unit 135 and a prediction information storage unit 136.
  • the traffic information receiver 131 receives the real-time traffic information and the unexpected event information from a FM multiplex broadcast receiver, a beacon receiver, a portable phone or a radio, and sends them to the traffic jam determining unit 133.
  • the real-time traffic information includes the travel time and the traffic level for each link.
  • the unexpected event information includes the restrictions (closed road, one-way traffic control, etc.), a causative event (accident, construction work, etc.), the road type of the restricted link, the restricted position, the restriction starting time, etc.
  • the FM multiplex broadcast receiver receives the general traffic information (figure, etc.) and the text information transmitted as a FM multiplex broadcast signal by a FM broadcast station.
  • the general traffic information and the text information are generated based on the real-time traffic information transmitted from a traffic information center to the FM broadcast station.
  • the beacon receiver receives the detailed real-time traffic information transmitted by a traffic control center through a beacon providing an on-road communication unit. This real-time traffic information is the one that has been transmitted to the traffic control center of each area from the traffic information center.
  • the FM multiplex broadcast receiver and the beacon receiver may receive, as the real-time information, the vehicle information (time, running speed, running position, etc.) sent from a floating car and related to the link corresponding to the running position.
  • the present position acquisition unit 132 calculates the position of the starting place and acquires the present time. In the process, the position is calculated based on the information acquired from at least one of the vehicle speed sensor, the gyro sensor and the GPS receiver.
  • the vehicle speed sensor measures the running distance based on the product of the circumference of a wheel and the r.p.m. of the wheel on the one hand and the angle of a curve followed by the vehicle based on the r.p.m. difference between a pair of the wheels on the other hand.
  • the gyro sensor is configured of an optical fiber gyro or a vibration gyro and detects the angle of rotation of the vehicle on which the sensor is mounted.
  • the starting place is defined as the position of the user's vehicle having the traffic information system 110 as an on-vehicle device.
  • the starting point is defined as a point designated by the user or the user's vehicle position notified from an on-vehicle terminal.
  • the traffic jam determining unit 133 by taking the position information acquired from the present position acquisition unit 132 into consideration, determines whether a traffic jam liable to have the starting place on the vehicle has occurred or may occur in the future, based on the real-time traffic information and the unexpected event information received by the traffic information receiver 131.
  • the traffic jam determining unit 133 determines that a traffic jam liable to have an effect on the starting place has occurred or will occur in the future. Upon determination that a traffic jam liable to have an effect on the starting place has occurred or will occur in the future, the real-time traffic information and the unexpected event information are sent to the traffic jam arrival time prediction unit 134.
  • the traffic jam arrival time prediction unit 134 calculates the traffic jam starting time and the traffic jam ending time for each mesh around the unexpected event occurrence position based on the real-time traffic information and the unexpected event information acquired from the traffic jam determining unit 133 and the basic map information acquired from the basic map information DB 120.
  • the traffic jam starting time and the traffic jam ending time calculated for each mesh are sent to the prediction information storage unit 136.
  • the arrival time prediction unit 135 calculates the arrival time from the starting place for each mesh around the starting place based on the starting place position information acquired from the present position acquisition unit 132 and the basic map information acquired from the basic map information DB 120. The arrival time from the starting place calculated for each mesh is sent to the prediction information storage unit 136.
  • the prediction information storage unit 136 stores therein the arrival time, the traffic jam starting time and the traffic jam ending time for each mesh which have been sent from the traffic jam arrival time prediction unit 134 and the arrival time prediction unit 135.
  • An example of the configuration of the prediction information stored in the prediction information storage unit 136 is shown in Fig. 9 .
  • the arrival time, the traffic jam starting time and the traffic jam ending time are recorded one by one for each mesh ID.
  • the jam-affected area calculation unit 140 reads the arrival time for each mesh, the traffic jam starting time and the traffic jam ending time from the prediction information storage unit 136, and determines whether each mesh is included in the jam-affected area or not. The result of this determination is sent to the display unit 160.
  • the display map information DB 150 contains the information on the roads and other structures required for displaying a map. Examples of the information thus contained include the position coordinate of the complementary point of the link, the water system data such as the shape of shorelines, lakes and rivers, the data on administrative boundary positions, the data on railway positions, the data on the position/shape of facilities and the display position data such as place names.
  • the display unit 160 is configured of a map display unit 161 and a display 162.
  • the map display unit 161 acquires the map information from the display map information DB 150, and sends a plot command to the display 162 to plot marks indicating the roads or other structures in the map and the starting place according to a designated plotting method (plan view, bird's-eye view, etc.) on a designated scale. Also, a plot command is sent to the display 162 to display the mesh appearance in a manner different from the normal mesh appearance (for example, by changing the color) to permit the user watching the display 162 to recognize the mesh determined as existent in the jam-affected area by the jam-affected area calculation unit 140.
  • the map display unit 161 may send a plot command to display the particular mesh in the ordinary color.
  • a predetermined threshold value is determined, and in the case where the number of links included in a mesh determined existent in the jam-affected area by the jam-affected area calculation unit 140 is not less than the threshold value, then the particular mesh is displayed as existent in the jam-affected area, while in the case where the number of links included in the mesh is less than the threshold value, on the other hand, the particular mesh is displayed as existent outside the jam-affected area.
  • the display 162 is configured of a CRT or a liquid crystal display, and displays the map screen based on the plot command transmitted thereto from the map display unit 161.
  • Fig. 11 shows an example of the screen displayed on the display 162.
  • the display 162 displays the jam-affected area together with the starting place, roads and facilities on the map, and thus can indicate the traffic jam area affecting the starting place into the future. As a result, the user can change the route by himself.
  • the configuration of the traffic information system 110 described above makes it possible to predict the future situation and determine the traffic jam area having an effect on the starting place. By avoiding this area, therefore, the traffic jam can be positively avoided into the future.
  • Fig. 3 is a flowchart showing all the processing steps executed in the traffic information system 110 according to an embodiment of the invention.
  • the traffic information system 110 first acquires the real-time traffic information and the unexpected event information from the FM multiplex broadcast receiver or the beacon receiver, and fetches it into the traffic information receiver 131 (step S40). This step is executed at regular time intervals of, say, 5 minutes.
  • the traffic jam determining unit 133 determines whether a traffic jam which may have an effect on the starting place has occurred or may occur or not in the future (step S41).
  • the traffic jam determining unit 133 determines that a traffic jam liable to have an effect on the starting place has occurred or will occur in the future.
  • the real-time traffic information and the unexpected event information are sent to the traffic jam arrival time prediction unit 134 (YES in step S41).
  • the process in the traffic information system 110 is finished (NO in step S41).
  • the traffic jam determining unit 133 also determines whether the information on the unexpected event received by the traffic information receiver 131 is the same as the previously received information on an unexpected event, and upon determination that it is the same as the previously received information, the process in the traffic information system 110 may be finished.
  • the determination as to whether both information are on the same unexpected event is made by determining, for example, whether both the position and time of occurrence of the two seemingly different unexpected events are the same or not. By doing so, the prediction process is not required to be executed a plurality of times for one unexpected event, and the calculation amount reduced.
  • the traffic jam arrival time prediction unit 134 calculates the traffic jam starting time and the traffic jam ending time for each mesh based on the real-time traffic information and the unexpected event information sent thereto from the traffic jam determining unit 133 (step S42).
  • the traffic jam starting time and the traffic jam ending time thus calculated are stored in the prediction information storage unit 136.
  • the arrival time prediction unit 135 calculates the arrival time from the starting place for each mesh, and the arrival time from the starting place thus calculated is stored in the prediction information storage unit 136 (step S43).
  • the jam-affected area calculation unit 140 reads the arrival time from the starting place, the traffic jam starting time and the traffic jam ending time for each mesh from the prediction information storage unit 136 and determines whether each mesh is included in the jam-affected area or not Then, a plot command is sent from the map display unit 161 to the display 162 to acquire the map information for the neighborhood of the starting place from the display map information DB 150 and display the map screen (step S44).
  • the map display unit 161 receives the mesh ID determined as included in the jam-affected area from the jam-affected area calculation unit 140, and sends a command to the display 162 to change the display color of the particular mesh to a designated color.
  • Figs. 11A and 11B show examples of display on the display 162.
  • the starting place is indicated by a triangle on the map, the unexpected event occurrence position by a star and the main roads by black lines.
  • each mesh is indicated by a square grid defined by dotted line and each mesh determined as included in the jam-affected area by hatching.
  • the jam-affected area may be displayed taking the areas such as a sea or a lake free of roads and the areas such as a mountain having few roads into consideration.
  • Fig. 11B shows an example of display on the display 162 taking the areas having no or few roads into consideration.
  • the future traffic level can be predicted and the traffic jam area having the starting place can be determined.
  • the traffic jam area can be positively avoided in the future.
  • Fig. 4 is a flowchart for explaining the detailed process of step S42 in the traffic jam arrival time prediction unit 134.
  • step S50 the real-time traffic information and the unexpected event information are acquired from the traffic jam determining unit 133.
  • step S51 various parameters for determining a traffic jam propagation model are set using the real-time traffic information and the unexpected event information thus acquired. By setting the various parameters in the traffic jam propagation model, the future traffic level can be predicted.
  • FIG. 5 An example of the traffic jam propagation model is explained with reference to Figs. 5 and 6 .
  • the traffic jam area is assumed to expand and shrink while maintaining the shape of a donut having the center at the place of occurrence of an unexpected event, and the positions of the outer and inner edges of the traffic jam area undergo a change.
  • a graph indicating the change, with time, in the distance of the outer and inner edges of the traffic jam area from the position of occurrence of the unexpected event is shown in (a) of Fig. 6 .
  • the abscissa represents the time and the ordinate the distance from the position of occurrence of the unexpected event.
  • a graph indicating the change, with time, in the displacement rate of the outer and inner edges of the traffic jam area is shown in (b) of Fig. 6 .
  • the abscissa represents the time, and the ordinate the displacement rate of the outer and inner edges of the traffic jam area.
  • the direction outward of the position of occurrence of the unexpected event is taken as a positive value.
  • the traffic jam occurs at time T1 and ends at time T5.
  • the outer edge of the traffic jam area expands outward at a predetermined rate Vj 1 ( ⁇ 0) between time points T1 and T2, remains unchanged between time points T2 and T4, and shrinks inward at a predetermined rate Vj3 ( ⁇ 0) between time points T4 and T5.
  • the inner edge of the traffic jam area has yet to exist between time points T1 and T3, and expands outward at a predetermined rate Vj2 ( ⁇ 0) between time points T3 and T5.
  • step S51 the various parameters designated by T1, T2, T3, T4, T5, Vj1, Vj2, Vj3 shown in (a) of Fig. 6 are set using the real-time traffic information and the unexpected event information.
  • the values of the various parameters are determined in advance for all the situations indicated by the specifics of restriction (closed road, one-way traffic control), the causative event (accident, construction, etc.), the road category of the link to be restricted, the position restricted and the restriction starting time.
  • the values determined statistically from the information on the past unexpected traffic jams which have occurred in a similar situation may be used as the values of the various parameters.
  • the various parameters may be set either uniformly for the whole of a single unexpected traffic jam or for each of the areas defined at a predetermined angle around the position of occurrence of the unexpected event.
  • step S52 the traffic jam starting time and the traffic jam ending time are calculated for each mesh using the traffic jam propagation model based on the various parameters set in step S51 and the basic map information acquired from the basic map information DB 120.
  • a mesh for which the traffic jam starting time and the traffic jam ending time are calculated is selected on condition that the distance between the position of occurrence of the unexpected event and the representative point of the mesh (for example, the center of the mesh) is in a predetermined range (for example, not more than 100 km).
  • the traffic jam starting time and the traffic jam ending time thus calculated are stored in the prediction information storage unit 136.
  • a specific process for calculating the traffic jam starting time and the traffic jam ending time for a mesh is explained.
  • a mesh on the map is expressed as a square grid in (c) of Fig. 6 .
  • the distance between the unexpected event occurrence position 601 and the representative point of each mesh (for example, the center of the mesh) is calculated.
  • the distance between the unexpected event occurrence position 601 and the mesh ml is given as d1
  • the distance between the unexpected event occurrence position 601 and the mesh m2 is given as d2.
  • Equation 1 the position changes of the inner and outer edges of the traffic jam area in (a) of Fig. 6 are expressed by Equation 1 and Equation 2, respectively.
  • d the distance from the unexpected event occurrence position and t the time. From these equations, the traffic jam area at time t is considered to satisfy Equation 3.
  • Equation 3 g t ⁇ d ⁇ f t
  • the traffic jam ending time for the mesh is determined as time t satisfying the conditions 3 and 4 described below.
  • neither the traffic jam starting time nor the traffic jam ending time can be calculated as described above, it indicates that the traffic jam area fails to propagate to the particular mesh, and "no data" is stored in the corresponding section of the prediction information storage unit 136.
  • the traffic jam starting time and the traffic jam ending time for each mesh are calculated by the process described above.
  • Fig. 7 is a flowchart for the process executed by the arrival time prediction unit 135.
  • the present position acquisition unit 132 acquires the present position calculated based on the information received from a vehicle speed sensor, a gyro sensor, a GPS receiver, etc.
  • the moving speed between meshes is set (S81).
  • the in-mesh average speed 212 contained in the mesh data of the basic map information DB 120 is used as the moving speed.
  • the moving speed between meshes may be calculated by determining the average value for the meshes after changing the travel speed of the link included in the traffic jam area based on the traffic level predicted in advance by the traffic jam arrival time prediction unit 134. Then, the arrival time from the starting place for each mesh is calculated using the set moving speed between meshes and the basic map information acquired from the basic map information DB 120 (step S82).
  • each mesh is expressed as a square grid, and the representative point of each mesh by a black circle, on which the moving time between the meshes is noted.
  • the minimum time required to arrive at the representative point of each mesh from the starting point can be determined by applying the Dijkstra's algorithm on the assumption that a link having the inter-mesh average moving time as a link cost exists between the representative points of the meshes.
  • the time to arrive at each mesh can be calculated.
  • the mesh for which the arrival time is calculated is selected, for example, on condition that the distance between the starting place and the representative point of the mesh (for example, the center of the mesh) is within a predetermined range (for example, not more than 100 km).
  • Fig. 8 the arrival time at each mesh is noted on the particular mesh with the upper left mesh as the starting place and the starting time as 9:00.
  • step S44 executed by the jam-affected area calculation unit 140 is explained in detail with reference to Fig. 10 .
  • This process is executed for each mesh included in a given area.
  • Each area is selected, for example, as a mesh satisfying the condition that the distance between the starting place and the representative point of the particular mesh (for example, the center of the mesh) is within a predetermined range (for example, not more than 100 km).
  • the jam-affected area calculation unit 140 reads the arrival time from the starting place, the traffic jam starting time and the traffic jam ending time for a given mesh from the prediction information storage unit 136 (S 110). Let Ts be the arrival time, Tj 1 the traffic jam starting time and Tj2 the traffic jam ending time for each mesh.
  • Fig. 9 shows an example of the format of the arrival time from the starting place, the traffic jam starting time and the traffic jam ending time stored for each mesh in the prediction information storage unit 136. Assume that the prediction information storage unit 136 stores therein the data on the format shown in Fig. 9 for each mesh within a predetermined area from the mesh corresponding to the starting place.
  • Step S111 determines whether the data on the arrival time Ts is contained in the data read from the prediction information storage unit 136 for the mesh to be processed. In the absence of such data ("no data" in S111), the particular mesh is determined not included in the jam-affected area (S117). This is the situation indicated by the data example having the mesh ID of "45678901" in Fig. 9 .
  • step S 112 determines whether the data on the traffic jam starting time Tj 1 for the particular mesh is available or not. In the case where no such data is available ("no data" in step S112), step S 117 determines that the particular mesh is not included in the jam-affected area. This is the situation indicated by the data example having the mesh ID of "34567890" in Fig. 9 .
  • step S113 determines whether the data on the traffic jam starting time Tj2 for the particular mesh is existent or not. In the absence of such data ("no data” in step S 113).
  • Step S116 determines whether Equation 4 below is satisfied or not. In the case where Equation 4 is satisfied (YES in step S 116), the particular mesh is determined as included in the jam-affected area, while in the case where Equation 4 is not satisfied (NO in step 116), on the other hand, step S117 determines that the particular mesh is not included in the jam-affected area.
  • step S 115 determines whether Equation 5 shown below is satisfied or not. In the case where Equation 5 is satisfied (YES in step S115), the particular mesh is determined as included in the jam-affected area (S 115). In the case where Equation 5 is not satisfied (NO in step S 116), on the other hand, the particular mesh is determined as not included in the jam-affected area (S 117). Tj ⁇ 1 ⁇ Ts ⁇ Tj ⁇ 2
  • the process described above is executed for each mesh in a predetermined area.
  • This process determines for each mesh whether it is included the am-affected area or not. This determination for each mesh by the jam-affected area calculation unit 140 whether the particular mesh is included in the jam-affected area or not reduces the calculation amount and shortens the processing time.
  • the jam-affected area may be determined not for each mesh but for each link.
  • the arrival time is calculated for each link by at least one of the traffic jam arrival time prediction unit 134 and the arrival time prediction unit 135.
  • the traffic jam arrival time prediction unit 134 calculates the traffic jam starting time and the traffic jam ending time for each link in the process of step S42, unlike in the process explained with reference to Fig. 6 , the distance between the unexpected event occurrence position and the representative point of the link (for example, the intermediate point of the link) without using the distance between the unexpected event occurrence position and the representative point of the mesh.
  • the time required to reach each link is calculated using the normal Dijkstra's algorithm is used for each link instead of the process of calculating the arrival time for each mesh explained with reference to Fig. 8 .
  • the link ID is stored in place of the mesh ID in the prediction information storage unit 136, and the arrival time from the starting place, the traffic jam starting time and the traffic jam ending time are recorded one by one for each link ID.
  • the jam-affected area can be calculated more accurately than in the prediction for each mesh.
  • the prediction process may be executed a plurality of times for one unexpected event. By doing so, the prediction accuracy is further increased, and the proper jam-affected area can be calculated.
  • the vehicle arrival time, the traffic jam starting time and the traffic jam ending time previously calculated are stored in the process of steps S42 and S43.
  • the process of step S44 may be executed.
  • the calculation of the jam-affected area is repeated only in the case where the difference between the previous prediction result and the present traffic level increases for the same unsuspected event. As compared with a case in which all the steps are repeated each time the traffic information is received, therefore, the calculation amount can be reduced.
  • Fig. 12 is a diagram showing the configuration of a traffic information system 1410 in which a route search unit 1420 having the function of searching for a route connecting the starting place and the destination is added to the traffic information system 110 shown in Fig. 1 .
  • Fig. 13 is a flowchart showing the processing steps for the traffic information system 1410.
  • the steps to execute the same process as those of the flowchart shown in Fig. 3 are designated by the same reference numerals, respectively.
  • the second embodiment has added thereto a route search process (S150) in the route search unit 1420.
  • Step S150 searches for the route of the shortest time from the starting place to the destination using the Dijkstra's algorithm or the like.
  • the link cost is set using the travel time 225 contained for each link in the basic map information DB 120.
  • the link cost may be set using the statistical traffic information contained in the basic map information DB 120.
  • the link cost may be set using the real-time traffic information acquired from the traffic information receiver 131.
  • the route search unit 1420 acquires, from the jam-affected area calculation unit 140, the ID of the mesh determined in step S44 as included in the jam-affected area, and resets the link cost for the link included in the mesh determined as included in the jam-affected area.
  • the average speed in the jam-affected area for example, is uniformly set (for example, at 5 km/h), and the link length 223 of each link is divided by the average speed in the jam-affected area to produce a link cost.
  • the link cost may be set at a smaller value, the nearer to an end of the traffic jam area, and at a larger value, the nearer to the center of the traffic jam area. This is by reason of the fact that the reliability of the traffic jam prediction result is low at an end, and high at the center of the traffic jam area.
  • the link cost C(d) for the distance d from the unexpected event occurrence position is determined according to Equation 6 below, where N( ⁇ , ⁇ 2 ) indicates the normal distribution of the mean ⁇ and the variance ⁇ 2 .
  • C d 1 + N ⁇ C ⁇ 2 dm / C ⁇ 1 dm , do - di / 2 x C ⁇ 1 d , di ⁇ d ⁇ do
  • C d C ⁇ 1 d , di ⁇ di or d ⁇ do
  • the center of the traffic jam area having a high prediction reliability is positively avoided on the one hand, while a route passing through an end of the traffic jam area low in prediction reliability may be selected depending on the traffic situation and the relative positions of the starting place and the destination on the other hand. Specifically, a route can be searched for properly in keeping with the traffic situation.
  • the map display unit 161 sends a command to the display 162 to display the map with a different color of the mesh determined as included in the jam-affected area.
  • the display 162 may display a recommended route after a repeated search based on the route information acquired from the route search unit 1420.
  • the mesh for which the traffic jam arrival time is calculated may be determined in step S52 shown in Fig. 4 on condition that the representative point of the mesh is located in a predetermined area including the destination and the starting place.
  • This predetermined area may be included in an ellipse with the two focal points at the starting place and the destination.
  • a similar process may also be executed in the case where the representative point of the mesh is located in the predetermined area including the destination and the starting place.
  • each process is executed subsequently only for the mesh highly liable to be passed through, thereby making possible the process of a high efficiency.
  • the jam-affected area is calculated without taking the road category into consideration.
  • the third embodiment on the other hand, the calculation of the jam-affected area taking the road category into consideration is explained.
  • the difference of the configuration of the third embodiment from those of the first and second embodiments lies in the process executed in the basic map information DB 120, the traffic jam arrival time prediction unit 134, the arrival time prediction unit 135, the prediction information storage unit 136 and the map display unit 161.
  • the basic map information DB 120 stores therein the in-mesh average speed 212 calculated for each road category.
  • step S172 the various parameters ( Fig. 5 ) for the traffic jam propagation model required for calculation of the traffic jam arrival time are determined for each road category.
  • the traffic jam starting time and the traffic jam ending time are calculated for each road category in step S42.
  • the vehicle arrival time is calculated for each road category in step S43.
  • the vehicle arrival time, the traffic jam starting time and the traffic jam ending time calculated in steps S42 and S43 are stored in the prediction information storage unit 136.
  • Fig. 14 shows a format of the vehicle arrival time from the starting place, the traffic jam starting time and the traffic jam ending time for each mesh stored in the prediction information storage unit 136 according to this embodiment. In this way, the vehicle arrival time, the traffic jam starting time and the traffic jam ending time are stored for each mesh according to the road category.
  • the traffic jam starting time and the traffic jam ending time are calculated on the assumption that the traffic jam propagates along the links of the same road category as that of the link at the original occurrence point.
  • the traffic jam caused by an unexpected event occurring on a toll road for example, is considered not to propagate to an ordinary road which is located nearer on the map but different in road category.
  • the manner in which the unexpected traffic jam propagates is indicated by coloring the traffic jam area on the toll road on the map in step S45.
  • a traffic jam may be considered to propagate also between different road categories.
  • the traffic jam propagation is predicted by regarding that an unexpected event has newly occurred at the connecting point of the roads of different categories. For example, it may be that the traffic jam due to an unexpected event occurring on a toll road propagates to an ordinary road from an interchange.
  • the traffic jam propagation on an ordinary road is predicted by regarding the interchange as the point of occurrence of a new unexpected event.
  • the unexpected traffic jam is assumed to be caused by an unexpected event that has occurred on a toll road, the manner in which the unexpected traffic jam propagates on the ordinary road is indicated on the map in step S45 in the same way as if the unexpected event has occurred at the interchange.
  • step S44 the jam-affected area calculation unit 140 executed the process to calculate the jam-affected area for each road category by reading, from the prediction information storage unit 136, the arrival time from the starting place, the traffic jam starting time and the traffic jam ending time for each mesh according to the road category.
  • a mesh having the mesh ID of "12345678" satisfies Equation 1, and therefore, is determined as included in the jam-affected area.
  • the data on both the traffic jam starting time and the traffic jam ending time are lacking, and therefore, the ordinary road is determined as not included in the jam-affected area.
  • the map display unit 161A sends a plot command to the display 162 to indicate the jam-affected area in such a manner as to permit the user to grasp the jam-affected area according to the road category.
  • a plot command is sent to indicate the toll road in a different color and the ordinary road in normal color.

Landscapes

  • Chemical & Material Sciences (AREA)
  • Analytical Chemistry (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Navigation (AREA)
  • Instructional Devices (AREA)
  • Traffic Control Systems (AREA)
EP10190190A 2009-11-09 2010-11-05 Method and apparatus for predicting traffic jam area Withdrawn EP2323115A1 (en)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP2009255687A JP2011099798A (ja) 2009-11-09 2009-11-09 渋滞範囲予測方法および装置

Publications (1)

Publication Number Publication Date
EP2323115A1 true EP2323115A1 (en) 2011-05-18

Family

ID=43558021

Family Applications (1)

Application Number Title Priority Date Filing Date
EP10190190A Withdrawn EP2323115A1 (en) 2009-11-09 2010-11-05 Method and apparatus for predicting traffic jam area

Country Status (2)

Country Link
EP (1) EP2323115A1 (ja)
JP (1) JP2011099798A (ja)

Cited By (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2015170990A1 (en) * 2014-05-04 2015-11-12 Roger Andre Eilertsen A road traffic server
CN105469599A (zh) * 2015-12-01 2016-04-06 上海交通大学 车辆轨迹跟踪和车辆行为预测方法
CN106781495A (zh) * 2017-01-04 2017-05-31 安徽科力信息产业有限责任公司 快速发现导致城市道路交通拥堵源头位置的方法和系统
CN106846810A (zh) * 2017-03-13 2017-06-13 青岛海信网络科技股份有限公司 一种高速公路收费站限流方法和装置
WO2018129850A1 (en) * 2017-01-10 2018-07-19 Beijing Didi Infinity Technology And Development Co., Ltd. Method and system for estimating time of arrival
CN110489799A (zh) * 2019-07-18 2019-11-22 讯飞智元信息科技有限公司 交通拥堵仿真处理方法及相关装置
CN110751311A (zh) * 2019-09-05 2020-02-04 北京交通大学 偶发性交通拥堵持续时间的数据提取与实时预测方法
WO2020034135A1 (zh) * 2018-08-16 2020-02-20 深圳市锐明技术股份有限公司 一种交通监测报警方法、装置、终端设备及存储介质
WO2020119593A1 (zh) * 2018-12-13 2020-06-18 深圳先进技术研究院 一种基于拥堵扩散的交通瓶颈预测方法、系统及电子设备
CN113643541A (zh) * 2021-09-10 2021-11-12 杭州海康威视数字技术股份有限公司 实时路况的确定方法、装置、设备及存储介质

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2014103080A1 (ja) * 2012-12-28 2014-07-03 パイオニア株式会社 表示制御装置、表示制御方法、表示制御プログラム、表示制御システム、表示制御サーバおよび端末
JP2015145793A (ja) * 2014-01-31 2015-08-13 パイオニア株式会社 経路探索装置、経路探索方法及び経路探索用プログラム
JP6226300B2 (ja) * 2014-09-19 2017-11-08 パナソニックＩｐマネジメント株式会社 交通情報生成装置および交通情報生成方法
KR101587878B1 (ko) * 2014-10-24 2016-01-22 한국교통연구원 교통영향권에 대한 중장기 예측방법
JP7350290B2 (ja) * 2019-06-28 2023-09-26 ヤマハファインテック株式会社 ガス濃度検出方法、ガス濃度検出装置、及びガス生成システム

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070013551A1 (en) * 2002-03-05 2007-01-18 Andre Gueziec System and method for predicting travel time for a travel route
JP2007285998A (ja) 2006-04-20 2007-11-01 Alpine Electronics Inc ナビゲーション装置および迂回経路作成方法
JP2008268149A (ja) 2007-04-25 2008-11-06 Xanavi Informatics Corp ナビゲーション装置及び経路誘導方法

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH11238194A (ja) * 1998-02-20 1999-08-31 Fujitsu Ten Ltd 交通渋滞予測方法および装置ならびに交通状況提供装置
JP2003344074A (ja) * 2002-05-23 2003-12-03 Matsushita Electric Ind Co Ltd 情報提供システム
JP2004280702A (ja) * 2003-03-18 2004-10-07 Nippon Telegr & Teleph Corp <Ntt> 車輌向けコンンテツ配信システム及びその方法ならびにコンテンツ配信プログラム
JP4773823B2 (ja) * 2005-12-28 2011-09-14 クラリオン株式会社 交通状況予測方法およびその装置ならびにプログラム

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070013551A1 (en) * 2002-03-05 2007-01-18 Andre Gueziec System and method for predicting travel time for a travel route
JP2007285998A (ja) 2006-04-20 2007-11-01 Alpine Electronics Inc ナビゲーション装置および迂回経路作成方法
JP2008268149A (ja) 2007-04-25 2008-11-06 Xanavi Informatics Corp ナビゲーション装置及び経路誘導方法

Cited By (20)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106663370B (zh) * 2014-05-04 2019-09-06 罗杰·安德烈·埃勒特森 道路交通服务器
CN106663370A (zh) * 2014-05-04 2017-05-10 罗杰·安德烈·埃勒特森 道路交通服务器
US9928743B2 (en) 2014-05-04 2018-03-27 Roger André EILERTSEN Road traffic server
WO2015170990A1 (en) * 2014-05-04 2015-11-12 Roger Andre Eilertsen A road traffic server
CN105469599A (zh) * 2015-12-01 2016-04-06 上海交通大学 车辆轨迹跟踪和车辆行为预测方法
CN105469599B (zh) * 2015-12-01 2017-12-15 上海交通大学 车辆轨迹跟踪和车辆行为预测方法
CN106781495A (zh) * 2017-01-04 2017-05-31 安徽科力信息产业有限责任公司 快速发现导致城市道路交通拥堵源头位置的方法和系统
WO2018129850A1 (en) * 2017-01-10 2018-07-19 Beijing Didi Infinity Technology And Development Co., Ltd. Method and system for estimating time of arrival
GB2564181A (en) * 2017-01-10 2019-01-09 Beijing Didi Infinity Technology & Dev Co Ltd Method and system for estimating time of arrival
US10816352B2 (en) 2017-01-10 2020-10-27 Beijing Didi Infinity Technology And Development Co., Ltd. Method and system for estimating time of arrival
CN106846810A (zh) * 2017-03-13 2017-06-13 青岛海信网络科技股份有限公司 一种高速公路收费站限流方法和装置
CN106846810B (zh) * 2017-03-13 2020-05-05 青岛海信网络科技股份有限公司 一种高速公路收费站限流方法和装置
WO2020034135A1 (zh) * 2018-08-16 2020-02-20 深圳市锐明技术股份有限公司 一种交通监测报警方法、装置、终端设备及存储介质
CN111325968A (zh) * 2018-12-13 2020-06-23 深圳先进技术研究院 一种基于拥堵扩散的交通瓶颈预测方法、系统及电子设备
WO2020119593A1 (zh) * 2018-12-13 2020-06-18 深圳先进技术研究院 一种基于拥堵扩散的交通瓶颈预测方法、系统及电子设备
CN111325968B (zh) * 2018-12-13 2021-05-25 深圳先进技术研究院 一种基于拥堵扩散的交通瓶颈预测方法、系统及电子设备
CN110489799A (zh) * 2019-07-18 2019-11-22 讯飞智元信息科技有限公司 交通拥堵仿真处理方法及相关装置
CN110751311A (zh) * 2019-09-05 2020-02-04 北京交通大学 偶发性交通拥堵持续时间的数据提取与实时预测方法
CN110751311B (zh) * 2019-09-05 2022-09-13 北京交通大学 偶发性交通拥堵持续时间的数据提取与实时预测方法
CN113643541A (zh) * 2021-09-10 2021-11-12 杭州海康威视数字技术股份有限公司 实时路况的确定方法、装置、设备及存储介质

Also Published As

Publication number Publication date
JP2011099798A (ja) 2011-05-19

Similar Documents

Publication Publication Date Title
EP2323115A1 (en) Method and apparatus for predicting traffic jam area
EP1808838B1 (en) Traffic information processing apparatus
EP2653834B1 (en) Method of Performing a Road Network Search and System for Estimating a Cruising Range of a Vehicle
US10762776B2 (en) Method, apparatus, and computer program product for determining vehicle lane speed patterns based on received probe data
EP3322961B1 (en) Methods and systems for detecting a closure and/or opening of a navigable element
EP2023085B1 (en) Route search device and route search method
CN108604407B (zh) 用于生成预期行进速度的方法及系统
JP2005259116A (ja) 交通情報算出装置、交通情報算出方法、交通情報表示方法および交通情報表示装置
EP3413286A1 (en) Reversible lane active direction detection based on probe data
EP2154663B1 (en) Method and apparatus for determining traffic data
CN111712862B (zh) 用于生成交通量或交通密度数据的方法和系统
CN109642800B (zh) 路线探索方法及路线探索装置
EP2610782A1 (en) Method for planning the route of a vehicle
EP3745087A1 (en) Method, apparatus, and computer program product for determining lane level vehicle speed profiles
JP5547106B2 (ja) 経路演算装置
JP2007140745A (ja) 渋滞予測システム及び渋滞要因推定システム、並びに渋滞予測方法及び渋滞要因推定方法
US10755118B2 (en) Method and system for unsupervised learning of road signs using vehicle sensor data and map data
US20060031566A1 (en) Road information providing server, road information providing system, road information providing method, route search server, route search system, and route search method
CN106133802A (zh) 用于推定行驶速度的装置和方法
US11428535B2 (en) System and method for determining a sign type of a road sign
US11341845B2 (en) Methods and systems for roadwork zone identification
US20210383687A1 (en) System and method for predicting a road object associated with a road zone
EP2287821B1 (en) Method and apparatus for determining traffic information and system for route calculation
US11697432B2 (en) Method, apparatus and computer program product for creating hazard probability boundaries with confidence bands
JPH1019593A (ja) 車載用ナビゲーション装置

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

AX Request for extension of the european patent

Extension state: BA ME

17P Request for examination filed

Effective date: 20110527

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION HAS BEEN WITHDRAWN

18W Application withdrawn

Effective date: 20140115