JPH0439800A - Travel time presenting device - Google Patents

Abstract

PURPOSE:To offer the travel time required for running two arbitrary spots on a network of roads to a user by providing a vehicle detecting means, an arithmetic means, an input means, a path means, a travel time calculating means, and an output means. CONSTITUTION:When two spots on a network of roads is inputted, a path fro connecting two points thereof is determined by a path determining means, and a distance between two points on the path is derived. Also, by detecting a vehicle running on the road by a vehicle detecting means, an average speed of the vehicle is derived. Subsequently, by dividing the distance between two points by the average speed, the time required (travel time) in the case of running between two points is derived by a travel time calculating means. In such a way, a running path between arbitrary spots on the network of roads and the travel time in the case of running along its path are offered. Accordingly, a user can drive in a feeling having composure even at the time of a traffic jam, since a destination arrival time is conjectured in advance, and it is related to safety driving and related to prevention of an accident.

Description

[Detailed Description of the Invention] [Industrial Field of Application] This invention relates to a travel time providing device, and particularly to a travel time providing device that provides the time required to travel between two points on a road network. Concerning time provision equipment.

[Problems to be Solved by the Prior Art and the Invention] Information boards have conventionally been installed on roads as information providing devices that provide road traffic information to drivers. Information boards display road traffic information in text that changes from moment to moment, such as ``Congestion due to construction 2'', ``Tokyo 1 Gotemba / Road closed due to accident'', ``Caution when driving in strong winds'', etc. Additionally, radio broadcasting is another means of providing information other than information boards. Information related to road traffic provided through radio broadcasts includes weather information, traffic jam information, accident information, traffic regulation information, and the like.

The information from the information boards and radio broadcasts mentioned above is
This is information that informs the current traffic situation, and serves as a reference for drivers to decide whether to proceed on the planned route or not.

However, this information is individual information about each road, such as which route to take to reach the destination quickly or how much time it will take to reach the destination. It is not intended to provide extremely detailed information.

In particular, recently, traffic congestion has become chronic due to an influx of vehicles exceeding the road's capacity, and traffic conditions are becoming more serious day by day, so it is important to provide information in real time that helps drivers decide on routes. It has been demanded.

Therefore, the main object of the present invention is to provide a travel time providing device that can provide a user with the travel time required to travel between any two points on a road network. be.

[Means for Solving the Problems] In order to achieve the above-mentioned object, the travel time providing device of the present invention includes vehicle detection means installed at predetermined intervals on a road to detect vehicles. , a calculation means for calculating the average speed of the vehicle based on the output of the vehicle detection means, an input means for inputting two points on the road network, and an input means for inputting two points input by the input means. Determine the route to connect
the distance required to travel the section based on the distance between two points on the route determined by the route determining means, and the average speed of the section calculated by the calculating means. , a travel time calculation means for calculating travel time;
It is configured to include output means for outputting data indicating the travel time calculated by the travel time calculation means and data indicating the route determined by the route determination means.

The above-mentioned route determining means stores, for each point on the road network, information indicating possible routes to travel from that point, and also includes storage means that stores in advance information indicating the destination of each route. and a search means for searching the storage means based on point information including one point inputted from the input means, selecting one route that can be traveled from the said point, and finding the destination point of the route. a determining means for determining whether or not the destination point matches another point input from the input means each time the destination point is searched by the search means; a control means for controlling the search means to repeat the search operation until a match is found; and a route output means for outputting information indicating a route from one point to the other point in response to a match determined by the discrimination. It is composed of:

The above-mentioned output means may display the plurality of determined routes when the plurality of routes are determined by the route determination means. Further, the output means may display a plurality of routes in an overlapping manner in descending order of travel time.

Further, the travel time calculation means described above may correct the travel time based on the time required to travel the section from the branch point to the confluence point on the road network.

Furthermore, the standard time calculation means calculates the required time when traveling at the regulated speed based on the distance between two points on the route determined by the route determination means and the predetermined regulated speed, and the standard time calculation means. and a comparison means for comparing the time calculated by the means and the time calculated by the travel time calculation time, and the output means displays the longer of the two times compared by the comparison means. , it may be done as follows.

[Operation] In the travel time providing device according to the present invention, when two points on a road network are input, a route connecting the two points is determined, and a distance between the two points on the route is determined. Additionally, by driving on the road and detecting vehicles, the average speed of the vehicle can be determined. Then, by dividing the distance between the two points by the average speed, the time required to travel between the two points (travel time) is determined.

Further, in the travel time providing device according to the present invention, when determining a route, one route that can be traveled from a starting point is selected, and the destination point of that route is determined. When the destination point is determined, it is determined whether the destination point is the destination point. If it is not the destination point, a route that can be traveled further from the destination point is selected, the next destination point is found, and it is determined whether or not the destination point is the destination point. By repeating this operation, when it is determined that the destination point has been reached, the route from the start point to the destination point is output. If there are multiple routes,
All the obtained routes are output in a form visible to the user. If multiple routes are displayed, the route with the shortest travel time will be displayed at the top, starting with the one with the longest travel time.

The road network includes the section from the branch point to the confluence point, and traffic jams are likely to occur in this section, so if the total travel time is corrected by the travel time in this section,
It can provide more accurate travel time.

Furthermore, if the average speed of the vehicle exceeds the regulated speed, the travel time is calculated by dividing the distance of the section by the regulated speed. In this way, it is possible to prevent general users from being misled into thinking that they are driving at a speed that exceeds the speed limit.

[Embodiment of the Invention] FIG. 4 is a diagram showing the overall configuration of a road traffic information providing system to which an embodiment of the invention is applied.

Referring to FIG. 4, the road traffic information providing system includes vehicle sensors 2 installed on each road 1 constituting a road network;
A traffic control center 3 that collects current information related to road traffic including information from vehicle sensors 2, and a data editing device 9 that edits the collected information so that road users can judge the road situation. and road information providing devices 10 to 14 that display the edited data.

The vehicle sensor 2 is preferably provided every several hundred meters in order to accurately grasp the traffic situation on the road. In addition to vehicle detection information from the vehicle sensor 2, the traffic control center 3 receives
Collect information that affects road traffic such as weather information,
an information collecting device 4 for processing, an information processing device 5 for processing the information collected by the information collecting device 4, and an information provision for providing the information processed by the information processing device 5 to the outside. A device 6 is provided. The information processing device 5 receives information from surveillance cameras, emergency telephones, patrol cars, etc. and information related to construction through input devices operated by traffic controllers.
Information is entered. The information providing device 6 provides information related to road traffic to an information board 7 and a data editing device 9 provided on the road.

The information given from the traffic control center 3 to the data editing device 9 includes information indicating the degree of congestion for each section, information indicating travel time for each section, accident information, construction information, weather information, 1 road closure/entry restriction information, and information. This includes information about the display contents displayed on the board. The various types of information mentioned above are sent from the traffic control center 3 to the data editing device 9 at fixed time intervals of 1 to 5 minutes.
given to. In the data editing device 9, information related to road traffic from the traffic control center 3 is transferred to the road information providing device 10.
Edited into the format shown in ~14. The edited road traffic information is output to the road information providing device of the terminal via a communication line (public communication line, private line, control network) at fixed time intervals of, for example, 1 minute to 5 minutes.

Next, the configuration and operation of a road information providing device as an example of a travel time providing device will be described in detail using a road information providing device installed in a parking area as an example.

FIG. 5 is a perspective view showing the parking area road information providing device. In the road information providing device 10 shown in FIG.
Display device 15, keyboard 16, and user detection sensor 1
7 is provided. The display 15 displays traffic jam information, accident/construction/weather information, information board display content information, travel time information, etc. The keyboard 16 is connected to the display 15
This is for selecting and specifying the information to be displayed. The user detection sensor 17 uses the road information providing device 10 to detect a person, and in response to this detection output,
A menu screen is displayed on the display 15.

FIG. 6 is a key layout diagram of the keyboard shown in FIG. 5. The keyboard 16 shown in FIG. 6 includes a key 161 for instructing the display of traffic jam information, a key 162 for instructing the display of accident/construction/weather information, and a key 162 for instructing the display of information on the information board. a key 163 for instructing, a key 164 for specifying the display of travel time information, and a display 1.
It includes a next page key 165 for changing the display screen of No. 5, and a number key 166 for inputting number data.

FIG. 7 is a schematic block diagram showing the main electrical configuration of the road information providing device shown in FIG. In FIG. 7, the road information providing device includes a CPU 2 for controlling its operation.
0 is set. This CPU 20 has a keyboard 16
．． Timer 21', ROM22. RAM23. A display control section 24 and a communication control section 25 are connected. The timer 21 measures the current time. ROM22 is CP
It stores the operation program of U20. RAM
2B stores traffic information received via the communication line;
It is something. The RAM 23 also stores data tables and data buffers shown in FIGS. 9A, 9B, 11, and 13 later. The display control unit 24 controls the display operation of the display 15. The communication control unit 25 controls the transmission and reception of data between the data editing device 9 and the CPU 20, and is connected to a modem 26 that modulates and demodulates signals.

FIG. 8 is a diagram for explaining how to group sections in an embodiment of the present invention. When considering a route from one point to another, searching for the next route for each short section increases the number of processing steps and takes time.

Therefore, in this embodiment, as shown in FIG. 8, blocks are considered that are divided by road branching points or merging points and main points. In Figure 8, there is a point B or a branch point, and a point F.
It is a confluence point, and points A and C.

D, E, G are the main points. Block numbers between each point are shown as BLI to BL6. In this way, by setting blocks and searching for the next route for each block, the number of processing steps can be reduced.

Figures 9A and 9B show data tables used to determine the route from the current point to the destination point, in particular, Figure 9A shows the initial route setting table, and Figure 9B shows the next route setting table. shows. The initial route setting table shown in FIG. 9A stores information indicating the route block to be passed next when starting from a certain point. For example, as shown in FIG. 10, suppose there is a point C between points B and D, and the route to point A and the route to point F diverge at point B. Starting from point C, the route is from point C to point B (
There is a route block "124") and a route block "133°" from point C to point D. In this case, as shown in Figure 9A, the point code "68" representing point C is The corresponding records include the route block number "124" for the route from point C to point B, and the route block number "133°" for the route from point C to point D.
is stored.

The next route setting table shown in FIG. 9B stores information indicating the next point to be reached after passing through a certain route and the route that can be branched next. If you take the route from point C to point B shown in Figure 10, after reaching point B,
At point, the route branches into a route heading towards point A and a route heading towards point F. In this case, as shown in FIG. 9B, the route block number "124" representing the route from point C to point B is
In the record corresponding to ", "63" representing point B is stored as the arrival point code, and the route block number "123" representing the route from point B to point A is stored as the route block number of the branching route. , a route block number "65" representing a route from point B to point F are stored.

FIG. 11 is a diagram showing a data buffer used for finding a route from the current location to the destination location. 11th
In the figure, a current location code buffer 233 stores a location code representing the current location. Destination point code buffer 234 stores a point code representing a destination point. The route buffer 235 is used to connect route blocks that make up a route and find a route from the current point to the destination point.If there are multiple routes, it is possible to find multiple routes. is now possible.

The passing point buffer 236 also stores the point code of the passing point that the user passes through when taking the route from the current point to the destination point. Passing point buffer 236
is used to determine whether a passing point is the same point as a point passed before. When the same passing point appears in the passing point buffer, it means that the route is in a loop.

FIG. 13 is an illustrative diagram showing a travel time data table included in the RAM 23. Travel time data table 23
7 stores data indicating the time required to pass through the route block for each route block number. This time data is given from the data editing device 9 to the road information providing devices 10-14. For this purpose, the data editing device 9 calculates the average speed of vehicles within each route block based on information from a plurality of vehicle sensors installed within that block, and obtains the distance of that block. The average time required for a block is calculated by dividing it by the average speed. The road information providing device adds up the average travel time for all blocks on the determined route and calculates the travel time between two points.

14A and 14B are diagrams for explaining display contents displayed on the road information providing device shown in FIG. 5. FIG. 1, 2A, and 2B are flowcharts for explaining one embodiment of the present invention. In particular, FIG. 1 shows the main routine, and FIG. 2A shows the steps shown in FIG. 1. A routine for determining a route in step S6 (abbreviated as S6 in the figure) is shown, and FIG. 2B shows the travel time calculation process in step S7 shown in FIG. Next, the operation of one embodiment of the present invention will be described in detail.

When the power is turned on, initial processing is performed in step S1, and the contents of the data buffer shown in FIG. 11 are cleared. Note that the current location code buffer 233 is
Since this information is unique to the road information providing device 10, there is no need to clear it. When a user stands in front of the road information providing device 10 shown in FIG. 5, the user detection sensor 17 detects the user and outputs a detection signal to the CPU 20. In response to the detection signal, in step S2, the display 15 displays “
``Press the desired key.'' message is displayed.If the user wants to know the travel time to the destination point, he/she can press the travel time key 164.In step S3, the travel time key 164 is displayed. When the key 164 is pressed, the screen shown in FIG. 14A is displayed on the display 15 in step S4.

A road map showing a road network is displayed on the screen shown in FIG. 14A, and the road map shows a symbol indicating the current location and a point number of each point on the road network. Below the road map, the message "Please enter your desired destination using number keys" is displayed. In step S5, when the user inputs the point number of the destination point using the numeric keys 166, a process for determining a route is performed in step S6. The process of finding a route is performed as follows.

Referring to FIG. 2A, in step S61, the initial route setting table 231 is searched using the current location as the starting point and the starting point code as a key. Subsequently, in step S62, it is determined whether or not there is a corresponding record. If the applicable record does not exist, error processing is performed, and if the applicable record does exist, the process advances to step 863. In step 56B, one route block number included in the record is selected and stored in one area of route buffer 235. Subsequently, in step S64, the next route setting table 232 is searched using this route block number as a key to find the corresponding record. Step S65
Then, it is determined whether the arrival point code or the destination point code included in the record matches. If the arrival point code does not match the destination point code, step S66
If it matches, then the destination point has been reached, so the operation ends.

In step S66, it is determined whether the same code as the obtained arrival point code is stored in the passing point buffer 236. This is to determine whether the route is looped or not. If the same code as the arrival point code is stored in the passing point buffer, step 57
If the data is not stored, the process advances to step S67. In step S67, the destination point code is stored in the passing point buffer 236. Subsequently, in step S68, it is determined whether the record includes the block number of the next branching route.

This is to determine whether the arrival point is the end of the route. If the record does not include the block number of the branching route, the process advances to step S74, and if it does, the process advances to step S69. In step S69, the obtained route block number is stored in the route buffer 235. Subsequently, step S64
Returning to , the next route setting table 232 is searched using this route block number as a key. In this way, each time a new route or route block is found, by connecting the route block numbers indicating that route,
The route buffer 235 stores information indicating the route taken. When the destination point is reached, the passing point buffer 236, which is a work area, is cleared.

In step S66, if it is determined that the same code as the destination point code is stored in the passing point buffer 236, the process advances to step 571 and loops back to the previous point or route block number. That is, in the route buffer 235, the route block number strings stored in a chain form are traced back and looped back to the previous route block number. Subsequently, in step S72, the route block number of the loop portion is deleted from the route buffer 235. Subsequently, in step 873, the next route setting table 232 is searched using the route block number as a key, and it is determined whether all branch routes that can branch from the corresponding destination point have already been selected. If there is a branch route that has not been selected yet,
Proceeding to step S75, read the block number of the branchable route that is not selected in the record, use this route block number as a key, and then proceed to step S6.
Return to 4. As a result, while maintaining the loop route from the start point to the previous point, another route is searched for using the loop point as the starting point. Step 3
If it is determined in step S73 that all routes have been selected, the process advances to step S74, returns to the previous point, deletes the route block number of the returned route from the route buffer 235, and then returns to step S74. Step 57
Return to 3. In this way, the user returns to a point where there is a branch route that has not yet been selected, and searches for a route using the returned point as a starting point.

If it is determined in step 368 that there is no route that can be branched, the process proceeds to step S74, and an operation for searching for a route that can be branched is performed in the same manner as described above.

Once one route from the start point to the destination point is found in this way, the same operation as described above is performed to find another route to the destination point. The found routes are arranged in order of long distance or long arrival time and are stored in a predetermined area of the RAM 23.

When the process for determining the route is completed, next, in step S7 shown in FIG. 1, travel time calculation process is performed. Travel time calculation processing is performed as follows.

Referring to FIG. 2B, in step S91, a variable T for determining travel time is cleared.

Subsequently, in step S92, the section travel time t corresponding to one route block constituting the route is read from the travel time data table 237 shown in FIG. 13, and in step 59B, T+t is calculated. . Step S94
Then, it is determined whether or not the travel time calculation process has been completed for all route blocks constituting the route.

If the process has not ended, the process advances to step S92, and the above-described addition operation is repeated. In this way, travel time is calculated for one route. If there are multiple routes from the current location to the destination location, calculations are performed for all routes. The calculation result is stored in a predetermined area of the RAM 23.

Next, referring to FIG. 1, the display order is determined in step S8. The display order is determined, for example, to display in the order of the longest distance or the order of the longest travel time. Subsequently, in step S9, the route from the current point to the destination point and the travel time along that route are displayed on the display 15. An example of the display mode is shown in FIG. 14B. In Figure 14B, the current location -
Route A of point 1 - point 10 - destination point 9 and current point -
Route B from point 1 to point 7 to destination point 9 is displayed, and if you take route A, it will take 48 minutes, and if you take route B, it will take 1 minute.
It is shown that it takes 1 minute. If route A and route B are displayed in different colors, and the colors are added in order from the current point to the destination point, the user will be able to see where the user is going and the display will be easy to see. In addition, as mentioned above, if multiple routes are displayed, the route with the longest time is displayed in order, and the route is displayed later or overlaid on the previously displayed route. Good too. In this way, the route with the shortest travel time will be displayed last. By overwriting each route in a different color, the shortest route drawn last will be displayed in its complete form. Note that another route may be further overwritten on the shortest route by the user's key input. Furthermore, each route may be displayed individually by the user's keystrokes. In addition, along with the road map shown in FIG. 14B, the names of the main points along the route may be displayed, for example, Takashimadaira-Takebashi-Tanimachi-Ichi-Shibuya.

Figure 15 explains the handling of crossover lines on expressways.
This is a diagram for Some interchanges on expressways have a road shape as shown in FIG. 15. 15th
In the figure, sections H1, H2, H3, and H4 are called "crossovers," and traffic jams and accidents occur in these sections as well.

For this reason, the time required for the crossover can have a significant effect on the overall travel time. In order to correct the travel time using the time required for this crossover, the above-mentioned next route setting table is set as follows. -For example: From point A to point B
Consider a route to point C passing through.

In this case, if one starts at point A and travels in the direction of the upward arrow shown in FIG. They are block BL2 and block BL4. Block B
The crossover for branching to L2 is the crossover line H1, and the crossover for branching to block BL4 is the crossover line H2. Therefore, in the next route setting table 232 shown in FIG. 9B, BL2+H1 and BL4+H2 are stored as block numbers of routes branching from block BLI.
. By setting in this way, the traffic conditions of the crossover can be reflected in the travel time.

The flow of calculating the travel time including the travel time of the crossover line is shown in the third part.
As shown in the figure.

Referring to FIG. 3, in step 5101, T-0 is determined. In step 5102, the section travel time t1 corresponding to one route block constituting the route is read from the travel time data table 237, and in step 8103, T+tl is calculated. Next, step 51
At step 04, it is determined whether or not there is a crossover. If there is a crossover, in step 5105, the
Section travel time t2 is read from the travel time data table, and in step 8103, T+t2 is calculated. In step 5107, it is determined whether or not the travel time calculation process has been completed for all route blocks constituting the route. If not, step 5102
Return to

In the travel time calculation method described above, the speed at which the vehicle is actually traveling is detected by a vehicle sensor, and the required time for each fixed section is calculated based on the travel speed. The calculation formula is the following formula (1).

However, if the vehicle actually travels at a high speed without observing the speed limit for the road, the required time is calculated by calculating formula (1) based on the speed limit.
The required time may be so short that it cannot be reached by driving normally at the regulated speed. It is not preferable to provide this directly to an acid driver. For this reason, the following method is used to prevent displaying speeds that exceed the regulated speed.

1) First, calculate in advance the time required when traveling at the regulated speed.

2) Next, calculate the required time calculated by formula (1) and formula (2)
If the required time of equation (1) is shorter, the travel time is provided based on the required time of equation (2).

3) In addition, if the speed limit is changed and displayed each time due to weather or other reasons, calculate the required time using formula (2) based on the current speed limit, and calculate the required time using formula (1).
Provides travel times based on whichever takes longer.

[Effects of the Invention] As described above, according to the present invention, the travel route between arbitrary points on the road network and the travel time for traveling along that route are provided, so that the user can easily reach the destination. Since you can estimate the time in advance, you can drive with plenty of time even in crowded conditions, which leads to safe driving and accident prevention. In addition, by driving on the provided route, it is possible to avoid congestion, increasing the efficiency of overall road network use, and minimizing the degree of congestion and congestion.

[Brief explanation of drawings]

FIG. 1 is a flow diagram for explaining the operation of an embodiment of the present invention. FIG. 2A is a flow diagram for explaining the process of step S6 shown in FIG. 1. Figure 2B is the first
It is a flowchart for explaining the process of step S7 shown in the figure. FIG. 3 is a flowchart for explaining the operation of calculating the travel time including the travel time of the crossover. FIG. 4 is a diagram showing the overall configuration of a road traffic information system to which an embodiment of the present invention is applied. FIG. 5 is a perspective view showing a road information providing device provided in a parking area. 6th
This figure is a key arrangement diagram of the keyboard shown in FIG. 5. 7th
This figure is a schematic block diagram showing the main electrical configuration of the road information providing device shown in FIG. 5. FIG. 8 is a diagram for explaining how to group sections in an embodiment of the present invention. FIGS. 9A and 9B are diagrams showing data tables used to determine the route from the current location to the destination location. FIG. 10 is a diagram for explaining the relationship between the data stored in FIGS. 8A and 8B and the road map. FIG. 11 is a diagram showing a data buffer used to find a route from the current point to the destination point. 1st
2A and 12B illustrate the process of finding a route,
This is a diagram for FIG. 13 is an illustrative diagram showing a travel time data table included in the RAM shown in FIG. 7. 1st
4A and 14B are diagrams for explaining display contents displayed on the road information providing device shown in FIG. 5. FIG. 15 is a diagram for explaining the handling of crossover lines on expressways. In the figure, 10 is a parking area road information providing device, 15 is a display, 16 is a keyboard, 20 is a CPU,
22 is a ROM, 2B is a RAM, and 24 is a display control section. 1128 District Figure 3 Figure 4 Figure 5 Figure 6 Figure 87 Figure 9 Figure A Flood ~ A j Number of colors B Figure 8 J Eupun C Figure 1 +A Figure 1//-F3 Figure Zhao 6. D

Claims (1)

[Scope of Claims] (1) Vehicle detection means installed at predetermined intervals on the road to detect vehicles; and calculation means for calculating the average speed of the vehicle based on the output of the vehicle detection means. an input means for inputting two points on a road network; a route determining means for determining a route connecting the two points inputted by the input means; and a route determined by the route determining means. a travel time calculation means that calculates the travel time required to travel the section based on the distance between the above two points and the average speed of the section calculated by the calculation means; A travel time providing device, comprising: output means for outputting data representing a calculated travel time and data representing a route determined by the route determining means. (2) The route determining means stores, for each point on the road network, information indicating routes that can be traveled from that point, and storage means that stores in advance information indicating the destination of each route. and a search means that searches the storage means based on the point information including one of the points inputted from the input means, selects one route that can be traveled from the said point, and finds the destination point of the route. and a determination means for determining whether or not the arrival point matches the other point input from the input means each time the arrival point is searched by the search means, and a match is determined by the determination means. a control means for controlling the search operation of the search means to be repeated until a match is found; The travel time providing device according to claim 1, further comprising a route output means for outputting information indicating the travel time. (3) The travel time providing device according to claim 1 or 2, wherein the output means displays a plurality of determined routes when the plurality of routes are determined by the route determination means. . (4) The travel time providing device according to claim 3, wherein the output means displays the plurality of routes in an overlapping manner in descending order of travel time. (5) The travel time calculation means outputs the travel time corrected by the time required to travel the section from the branch point to the confluence point existing on the road network. The travel time providing device according to any of paragraphs. (6) 2 on the route determined by the route determining means
a standard time calculation means for calculating the required time when traveling at the regulated speed based on the distance between points and a predetermined speed limit; the time calculated by the standard time calculation means; and the travel time calculation means Claims 1 to 5 further include a comparison means for comparing the time calculated by the comparison means, and the output means displays the longer of the two times compared by the comparison means. The travel time providing device according to any of paragraphs.