JP2002310684A - Method for providing information based on time when a vehicle passes a predetermined road, and center-side device for providing similar information - Google Patents

Abstract

(57) [Summary] [Problem] Information based on an estimated arrival time of a vehicle, which is useful for a user of a store or the like (how many vehicles pass on a road adjacent to the store at what time and at what time). Etc.). SOLUTION: Computer 21 of traffic information center 20
Estimates the conditions (congestion, weather conditions) of the roads constituting the route from the departure point P to the destination G of each vehicle, and allows the driver of the vehicle to drive the vehicle under the estimated road conditions. Estimating the driving speed when driving as a preferred driving speed, and using the distance of the road and the estimated favorite driving speed to estimate the arrival time to each road on the route from the departure point to the destination. I do. Then, these estimations are performed for each vehicle, and the number of vehicles existing at a predetermined time on a road adjacent to the user such as the store requesting the information is estimated. Providing to users.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a method for providing information obtained based on a time at which a vehicle passes a predetermined road to a user such as a store, and a center device for providing the same kind of information.

[0002]

2. Description of the Related Art Hitherto, a system has been proposed in which information on road traffic is collected, the occurrence of traffic congestion is grasped based on the information, and the result is provided to each vehicle. On the other hand, when a driver selects a route, information about how long it takes to pass through a certain traveling section is more effective than information about whether or not a certain traveling section is congested. In some cases. Therefore, Japanese Patent Application Laid-Open No. 9-259287
In the system disclosed in Japanese Patent Laid-Open Publication No. H10 (1995), when a vehicle passes a predetermined traveling section, the actual required time of the section is transmitted from the vehicle to the center, and the center transmits the actual required time transmitted from each vehicle. And updates the actual required time at the present time of each traveling section, and transmits the updated actual required time to other vehicles required for route determination.

[0003]

However, the system disclosed in the above publication only provides information on road traffic to vehicles. For example, a store or the like adjacent to a road on a route may receive such information. There was a problem that could not be used effectively. Further, even if such information is provided to a store or the like, the information is current or past information, so that the information cannot be effectively used for business (for example, changing a closing time, deploying a clerk, etc.). There is a problem.

[0004]

SUMMARY OF THE INVENTION An information providing method according to the present invention aims to provide useful information to users other than vehicles such as stores, and one of the features of the method is to provide information along a predetermined route. It is an object of the present invention to estimate a time at which an arbitrary traveling vehicle passes a road constituting a predetermined section on the same route, and to provide a user with information based on the estimated time. in this case,
It is preferable to obtain compensation from the user who received the information so that the information is provided for a fee. Further, the information based on the estimated time includes information on the number of vehicles estimated to pass on a road adjacent to the location of the user at a predetermined time (the predetermined time includes a predetermined time zone). Preferably, it is information.

According to this, the time at which an arbitrary vehicle traveling along a predetermined route passes through a road constituting a predetermined section of the same route is estimated, and information based on the estimated time (for example, a predetermined time) is obtained. Information about the number of vehicles estimated to pass on a road adjacent to the location of the user at the time is provided to the user such as a store. Therefore, the user of the store or the like can reflect the provided information on the business of the store, such as a change in business hours, an arrangement of clerks, and a change in electronic advertisement. The road adjacent to the location of the user includes a road facing the building of the user, a road that is highly likely to be stopped by a vehicle passing through the road to receive the service of the user, and the like.

Another feature of the present invention is a center device configured to be able to communicate with a vehicle device and a user device mounted on a vehicle, and relates to a future route of the vehicle from the vehicle device. Route information acquiring means for acquiring information, and passing time estimation for estimating a time at which the vehicle traveling along the route forms a predetermined section of the route and passes a road adjacent to the location of the user-side device Means for predicting the number of vehicles passing through the road at a predetermined time based on the respective passage times of the road predicted by the passage time estimating means for the plurality of vehicles having acquired the information on the route. Means for predicting the number of passing vehicles, and information distributing means for distributing information relating the predicted number of vehicles to the predetermined time to the user-side device. . The road adjacent to the location of the user device is synonymous with the road adjacent to the location of the user.

[0007] According to this, the center device acquires information on a future route of each vehicle from each vehicle, and each vehicle constitutes a predetermined section on the route and determines a location of the user device. Predict the time to pass an adjacent road. Then, the center-side device determines a predetermined time (the predetermined time includes a predetermined time zone) based on each of the predicted passing times of the road for the plurality of vehicles that have acquired the information on the route. ), The number of vehicles passing through the road is predicted, and information relating the predicted number of vehicles and the predetermined time is delivered to the user-side device.

Therefore, a user of a store or the like can know in advance when and how many vehicles will pass on a road adjacent to his or her location, and can predict the number of users to a certain extent. The business contents can be changed according to the change in the number of users.

[0009]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS An embodiment of an information providing system for implementing an information providing method according to the present invention will be described below with reference to the drawings. This information providing system whose overall configuration is shown in FIG. 1 includes a navigation unit 10 as a vehicle-side device mounted on each vehicle and a center computer 2 as a center-side device in a traffic information center 20.
1. It is configured to include a computer 31 in the weather information center 30 and a computer 41 as a user device in the store 40.

As shown in FIG. 2, the navigation unit 10 has a microcomputer 11 as a main component. The microcomputer 11 includes a CPU 11a, a ROM 11b, and a RAM 11 connected to each other by a bus.
c and an input / output interface 11d.
The CPU 11a executes a program (routine) described later stored in the ROM 11b while using the data storage function of the RAM 11c.

The navigation unit 10 includes a GPS device 12, a terrestrial communication device 13, a display device 14, and an audio device 15 connected to the input / output interface 11d so that signals can be input to and output from the CPU 11a. , An external memory 16, and an operation unit 17.

The GPS device 12 is connected to an antenna 12a for receiving GPS signals from the GPS satellites 51, 52, 53 shown in FIG. 1, and receives the GPS signal via the antenna 12a every predetermined time. The own vehicle position P is specified by the GPS signal, and data relating to the specified vehicle position P is transmitted to the microcomputer 11.

The terrestrial communication apparatus 13 is connected to a terrestrial antenna 13a, receives a radio signal from the traffic information center 20 shown in FIG. 20 is transmitted to the predetermined information. Display device 14
Includes a display (not shown), and displays necessary map information and the like in accordance with an instruction signal from the microcomputer 11. The audio device 15 is connected to the speaker 15a, and generates necessary audio according to an instruction from the microcomputer 11.

The external memory 16 includes a hard disk, an MO
Necessary information such as data and programs is supplied to the microcomputer 11 and the CPU 1
The necessary information is stored according to the instruction of 1a. The operation unit 17 includes an operation switch, and can input a destination G, select a route, and the like.

The navigation unit 10 of each vehicle is configured to achieve the following functions. (1) When the destination G is input by the vehicle user, the destination G and the vehicle position P are transmitted to the traffic information center 20. (2) When one of the candidate routes from the traffic information center 20 to the destination G transmitted to the vehicle is selected by the user of the vehicle, the result of the selection is transmitted to the traffic information center 20. (3) When the vehicle passes through the node nk recognized by the traffic information center 20, information (node nk) for specifying the passed node is transmitted to the traffic information center 20. (4) When a predetermined instruction is given by the user, the traffic information center 20
A signal for specifying the type of information related to sales at a store or the like and a signal for requesting distribution of the information are transmitted. In any of the above cases, the navigation unit 10 transmits to the traffic information center 20 a vehicle ID for specifying a vehicle (or a user of the vehicle) on which the unit is mounted.

The traffic information center 20 is provided with a computer 21 shown in FIG. This computer 2
1 is a CPU 21a and a ROM 2 connected to each other by a bus.
1b, a RAM 21c, a hard disk 21d, and an input / output interface 21e.

The CPU 21a executes a program (routine) described later stored in the ROM 21b or the hard disk 21d while utilizing the data storage function of the RAM 21c. In addition, the CPU 21a
The terrestrial communication device 22, the wired communication device 23, and the database 24 are connected via the input / output interface 21e.

The terrestrial communication device 22 includes an antenna 22a, receives a signal from the navigation unit 10 of the vehicle via the antenna 22a, provides the signal to the computer 21, and transmits predetermined information according to an instruction from the computer 21. The data is transmitted to the navigation unit 10. The wired communication device 23 includes a computer 21 of the traffic information center 20, a computer 31 of the weather information center 30, and a computer 41 of the store 40,
It is communicably connected via the Internet I.

The database 24 is an external storage device capable of reading and writing data, and stores and stores map information, data relating to traffic conditions, information relating to sales of shops, and the like. The map information includes a road number R assigned to each road X, as shown in FIG.
n, the shape of each road X, nodes nn indicating both ends of each road X, and the distance (distance between adjacent nodes nn) LX of each road X. Further, data on traffic conditions is stored in the CX table shown in FIG. 8 and Vus shown in FIG.
Includes er table. These CX tables and V
Although the user table will be described later, the Vuser table is prepared for each vehicle ID of all vehicles using this system.

The computer 31 of the weather information center 30, which is capable of distributing data relating to the collection of weather information and the weather forecast, is connected to the Internet I and communicates with the computer 21 of the traffic information center 20 via the Internet I. Can be exchanged.

Similarly, the computer 41 of the store 40
It is connected to the Internet I, and can exchange information with the computer 21 of the traffic information center 20 via the Internet I.

Next, the operation of the information providing system will be described. (Determination of Recommended Route) The computer 21 of the traffic information center 20 determines a recommended route from the current vehicle position P (hereinafter, also referred to as a departure point P) to a destination G, and relates to the determined recommended route. In order to transmit the information to the vehicle, a program (routine) shown by a flowchart in FIG. 5 is executed every elapse of a predetermined time. That is, the CPU 21a of the computer 21 starts the processing of this program from the step 500 shown in FIG. 5 at a predetermined timing, and proceeds to the step 505 to obtain information on the vehicle ID, the vehicle position P, and the destination G from any vehicle. It is determined whether or not the information has been received. If these pieces of information have not been received from any vehicle, “No” is determined in step 505 and the process proceeds to step 595. The process that ends once is repeatedly executed.

On the other hand, as described above, when the user of the vehicle inputs the destination G to the navigation unit 10 in order to determine the route from the current position P to the destination G,
The navigation unit 10 has a vehicle ID of the vehicle.
And the vehicle position P of the vehicle and the input destination G are transmitted to the computer 21 of the traffic information center 20.

Accordingly, when the user inputs the destination G to the navigation unit 10, the CPU 21a makes a "Yes" determination at step 505, proceeds to step 510, and selects and determines a candidate route at step 510.
In this case, the CPU 21a does not consider the time (required time) required to reach the destination G, and moves from the vehicle position P (actually, the node closest to the vehicle position P) to the destination G (actually, , A predetermined number of routes are selected in order from the route having the shortest traveling distance to the destination (the node closest to the destination G).

Next, the CPU 21a proceeds to step 515, and sets the time of reaching the destination G by one of the candidate routes selected and determined in step 515 (expected arrival time) for all the candidate routes. Calculate.

More specifically, the CPU 21a executes step 515 and executes step 60 shown in FIG.
Then, in step 605, one of the selected and determined candidate routes is arbitrarily selected.

Next, the CPU 21a proceeds to step 610, sets the total time (required time) SU required to reach the destination G to "0" in step 610, and then sets the current time SU in step 615. Is set to the node arrival time T0. Next, the CPU 21a proceeds to step 620,
In step 620, the transit time UX () from the node ni indicating the departure point (vehicle position) P to the next node nj on the route selected in step 605 (the node nj adjacent in the direction closer to the destination G). T0) is calculated.

The calculation of the transit time UX (T0) is performed by executing a subroutine detailed in FIG. That is, the CPU 21a starts processing from step 700,
Proceeding to step 705, the traffic condition index value CX (T0) at time T0 of the road X specified by the nodes ni and nj is read from the CX table shown in FIG. At this time, if there is no corresponding traffic condition index value CX (T0) for the time T0, the traffic condition index value CX (T0) at the time t closest to the same time T0.
Is read. For example, when the time T0 is 6:02 and the CX table has CX values at 10-minute intervals, that is, CX (6: 0
If the CX table is configured as in (0), CX (6:10)..., CX (6:00) is read as CX (T0).
The traffic condition index value CX (T0) is one of the parameters indicating the road condition at the time T0 of the road X (for example, the congestion condition).
In the present embodiment, it is a predicted value of the total number of vehicles traveling on the same road X at the same time T0. A method of updating the traffic condition index value CX (T0) will be described later.

Next, the CPU 21a proceeds to step 710, and acquires the weather index value WX (T0) of the road X at the time T0 from the computer 31 of the weather information center 30. The weather index value WX (T0) is one of the parameters indicating the road condition.
For example, the weather condition at the time T0 of the area including the road X such as sunny, light rain, heavy rain, typhoon, light snow, and heavy snow is coded. Next, the CPU 21a proceeds to step 715, and the Vuser table shown in FIG. 9 corresponding to the vehicle ID received in step 505 in step 715,
The traffic condition index value CX (T0) read in the previous step 705
And the weather index value WX (T0) obtained in the previous step 710, and reads the preferred driving speed Vuser of the vehicle. Under the road condition represented by the traffic condition index value CX (T0) and the weather index value WX (T0),
This is the speed at which the user of the vehicle specified by the vehicle ID will run the vehicle. A method of updating the preferred driving speed Vuser will be described later. Subsequently, the CPU 21a proceeds to step 720, in which the passing time UX is calculated by dividing the distance LX of the road X by the preferred driving speed Vuser.
(T0) is obtained, and step 625 is performed via step 795.
Proceed to.

The CPU 21a calculates a new arrival time T0 by adding the passing time UX (T0) to the node arrival time T0 at step 625, and then adds the passing time UX to the total time SU at that time at step 630. The time obtained by adding (T0) is set as a new total time SU. Next, the CPU 21
In step 635, a determines whether or not the node nj is the destination G. Usually, to reach destination G,
At this point, it is rare that the node nj is the destination G because it is necessary to go through a plurality of roads X from the departure point P. In this case, the CPU 21a determines "No" in step 635. Proceeding to step 640, node ni and node nj are updated in step 640. Specifically, the CPU 21a sets the previous node nj as the node ni, and sets a node adjacent to the newly set node ni toward the destination G on the selected route to the new node nj. After that, the process returns to the step 620 to execute the subroutine for calculating the transit time UX (T0) shown in FIG.

As a result, at step 705, regarding the road X specified by the nodes ni and nj newly set at the previous step 640, the traffic condition index value CX (at the node arrival time T0 updated at the step 625 is obtained. T0) is read, and the weather index value WX (T0) of the road X at the node arrival time T0 updated at step 710 is obtained. Then, at step 715, V corresponding to the vehicle ID
From the user table, the traffic condition index value CX (T0) and the weather index value
The preferred driving speed Vuser corresponding to WX (T0) is read, and the transit time UX (T0) of the road X is calculated in step 720.

Next, the CPU 21a determines the node arrival time T0 and the total time in steps 625 and 630.
The SU is updated, and in the following step 635, it is determined whether or not the node nj is the destination G. If the node nj is not the destination G, the CPU 21a proceeds to step 64.
0, 620 to 635 are executed again. If the node nj coincides with the destination G, “Yes” is determined in step 635 and the process proceeds to step 645. Thus, the CPU 21a
Is the road X on the route from the departure point P to the destination G
For each (between adjacent nodes), the user's preferred driving speed of the vehicle is calculated from the traffic condition index value CX (T0) of the road X at time T0 and the weather index value WX (T0) of the road X at the same time T0. Predict how Vuser will be, and calculate the preferred driving speed V
The transit time UX (T0) of the road X is calculated from the distance LX between the user and the road X, and the total time SU from the departure point P to the destination G is calculated by integrating the transit time UX (T0).

When the CPU 21a determines "Yes" in step 635 and proceeds to step 645, the CPU 21a selects the total time SU and the arrival time (expected arrival time) T0 in the previous step 605. The process is stored in association with the route, and the process proceeds to step 650 to determine whether the calculation of the total time SU and the arrival time T0 has been completed for all of the plurality of candidate routes.

At this stage, the calculation of the total time SU for one candidate route has only been completed. Accordingly, the CPU 21a determines “No” in step 650 and proceeds to step 655, sets “0” in the total time SU in step 655, and sets the current time to the node arrival time T0 in step 660. Set. Then, CPU
21a selects one of the remaining candidate routes (the calculation of the total time SU and the arrival time T0 has not been completed) in step 665, and returns to step 620. Thus, the total time from the starting point P to the destination G by one of the remaining candidate routes
The arrival time T0 to the SU and the destination G is predicted in the same manner as described above, and the total time SU and the arrival time T0 are stored in association with the selected route.

When such a procedure is repeatedly executed and the calculation of the total time SU and the arrival time T0 has been completed for all the candidate routes, the CPU 21a proceeds to step 650 and returns to “Ye”.
s ", and proceeds to step 695, at which step 69
The process proceeds to step 520 shown in FIG. Then, in step 520, the CPU 21a assigns a high priority to the candidate route having the earlier arrival time T0 (the route having the shorter total time SU), and in subsequent step 525, assigns the vehicle having the vehicle ID received in the previous step 505 to the vehicle having the vehicle ID. The candidate route is transmitted together with the priority and the like, and then the process proceeds to step 595 to end the processing of this routine.

Thus, the user of the vehicle can know the plurality of routes to the destination G and the arrival times on each route, and thus can easily select the optimal route.

(Update of Traffic Condition Index Value CX) Next, the operation when updating the traffic condition index value CX stored in the CX table shown in FIG. 8 and indicating the congestion state of the road X will be described. The computer 21 of the center 20
A program for updating the CX table shown in FIG. 0 is executed every elapse of a predetermined time. That is,
The CPU 21a of the computer 21 starts the process from step 1000 at a predetermined timing, proceeds to step 1005 as route information acquisition means, determines whether or not a result of route selection has been received from a vehicle, If no selection result of the same route is received, step 109
The process of proceeding to step 5 and temporarily ending this routine is repeatedly executed.

On the other hand, as described above, the navigation unit 10 transmits the result of the selection to the traffic information center 20 when the user of the vehicle selects one of the candidate routes transmitted from the traffic information center 20. It has become.

Accordingly, when the vehicle user selects one of the candidate routes, the CPU 21a determines "Yes" in step 1005 and proceeds to step 1010, where the value of the total time SU is set to "0" in step 1010. , And the current time is set to the node arrival time T0 in the following step 1015. Next, the CPU 21a determines in step 1020
From the node ni indicating the departure point P on the route selected in the step 1020 to the next node n on the same route.
In order to calculate the transit time UX (T0) up to j, the subroutine for calculating the transit time UX (T0) shown in FIG. 7 is executed. Since the contents of this subroutine are as described above, the description is omitted.

Next, the CPU 21a proceeds to step 1025, in which the current node arrival time T0 is stored as the past node arrival time T0old, and
Proceeds to step 30 at the current node arrival time T0.
The node arrival time T0 is updated by adding the passing time UX (T0) obtained in 020, and the road X is specified by the nodes ni and nj in the following step 1035.

Next, the CPU 21a proceeds to step 1040.
In step 1040, all traffic condition index values CX (T0) corresponding to the time between the node arrival time T0old and the node arrival time T0,
(T0) is read from the CX table shown in FIG. 8, and in the subsequent step 1045, the read traffic condition index value CX (T
0) is increased by “1” and stored as a new traffic condition index value CX (T0).

Next, the CPU 21a proceeds to step 1050.
It is determined whether or not the node nj is the destination G at. Normally, in order to reach the destination G, it is necessary to pass through a plurality of roads X from the departure point P, so that the node nj is rarely the destination G at this time.
The PU 21a determines “No” in Step 1050, proceeds to Step 1055, and updates the nodes ni and nj in Step 1055.

Specifically, the CPU 21a sets the node nj at that time as the node ni, and determines whether the node nj is adjacent to the newly set node ni in the direction of the destination on the selected route. Set the node as a new node nj. Next, the CPU 21a executes step 102
After returning to 0, the traffic condition index value CX (T0) is similarly updated in step 1045. If the node nj matches the destination G, the CPU 21a proceeds to step 1050.
Is determined to be "Yes", the process proceeds to step 1095, and the routine ends in step 1095.

As described above, every time the user of the vehicle selects a route, the traffic information center 20 predicts the time of arrival at each node on the route, and determines the road on the route according to the time of arrival. The value of the traffic condition index value CX (T0) of X is increased by “1”. As a result, the number of vehicles traveling on each road at a future time is estimated, and the same value as the number is set as the traffic condition index value CX (T0). As understood from the above, the routine shown in FIG. 10 constitutes a passing time estimating means for estimating a time at which a vehicle traveling along a selected route passes a road constituting a predetermined section on the selected route. are doing. Since this road includes all the roads recognized by the traffic information center 20, the road X adjacent to the location of the user 40 is also included. Therefore, FIG.
The routine shown in (1) predicts the time at which a vehicle traveling along the selected route constitutes a predetermined section on the route and passes a road X adjacent to the location of the user (user-side device). It is also a means.

FIG. 4 shows an example of the traffic condition index value CX (T0) updated in this way. In this example, it is assumed that the initial values of the traffic condition index values CX (T0) are all “0”. First, as shown in FIG. 4A, the node n0 is selected as the departure point P, the node n8 is selected as the destination G, and the information is transmitted to the navigation unit 10 of the vehicle.
To the computer 21 of the traffic information center 20. Thereby, the computer 2 of the traffic information center 20
1 determines a candidate route and a priority order, and transmits information such as the determined candidate route to the navigation unit 10 of the vehicle. The user of the vehicle selects a route based on this information. In this example, as shown in FIG. 4B, nodes n0-n3-n4-n7-n8 (roads R0-R12-R3-R1
5) is selected, and the result of the selection is transmitted from the navigation unit 10 of the vehicle to the computer 21 of the traffic information center 20.

The computer 21 estimates the arrival time T0 to each node on the same route as described above, based on the route selection result transmitted from the vehicle. In FIG. 4B, an example of the estimated arrival time T0 is shown in parentheses. Then, the vehicle arrives at a certain node at time T0.
And arrival times at nodes on the selected route that are adjacent to the node in a direction away from the destination G.
Since the vehicle travels on the road X specified by these two nodes between the arrival time T0old and the arrival time T0, the computer 21 determines the traffic condition index value CX corresponding to the road X in the period from the arrival time T0old to the arrival time T0. (T0) is increased by “1”.

For example, in this example, the arrival time T0 at the node n3 is 6:02, and the arrival time T0 at the node n4 is
6:18, the traffic condition index value CX (T) of the road R12 specified by the nodes n3 and n4 between these times.
0), that is, C12 (6:10) is increased by “1”.

(Calculation of Preference Driving Speed Vuser) Next, the operation when updating the above-mentioned preference driving speed Vuser will be described.
A program for updating the preferred driving speed Vuser shown in FIG. 1 is executed every predetermined time.

That is, the CPU 21a of the computer 21 starts the process from step 1100 in FIG. 11 at a predetermined timing, and proceeds to step 1105 to receive the vehicle ID and information on the node nk through which the vehicle has passed from any vehicle. It is determined whether or not the same information is received from any of the vehicles, and the process proceeds to step 1195 to repeatedly execute the process of ending this routine once.

On the other hand, as described above, when the vehicle equipped with the navigation unit 10 passes through the node nk recognized by the traffic information center 20, the navigation unit 10 transmits the vehicle ID of the vehicle and information on the node nk. The information is transmitted to the traffic information center 20.

Therefore, when the vehicle passes through the node nk,
The CPU 21a determines “Yes” in step 1105 and proceeds to step 1110, in which the vehicle identified by the vehicle ID received in step 1110 has passed the previous node nm and the vehicle has passed the same node nm. Time
T1old is read from the database 24, and in the following step 1115, the current time is stored as the actual node arrival time T1. Then, in step 1120, the node nm
And the road X is specified from the node nk and the distance LX of the road X is specified.
Read out.

Next, the CPU 21a proceeds to step 1125.
And the time required to actually pass through road X (T1-
T1old) and the distance LX divided by the same road X
Is obtained as the current preferred driving speed Vuser0, and in step 1130, the corresponding traffic condition index value CX (T0) is read from the road X, the actual node arrival time T1, and the CX table. In reading data from the CX table, the variable T0 for reading data is set to the actual node arrival time T1, and the time T0 (=
If the traffic condition index value CX (T0) corresponding to (T1) does not exist, the traffic condition index value CX (T0) at the time t closest to the time T0.
Is read. Note that an intermediate time ((T1 + T1old) / 2) between the time T1 and the time T1old may be set as the variable T0, and the traffic condition index value CX (T0) at the time t closest to the time T0 may be read.

Next, the CPU 21a proceeds to step 1135.
To the weather index value WX (T
1) is obtained from the weather information center, and the following step 1140
Reads the preferred driving speed Vuser from the Vuser table. Specifically, the CPU 21a transmits the received vehicle I
Select the Vuser table for D, and select the selected Vuser
The table, the traffic condition index value CX (T1) (= CX (T0)) read in the previous step 1130, and the weather index value WX (T1) (= WX (T0)) obtained in the previous step 1135 The preferred driving speed Vuser is read out based on this.

Next, the CPU 21a proceeds to step 1145. In step 1145, the CPU 21a calculates the weighted average value of the read preferred driving speed Vuser and the current preferred driving speed Vuser0 obtained in step 1125. It is obtained based on the equation shown, and is set to the latest Vuser. The value α described in step 1145 is an arbitrary constant from 0 to 1. After that, the CPU 21
a proceeds to step 1150, and the value of the preferred driving speed Vuser obtained in step 1145 is specified by the vehicle ID, the traffic condition index value CX (T0), and the weather index value WX (T0). It is written in the Vuser table as the preferred driving speed Vuser.

As described above, the computer 21 of the traffic information center 20 calculates the average speed when the vehicle actually travels on the road according to the actual time required for the vehicle to pass the road X. A new preferred driving speed Vuser0 of the user of the vehicle is calculated based on the average speed. Then, the existing preference driving speed Vuser corresponding to the traffic condition index value CX (T0) and the weather index value WX (T0) indicating the situation in which the preference driving speed Vuser0 is obtained is calculated according to the calculated preference driving speed Vuser0. Update. As a result, the reliability of the preferred driving speed Vuser is further improved.

(Information on road conditions (number of passing vehicles)
Next, the operation for providing the traffic condition index value CX (T0), which is one of the information on the road condition to be updated as described above, to users other than vehicles such as stores will be described. The traffic condition index value CX (T0) is a value that is updated when the vehicle selects the route to the destination G as described above, and any vehicle traveling on a predetermined route is This is information based on the time at which the vehicle passes through the road constituting the predetermined section, and more specifically, the number of vehicles estimated to be passing through the road at the predetermined time.

More specifically, the computer 21 of the traffic information center 20 executes a program for providing information on road conditions shown in FIG. 12 every time a predetermined time elapses.

That is, the CPU 21a of the computer 21 starts the process from step 1200 at a predetermined timing, and proceeds to step 1205 to determine whether or not a user such as a store has requested distribution of information on road conditions. If a distribution request for the same information is not received from the user, the process proceeds to step 1295 to repeatedly execute the process of temporarily ending this routine.

For this reason, the user uses the computer 41 to access the traffic information center 2 via the Internet I.
0 computer 21 (in this case, the computer 21
Functions as a distribution server. ), The CPU 21a determines “Yes” in step 1205 and proceeds to step 1210.
Then, in the same step 1210, the current time is set to time T0.

Next, the CPU 21a proceeds to step 1215.
To the road X adjacent to the location of the user who requested the distribution in the step 1215 (the road X on which the user's store or the like faces the building), the user ID transmitted from the computer 41 on the user side. Specify based on. Next, the CPU 21a proceeds to step 1220, where the traffic condition index value CX from the time T0 to the time (T0 + TA) obtained by adding the predetermined time TA to the same time T0 is determined.
(T0) to CX (T0 + TA) are read from the CX table, and the data for providing the image shown in FIG. Note that the predetermined time TA is an arbitrary time (for example, 2 hours), may be a fixed time, or may be configured to be specified by the same user when a distribution request is made by the user. As can be understood from the above, the routine shown in FIG. 10 and the steps 1210 to 1220 constitute the predetermined sections of the routes respectively predicted for a plurality of vehicles that have acquired the information on the selected route. A passing vehicle number estimating means for estimating the number of vehicles passing through a road X adjacent to the user's location at a predetermined time based on the passing time of the road.

Next, the CPU 21a proceeds to step 1225.
Then, the image data is transmitted to the user who has made the distribution request, and in step 1230, the user is charged. Specifically, the number of information provisions for the user is increased by “1”, and after a predetermined period of time, an amount corresponding to the number of information provisions is collected from the user's bank (or credit company) account. To perform the process. Then, the CPU 21a executes step 1
Proceeding to 295, the present routine is terminated once. Steps 1220 and 1225 constitute information distribution means for distributing information relating the predicted number of vehicles and the predetermined time to the computer 41 of the user-side device.

As described above, FIG. 13 shows the traffic condition index values CX (T0) to CX (T0 + TA) of the road adjacent to the user at the time from the current time T0 to the time after the time TA. Can be obtained in the form of an image. Since this traffic condition index value CX indicates the traffic congestion status of the road in the near future, that is, the number of vehicles passing through the road at each time, the user can use his / her store based on the number of vehicles passing through the road. You can anticipate the number of employees and change your business to an appropriate one.

That is, for example, if the user is a restaurant or the like, and the traffic condition index value CX at a certain time in the future suddenly increases, it can be expected that there will be many customers at that time. It is possible to prepare for a sudden increase in the number of users, such as preparing dishes that can be provided in accordance with the schedule, increasing the number of clerks, extending business hours, or changing the display contents of electronic advertisements and the like.

It should be noted that when the image data is created in the above step 1220, a more accurate tally is performed, whereby
Higher value information can be provided to users. For example, in the above step 1220,
Instead of directly reading the traffic condition index values CX (T0) to CX (T0 + TA), information about vehicles passing through the road X at times T0 to T0 + TA is collected, and vehicles with a running duration of a certain time or more and less than a certain time And the result may be provided to the user in step 1225 as image data. A vehicle with a running duration of less than a certain time is likely to be immediately after a break or the like with respect to a vehicle with a running duration of a certain time or more. This is because there is a low possibility of stopping at the store.

At step 1220, the time T0
~ T0 + TA to collect information on vehicles passing through the road X, and determine whether each vehicle (user) has used the store (user) in the past (such information is If the vehicle stops at a place where the traffic information center 2
0. ), And the results may be provided to the user in step 1225 as image data. This is because a vehicle that has used the store in the past is more likely to use the store when passing the road X than a vehicle that has not used the store in the past.

(Provision of Information on Number of Users) Next, the operation for providing information on the number of users in a store or the like to a user in the store or the like will be described.
0 executes the program shown in FIG. 14 every time a predetermined time elapses.

That is, the CPU 21a of the computer 21 starts the processing from step 1400 at a predetermined timing, and proceeds to step 1405 to determine whether or not a user such as a store has requested distribution of information on the number of users of the store. If no distribution request for the same information is received from any user, the process proceeds to step 1495 to repeatedly execute the process of temporarily terminating the present routine.

For this reason, the user uses the computer 41 to access the traffic information center 2 via the Internet I.
When the CPU 21a requests the computer 21 of No. 0 to distribute the information on the number of users, the CPU 21a proceeds to step 1405.
In step 1410, information on vehicles having the same store as the destination G (including the estimated arrival time at the destination G) is collected from the database 24. And sums up the results by time zone.

Then, the CPU 21a determines in step 141
In step 5, image data for providing the image shown in FIG. 15 in which the number of users of the user (store) is graphed for each time zone is created, and in step 1420, the image data is transmitted to the user. . Next, the CPU 21a performs billing processing for the same user in step 1425 in the same manner as in step 1230 described above.
To end this routine once.

As described above, the user of the store or the like can obtain the number of vehicles that set the user as the destination G, that is, the number of users of the store or the like in the form of an image shown in FIG. Therefore, the user can change his / her business to an appropriate one based on the number of users for each time zone.

It should be noted that when the data is aggregated in step 1410, more accurate aggregation is performed, whereby information having a higher utility value can be provided to the user. For example, a vehicle (user) whose destination G is the user who has requested data distribution has set a relay point (stop point) between the departure point P and the same destination G, and this information is stored in the navigation unit. When the traffic information is transmitted from the traffic information center 20 to the traffic information center 20,
Vehicles for which relay points are set are classified as candidate users, and vehicles for which relay points are not set are classified as influential candidate users, and the results are transmitted to the user (see FIG. 15). This is because a user who has set a relay point may spend more time at the relay point than expected and may not stop at the destination G.

(Provision of Sales Information to Vehicle Users, etc.) Next, the operation of providing information on sales at stores and the like (hereinafter referred to as “business information”) to users, such as vehicle drivers, will be described. I do. First, the user of the store or the like changes his / her business contents based on the information such as the number of users obtained from the traffic information center 20 (it is not always necessary to change), and uses the computer 41 to access the Internet I.
And transmits its own business information to the computer 21 of the traffic information center 20. This sales information, for example,
Opening hours, closing times, services that can be provided (for example, dishes that can be provided if the store is a restaurant, that is, menus) and the like. Computer 21 of traffic information center 20
Receives the business information of the user of the store or the like and stores the information in the database 24.

On the other hand, the computer 21 of the traffic information center 20 executes a program for providing information relating to sales of stores and the like shown in FIG. 16 every time a predetermined time elapses. That is, the CPU 2 of the computer 21
1a starts processing from step 1600 at a predetermined timing, and proceeds to step 1605 to determine whether or not a distribution request for business information has been made. If no distribution request for the same information has been received from any vehicle, step 1695 And the process of temporarily ending this routine is repeatedly executed.

For this reason, the user of the vehicle requests the computer 21 of the traffic information center 20 to use the microcomputer 11 of the navigation unit 10 to send a signal for specifying the type of information related to sales at stores and the like, and to distribute the information. When the CPU 21a transmits a signal to perform the operation, the CPU 21a determines “Yes” in Step 1605, and proceeds to Step 161.
In step 1610, the sales information corresponding to the specified information type is read from the database 24. The type of the specified information is, for example, a meal that can be provided according to the opening time and closing time of the store on the route selected by the vehicle, or the time zone. Then C
The PU 21a proceeds to step 1615,
At step 15, the read business information is transmitted to the navigation unit 10 of the user who has requested the distribution of the business information, and at step 1695, this routine is temporarily ended.

In this way, the vehicle user can easily obtain effective business information on shops, facilities, and the like existing on the route to his / her destination G. Further, the business information is the latest information updated by stores and the like that have obtained future road conditions, and is therefore highly reliable information.

As described above, according to the present embodiment, the computer 21 of the traffic information center 20 allows the arbitrary vehicle traveling along the predetermined route (the route selected by the user of the vehicle) to execute the predetermined route on the same route. The time when the vehicle passes through the road X that constitutes the section (the arrival time TOold on the road X and the time T0 when the road X transitions to another road) is estimated, and information based on the estimated time (for example, a predetermined time) Information about the number of vehicles presumed to pass through the road X adjacent to the location of the user such as a store) is provided to the user of the store or the like. Therefore, the user of the store or the like can reflect the provided information on the business of the store, such as a change in business hours, an arrangement of clerks, or a change in electronic advertisement.

According to the present embodiment, the time required to pass each road X is estimated based on the future road conditions and the preferred driving speed of each vehicle (each driver). The road condition and the preferred speed are sequentially updated based on actual data. Therefore, it is possible to accurately determine the time at which each vehicle passes through the road X constituting the route selected by the vehicle, and to determine at a predetermined time the predetermined road X
The number of vehicles passing through can also be estimated more accurately.

The present invention is not limited to the above embodiment, and various modifications can be made within the scope of the present invention. For example, in the above-described embodiment, the user of the vehicle obtains business information using the navigation unit 10, but a general user uses his / her own computer (not shown) to access the Internet I or the like. By accessing the computer 21 of the traffic information center via the Internet, information on the business can also be obtained in the same manner.

Although the preferred speed Vuser is stored in the traffic information center 20, it may be stored in the navigation unit 10 of each vehicle. Further, in the above embodiment, various calculations are executed by the computer 21 of the traffic information center 20, but these calculation functions are provided in the navigation unit 10 of each vehicle,
The computer 21 of the traffic information center 20 may transmit data necessary for the calculation function to each vehicle.

[Brief description of the drawings]

FIG. 1 is an overall configuration diagram of an embodiment of an information providing system according to the present invention.

FIG. 2 is a block diagram of the navigation unit shown in FIG.

FIG. 3 is a block diagram of a computer in the traffic information center shown in FIG.

4A is an example of map information stored in a database in a traffic information center; FIG. 4B is an example of a route selected by a user and an arrival time at each node;
(C) is a figure showing an example of updated traffic condition index value CX (T0).

FIG. 5 is a flowchart showing a recommended route determination routine (program) executed by the computer shown in FIG. 3;

6 is a flowchart illustrating an arrival time prediction calculation routine executed by the computer illustrated in FIG. 3;

FIG. 7 is a flowchart illustrating a passage time calculation routine executed by the computer illustrated in FIG. 3;

FIG. 8 is a diagram showing a CX table storing traffic condition index values.

FIG. 9 is a diagram showing a Vuser table in which a preferred driving speed is stored.

FIG. 10 is a CX executed by the computer shown in FIG. 3;
9 is a flowchart illustrating a routine for updating a table.

FIG. 11 is a flowchart illustrating a routine for updating a preferred driving speed executed by the computer illustrated in FIG. 3;

12 is a flowchart illustrating a routine executed by the computer illustrated in FIG. 3 for providing information on road conditions to a user such as a store.

13 is a diagram illustrating an example of an image provided by executing the routine illustrated in FIG. 12;

14 is a flowchart illustrating a routine executed by the computer illustrated in FIG. 3 for providing information on the number of users of the store or the like to users of the store or the like.

15 is a diagram illustrating an example of an image provided by executing the routine illustrated in FIG. 14;

FIG. 16 is a flowchart showing a routine executed by the computer shown in FIG. 3 for providing information on sales to a user of the vehicle.

[Explanation of symbols]

10 navigation unit, 11 microcomputer, 12 GPS device, 13 terrestrial communication device, 1
4 display device, 15 audio device, 16 external memory, 1
7 operation unit, 20 traffic information center, 21 computer, 21d hard disk, 22 terrestrial communication device,
23: Wired communication device, 24: Database, 30: Weather information center, 31: Computer on the weather information center side
40: store, 41: computer on the store side.

──────────────────────────────────────────────────続 き Continued on the front page (51) Int.Cl. ⁷ Identification symbol FI theme coat ゛ (reference) G08G 1/00 G08G 1/00 A F term (reference) 2F029 AA02 AB07 AB13 AC06 AC09 5H180 BB15 DD01 EE02 EE10 EE13 EE14 FF05 FF13 FF22 FF27

Claims (4)

[Claims] 1. An information providing device for estimating a time at which an arbitrary vehicle traveling along a predetermined route passes through a road constituting a predetermined section of the same route, and providing information based on the estimated time to a user. Method. 2. The method for providing information according to claim 1, wherein the user receiving the information receives a price for providing the information. 3. The information providing method according to claim 1, wherein the information based on the estimated time is estimated to pass on a road adjacent to the location of the user at a predetermined time. A method of providing information, which is information on the number of vehicles to be used. 4. A center device communicable with a vehicle device mounted on a vehicle and a user device, wherein route information for acquiring information on a future route of the vehicle from the vehicle device. Acquiring means, passing time estimating means for estimating the time at which the vehicle traveling along the route forms a predetermined section of the route and passing a road adjacent to the location of the user-side device, Passing number prediction means for predicting the number of vehicles passing through the road at a predetermined time, based on each passing time of the road predicted by the passing time prediction means for the plurality of vehicles having acquired information; A center-side device that includes information distribution means for distributing information in which the predicted number of vehicles is associated with the predetermined time to the user-side device.