JP2002230680A - System and method for traffic flow analysis and method and device for route retrieval - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a system and method for traffic flow analysis and a method and device for route retrieval capable of precisely realizing the traffic flow of vehicles with a small calculation load and performing a proper route retrieval considering the congestion of a road. SOLUTION: Vehicles are advanced one by one every prescribed time from the rear end of a road section 20 while switching a signal 22 provided in an intersection at the front of the road section 20. When the vehicle advanced to the road section 20 reaches the trail position X1 of a congested line, the vehicle is considered to be the trail vehicle of the congested line, and the trail position X1 is changed to the rear end of the advanced vehicle. When the head vehicle of the congested line starts after the signal 22 is changed to blue, the head position X0 of the congested line is changed to the rear end of the first vehicle following the head vehicle. When a prescribed reaction delay time has passed after every time when vehicles started, the head position X0 of the congested line is changed to the rear end of the first vehicle following the started vehicle.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a traffic flow analysis system, a traffic flow analysis method, a route search method and a route search device, and more particularly, to a traffic flow analysis system and a traffic flow analysis system for analyzing a traffic jam sequence in a predetermined road section. Traffic flow analysis method,
Further, the present invention relates to a route search method and a route search device for searching for a route to a destination where a vehicle should travel.

[0002]

2. Description of the Related Art Conventionally, for example, Japanese Unexamined Patent Application Publication No.
As disclosed in Japanese Patent Publication No. 82, there is known a system for analyzing a traffic flow on a wide area road network by combining a macro traffic flow simulation such as a block density method and a micro traffic flow simulation using a tracking model or the like. The block density method is used to express the flow of a vehicle.
Instead of treating each vehicle individually, treat multiple vehicles as a group of vehicles. Therefore, according to the block density method,
Since the moving states of a plurality of vehicles can be collectively calculated for each road section, it is possible to analyze the traffic flow on the wide area road network without increasing the amount of calculation. on the other hand,
The follow-up model individually reproduces the behavior of each vehicle based on the acceleration, running speed, and road conditions of the vehicle. For this reason, according to the following model, it is possible to analyze the traffic flow on the road in a fine and precise manner.

[0003]

However, according to the block density method, since the characteristics of each vehicle are not reflected in the analysis of the traffic flow, it is not possible to accurately predict the congestion sequence on the road. Further, in the following model, it is necessary to individually calculate the behavior of each vehicle, which causes an increase in calculation load in analyzing a traffic flow.

[0004] The present invention has been made in view of the above points, and provides a traffic flow analysis system and a traffic flow analysis method capable of accurately analyzing a vehicle traffic flow with a small calculation load. With the primary purpose of doing
It is a second object of the present invention to provide a route search method and a route search device capable of performing an appropriate route search in consideration of traffic congestion on a road.

[0005]

A first object of the present invention is to provide a traffic flow analysis system for analyzing a traffic congestion sequence of a vehicle in a predetermined road section, as described in claim 1; When the approaching vehicle arrives at the congestion queue, when the last vehicle of the congestion queue changes to the position of the approaching vehicle, and when the leading vehicle of the congestion queue flows out of the congestion queue, And a head changing means for changing the head of the congestion queue to a position of a following vehicle following the leading vehicle.

A first object of the present invention is to provide a traffic flow analysis method for analyzing a traffic congestion sequence of vehicles in a predetermined road section, wherein the approaching vehicle has entered the predetermined road section. (A) changing the end of the congestion line to the position of the approaching vehicle when the vehicle reaches the congestion line, and changing the congestion line when the leading vehicle of the congestion line flows out of the congestion line. (B) changing the head of the vehicle to the position of the succeeding vehicle following the head vehicle.

According to the first and fifth aspects of the present invention, when an approaching vehicle that has entered a predetermined road section reaches a congestion line, the last part of the congestion line is changed to the position of the approaching vehicle. When the leading vehicle in the congestion row flows out of the congestion row, the head of the congestion row is changed to the position of the succeeding vehicle following the leading vehicle. In such a configuration, the analysis of the congestion line is executed based on the outflow of the leading vehicle and the arrival of the entering vehicle at the end. That is, the process is executed without reproducing the behavior of the other vehicles in the traffic jam line. Therefore, according to the present invention, it is possible to accurately analyze a traffic flow in a predetermined road section with a small calculation load.

By the way, whether a vehicle entering a predetermined road section has arrived at the congestion line depends on the distance from the rear end of the road section to the end of the congestion line, and the shape and lane of the road section. The determination can be made based on the number, the speed limit, the signal period, the number of vehicles entering the road section per unit time, and the like.

Therefore, according to a second aspect of the present invention, in the traffic flow analysis system according to the first aspect, based on the data on the predetermined road section and the amount of vehicles flowing into the predetermined road section per unit time, The traffic congestion line arrival determination means for determining whether the approaching vehicle has reached the traffic congestion line, the tail change means, the rear end of the traffic congestion line according to the determination result of the traffic congestion line arrival determination means The position of the approaching vehicle may be changed.

[0010] Whether or not the leading vehicle in the congestion line has flown out of the congestion line can be determined based on the signal cycle and shape of the road section, the number of lanes, and the like.

Therefore, according to a third aspect of the present invention, in the traffic flow analysis system according to the first or second aspect, it is determined whether or not the leading vehicle has flowed out of the congestion line on the basis of data on the predetermined road section. And the head change means may change the head of the congestion line to the position of the following vehicle according to the result of the judgment by the congestion line outflow judgment device.

By the way, a vehicle following a vehicle in the traffic congestion line flows out of the traffic congestion line with a certain time delay after the one vehicle flows out of the traffic congestion line. For this reason, the outflow of the leading vehicle from the congestion line is performed when a predetermined time has elapsed after the preceding vehicle that has flown out of the congestion line in front of the leading vehicle.

Therefore, in the traffic flow analysis system according to the first or third aspect, the head change means may be configured to determine whether the leading vehicle preceding the leading vehicle has flown out of the traffic congestion line. When the time has elapsed, the head of the congestion line may be changed to the position of the following vehicle.

According to a first object of the present invention, as set forth in claim 6, branch control means for branching each vehicle at an intersection according to a predetermined branch rate, and each vehicle is branched by the branch control means. Under the circumstance, a traffic jam sequence analyzing means for analyzing a traffic jam sequence of each vehicle in each road section connecting two intersections, and a branch rate change for changing the predetermined branch rate based on an analysis result by the traffic jam sequence analyzing means Means, and a traffic flow analysis system characterized by comprising:

Further, the first object of the present invention is as described in claim 7, wherein a step (c) of branching each vehicle at an intersection according to a predetermined branching rate, and the step (c).
In a situation where each vehicle is branched by
(D) analyzing each traffic congestion sequence in each road section connecting two intersections; and (e) changing the predetermined branching rate based on the analysis result of the step (d). This is achieved by a traffic flow analysis method characterized in that:

According to the inventions described in claims 6 and 7, in a situation where each vehicle branches at an intersection according to a predetermined branching rate, a traffic congestion sequence of the vehicle in each road section connecting the two intersections is analyzed. Then, the predetermined branching rate is changed based on the analysis results. When the branching rate is changed, the number of vehicles flowing into the road section changes, and the analysis result of the congestion sequence in each road section changes. Therefore, according to the present invention, it is possible to analyze a traffic congestion sequence in each road section, for example, in response to a change in the presence or absence of a vehicle or a destination.

In the present invention, the term "branch rate" refers to the ratio of each road to which vehicles traveling from the same road section to the same destination enter after entering the intersection at the rear end of the road section. is there.

The second object of the present invention is to read out traffic congestion column data of vehicles in each road section recorded on a predetermined recording medium for each time zone as described in claim 8; (G) searching for a route to a destination to which the vehicle should travel based on the congestion column data of the vehicle in each road section read in (f).
And a route search method characterized by comprising:

In the present invention, for example, traffic congestion sequence data of vehicles in each road section recorded on a predetermined recording medium for each time zone as an analysis result is read. Then, based on the read congestion column data of the vehicle in each road section, a search for a route to a destination where the vehicle should travel is performed. Therefore, according to the present invention, it is possible to perform an appropriate route search in consideration of traffic congestion on a road.

The traffic congestion on the road changes according to the time. Therefore, in order for the vehicle to reach the destination early, it is appropriate to set a road section where traffic congestion is least severe as a route. That is, for each branch point,
At the time when a vehicle arrives at a junction, based on data of a traffic congestion column expected to occur in a road section connected to the junction, the time at which the vehicle is expected to arrive at the junction as the end of the road section is calculated. It is appropriate to calculate and set the road that requires the least time among the routes from the current position to the destination as the route based on the arrival times at all the junctions.

Therefore, in the route searching method according to the ninth aspect, the step (f) is performed.
Is a traffic jam related to a traffic jam line expected to occur in a second road section connected to the first junction at a first time when a vehicle arrives at a first junction as an end of the first road section Reading the column data and performing step (g)
Calculating a second time at which a vehicle arrives at a second branch point as an end of the second road section based on the traffic congestion column data read in the step (f) (h ) And a step (i) of setting, as a route to the destination, a road constituting a vehicle whose arrival time at the destination is closest to the current time.

The second object is that the vehicle should travel based on the traffic congestion sequence data of the vehicle in each road section recorded on a predetermined recording medium for each time zone. The present invention is attained by a route search device including a route search unit that searches for a route to a ground.

In the present invention, for example, a search for a route to a destination to which the vehicle should travel can be performed based on the congestion column data of the vehicle in each road section recorded on a predetermined recording medium for each time zone as a result of analysis. Will be Therefore, according to the present invention, it is possible to perform an appropriate route search in consideration of traffic congestion on a road.

[0024]

FIG. 1 shows a configuration diagram of a traffic flow analysis system 10 according to one embodiment of the present invention. As shown in FIG. 1, the traffic flow analysis system 10 of the present embodiment includes a traffic information input unit 12, a traffic condition reproduction unit 14, a result output unit 16
And The traffic information input unit 12 includes a road length, a number of lanes, a speed limit, a road shape, a normal passenger car, and a truck entering a target road section of a road section (hereinafter, referred to as a target road section) to be analyzed for a traffic flow. And the type of intersection, the shape of the intersection included in the target road section, the traffic regulation content of the traffic light (ie, the switching cycle of the green signal, yellow signal, red signal, etc.), and entering the target road section per unit time This is a part for inputting road data such as the number of approaching vehicles based on actual measurement in the target road section. The road data input to the traffic information input unit 12 is recorded on a writable recording medium 18 such as a CD-ROM, DVD, or hard disk.

In this embodiment, the target road section is
It is a section when the approachable road is divided at each intersection where multiple roads are connected.It is a section when it is divided at each intersection where traffic lights are provided, or when it is divided at each intersection where there is no traffic light. It can be considered that it is one section or it is divided based on the contents of the set road sign, but the target road section is not limited to this, and the point where the position of the intersection, the toll gate, the speed limit changes It may be one section in the case where each section is divided for each point where the traveling state of the vehicle is predicted to change, such as a road structure.

The traffic information input unit 12 is also used when the rear vehicle of the two vehicles traveling back and forth is accelerated or decelerated in accordance with the acceleration or deceleration of the preceding vehicle, or at the head of the target road section by a red light. This is a part for inputting vehicle characteristic data such as a reaction delay time when the leading vehicle that has stopped moving at a green light starts based on the reaction measurement results of many vehicle drivers. This vehicle characteristic data is also recorded on the recording medium 18. Note that this characteristic does not depend on the road structure or has a small degree of dependence, so that it can be applied to all road sections.

Further, the traffic situation reproducing section 14 stores the recording medium 1
Based on the road data and the vehicle characteristic data recorded in No. 8, the traffic condition of the vehicle in the target road section is reproduced as described later in detail. The above-described result output unit 16 is connected to the traffic situation reproduction unit 14. Result output unit 16
Supplies a command signal to the display unit 19 so that the traffic condition reproduced by the traffic condition reproducing unit 14 is displayed, and stores the traffic condition in a predetermined recording medium 18 at predetermined time intervals. The display unit 19 superimposes and displays the traffic condition by the traffic condition reproduction unit 14 on a map according to the instruction of the result output unit 16.

FIG. 2 shows a traffic flow analysis system 1 according to this embodiment.
FIG. 3 shows a diagram for explaining an analysis model of a traffic flow (specifically, a congestion sequence) in one road section 20 at 0. FIG.
In this embodiment, the congestion line refers to a state in which a plurality of stopped vehicles are connected. In this embodiment, the road data recorded on the recording medium 18 has a road length L of one road section 20 having an intersection (position X = 0) where a traffic light 22 is provided at the tip end, as shown in FIG.
(M), the number of lanes is 1, the speed limit is V (km / h), the type ratio of trucks to all entering vehicles is Y (%), the total length of ordinary cars is WJ (m), and the total length of trucks is WT
(M), the durations of the green signal, the yellow signal, and the red signal of the traffic signal 22 are TB, TY, TR, and the road section 2 respectively.
It is assumed that the number of vehicles entering the vehicle per unit time to zero is Z (vehicles / h). Note that the number of approaching vehicles Z may be changed for each time zone. In the vehicle characteristic data, it is assumed that the reaction delay time at the time of starting the vehicle is TA (sec).

In this embodiment, the traffic condition reproducing unit 14
First, the state of the traffic light 22 is changed to the switching period T described above.
While changing with B, TY, TR, 3600 / Z (se
c) one vehicle at a time at the rear end of the road section 20 (position X
= L) to enter the road section 20. At this time, the type of the vehicle entering the road section 20 is changed according to the type ratio Y, and the entering vehicle is caused to travel at the speed limit V in the road section 20.

When the traffic light 22 becomes a red light, the vehicle is stopped at the intersection at the front end of the road section 20, and the following vehicle is decelerated to reduce the total length (WJ or WT) from the front end position of the front stopped vehicle. ) Stop at the position behind by + α. Note that the predetermined value α is an inter-vehicle distance to be maintained when the vehicle stops. When the traffic light 22 becomes a green light,
First, the leading vehicle is started and accelerated at a predetermined acceleration, and the succeeding vehicles behind the vehicle are started from the front with a reaction delay time and accelerated at a predetermined acceleration. Then, when the traffic light 22 switches from a green signal to a red signal to a red signal, the vehicle that cannot pass through the intersection is decelerated and stopped backward from the tip (X = 0) of the intersection. in this way,
The traffic condition reproducing unit 14 reproduces the traffic condition of the vehicle in the target road section 20 based on the road data and the vehicle characteristic data.

In a situation where the above processing is repeated, the result output unit 16 determines the start position X0 and the end position X1 of the congestion line formed in the target road section 20 at predetermined time intervals by the vehicle in the road section 20. The traffic condition is stored in a predetermined recording medium 18. In the present embodiment, the traffic situation reproducing unit 14 and the result output unit 16 repeat the above processing for each target road section.

Hereinafter, with reference to FIGS. 2 and 3 and FIGS. 3 and 4, a specific method for eliminating or extending a congestion line in one road section 20 in this embodiment will be described.

FIG. 3 shows a traffic condition reproducing unit 1 according to the present embodiment in order to eliminate a congestion line in one road section 20.
4 shows a flowchart of an example of a routine executed by the fourth embodiment.
FIG. 4 shows a flowchart of an example of a routine executed by the traffic situation reproducing unit 14 in the present embodiment to extend the congestion line for one road section 20. The routine shown in FIGS. 3 and 4 is a routine that is repeatedly started at predetermined time intervals. When the routine shown in FIG. 3 is started, first, the process of step 102 is executed. Also,
When the routine shown in FIG. 4 is started, the process of step 120 is executed.

Step 10 in the routine shown in FIG.
In the second, the signal 22 from the previous process to the current process is used.
Is switched from a red light to a green light, then whether a predetermined reaction delay time TA (for example, 1 second) has elapsed,
Alternatively, for example, as shown in FIG. 2, when the vehicle A has already started with the green signal of the traffic light 22, it is determined whether or not a predetermined reaction delay time TA has elapsed after the start. The process of step 102 is repeatedly executed until it is determined that the reaction delay time TA has elapsed. As a result, if a positive determination is made, the process of step 104 is performed next.

In step 104, a process of changing the head of the congestion line in the road section 20 is executed. When the traffic light 22 is switched from the red light to the green light, the leading vehicle in the congestion line starts moving after the reaction delay time TA has elapsed. Therefore, in step 104, for example, as shown in FIG. 2, when the signal delay time TA elapses after the traffic light 22 switches from the red signal to the green signal at the time of signal switching, the head of the congestion column is replaced with the head of the congestion column. The vehicle A is changed to the vehicle B that is one vehicle behind the leading vehicle A (X0 ← X0 + (W * + α)). In this case, the overall length W * of the vehicle is the overall length of the leading vehicle A, which is WJ for an ordinary passenger car and WT for a truck.

If there is a vehicle that has already started due to a green light, after the reaction delay time TA has elapsed thereafter, the vehicle following the started vehicle starts to start. Therefore, in step 104, for example, as shown in FIG. 2, the vehicle A in the traffic jam line has already started with a green light, and the vehicle B succeeding the start vehicle A by one vehicle has been at the head of the traffic jam line. In this case, when the reaction delay time TA elapses after the start vehicle A starts, the head of the congestion line is
The vehicle B, which is one vehicle after the starting vehicle A, is changed to the vehicle C, which is two vehicles after the starting vehicle A (X0 ← X0 + (W * + α)). In this case, the total length W * of the vehicle is the total length of the vehicle B, which is WJ for an ordinary passenger car and WT for a truck.

At step 106, the start position X of the traffic jam line
It is determined whether or not 0 matches the last position X1. As a result, if it is determined that the head position X0 does not match the tail position X1, it can be determined that the congestion line has not been resolved, and the process of step 102 is executed again. On the other hand, if it is determined that the start position X0 matches the end position X1, the process of step 108 is executed next.

In step 108, a process is executed to determine that the congestion has been eliminated in the road section 20. When the process of step 108 ends, the current routine ends. Therefore, according to the routine shown in FIG. 3, the head of the traffic congestion line sequentially moves backward with the passage of time, so that the traffic congestion occurring in the road section 20 can be eliminated.

In step 120 of the routine shown in FIG.
After entering from L), it is determined whether or not a time T (= (L−X1) / V + β) has elapsed for arriving at the last position X1 of the traffic jam line. Note that the predetermined value β is a time in consideration of a deceleration state until the vehicle stops. Step 12
The process of 0 is repeatedly executed until it is determined that the time T has elapsed. As a result, if a positive determination is made,
Since it can be determined that the vehicle that has entered the road section 20 has reached the end of the congestion queue, the process of step 122 is executed next.

In step 122, a process of changing the tail of the congestion line in the road section 20 is executed. Specifically, in the situation shown in FIG. 2, the rear end of the congestion line is shifted from the vehicle D, which is one vehicle ahead of the approaching vehicle E, to the approaching vehicle E.
(X1 ← X1 + (α + W *)). In this case, the total length W * of the vehicle is the total length of the approaching vehicle, which is WJ for an ordinary passenger vehicle and WT for a truck.

In step 124, it is determined whether or not the last position X1 of the congestion line exceeds the end L of the road section 20. As a result, the last position X1 is the end L of the road section 20.
If it is determined that the vehicle speed exceeds the threshold value, the vehicle can enter the road section 20, and the process of step 120 is executed again. On the other hand, if the tail position X1 is beyond the end L of the road section 20, the process of step 126 is executed next.

At step 126, a process is executed to determine that the vehicle cannot enter the road section 20.
When the process of step 126 ends, the current routine ends. Therefore, according to the routine shown in FIG.
Since the end of the congestion row moves to the following approaching vehicle with the passage of time, the congestion occurring in the road section 20 can be extended.

As described above, according to the routine shown in FIGS. 3 and 4, it is possible to form a congestion line in one road section as time elapses. In such a method, the formation of the congestion train is realized by the outflow of the leading vehicle from the road section 20 and the arrival of the entering vehicle to the congestion train. Then, in the present embodiment, the start position X0 and the tail position X1 of the congestion line are recorded on the predetermined recording medium 18 at predetermined time intervals in the process of forming the congestion line.

Therefore, according to the system of this embodiment, the traffic congestion sequence is analyzed under the situation where the behavior of the vehicle is reproduced according to a predetermined rule without reproducing the behavior of the vehicle, and the relationship between the number of vehicles passing and the vehicle density is analyzed. In addition to using, the analysis of the congestion line is performed under the condition that the behavior of the leading vehicle and the approaching vehicle in the congestion line is reproduced. For this reason, according to the system of the present embodiment, it is possible to accurately analyze the traffic flow with a small calculation load.

The traffic flow analysis system 10 of the present embodiment analyzes the traffic flow for each road section and records the head position X0 and the tail position X1 of the congestion line at predetermined time intervals.

FIG. 5 shows, on the map, the traffic congestion sequence as the analysis result of the traffic flow independently analyzed for each road section in a certain area in accordance with the roads in the present embodiment with the times corresponding to the respective roads. An example of a display screen on the display unit 19 at this time is shown. In this embodiment, when a congestion column is formed as a result of analyzing the traffic flow in each road section, the congestion column is superimposed on the road section on the map on the display unit 19 as shown in FIG. (A shaded area in the figure). For this reason, in the present embodiment, it is possible to visually recognize the traffic congestion state in each road section on the map displayed on the display unit 19 during the analysis or the reproduction of the analysis result from the display unit 19. ing.

Next, a description will be given of a method of analyzing a congestion sequence in each road section caused by each vehicle heading for a predetermined destination for each vehicle in the system of this embodiment.

FIG. 6 is a diagram for explaining a method of determining a route of a vehicle traveling from a current position to a destination in the present embodiment. In this embodiment, the vehicle is, for example, as shown in FIG.
When traveling from the current position O to the destination D on the road map shown in FIG.
With respect to 21, the analysis result of the traffic flow in the current time zone is read based on the traffic situation reproduced by the above-described method. Then, based on the distance between the current position O and the intersection P21 at the end of the road section AV21 and the read analysis result, a time T21 at which the vehicle is expected to arrive at the intersection P21 is calculated. Next, for each of the road sections ST21, AV22, and ST31 connected to the intersection P21, the analysis result of the traffic flow at the estimated arrival time T21 at the intersection P21 is read, and based on the result, the vehicle is terminated at the end P11, P22 of the road section. , P31 are calculated at times T11, T22, and T31.

Similarly, at the predicted arrival time T when the vehicle is expected to arrive at the intersection P, the analysis result of the traffic flow of the road sections ST and AV connected to the intersection P is read out, and the vehicle is determined based on the result. The road section ST, AV
Is calculated, and the time T at which the vehicle arrives at the intersection P at the end of the road section is calculated.
In this case, when different routes connect to the same intersection P, the earliest time T among the estimated arrival times of those routes is set as the expected arrival time at the intersection P, and the route is set as a route candidate. leave. As a result of this processing, the route that requires the shortest time from the current position O to the destination D (from the current position O to the intersection P12 on the map shown in FIG. 6), that is, the time at which the vehicle arrives at the destination is the current time Is set as a search route.

Next, in consideration of the shortest time route set as described above, in addition to the route, for example, four routes that the vehicle is expected to travel as a route from the current position O to the destination D are set. 5 routes are selected as route candidates. Then, branching rates are set according to the directions in which the five routes head from the intersection P21. For example, when three of the five routes pass through the road section ST21, the branching rate to the road section ST21 is 60%, and when the remaining two routes pass through the road sections AV22 and ST31, respectively, The branch rate to the sections AV22 and ST31 is 20% each. In the present embodiment, the branching ratio is a ratio of each road to which the vehicle goes after entering the intersection, and is set for each destination of the vehicle. The branch rate is set for each of the road sections extending from each intersection.

The vehicle arriving at the intersection P21 from the road section AV21 enters the road sections ST21, AV22 and ST31 from the intersection P21 according to the branching rate. Specifically, if the destination D is the same, a plurality of vehicles traveling on the road section AV21 pass through the intersection P21, and
0% is road section ST21 and the remaining 20% is road section A.
V22 and the remaining 20% travel on the road section ST31. In this embodiment, all vehicles existing on the road pass through each intersection according to the branching rate set for each destination.

When such processing is performed, a traffic flow is formed in each road section with the passage of time. In this embodiment, the formed traffic flow is analyzed for each road section, and the results are recorded at predetermined time intervals.

By the way, if it is assumed that traffic regulation is performed or an event in each facility is held in the process of executing the above-described processing, the traffic condition in each road section is changed to the shortest time route as described above. May be different from the traffic situation used when setting. That is, traffic congestion may become severe in a certain road section, and traffic congestion may hardly occur in a certain road section. In spite of such a situation, if the branching rate in each road section is maintained at the same value, the traffic flow cannot be accurately reproduced and accurate analysis cannot be performed.

Therefore, the system of this embodiment updates the analysis result of the traffic flow of each road section in the same time zone every time the analysis of the traffic flow is executed, and branches at each intersection based on the updated analysis result. The rate is to be changed. That is, when the analysis result of the traffic flow is updated, the shortest route from the current position to the destination may change accordingly. In such a case, the branching rate at the intersection is set using the above-described method. Do it again.

According to this method, the branching rate is changed based on the analysis result of the traffic flow in a situation where the traffic flow of the vehicle can change due to traffic regulation or the like. Is caused, each vehicle can be caused to travel along a route that is expected to actually travel. That is, it is possible to accurately reproduce the traffic flow in each road section. Therefore, according to the system of the present embodiment, it is possible to appropriately analyze the traffic flow in each road section in accordance with traffic regulations and the like.

FIG. 7 shows a flowchart of an example of a control routine executed by the traffic situation reproducing section 14 in this embodiment to realize the above-mentioned functions. The routine shown in FIG. 7 is a routine that is executed each time the traffic condition of the vehicle is analyzed. When the routine shown in FIG. 7 is started,
First, the process of step 140 is performed.

In step 140, for example, when the vehicle travels from the current position O to the destination D as shown in FIG. 6, the vehicle is moved to the current position based on the (n-1) th previous traffic flow analysis result. The required time of the vehicle for each road section between O and the destination D is calculated. Specifically, an estimated arrival time T _i arriving at one intersection is calculated, the analysis result at the expected arrival time T _i of the traffic flow of the road section connected to the intersection is read, and the required time of the road section is calculated. Is calculated. Then, an estimated arrival time T _{i + 1} arriving at the intersection at the end of the road section is calculated, and the analysis result at the expected arrival time T _{i + 1} of the traffic flow of the road section connected to the intersection is read out, The required time of the road section is calculated. Then, the same processing is repeated up to the destination.

In step 142, the above-mentioned step 140
Based on the calculation result in, a process of setting the shortest route in which the vehicle arrives at the destination D in the shortest time is executed.

In step 144, the above-mentioned step 142
Based on the shortest time route set in the above, a process of setting a branch rate at each intersection between the current position and the destination is executed. At this time, the branching rate is calculated for each intersection,
It is set for each destination of the vehicle. When the process of step 144 is performed, the branching rate is changed thereafter, and the vehicle branches at the corresponding intersection according to the branching rate at the time of the next traffic flow analysis. When the process of step 144 ends, the current routine ends.

According to the routine shown in FIG. 7, every time the analysis of the traffic flow is repeated, the branching rate at the intersection can be changed based on the analysis result in each road section. Therefore, the next time traffic flow analysis is performed during the same time period, it is assumed that a similar traffic situation will occur.
Each vehicle can be run appropriately. Therefore, according to the system of this embodiment, the traffic flow in each road section can be accurately reproduced, and as a result, the traffic flow can be properly analyzed.

Next, the traffic flow analysis system 10 of this embodiment
A method for searching for a route on which a vehicle travels from a current position to a destination by using a traffic flow analysis result for each road section according to the present invention will be described.

FIG. 8 shows a traffic flow analysis system 1 according to this embodiment.
FIG. 2 shows a configuration diagram of a navigation system 40 that searches for a route to a destination of a vehicle using an analysis result of 0. FIG.
As shown in FIG.
The navigation unit 42 is mounted on a vehicle, and displays a route to a destination to which the vehicle should travel on a predetermined display screen, and a traffic flow analysis result of each road section by the traffic flow analysis system 10 is used. And a center 44 for searching for a route to a destination to which the vehicle should travel according to a request from the vehicle.

In this embodiment, the navigation unit 42 has a control unit 50. The control unit 50 includes
The input unit 52 and the position detection unit 54 are connected. The input unit 52 is provided in the vehicle interior, and is used by the vehicle occupant, for example, to set a destination to be reached or to change the scale of a map on a display screen.
It is operated when various inputs are made to the device 2. The position detecting unit 54 has a GPS receiver and a self-contained navigation sensor (both not shown), and outputs a signal corresponding to the current position where the vehicle is traveling based on a radio signal from a GPS satellite and an output signal of the self-contained navigation sensor. Output. The input unit 52 supplies a signal corresponding to the operation of the vehicle occupant, and the position detection unit 54 supplies a signal corresponding to the current position of the vehicle to the control unit 50. The control unit 50 detects an operation by a vehicle occupant based on an output signal of the input unit 52 and detects a current position of the vehicle based on an output signal of the position detection unit 54.

The navigation unit 42 is a CD-R
It has a map information database 56 composed of recording media such as OM and DVD. Map information database 5
Reference numeral 6 stores road map information corresponding to the reduced scale. The navigation unit 42 also includes a transmission / reception unit 60. Transmission / reception unit 60 of navigation unit 42
Is constituted by a two-way communication device such as a mobile phone or a PHS terminal so that bidirectional communication with the center 44 can be performed. For this reason, the navigation unit 42
It is possible to transmit its own identification ID code (for example, the telephone number of the transmission / reception unit 60) and the acquired information (specifically, the current position and destination of the vehicle) to the center 44, and The information you submitted (specifically,
(A route to a destination to which the vehicle should travel).

The navigation unit 42 also has C
The data storage unit 62 includes a recording medium such as a D-ROM or a DVD. The data storage section 62 stores its own identification ID code, the result of detection by the position detection section 54, the destination set by the vehicle occupant, and information from the center 44 received by the transmission / reception section 60.

A video output unit 64 is connected to the control unit 50. The video output unit 64 controls a display screen provided at a position visible to a vehicle occupant in the passenger compartment. The control unit 50 reads road map data around the position based on the current position detected by the position detection unit 54 so as to provide display guidance to the vehicle occupant when the destination is set, and reads the current position of the vehicle. A command signal is supplied to the video output unit 64 so that the road map is drawn on the display screen in a size corresponding to the reduction scale while fixing the mark indicating the position on the display screen. At this time, the road map on the display screen is scrolled as the current position of the vehicle changes on the road map. Further, the control unit 50 controls the image output unit 6 based on the route data transmitted from the center 44 so that the route is superimposed and displayed on the road map on the display screen, as described later.
4 is supplied with a command signal.

The center 44 has a transmitting / receiving unit 70. The transmission / reception unit 70 of the center 44 is configured by a two-way communication device such as a mobile phone, similarly to the transmission / reception unit 60 of the navigation unit 42, so that bidirectional wireless communication with the navigation unit 42 can be performed. For this reason, the center 44 can receive the information transmitted by the navigation unit 42 and transmit the information acquired by the center 44 to the navigation unit 42.

A route distribution section 74 is connected to the transmission / reception section via a bus 72. The route distribution unit 74 is a CD-R
It has a map information database composed of a read-only or writable recording medium such as an OM, a DVD, and a hard disk. This map information database stores the latest road map information and the latest guidance information on roads. The route distribution unit 74 includes
Based on the destination data and the current position data of the vehicle received in the above, and the analysis result of the traffic flow for each road section by the traffic flow analysis system 10 described above, from the current position where the vehicle should travel to the destination Search for a route.

The center 44 stores the position information of the route obtained as a result of the search by the route distribution unit 74 and the guidance information about the route in a predetermined data storage unit together with the destination data for each identification ID code of the vehicle. Let it. Then, the position information and the guidance information of those routes are distributed from the transmission / reception unit 70 to the vehicle.

Next, the operation of the navigation system 40 of this embodiment will be described.

In the navigation system 40 of this embodiment, when the setting of the destination to be reached by the operation of the input unit 52 is completed, the navigation unit 42 first transmits and receives the information to connect the communication line with the center 44. The part 60 dials the telephone number of the center 44. Then, when the communication line with the center 44 is connected, the destination data and the current position data of the vehicle are transmitted together with its own identification ID code in order to request the center 44 to search for a route from the current position to the destination.

The center 44 includes the navigation unit 4
If the identification ID code, the destination data and the current position data are received from the navigation unit 42 after the communication line with the communication line 2 is connected, the route distribution unit 74 is caused to search for a route from the current position to the destination. And
The position information of the route obtained as a result of the search by the route delivery unit 74 and the guidance information about the route are delivered to the vehicle. The navigation unit 42 supplies a command signal to the video output unit 64 based on the position information and guidance information of the route distributed from the center 44, and superimposes and displays the distribution route from the center 44 on the road map on the display screen. I do.

Further, when the vehicle stops traveling along the distributed route, the navigation unit 42 transmits and receives the transmission / reception unit 60 to connect the communication line with the center 44.
Dials the telephone number of the center 44, and instructs the center 44 to again search for a route from the current position to the destination.
Transmit with D code. When the center 44 receives the identification ID code, the destination data, and the current position data from the navigation unit 42 after the communication line with the navigation unit 42 is connected, the center 44 executes the above-described route search processing.

In the navigation system 40, the navigation unit 42 keeps the road map updated even when the road map owned by the navigation unit 42 does not match the actual road laying condition due to the construction of a new road. By receiving the distribution from the updated center 44, the video output unit 6 can select an appropriate route that matches the actual road laying condition.
4 is displayed on the display screen. Therefore, according to the navigation system 40 of this embodiment, the vehicle is moved from the current position to the destination by the route searched based on the latest road map at the center 44 without frequently updating the road map of the navigation unit 42. It is possible to guide to.

By the way, a number of routes can be considered as a route from the current position to the destination, but it is desirable to select a route that can reach the destination in the shortest required time without severe traffic congestion. However, traffic congestion on the road
Since it changes according to the time, that is, according to the time zone, there is a possibility that even when traffic congestion occurs at one time in one road section, the traffic congestion is resolved when the vehicle travels on that road section. . Therefore, in searching for an optimal road as a route from the current position to the destination, it is necessary to consider the traffic congestion state at the time when the vehicle is expected to run for each road section between them.

For example, when the vehicle travels from the current position O to the destination D as shown in FIG. 6, the route may be a road section AV21 → ST21 → AV12 → AV1.
3. Road section AV21 → AV22 → ST22 → AV1
3. Road section AV21 → ST31 → AV32 → ST3
2 → ST22 → AV13, etc.

In this embodiment, first, the analysis result of the traffic flow in the current time zone is read out for the road section AV21 where the vehicle is currently traveling, and the current position O and the intersection P21 which is the end of the road section AV21 are read. And the time T21 at which the vehicle is expected to arrive at the intersection P21 based on the distance between the vehicle and the read analysis result. Next, road sections ST21, AV22, S connecting to intersection P21
For each T31, the analysis result of the traffic flow at the estimated arrival time T21 of the intersection P21 is read, and based on the result, the vehicle is moved to the end points P11, P22, P of the road section.
Times T11, T22, T3 expected to arrive at 31
1 is calculated. Hereinafter, similarly, the road section S connecting to the intersection P at the estimated arrival time T arriving at the intersection P
The analysis result of the traffic flow of T and AV is read, the time required for the vehicle to travel on the road section ST and AV is calculated based on the result, and the time T when the vehicle arrives at the intersection P at the end of the road section is calculated. Is calculated.

Then, from the current position O to the destination D (from the current position O to the intersection P12 on the map shown in FIG. 6).
Is set as the search result, that is, the route that is expected to have the shortest required time, that is, the route in which the time at which the vehicle arrives at the destination is expected to be closest to the current time. According to such a method, it is possible to search for a route from the current position O to the destination D in consideration of the traffic congestion state at the time when the vehicle is expected to travel on each road section.

Therefore, according to the search method by the navigation system 40 of the present embodiment, even if the route length from the current position to the destination is relatively long, a road that can reach the destination in the shortest time from the current time is set as the route. It is possible to perform an appropriate route search in consideration of traffic congestion on the road. For this reason, according to the navigation system of the present embodiment, it is possible to provide the vehicle occupant with an optimal route corresponding to the traffic flow expected to occur on the road in the future.

Next, a traffic flow analysis system according to a second embodiment of the present invention will be described with reference to FIG. 9 together with FIG. FIG. 9 is a diagram for explaining a method of determining a route of a vehicle traveling from a current position to a destination D in the present embodiment.

By the way, in the system shown in FIG.
A road section is a section in the case where a plurality of accessible roads are divided at each intersection where the plurality of accessible roads are connected. As shown in FIG. 9, a narrow street S as a detour is connected in the middle of the road section. May be. That is, there may be an intersection where no traffic signal is provided in the road section. When the narrow street S is connected to the road section AV22 in this way, if severe congestion or the like occurs in the road section AV22, the vehicle that has entered the road section AV22 from the intersection P21 is used as a detour and the narrow street S (see FIG. 9 (shown by a broken line), and may head toward the destination D via the road section AV22.

Therefore, the system of this embodiment is different from the system shown in FIG. 1 in that when a narrow street exists in a road section, a vehicle enters the road section and then travels on the road section as it is. And the time of arrival at the destination when passing through a narrow street (that is, comparing the required times), and as a result, the required time is significantly shorter when traveling through a narrow street. When possible, this is realized by making the vehicle enter a narrow street.

Specifically, when the vehicle is in the road section A shown in FIG.
When entering V22, for road section AV22 (n-
1) After reading out the analysis result of the traffic flow in the time zone of the first time, the time at which the vehicle is expected to arrive at the intersection P22 is calculated, and the traffic flow of the road section ST22 in the (n-1) th time zone is calculated. , The time T12 at which the vehicle is expected to arrive at the intersection P12 is calculated, and the time Td1 at which the vehicle arrives at the destination D is calculated. Also,
The time at which the vehicle is expected to arrive at the intersection with the narrow street S is calculated, and the analysis result of the traffic flow on the narrow street S in the time zone set based on the road data and the vehicle characteristic data is read. The time required to pass through the narrow street S is calculated, and the time at which the vehicle arrives at an intermediate intersection in the road section AV12 is calculated. Then, the analysis result of the traffic flow in the road section AV12 in the (n-1) th time zone is read, the time T′12 at which the vehicle is expected to arrive at the intersection P12 is calculated, and the time at which the vehicle arrives at the destination D is calculated. Calculate Td2. Then, those times Td1 and Td2 are compared, and if Td1> (Td2 + α) is satisfied, it is determined that the vehicle can arrive at the destination earlier through the narrow street S, and the vehicle is caused to flow into the narrow street S. . The traveling of the vehicle that has flowed into the narrow street S is reproduced according to the model shown in FIG. 2 described above.

The above processing is repeatedly executed each time a vehicle enters each road section connected to a narrow street. Therefore, according to the system of the present embodiment, in a situation where a narrow street exists in the middle of a road section, the traffic flow of the vehicle can be accurately reproduced in consideration of the narrow street. In such a configuration, it is possible to calculate the route of the vehicle with a smaller amount of calculation than in a configuration in which a narrow street is treated as a normal road section. Therefore, according to the system of the present embodiment,
It is possible to perform an appropriate traffic flow analysis in consideration of a calculation amount narrow street with a small calculation load.

In the first and second embodiments described above, the traffic situation reproducing section 14 performs step 12 in FIG.
By executing the processing of step 2, the "tail changing means" and "step (a)" described in the claims become the claims by executing the processing of step 104 in FIG. The described "head changing means" and "step (b)" execute the processing of step 120, so that the "congestion train arrival determining means" described in the claims performs the processing of step 102. By executing, the "congestion line outflow determination means" described in the claims is realized.

Further, in the first and second embodiments, the traffic situation reproducing section 14 claims that each vehicle branches at an intersection according to a branching rate set for each destination and for each intersection. The “branch control means” and “step (c)” described in the range of FIG.
The "congestion sequence analyzing means" and "step (d)" described in the claims by executing the processing of steps 140 and 142 therein execute the processing of step 144 described above. The "branch rate changing means" and "step (e)" described in (1) are realized respectively.

Further, in the first and second embodiments described above, the route distribution unit 74 of the center 44 uses the predetermined recording medium 18 for storing the traffic conditions reproduced by the traffic condition reproduction unit 14 in the traffic flow analysis system 10. "Step (f)" by reading the analysis result of the traffic flow in each road section from "", and "step (g)", "step (h)" by performing a route search based on the read analysis result. And "Step (i)" performs a route search based on the analysis result of the traffic flow in each road section by the traffic flow analysis system 10, thereby realizing the "route search means" described in the claims. Have been.

By the way, in the first and second embodiments, the on-vehicle navigation unit 42 is
Requests the delivery of a route to the destination, and in response to the request, the center 44 distributes the route to the destination to the vehicle side.
However, the route search is performed in consideration of the congestion sequence of vehicles in each road section analyzed using the traffic flow analysis system 10, but the present invention is not limited to this. CD storing analysis data of traffic congestion lines in each road section analyzed using the data 10
-It is also possible to apply the present invention to a navigation system in which a vehicle-mounted navigation unit searches for a route to a destination by itself using a ROM, a DVD, or the like.

In the second embodiment, the configuration in which one narrow street S is provided in the middle of the road section is applied. However, a plurality of narrow streets S are provided in the middle. It is also possible to apply to the configuration. In this case, the required time to the destination after passing through each narrow street S is compared with the required time when traveling along the road section as usual, and as a result, even one of the narrow streets S If there is a narrow street S that can significantly reduce the required time, the vehicle may enter the narrow street.

As described above, according to the first, second, third, fourth, and fifth aspects of the present invention, it is possible to accurately analyze a traffic flow in a predetermined road section with a small calculation load.

According to the sixth and seventh aspects of the present invention, it is possible to analyze the traffic congestion sequence in each road section, for example, in response to changes in the presence or absence of vehicles, destinations, and the like.

According to the eighth and tenth aspects of the present invention, it is possible to perform an appropriate route search in consideration of traffic congestion on a road.

According to the ninth aspect of the present invention, a road section in which a vehicle arrives at a destination early is searched for as a route in consideration of traffic congestion sequences in a plurality of road sections connected to a branch point. Can be.

[Brief description of the drawings]

FIG. 1 is a configuration diagram of a traffic flow analysis system according to an embodiment of the present invention.

FIG. 2 is a diagram for explaining an analysis model of a congestion sequence in one road section in the traffic flow analysis system of the present embodiment.

FIG. 3 is a flowchart of an example of a routine executed to eliminate a congestion line in one road section in the embodiment.

FIG. 4 is a flowchart of an example of a routine executed to extend a congestion line for one road section in the embodiment.

FIG. 5 is a diagram illustrating a case where a traffic congestion sequence as an analysis result of a traffic flow independently analyzed for each road section in a certain area is displayed on a map at the same time corresponding to each road in the present embodiment. It is an example of a display screen.

FIG. 6 is a diagram for explaining a method of determining a route of a vehicle traveling from a current position to a destination in the embodiment.

FIG. 7 is a flowchart illustrating an example of a routine that is executed to change a branching rate at each intersection in the embodiment.

FIG. 8 is a configuration diagram of a navigation system that searches for a route to a destination of a vehicle using an analysis result of the traffic flow analysis system of the present embodiment.

FIG. 9 is a diagram for explaining a method of determining a route of a vehicle traveling from a current position to a destination D in the traffic flow analysis system according to the second embodiment of the present invention.

[Explanation of symbols]

 Reference Signs List 10 traffic flow analysis system 14 traffic situation reproduction unit 40 navigation system 42 navigation unit 44 center 74 route distribution unit

Claims (10)

[Claims] 1. A traffic flow analysis system for analyzing a traffic jam sequence of vehicles in a predetermined road section, wherein when an approaching vehicle that has entered the predetermined road section reaches the traffic jam sequence, the traffic flow analysis system terminates the traffic jam sequence. A tail changing means for changing a tail to the position of the approaching vehicle; and when the leading vehicle of the congestion row flows out of the congestion row,
A head change means for changing a head of the congestion queue to a position of a following vehicle following the leading vehicle. 2. The traffic flow analysis system according to claim 1, wherein the approaching vehicle enters the congestion line based on data on the predetermined road section and a vehicle inflow amount per unit time into the predetermined road section. A traffic congestion row arrival discriminating means for discriminating whether or not the vehicle has arrived; the tail changing means changing the tail of the traffic congestion row to the position of the approaching vehicle in accordance with a result of the discrimination by the traffic congestion row arrival discriminating means. A traffic flow analysis system characterized in that: 3. The traffic flow analysis system according to claim 1 or 2, wherein a traffic congestion line outflow determining unit that determines whether or not the leading vehicle has flowed out of the traffic congestion line based on data on the predetermined road section. A traffic flow analysis system, wherein the head change unit changes the head of the congestion line to the position of the following vehicle according to the result of the judgment by the congestion line outflow judgment unit. 4. The traffic flow analysis system according to claim 1, wherein the head change unit is configured to execute the head change at a point in time when a predetermined time elapses after a vehicle ahead of the head vehicle flows out of the congestion line. A traffic flow analysis system, wherein a head of a congestion line is changed to a position of the following vehicle. 5. A traffic flow analysis method for analyzing a traffic congestion sequence of vehicles in a predetermined road section, wherein when a vehicle entering the predetermined road section reaches the traffic congestion sequence, the traffic flow analysis method ends the traffic congestion sequence. (A) changing the tail to the position of the approaching vehicle, and when the leading vehicle in the congestion row flows out of the congestion row,
(B) changing the head of the congestion queue to the position of a following vehicle following the leading vehicle. 6. A branch control means for branching each vehicle at an intersection according to a predetermined branch rate, and a vehicle in each road section connecting two intersections under a situation where each vehicle is branched by the branch control means. A traffic flow analysis system, comprising: a traffic jam line analyzing means for analyzing each of the traffic jam trains; and a branch rate changing means for changing the predetermined branch rate based on an analysis result by the traffic jam train analyzing means. 7. A step (c) of branching each vehicle at an intersection according to a predetermined branching rate, and a road section connecting two intersections in a situation where each vehicle branches at the step (c). Analyzing each of the traffic congestion trains in step (d)
And a step (e) of changing the predetermined branching rate based on the analysis result of the step (d). 8. A step (f) of reading traffic congestion column data of vehicles in each road section recorded on a predetermined recording medium for each time zone, and a step of reading vehicle congestion in each road section read in step (f). (G) performing a search for a route to a destination to which the vehicle should travel based on the column data. 9. The route search method according to claim 8, wherein the step (f) includes the step of: executing the first time at a first time when the vehicle arrives at a first branch point as an end of a first road section. The step (g) reads out the congestion column data related to the congestion column expected to occur in the second road section connected to the branch point, based on the congestion column data read in the step (f). (H) calculating a second time at which the vehicle arrives at a second branch point as an end of the second road section; and a time at which the vehicle arrives at the destination is closest to the current time. (I) setting the road constituted by the route as the route to the destination. 10. Based on traffic congestion sequence data of vehicles in each road section recorded on a predetermined recording medium for each time zone,
A route search device comprising a route search unit that searches for a route to a destination to which a vehicle should travel.