JP6303795B2 - Route search system and route search method - Google Patents

Description

  The present invention relates to a route search system and a route search method for performing route guidance that avoids a driving route that a driver is not good at.

  As a navigation system that searches for an optimal route from a departure place to a destination, for example, as in the technique described in Patent Document 1, it is used so as to avoid road attributes that the driver is not good at from route search and route guidance. There is a technology that provides a safe driving environment for the driver.

JP 2013-205227 A

However, in the technique described in Patent Document 1, the attribute of a poor road is specified by collating with a weak candidate database in which the driver is not good at accumulating road attributes. For this reason, there is a problem that a road that is not accumulated in the weak candidate database, that is, an untraveled road that the driver has not traveled in the past, cannot be searched as a poor road because the driver is weak.
The present invention has been made paying attention to the above-described problems, and is capable of searching for a road that the driver is not good at as a road that the driver is not good at. The purpose is to provide.

  In order to solve the above problems, the present invention analyzes driving operation data obtained by individually detecting driving operations performed by a plurality of drivers by each driver, and individually calculates the unsatisfactory degree of each driver. . Then, each driver is classified based on the calculated degree of weakness and the type of each driver is set. In addition to this, the first route search process for searching for a guide route based on the weakness of the driver who requested the provision of the guide route, and another driver set to the same type as the driver who made the provision request One of the second route search processes for searching for a guide route based on the degree of weakness of the user is selectively performed. Furthermore, the guide route information indicating the searched guide route is provided to the driver who has made the provision request.

According to the present invention, it is possible to analyze each driver's driving operation, individually calculate the unsatisfactory degree for each driver, and further classify each driver from the calculated unsatisfactory degree. It becomes possible.
This makes it possible to search for a road on which the driver who requested the provision of the guidance route has not traveled as a road that the driver is not good at using the other driver's unsatisfactory degree set to the same type. As a result, it becomes possible to search for a guidance route according to the degree of unsatisfaction with an untraveled road.

It is a block diagram which shows the structure of the route search system of 1st embodiment of this invention. It is a table | surface which shows the data which a link driving | running | working history database accumulate | stores. It is a flowchart which shows the process which a link driving history comparison calculating part performs. It is a flowchart which shows the process which a typification calculating part performs. It is a figure which shows a weakness list. It is a figure which shows a type pattern list. It is a flowchart of the operation | movement performed using the route search system of 1st embodiment of this invention. It is a block diagram which shows the structure of the route search system of 2nd embodiment of this invention. It is a table | surface which shows the data which a link driving | running | working history database accumulate | stores. It is a figure which shows the vehicle speed average value of each link. It is a flowchart which shows the process which a link driving history comparison calculating part performs. It is a figure which shows a weakness list. It is a figure which shows a type pattern list.

  Embodiments of the present invention will be described below with reference to the drawings.

(First embodiment)
Hereinafter, a first embodiment of the present invention (hereinafter referred to as the present embodiment) will be described with reference to the drawings.

(Overall configuration of route search system)
As shown in FIG. 1, the route search system S includes an in-vehicle device 1 and an information creation / distribution device 2.
The in-vehicle device 1 is formed using a known navigation device and is mounted on each vehicle C. The detailed configuration of the in-vehicle device 1 will be described later.
The information creation / distribution device 2 is provided in the data center 4 (base station). The detailed configuration of the information creation / distribution apparatus 2 will be described later.
In addition, the information creation / distribution device 2 transmits and receives information signals (information) and the in-vehicle device 1 individually provided in a plurality of vehicles via a communication path formed by a wireless communication path such as a cellular phone network. Do.

The communication method between the in-vehicle device 1 and the information creation / distribution device 2 can be arbitrarily selected. For example, the communication connection is not only a direct connection but also a vehicle-to-vehicle communication, a road-to-vehicle communication, Connection via satellite communication may be used.
In the present embodiment, as an example, a case will be described in which a plurality of vehicles C and the data center 4 are connected via a communication path so that information can be transmitted or received. In FIG. 1, three vehicles (vehicles C1 to C3) are illustrated as vehicles on which the in-vehicle device 1 is mounted. However, in the present embodiment, other vehicles (not shown) are also connected via the communication path. The data center 4 is transmitted or received. Moreover, the structure of the other vehicle which is not shown in figure is the same structure as the vehicle C shown in FIG.

(Configuration of in-vehicle device)
With reference to FIG. 1, the structure of the vehicle-mounted apparatus 1 is demonstrated.
The in-vehicle device 1 includes a vehicle information acquisition unit 6, a route guide unit 8, and a vehicle side data transmission / reception unit 10.
The vehicle information acquisition unit 6 receives data related to the behavior of the vehicle C detected by various sensors (not shown) provided in the vehicle C via an in-vehicle LAN (Local Area Network) not shown.

  The data related to the behavior of the vehicle C includes, for example, vehicle speed data detected by the vehicle speed sensor, acceleration data detected by the acceleration sensor, and steering angle data of the steering operator (steering wheel) detected by the steering angle sensor. In addition, the data relating to the behavior of the vehicle C includes, for example, braking pressure data detected by the brake pressure sensor and accelerator pedal opening (accelerator opening) data detected by the accelerator opening sensor.

Moreover, the vehicle information acquisition part 6 receives the input of the data of the present position of the vehicle C acquired, for example using GNSS (Global Navigation Satellite System) via in-vehicle LAN etc. which are not shown in figure. The GNSS is, for example, a GPS (Global Positioning System) receiver.
And the vehicle information acquisition part 6 outputs the information signal (it may be described as "vehicle information data signal" in the following description) containing the various data which received the input to the vehicle side data transmission / reception part 10. .

The route guidance unit 8 is formed by a navigation device including a touch display (touch panel) having a screen that can display images and the like and can be touch-input by the user, for example.
The route guide unit 8 may be formed using a device that can provide a guide route to the user. In addition to the navigation device, the route guide unit 8 may be formed using a PND (Personal Navigation Device), a Smartphone, or the like. Good.

  In addition, an image including characters and options for inputting a destination is displayed on the touch display forming the route guide unit 8 for a driver or the like and an occupant of the vehicle C. When the route guidance unit 8 receives the input of the destination, the route guidance unit 8 outputs an information signal including data (coordinates and the like) indicating the destination (may be described as “destination data signal” in the following description), It outputs to the vehicle side data transmission / reception part 10.

That is, the destination data signal is output by the vehicle C driven by the driver who has requested to provide the guidance route from the current location to the destination.
In addition, when receiving a guidance route signal from the vehicle-side data transmission / reception unit 10, the route guidance unit 8 displays an image in which a guidance route included in the guidance route signal is superimposed on a map image on the touch display. The guidance route signal and the guidance route will be described later.

Note that the configuration of the route guide unit 8 is not limited to a touch display, and may be formed using, for example, a switch having a movable unit such as a button or a lever in addition to a display capable of displaying an image.
The vehicle-side data transmission / reception unit 10 receives an input of a vehicle information data signal from the vehicle information acquisition unit 6 and receives an input of a destination data signal from the route guidance unit 8. Then, the vehicle-side data transmission / reception unit 10 receives the input vehicle information data signal and destination data signal at a predetermined interval with information (vehicle ID or the like) indicating the unique ID of the vehicle C added. Output to center 4.
Further, when receiving the input of the guidance route signal from the data center 4, the vehicle-side data transmission / reception unit 10 outputs the received guidance route signal to the route guidance unit 8. Note that the input of the route guidance unit 8 is received at a preset interval.

(Configuration of information creation / distribution device)
The configuration of the information creation / distribution device 2 will be described with reference to FIGS.
The information creation / distribution device 2 includes a center side data transmission / reception unit 12, a probe car database 14, a map database 16, a poor link management unit 18, and a route search unit 20. In the drawings and the following description, the probe car database 14 may be indicated as “probe car DB 14” and the map database 16 may be indicated as “map DB 16”.

  The center side data transmitting / receiving unit 12 receives an input of a vehicle information data signal and a destination data signal to which information indicating a unique ID of the vehicle C is added from the vehicle side data transmitting / receiving unit 10. And the center side data transmission / reception part 12 adds the vehicle information data signal and destination data signal which added the information which shows unique ID of the vehicle C to probe car DB14, the weak link management part 18, and the route search part 20. Output.

When the center side data transmission / reception unit 12 receives an input of the guidance route signal from the route search unit 20, the center side data transmission / reception unit 12 outputs the received guidance route signal to the vehicle side data transmission / reception unit 10.
The probe car DB 14 receives input of information signals from the center side data transmission / reception unit 12 and the weak link management unit 18. In addition, the probe car DB 14 stores and accumulates the travel history of the link, the weakness of each link, and the type of the vehicle C as data unique to the vehicle C. That is, the probe car DB 14 accumulates driving operation data in which driving operations performed by a plurality of drivers through a plurality of links are individually detected for each driver and each link.

Here, as described above, the data related to the behavior of the vehicle C, which is received by the vehicle information acquisition unit 6, includes vehicle speed data, acceleration data, steering angle data, braking pressure data, and accelerator opening data.
That is, driving operations performed by a plurality of drivers through a plurality of links include acceleration / deceleration operations by the driver and steering operations by the driver.

  The map DB 16 stores map data. Further, the map data stored in the map DB 16 is updated according to a certain period, for example. The map data stored in the map DB 16 includes, for example, the link length (distance) of each link obtained by dividing the road at intersections, fixed intervals, etc., the number of lanes of each link, the lane width of each link, Includes regulated speed. Each road and each link is stored in the map DB 16 as map data with information (unique ID, road ID, etc.) indicating a unique ID added thereto.

  The weak link management unit 18 includes a link travel history database 22, a link travel history comparison calculation unit 24, a poor link database 26, and a categorization calculation unit 28. In the drawings and the following description, the link travel history database 22 may be indicated as “link travel history DB 22” and the poor link database 26 may be indicated as “poor link DB 26”.

  The link travel history DB 22 associates the current position of the vehicle C included in the vehicle information data signal received from the center side data transmitting / receiving unit 12 with the link stored in the map DB 16. The link travel history DB 22 stores and accumulates the travel state of each vehicle C individually for every link. Therefore, the link travel history DB 22 individually stores and accumulates the travel state of each vehicle C, that is, the data (driving operation data) of the driving operation performed by the driver of each vehicle C for every link. .

  Here, in the link travel history DB 22, as shown in FIG. 2, as the travel state accumulated in the link travel history DB 22, a value indicating the travel state for each link of each vehicle C (each user), and for each link The average value calculated from the statistics of the values indicating the running state is recorded and accumulated. In addition, as shown in FIG. 2, the link travel history DB 22 records and accumulates average values calculated from statistics of values indicating the travel state of each vehicle C (all users) for each link. ing.

  In this embodiment, as an example, as shown in FIG. 2, the traveling state accumulated in the link traveling history DB 22 is detected by the braking pressure detected by the brake pressure sensor, the vehicle speed detected by the vehicle speed sensor, and the steering angle sensor. A case where the steering angular velocity using the steering angle is included will be described. Therefore, in the present embodiment, as an example, as shown in FIG. 2, the average value calculated from the statistics of the values indicating the running state for each link is the average value of braking pressure (braking pressure average value) and the average vehicle speed. A case will be described in which a value (vehicle speed average value) and an average value of steering angular velocity (steering angular velocity average value) are included.

The link travel history comparison calculation unit 24 acquires the travel state of each vehicle C for each link accumulated in the link travel history DB 22. And about the driving | running state of each vehicle C accumulate | stored in link driving | running | working log | history DB22, the driving | running state of all the vehicles C collected by the selected link and the selected one vehicle C (for example, vehicle C1) Compare the driving conditions.
Further, the link travel history comparison calculation unit 24 calculates the unsatisfactory degree in the selected link of the driver who drives the selected vehicle C according to the comparison result. In addition to this, the link travel history comparison calculation unit 24 sends the information signal including the calculated unsatisfactory degree (in the following description, may be referred to as “unsatisfied degree signal”) to the probe car DB 14 and unsatisfactory. It outputs to link DB26.

The processing performed by the link travel history comparison calculation unit 24 will be described later.
Also, the degree of weakness may be expressed arbitrarily, and for example, score evaluation, five-level evaluation, etc. can be used.
In the present embodiment, as an example, a case where the degree of weakness is calculated by five-level evaluation will be described.

That is, in the present embodiment, a case will be described in which the unsatisfactory degree of each driver is calculated by multiple stages of evaluation.
The weak link DB 26 is a data (unsatisfied degree calculation link) in which data of the poor degree of interest is associated with the link where the poor degree included in the poor degree signal received from the link travel history comparison calculation unit 24 is calculated. Data) is stored and accumulated.

  The categorization calculating unit 28 acquires the weakness calculation link data from the poor link DB 26, refers to the weakness of each vehicle C for each link, and classifies the driver who drives each vehicle C I do. The categorization calculating unit 28 may describe an information signal (data “driver type data signal” in the following description) including data (driver type data) typifying the driver who drives each vehicle C. Is output to the probe car DB 14.

Note that the processing performed by the categorization calculating unit 28 will be described later.
The route search unit 20 receives the destination data signal and the vehicle information data signal from the center side data transmission / reception unit 12. Then, the route search unit 20 calculates a plurality of travel routes from the current position to the destination from the destination included in the destination data signal and the current position of the vehicle C included in the vehicle information data signal. In addition, a plurality of travels from the current position to the destination for one vehicle C that has acquired the weakness calculation link data from the poor link DB 26 and has output the destination data signal and the vehicle information data signal. The guide route is searched according to the weakness of the link existing on the route.

The route search unit 20 then outputs a guide route signal, which is an information signal including the searched guide route, to the center side data transmitting / receiving unit 12.
Here, a specific process for searching for a guidance route will be described.
If a plurality of travel routes from the current position to the destination include roads on which a single vehicle C that has output the destination data signal and the vehicle information data signal has traveled in the past, it is as bad as possible. A guide route is searched for as a route on a road that does not include a simple link.

  On the other hand, if the plurality of travel routes from the current position to the destination does not include a road on which one vehicle C that has output the destination data signal and the vehicle information data signal has traveled in the past, from the probe car DB 14 The driver type data of the vehicle C of the same or similar type is acquired. Then, using the weakness calculation link data that the same or similar type of vehicle has traveled in the past, the guide route is searched as a route that travels on a road that does not include the weak link as much as possible.

As described above, the route search unit 20 can execute both the first route search processing and the second route search processing, and selectively performs one of the route search processing.
Here, the first route search process is a process of searching for a guide route from a driver's weakness that has made a request to provide a guide route from the current location to the destination. The second route search process is a process for searching for a guide route based on the unsatisfactory degree of another driver set in the same type as the driver who has requested the provision of the guide route.

In addition, the route search unit 20 is not good at the driver who requested the provision of the guide route from the current location to the destination, and other drivers who have set the same type as the driver who requested the provision. A guide route is searched from the degree of goodness. In addition to this, the route search unit 20 searches for a guide route by selecting a travel route including a link with a low degree of weakness of other drivers from a plurality of travel routes from the current location to the destination as the guide route. To do.
In addition, the route search unit 20 executes the second route search process when the search target of the guide route includes a link whose unsatisfactory degree of the driver who has requested the provision of the guide route is not calculated.

(Processing performed by the link travel history comparison calculation unit 24)
Processing performed by the link travel history comparison calculation unit 24 will be described with reference to FIGS. 1 and 2 and FIG.
Note that the processing performed by the link travel history comparison calculation unit 24 can be performed at an arbitrary time, for example, sequentially performed at the time when the travel state of the vehicle C is obtained (when the input of the vehicle information data signal is received). May be. Further, for example, it may be carried out collectively at midnight when there is a margin for calculation compared to daytime or the like.
In addition, in the description using FIG. 3 described below, processing to be performed on one vehicle C1 selected from among a plurality of vehicles C will be described, but other vehicles (vehicle C2, vehicle C3, etc.) will be described. The processing for is also the same.

As shown in FIG. 3, when the link travel history comparison calculation unit 24 starts the process (START), first, the process of step S100 is performed.
In step S100, for one selected vehicle C (for example, vehicle C1) among the plurality of vehicles C, the degree of weakness in one link selected from the links that have not been subjected to the process of calculating the unsatisfactory degree. A process for starting the calculation is performed. That is, in step S100, for the driver of one vehicle C selected from among the plurality of vehicles C (for example, the vehicle C1), a process for starting calculation of the unsatisfactory degree ("driver shown in the figure""Start calculation of weakness for D1").

In the drawings and the following description, the driver of one selected vehicle C1 may be described as “driver D1” or “D1”. In step S100, when the process for starting the calculation of the unsatisfactory degree is performed for the driver of one vehicle C selected from the plurality of vehicles C, the process performed by the link travel history comparison calculation unit 24 is as follows. The process proceeds to step S101.
In step S101, the link travel history DB 22 is accessed ("Access to the link travel history DB" shown in the figure). And the process which acquires the driving state of all the vehicles C in the selected one link and the driving state of one selected vehicle C1 from link driving | operation log | history DB22 is performed. In step S101, when the process of acquiring the travel state of all the vehicles C and the travel state of one selected vehicle C1 in the selected one link is performed, the process performed by the link travel history comparison calculation unit 24 is as follows. The process proceeds to step S102.

  In step S102, a process of comparing the traveling state of all the vehicles C on one selected link with the traveling state of one selected vehicle C1 on the selected one link is performed. That is, in step S102, the process of obtaining the driving operation data of all the drivers of the vehicle C and the driving operation data of the driver D1 of the selected vehicle C1 in the selected one link (shown in the figure). “Obtain all driver data and driver D1 data”). In step S102, when the process of obtaining the driving operation data of all the drivers of the vehicle C and the driving operation data of one driver D1 in the selected one link is performed, the link travel history comparison calculation unit 24 performs. The process proceeds to step S103.

Here, in the present embodiment, as an example, a case will be described in which the braking pressure data is acquired from the traveling state (driving operation data) accumulated in the link traveling history DB 22 in the process performed in step S102.
In step S103, the two data acquired in the process of step S102 are compared to determine whether or not the difference between the two exceeds the threshold ("two data difference exceeds the threshold" shown in the figure). I do.

Specifically, the average value Ap of the braking pressure of all users, the average value Apd1 of the braking pressure of the driver D1, and the threshold value Xp in the selected link A are substituted into the following formula (1) for comparison. .
Apd1-Ap> Xp (1)
In the above formula (1), Xp is an arbitrary value, and can be set using a standard deviation or the like as long as it is a value in a running state where a normal distribution is expected.

That is, in step S103, if the average braking pressure value Apd1 of the selected vehicle C1 exceeds the average braking pressure value Ap of all the vehicles C in the selected link A, the selected one vehicle C1 The driver D1 of the vehicle C1 determines that the selected link A is not good.
In the present embodiment, as one example, the degree of weakness is determined using one value (braking pressure) representing the driving state (driving operation data), but the present invention is not limited to this. The degree of weakness may be determined by combining a plurality of values representing (data).

In step S103, when it is determined that the two data difference (Appd1-Ap) acquired in the process of step S102 exceeds the threshold (Xp) (“Yes” shown in the figure), the link travel history comparison calculation unit 24 The process performed by the process proceeds to step S104.
On the other hand, if it is determined in step S103 that the difference between the two data (Appd1-Ap) acquired in step S102 does not exceed the threshold (Xp) ("No" shown in the figure), the link travel history comparison calculation The processing performed by the unit 24 proceeds to step S105.

  In step S104, the degree of weakness with respect to the selected link is calculated from the determination result in step S103, and the calculated degree of weakness is stored in the weakness link DB 26 ("calculation of degree of weakness shown in the figure"). And store in the weak link DB ”). In step S104, when the degree of weakness for the selected link is calculated and stored in the poor link DB 26, the process performed by the link travel history comparison calculation unit 24 proceeds to step S106.

  Here, regarding the calculation of the degree of weakness for one selected link, if it is a two-stage evaluation (“good” or “poor”), it can be calculated that it is poor because it exceeds the threshold value Xp. It is. In addition, when calculating the unsatisfactory degree for one selected link in three or more stages, the difference result is directly calculated as the unsatisfactory degree, or the number is rounded step by step to calculate the unsatisfactory degree. May be.

  In step S105, the degree of unsatisfiedness with respect to one selected link is minimum. For example, data indicating information that the selected single link is unsatisfactory is stored in the unsatisfactory link DB 26 ("Unsatisfactory" Store no data in the weak link DB ”). If the process which stores the data which is not good in step S105 in the weak link DB26 is performed, the process which the link driving history comparison calculating part 24 performs will transfer to step S106.

In step S106, a process of determining whether or not the process of calculating the degree of weakness has been performed for all the links ("execute the process for all the links" shown in the drawing) is performed.
If it is determined in step S106 that the process of calculating the degree of weakness is performed on all links (“Yes” shown in the figure), the process performed by the link travel history comparison calculation unit 24 is ended (END). .
On the other hand, if it is determined in step S106 that the process of calculating the degree of weakness is not performed for all links ("No" shown in the figure), the process performed by the link travel history comparison calculation unit 24 is performed in step S100. Migrate to

(Processing performed by the categorization calculating unit 28)
The processing performed by the categorization calculator 28 will be described with reference to FIGS. 1 to 3 and FIGS. 4 to 6.
The process performed by the categorization calculation unit 28 can be performed at an arbitrary time, similar to the process performed by the link travel history comparison calculation unit 24. For example, when the travel state of the vehicle C is obtained (vehicle information data signal May be performed sequentially at the time of receiving the input. Further, for example, it may be carried out collectively at midnight when there is a margin for calculation compared to daytime or the like.

In addition, in the description using FIG. 4 described below, processing to be performed on one vehicle C1 selected from among a plurality of vehicles C will be described, but other vehicles (vehicle C2, vehicle C3, etc.) will be described. The processing for is also the same.
As shown in FIG. 4, when the categorization calculating unit 28 starts processing (START), first, the processing of step S200 is performed.
In step S200, a process (shown in the figure) for starting a type of calculation for the driver (driver D1) of one selected vehicle C (for example, vehicle C1) among the plurality of vehicles C is shown. “Start type operation for driver D1”). In step S200, when the process for starting the type calculation is performed on the driver D1, the process performed by the type calculation unit 28 proceeds to step S201.

  In step S201, the poor link DB 26 is accessed ("Access poor link DB" shown in the figure). And from the weak link DB26, the process which acquires the unsatisfactory degree (unsatisfactory degree calculation link data) with respect to each link of all the drivers is performed. In step S201, when the process of acquiring the unsatisfactory degree of each driver for each link is performed, the process performed by the categorization calculating unit 28 proceeds to step S202.

  In step S202, a process of searching for another driver D whose degree of weakness with respect to each link matches or is similar to the driver D1 from the weakness degree calculation link data acquired in step S201 (in the figure). "Unfavorable link configuration type search") is performed. In step S202, when the process of searching for another driver D whose degree of weakness with respect to each link matches or is similar to the driver D1 is performed, the process performed by the categorization calculating unit 28 proceeds to step S203. Transition.

  It should be noted that at the initial stage when the processing performed by the categorization calculation unit 28 is performed, there is little acquirable degree calculation link data that can be acquired, so the search target is another driver D. However, at a stage after a certain degree of weakness calculation link data is accumulated in the weak link DB 26, since each driver is set to several types, the search target is the type itself (in the following description, It may be described as “type pattern”).

Specifically, in the process performed in step S202, for example, as shown in FIG. 5, from the list of weaknesses for all drivers (five-level evaluation), driver D2 and driver D4 (of vehicle C4 not shown) Search that the driver's weakness matches. In addition, the driver D2 and the driver D4 search for belonging to the type Y from the type pattern list shown in FIG.
In the example described above, the case where the unsatisfactory degrees of the driver D2 and the driver D4 are matched (similarity is 100%) has been described. However, the present invention is not limited to this. For example, the similarity is 80 % Or more drivers may be searched as belonging to the same type. That is, the degree of similarity may be set arbitrarily.

  In step S203, the type of unsatisfactory degree of the driver D1 newly calculated by the link travel history comparison calculation unit 24 in the current process is closer to the unsatisfactory degree than the result calculated in the previous process (conventional process). It is determined whether or not there is. That is, in step S203, a process of determining whether or not there is a type with a weaker degree than before ("There is a type with a lower degree of weakness than before" shown in the figure) is performed.

  As a specific example of the process performed in step S203, in the process performed by the link travel history comparison calculation unit 24, the driver D1 is newly calculated that the unsatisfactory degree for the link C is “2”, and the unsatisfactory degree list When an update occurs, the type pattern list is referred to. In the previous process, if the driver D1 retrieved as not belonging to any type pattern newly determines that it is similar to the type X as a result of the type search, the driver D1 belongs to the type X And search. Accordingly, there is a possibility that the driver D1's weakness is “3” for the link D in which the driver D1 has not traveled and the poorness is not accumulated (“no data” shown in the figure). It becomes possible to detect high data.

If it is determined in step S203 that there is a type with a weaker degree than before (“Yes” shown in the figure), the processing performed by the type calculation unit 28 proceeds to step S204.
On the other hand, if it is determined in step S203 that there is no type that is less familiar than the conventional type ("No" shown in the figure), the processing performed by the type calculation unit 28 proceeds to step S205.

  In step S204, a process ("type update" shown in the figure) for updating a type having a weaker degree than the conventional one from data stored in the probe car DB 14 is performed. In step S204, when a process with a weaker degree than before is performed from the data stored in the probe car DB 14, the process performed by the classification operation unit 28 is terminated (END).

In step S205, a process of maintaining the data stored in the probe car DB 14 without updating it ("type maintenance" shown in the figure) is performed. In step S205, if the process for maintaining the data stored in the probe car DB 14 is maintained without being updated, the process performed by the categorization calculation unit 28 is terminated (END).
As described above, in the present embodiment, even if there is a link where the driver D1 has not traveled, as a result of the processing performed by the type calculation unit 28, the driving of another driver of the same type is performed. It becomes possible for the person D1 to search for the guidance route using the unsatisfactory degree with respect to the unrunning link.
In addition, as described above, the weak link management unit 18 analyzes the driving operation data accumulated in the probe car DB 14 and individually calculates the unsatisfactory degree of each driver for each link for each link. . In addition to this, the poor link management unit 18 classifies each driver using the calculated poor point and sets the type of each driver.

(Operation)
Next, an operation performed using the route search system S of the present embodiment will be described with reference to FIGS. 1 to 6 and FIG.
As shown in FIG. 7, when the operation performed using the route search system S is started (START), first, the process of step S300 is performed.
In step S300, the route search unit 20 performs a process of detecting a plurality of travel routes existing between the current position of each vehicle and the destination ("travel route acquisition" shown in the figure). If the process which detects a some driving | running route is performed in step S300, the operation | movement performed using the route search system S will transfer to step S301.

  In step S301, the weakness calculation link data is acquired from the poor link DB 26, and further, a link having a low driver's weakness is searched among the links of the plurality of travel routes detected in step S300 (FIG. "Good link search") shown in the inside. In step S301, when a process for searching for a link with a low degree of weakness of the driver is performed, the operation performed using the route search system S moves to step S302.

  In step S302, the route search unit 20 sets a guide route as a travel route including as many links as possible with a low degree of unsatisfied driver searched in step S301 ("guide route setting" shown in the figure). )I do. In step S302, when processing for setting a guide route including as many links as possible with a low degree of weakness of the driver is performed, the operation performed using the route search system S moves to step S303.

  In step S303, a process of outputting a guidance route signal including the guidance route set in step S302 to the route guidance unit 8 via the vehicle-side data transmission / reception unit 10 ("guidance route signal output" shown in the figure) is performed. If the process which outputs a guidance route signal to the route guidance part 8 is performed in step S303, the operation | movement performed using the route search system S will transfer to step S304.

In step S304, the route guidance unit 8 that has received the input of the guidance route signal displays on the touch display an image obtained by superimposing the guidance route set in step S302 on the map image ("detour shown in the figure"). Superimposed image display "). In step S304, when processing for displaying on the touch display an image obtained by superimposing the guide route set in step S302 on the map image, the operation performed using the route search system S is ended (END).
Therefore, the touch display forming the route guide unit 8 provides the guide route information to the driver.

  In addition, in step S304, in addition to the information including the image obtained by superimposing the guide route set in step S302 on the map image, the content that the guide route set in step S302 is a guide route with a low level of driver dissatisfaction. Information including the indicated characters may be generated. Here, the characters indicating the content that the guide route set in step S302 is a guide route with a low level of driver dissatisfaction are, for example, “A drive route that avoids a road that the driver is not good at” is set. And

The poor link manager 18 described above corresponds to a poor degree calculator and a type setting unit.
The route guidance unit 8 described above corresponds to a guidance route information providing unit.
Further, as described above, in the route search method implemented by the operation of the route search system S of the present embodiment, driving operation data obtained by individually detecting driving operations performed by a plurality of drivers at each driver and each link is obtained. analyse. Furthermore, using the analyzed driving operation data, each driver's dissatisfaction degree for each link is calculated individually for each link, and each driver is classified according to the calculated dissatisfaction degree. Set the type. In addition, one of the first route search process and the second route search process is selectively performed to search for a guide route, and an image in which the searched guide route is superimposed on a map image is displayed on the touch display. To the driver who requested the provision of the guidance route.
The above-described first embodiment is an example of the present invention, and the present invention is not limited to the above-described first embodiment, and the present invention may be applied to other forms than this embodiment. Various modifications can be made according to the design or the like as long as they do not depart from the technical idea.

(Effects of the first embodiment)
The route search system S of the present embodiment can achieve the effects described below.

(1) The poor link management unit 18 analyzes driving operation data obtained by individually detecting driving operations performed by a plurality of drivers at each driver and each link, and the unsatisfactory degree of each driver for each link Is calculated individually for each link. Further, each driver is classified based on the calculated degree of weakness and the type of each driver is set.
In addition to this, the route search unit 20 selectively performs one of the first route search processing and the second route search processing to search for a guide route. Further, guide route information indicating the searched guide route, that is, an image in which the searched guide route is superimposed is displayed on the touch display on the map image, and provided to the driver who has made the provision request.

For this reason, the driving operation of each driver detected for each link is analyzed, and the unsatisfactory degree for each link is calculated individually for each driver, and further, each driver is determined from the calculated unsatisfactory degree. It becomes possible to classify.
As a result, it is possible to search for a road on which the driver who has requested the provision of the guidance route has not traveled as a road that the driver is not good at using the degree of weakness of other drivers set to the same type. As a result, it becomes possible to search for a guidance route according to the degree of unsatisfaction with an untraveled road.

(2) The route search unit 20 executes the second route search process when the search target of the guide route includes a link for which the driver who made the request for providing the guide route is not calculated.
For this reason, even when the driver who requested the provision of the guidance route includes a road that has not traveled on the road that is the target of the guidance route search, other drivers set to the same type It is possible to search for a guidance route using the degree of weakness.
As a result, it is possible for the driver who requested the provision of the guidance route to search for a road that has not traveled as a road that the driver is not good at. A route can be searched.

(3) A driving operation performed by a plurality of drivers through a plurality of links includes at least one of an acceleration / deceleration operation and a steering operation. That is, the driving operation data includes at least one of the acceleration / deceleration operation and the steering operation.
Therefore, it is possible to analyze at least one of the acceleration / deceleration operation and the steering operation of the vehicle C performed by the driver, and to calculate the unsatisfactory degree of each driver for each link individually for each link. Become.
As a result, it is possible to search for a guide route while reflecting at least one of the acceleration / deceleration operation and the steering operation, which are parameters specific to the driving of the vehicle C.

(4) The unfavorable link management unit 18 calculates the unsatisfactory degree of each driver by a multi-stage evaluation.
For this reason, compared with the case of calculating the degree of weakness by one-step evaluation, that is, the case of calculating whether the driving operation for the driver's link is good or bad by two-step evaluation, It is possible to calculate with high accuracy.
As a result, it is possible to improve the accuracy of searching for a guidance route.

(5) In the route search method implemented by the operation of the route search system S of the present embodiment, driving operation data obtained by individually detecting driving operations performed by a plurality of drivers by each driver and each link is analyzed. Furthermore, using the analyzed driving operation data, the degree of weakness of each driver for each link is calculated individually for each link.
In addition to this, each driver is classified according to the calculated weakness, the type of each driver is set, one of the first route search processing and the second route search processing is selectively performed, and the guidance route is selected. Explore. Then, an image obtained by superimposing the searched guide route on the map image is displayed on the touch display and provided to the driver who has made the request for providing the guide route.

For this reason, the driving operation of each driver detected for each link is analyzed, and the unsatisfactory degree for each link is calculated individually for each driver, and further, each driver is determined from the calculated unsatisfactory degree. It becomes possible to classify.
As a result, it is possible to search for a road on which the driver who has requested the provision of the guidance route has not traveled as a road that the driver is not good at using the degree of weakness of other drivers set to the same type. As a result, it becomes possible to search for a guidance route according to the degree of unsatisfaction with an untraveled road.

(Modification)
(1) In the present embodiment, the in-vehicle device 1 is formed using a navigation device, but the present invention is not limited to this.
That is, the mobile terminal may be configured to include the vehicle information acquisition unit 6, the route guide unit 8, the vehicle-side data transmission / reception unit 10, and the route guide unit 8. In addition, a portable terminal is a portable information terminal (smart phone, tablet etc.) provided with a touch display while being able to operate an application, for example.

(Second embodiment)
Hereinafter, a second embodiment of the present invention (hereinafter referred to as the present embodiment) will be described with reference to the drawings. In addition, description may be abbreviate | omitted about the structure similar to 1st embodiment mentioned above.

(Overall configuration of route search system)
As shown in FIG. 8, the route search system S includes an in-vehicle device 1 and a cloud server CS.
The in-vehicle device 1 is formed using a known navigation device and is mounted on each vehicle C. The detailed configuration of the in-vehicle device 1 will be described later.
The cloud server CS constitutes the Internet (Internet cloud) and implements the functions of the information creation / distribution apparatus 2 of the first embodiment described above. The detailed configuration of the cloud server CS will be described later.

(Configuration of in-vehicle device)
With reference to FIG. 8, the structure of the vehicle-mounted apparatus 1 is demonstrated.
The in-vehicle device 1 includes a vehicle information acquisition unit 6, a route guide unit 8, and a vehicle side data transmission / reception unit 10.
The vehicle information acquisition unit 6 includes an in-vehicle image detection unit 30, an in-vehicle audio detection unit 32, a driver biological reaction detection unit 34, an own vehicle position detection unit 36, a CAN connection unit 38, and a driver psychology estimation unit 40. Is provided.

The vehicle interior image detection unit 30 is formed using a camera that can capture the facial expression of the driver seated in the driver's seat, and images the driver's face when passing through each link. Then, the vehicle interior image detection unit 30 outputs an information signal including the captured driver's face (may be described as “driver expression signal” in the following description) to the driver psychology estimation unit 40.
The in-vehicle sound detection unit 32 is formed using a microphone capable of acquiring sound in the vehicle, and acquires sound generated in the vehicle when passing through each link. Then, the in-vehicle sound detection unit 32 outputs an information signal including the acquired in-vehicle sound (may be described as “in-vehicle sound signal” in the following description) to the driver psychological estimation unit 40.

  The driver's biological reaction detection unit 34 is formed using, for example, a heart rate sensor disposed at a position where the driver is likely to contact the steering wheel, and when the driver passes each link, the driver's heart rate is detected. To detect. Then, the driver biological reaction detection unit 34 outputs an information signal including the detected driver's heartbeat (may be described as “driver heartbeat signal” in the following description) to the driver psychology estimation unit 40. To do.

The driver biological reaction detection unit 34 is not limited to a heart rate sensor, and may be formed using a sensor capable of detecting a biological reaction other than a heartbeat, such as a sensor capable of detecting a driver's sweat. Good.
The own vehicle position detection unit 36 is, for example, a GPS receiver, acquires the current position of the vehicle C, and may be described as an information signal including the acquired current position (in the following description, “self position signal”). Is output to the in-vehicle image detection unit 30 and the in-vehicle sound detection unit 32. In addition to this, the self-position signal is output to the driver biological reaction detection unit 34, the CAN connection unit 38, the driver psychology estimation unit 40, the route guidance unit 8, and the vehicle-side data transmission / reception unit 10.

The CAN connection unit 38 is an on-board network (Controller Area Network), and receives data related to the behavior of the vehicle C detected by various sensors (not shown) included in the vehicle C. Then, the CAN connection unit 38 outputs a vehicle information data signal including various types of input data to the vehicle-side data transmission / reception unit 10.
The driver psychology estimation unit 40 receives input of information signals from the in-vehicle image detection unit 30, the in-vehicle sound detection unit 32, the driver biological reaction detection unit 34, and the own vehicle position detection unit 36. Then, the driver psychology estimation unit 40 uses various information included in the input information signal to estimate a mental state such as anxiety that the driver feels when passing through each link. In addition to this, the driver psychological estimation unit 40 outputs an information signal including a mental state when passing through each estimated link (in the following description, it may be referred to as “link state mental state signal”). It outputs to the vehicle side data transmission / reception part 10.

Specifically, the driver psychology estimation unit 40 that has received the input of the driver facial expression signal analyzes a mental state such as anxiety felt by the driver from the facial expression included in the driver facial expression signal. In this case, for example, when a facial expression included in the driver facial expression signal includes a tense facial expression, the driver's mental state when passing through each link is estimated to be uneasy.
In addition, the driver psychological estimation unit 40 that has received the in-vehicle sound signal analyzes the mental state such as anxiety that the driver feels from the in-vehicle sound included in the in-vehicle sound signal. In this case, for example, if the in-vehicle sound included in the in-vehicle sound signal includes a voice of tongue driving by the driver or “sounding”, “burned”, etc. It is estimated that the driver's mental state is anxious.

In addition, the driver psychology estimation unit 40 that has received the driver heartbeat signal inputs analyzes a mental state such as anxiety that the driver feels from the heartbeat included in the driver heartbeat signal. In this case, for example, when the heartbeat included in the driver heartbeat signal includes a heartbeat more intense than usual, it is estimated that the driver's mental state when passing through each link is uneasy.
As described above, in the mental state signal at the time of passing the link, the behavior history such as voice generation, change in facial expression, change in biological reaction, etc., performed by the driver on multiple links was detected individually for each driver and each link. Includes action history data (action history data).

When the driver psychological estimation unit 40 analyzes the mental state such as anxiety felt by the driver, for example, information that estimates that the driver's mental state is anxious is within a preset period, The present invention may be implemented only when receiving a plurality of inputs on the same link.
Specifically, on the same link, if the heart rate included in the driver's heart rate signal in the same link is detected more than 5 times more than normal, the link is passed. It may be estimated that the driver's mental state is anxious. This is because the driver's mental state is uneasy due to a sudden situation, such as when the information that estimates that the driver's mental state is uneasy is small, for example, when a pedestrian falls. This is because a situation is assumed in which information to be estimated is detected.

The route guide unit 8 is formed by a navigation device, for example.
In addition, an image including characters and options for inputting a destination is displayed on the touch display forming the route guide unit 8 for a driver or the like and an occupant of the vehicle C. When the route guidance unit 8 receives an input of the destination, the route guidance unit 8 outputs a destination data signal to the vehicle-side data transmission / reception unit 10.

  In addition, on the touch display that forms the route guide unit 8, when a link that is not good for driving is displayed on the image showing the map to the driver, the link that is not good for driving is shown. An image that prompts the user to select a location is displayed. And if operation which selects the location which shows the link where driving is not good is performed, the information signal containing the selected location (in the following explanation, it may be indicated as "the poor location signal"), It outputs to the vehicle side data transmission / reception part 10.

In addition, when receiving a guidance route signal from the vehicle-side data transmission / reception unit 10, the route guidance unit 8 displays an image in which a guidance route included in the guidance route signal is superimposed on a map image on the touch display.
The vehicle-side data transmission / reception unit 10 receives a vehicle information data signal and a link state mental state signal from the vehicle information acquisition unit 6, and receives a destination data signal and a weak point signal from the route guidance unit 8.

Then, the vehicle-side data transmitting / receiving unit 10 adds the vehicle information data signal and the link passing mental state signal that have received the input with information (vehicle ID or the like) indicating the unique ID of the vehicle C to a preset interval. To output to the cloud server CS. In addition to this, the vehicle-side data transmitting / receiving unit 10 adds the destination data signal and the weak point signal received to the cloud server CS at a preset interval with information indicating the unique ID of the vehicle C added thereto. Output.
In addition, when receiving the input of the guidance route signal from the cloud server CS, the vehicle-side data transmission / reception unit 10 outputs the received guidance route signal to the route guidance unit 8. Note that the input of the route guidance unit 8 is received at a preset interval.

(Configuration of cloud server CS)
The configuration of the cloud server CS will be described with reference to FIGS. 8 and 9.
The cloud server CS includes a server-side data transmission / reception unit 42, a probe car database 14, a map database 16, a poor link management unit 18, a poor information search unit 44, a poor degree correction unit 46, and a route search. The unit 20 is provided. In the drawings and the following description, the probe car database 14 may be indicated as “probe car DB 14” and the map database 16 may be indicated as “map DB 16”.

  The server-side data transmission / reception unit 42 receives from the vehicle-side data transmission / reception unit 10 a vehicle information data signal to which information indicating the unique ID of the vehicle C is added, a link passing mental state signal, a destination data signal, and a weak point signal. Receive input. And the server side data transmission / reception part 42 adds the vehicle information data signal and the destination data signal which added the information which shows unique ID of the vehicle C to probe car DB14, the weak link management part 18, and the route search part 20. Output. In addition to this, the server-side data transmission / reception unit 42 outputs a link passing mental state signal and a weak point signal to which the information indicating the unique ID of the vehicle C is added to the poor degree correction unit 46.

Further, when receiving the input of the guidance route signal from the route search unit 20, the server side data transmission / reception unit 42 outputs the received guidance route signal to the vehicle side data transmission / reception unit 10.
The probe car DB 14 receives input of information signals from the server-side data transmission / reception unit 42 and the weak link management unit 18. In addition, the probe car DB 14 stores and accumulates the travel history of the link, the weakness of each link, and the type of the vehicle C as data unique to the vehicle C.
Therefore, the probe car DB 14 accumulates action history data in which an action history performed by a driver using a plurality of links is detected individually for each driver and each link.

  The map DB 16 stores map data. Further, the map data stored in the map DB 16 is updated according to a certain period, for example. The map data stored in the map DB 16 includes, for example, the link length (distance) of each link obtained by dividing the road at intersections, fixed intervals, etc., the number of lanes of each link, the lane width of each link, Includes regulated speed. In addition, each road and each link is stored in the map DB 16 as map data with information indicating a unique ID (road ID, link ID, etc.) added thereto.

  The weak link management unit 18 includes a link travel history database 22, a link travel history comparison calculation unit 24, a poor link database 26, and a categorization calculation unit 28. In the drawings and the following description, the link travel history database 22 may be indicated as “link travel history DB 22” and the poor link database 26 may be indicated as “poor link DB 26”.

The link travel history DB 22 associates the current position of the vehicle C included in the vehicle information data signal received from the server-side data transmission / reception unit 42 with the link stored in the map DB 16. The link travel history DB 22 stores and accumulates the travel state of each vehicle C individually for every link.
Here, in the link travel history DB 22, as shown in FIG. 9, as the travel state stored in the link travel history DB 22, a value indicating the travel state for each link of each vehicle C (each user), and for each link The average value calculated from the statistics of the values indicating the running state is recorded and accumulated. In addition, as shown in FIG. 9, the link travel history DB 22 records and accumulates average values calculated from statistics of values indicating the travel state of each vehicle C (all users) for each link. ing.

In this embodiment, as an example, as shown in FIG. 9, the traveling state accumulated in the link traveling history DB 22 is detected by the braking pressure detected by the brake pressure sensor, the vehicle speed detected by the vehicle speed sensor, and the steering angle sensor. A case where the steering angular velocity using the steering angle is included will be described. Therefore, in the present embodiment, as an example, as shown in FIG. 9, the average value calculated from the statistics of the values indicating the running state for each link is the average value of braking pressure (braking pressure average value) and the vehicle speed average. A case will be described in which a value (vehicle speed average value) and an average value of steering angular velocity (steering angular velocity average value) are included.
Further, as shown in FIG. 9, the link travel history DB 22 stores the accumulated data collectively for each preset period (for example, one year). In this way, the data collected in a preset period is compared with the latest data, and the driving skill of the driver changes, and the degree of weakness that has changed with respect to the link is detected and used for searching the guidance route. Is possible.

The link travel history comparison calculation unit 24 acquires the travel state of each vehicle C for each link accumulated in the link travel history DB 22. And about the driving | running state of each vehicle C accumulate | stored in link driving | running | working log | history DB22, the driving | running state of all the vehicles C collected by the selected link and the selected one vehicle C (for example, vehicle C1) Compare the driving conditions.
Further, the link travel history comparison calculation unit 24 calculates the unsatisfactory degree in the selected link of the driver who drives the selected vehicle C according to the comparison result. In addition to this, the link travel history comparison calculation unit 24 outputs a weakness signal including the calculated poorness degree to the probe car DB 14, the poorness link DB 26, and the poorness degree correction unit 46.
The processing performed by the link travel history comparison calculation unit 24 will be described later.

Also, the degree of weakness may be expressed arbitrarily, and for example, score evaluation, five-level evaluation, etc. can be used.
The weakness link DB 26 stores the weakness degree calculation link data in which the poorness degree data included in the poorness degree signal included in the weakness degree signal received from the link travel history comparison calculation unit 24 is associated with the calculated weakness degree data. Remember and accumulate.
The categorization calculating unit 28 acquires the weakness calculation link data from the poor link DB 26, refers to the weakness of each vehicle C for each link, and classifies the driver who drives each vehicle C I do. And the type | category calculating part 28 outputs the driver type data signal containing the driver type data which categorized the driver who drives each vehicle C to probe car DB14.
Note that the processing performed by the categorization calculating unit 28 will be described later.

  The unsatisfactory information search unit 44 searches for comments about the unsatisfactory degree associated with the point information posted by the driver on the Internet cloud via SNS (Social Networking Service) or the like. And if the comment regarding the unsatisfactory degree which linked | related the point information by a driver | operator is detected from the internet cloud, the information signal containing the point information and unsatisfactory degree which this comment contains will be output to the unsatisfactory degree correction | amendment part 46. FIG.

In the following description, when a comment on the degree of dissatisfaction associated with point information by the driver is detected, the point information included in the comment and the information signal including the degree of dissatisfaction are described as “disappointing comment signal”. There is.
In addition, the comment on the degree of weakness associated with the point information is, for example, “It is difficult to turn right at the Δ □ intersection on the highway”.
The unsatisfactory degree correction unit 46 acquires the unsatisfactory degree calculation link data from the unsatisfactory link DB 26. In addition to this, the poor degree correction unit 46 receives a bad comment signal from the poor information search unit 44, and adds a link ID to the server side data transmission / reception unit 42 to indicate the unique ID of the vehicle C. Receives status signal and weak point signal input.

Then, the weakness correction unit 46 includes the point information and poorness included in the poor comment signal, the mental state when each link included in the mental state signal when passing through the link, and the location included in the poor point signal. Is used to correct the weakness calculation link data. Specifically, of the weakness calculation link data, calculation is performed so that the poorness is highly evaluated for the data included in the poor point signal and the link data in which the mental state such as anxiety is estimated. Correct already poor data. Further, the information signal including the corrected poor degree calculation link data (in the following description, may be described as “corrected poor degree signal”) is output to the route search unit 20.
Therefore, the unsatisfactory degree correction unit 46 corrects the unsatisfactory degree calculated by the unsatisfactory link management unit 18 from the action history performed by each driver at the link for which the unsatisfactory degree is to be calculated.

The route search unit 20 receives the destination data signal and the vehicle information data signal from the server-side data transmission / reception unit 42. Then, the route search unit 20 calculates a plurality of travel routes from the current position to the destination from the destination included in the destination data signal and the current position of the vehicle C included in the vehicle information data signal. In addition, a plurality of travels from the current position to the destination for one vehicle C that has acquired the weakness calculation link data from the poor link DB 26 and has output the destination data signal and the vehicle information data signal. The guide route is searched according to the weakness of the link existing on the route.
Furthermore, the route search unit 20 searches for a guide route according to the degree of weakness included in the corrected weakness degree calculation link data when receiving the corrected poorness degree signal from the poorness degree correction unit 46. To do.
The route search unit 20 then outputs a guide route signal, which is an information signal including the searched guide route, to the server-side data transmission / reception unit 42.

Here, a specific process for searching for a guidance route will be described.
If a plurality of travel routes from the current position to the destination include roads on which a single vehicle C that has output the destination data signal and the vehicle information data signal has traveled in the past, it is as bad as possible. A guide route is searched for as a route on a road that does not include a simple link.
On the other hand, if the plurality of travel routes from the current position to the destination does not include a road on which one vehicle C that has output the destination data signal and the vehicle information data signal has traveled in the past, from the probe car DB 14 The driver type data of the vehicle C of the same or similar type is acquired. Then, using the weakness calculation link data that the same or similar type of vehicle has traveled in the past, the guide route is searched as a route that travels on a road that does not include the weak link as much as possible.

(Processing performed by the link travel history comparison calculation unit 24)
Processing performed by the link travel history comparison calculation unit 24 will be described with reference to FIGS. 1 to 9 and FIGS. 10 and 11.
Note that the processing performed by the link travel history comparison calculation unit 24 can be performed at an arbitrary time, for example, sequentially performed at the time when the travel state of the vehicle C is obtained (when the input of the vehicle information data signal is received). May be. Further, for example, it may be carried out collectively at midnight when there is a margin for calculation compared to daytime or the like.
Further, in the description using FIG. 10 and FIG. 11 described below, processing to be performed on one vehicle C1 selected from among a plurality of vehicles C will be described. The same applies to the processing for C3 and the like.

In the present embodiment, as an example, a case will be described in which the unsatisfactory degree for the driver D1 of the vehicle C1 is calculated using the vehicle speed average value of each link shown in FIG.
As shown in FIG. 10, the vehicle speed average value detected in the past in each link of the vehicle C1 driven by the driver D1 between the continuous link A and the link H changes in each link.

Here, the actual road condition between the continuous link A and the link H is a road heading to the temporary stop intersection without a signal in the vicinity of the link H. For this reason, as the vehicle approaches the link H, the vehicle speed of the vehicle C1 decreases.
However, as shown in FIG. 10, the average vehicle speed in the link C is lower than that of the adjacent links (link B, link D). Temporary external influences such as other vehicles and parked vehicles can be ignored due to the characteristics of past statistics, so it is presumed that link C has some unfavorable factors. For this reason, below, calculation of the weakness degree with respect to the link C of the driver | operator D1 is demonstrated on the assumption that there exists some weakness factor in the link C. FIG.

As shown in FIG. 11, when the link travel history comparison calculation unit 24 starts the process (START), first, the process of step S400 is performed.
In step S400, for one selected vehicle C (for example, vehicle C1) out of a plurality of vehicles C, the degree of weakness in one link selected from the links that have not been processed to calculate the unsatisfactory degree. A process for starting the calculation is performed. That is, in step S400, for the driver of one vehicle C (for example, vehicle C1) selected from the plurality of vehicles C, a process for starting the calculation of the unsatisfactory degree ("driver shown in the figure""Start calculation of weakness for D1").

In the drawings and the following description, the driver of one selected vehicle C1 may be described as “driver D1” or “D1”. In step S400, when the process for starting the analysis of the unsatisfactory degree is performed for the driver of one vehicle C selected from the plurality of vehicles C, the process performed by the link travel history comparison calculation unit 24 is as follows. The process proceeds to step S401.
In step S401, the link travel history DB 22 is accessed ("Access to the link travel history DB" shown in the figure). And the process which acquires the driving | running | working state of one selected vehicle C1 in the some selected link (link A to link H) from link driving | running | working log | history DB22 is performed. If the process which acquires the driving | running state of one selected vehicle C1 in the some selected link in step S401 is performed, the process which the link driving history comparison calculating part 24 will transfer to step S402.

In step S402, the range of links to be compared with the traveling state of one selected link (link C) and one of the selected links (link A to link H) selected in step S403. Process to set.
Here, the range set in step S402 is a range indicating the traveling state (vehicle speed average value v) of the vehicle C1 similar to the link B and the link D adjacent to the link C among the links A to H. In FIG. 10, a threshold value Xv that can be arbitrarily set is shown as a threshold value that indicates a similar traveling state of the vehicle C <b> 1.

  That is, in the range set in step S402, the vehicle speed average value v is kept within the threshold value Xv in the same way as the vehicle speed average value vB of the link B and the vehicle speed average value vd of the link D among the links A to H. The range of the link. Therefore, in the example shown in FIG. 10, the link B side is set as a range in which only the link B is set, and the link D side is set as a range set up to the link E. This is because a group of links in which the driving state of the vehicle C1 is close is set as a range of links to be compared with the driving state of the selected link, so that a link having a relatively close road condition is selected. This is because the range of the link to be compared with the traveling state is set.

As described above, in step S402, the process of setting the comparison target range (“set comparison target range of adjacent link” shown in the figure) from the link adjacent to the selected one link is performed.
In step S403, the traveling state of the vehicle C1 on the link set in step S402 is compared. Then, processing for determining whether or not the difference between the two compared is less than a threshold Yv that can be arbitrarily set (“difference between adjacent links is less than threshold” shown in the figure) is performed.

Specifically, among the links set in step S402, the vehicle speed average value (vB) of the link before the link C, the vehicle speed average value (vD, vE) of the link after the link C, and a threshold value Yv is substituted into the following formula (2) for comparison.
| VB − {(vD + vE) / 2} | <Yv (2)
In step S403, if it is determined that the difference between the two travel conditions of the vehicle C1 on the link set in step S402 is less than the threshold Yv (“Yes” in the figure), the link travel history comparison calculation unit 24 The process to be performed proceeds to step S404.

On the other hand, if it is determined in step S403 that the difference between the two travel conditions of the vehicle C1 on the link set in step S402 is equal to or greater than the threshold Yv ("No" in the figure), the link travel history comparison calculation unit The processing performed by 24 proceeds to step S406.
In step S404, the traveling state of the vehicle C1 on the selected link (link C) is compared with the traveling state of the vehicle C1 on the link set in step S402. Then, a process of determining whether or not the difference between the two compared exceeds a threshold Zv that can be arbitrarily set (“difference with adjacent link group exceeds the threshold” shown in the figure) is performed.

Specifically, the vehicle speed average value (vC) of link C which is one selected link, the vehicle speed average value (vB) of the link ahead of link C among the links set in step S402, and the threshold value Zv. Is substituted into the following equation (3) for comparison.
vB-vC> Zv (3)
In addition to this, the vehicle speed average value (vC) of link C, which is one selected link, and the vehicle speed average value (vD, vE) of the link behind link C among the links set in step S402, The threshold value Zv is substituted into the following equation (4) for comparison.
{(VD + vE) / 2} -vC> Zv (4)
If it is determined in step S404 that the difference between the traveling states of the two types of vehicles C1 exceeds the threshold value Zv ("Yes" shown in the figure), the processing performed by the link traveling history comparison calculation unit 24 proceeds to step S405. Transition.
On the other hand, if it is determined in step S404 that the difference between the two types of travel states is equal to or less than the threshold value Zv ("No" in the figure), the processing performed by the link travel history comparison calculation unit 24 proceeds to step S406. .

  In step S405, the degree of weakness with respect to the selected link is calculated from the determination result in step S404, and the calculated degree of weakness is stored in the weakness link DB 26 ("calculation of weakness shown in the figure" And store in the weak link DB ”). In step S405, when the degree of weakness for the selected link is calculated and stored in the poor link DB 26, the process performed by the link travel history comparison calculation unit 24 proceeds to step S407.

  Here, regarding the calculation of the degree of weakness for a selected link, if it is a two-level evaluation (“good” or “poor”), it can be calculated as poor because it exceeds the threshold value Zv. It is. In addition, when calculating the unsatisfactory degree for one selected link in three or more stages, the difference result is directly calculated as the unsatisfactory degree, or the number is rounded step by step to calculate the unsatisfactory degree. May be.

  In step S406, the degree of unsatisfiedness with respect to one selected link is minimum. For example, data indicating information that the selected single link is unsatisfactory is stored in the unsatisfactory link DB 26 ("Unsatisfactory" Store no data in the weak link DB ”). If the process which stores the data which is not good in step S406 in the weak link DB26 is performed, the process which the link driving history comparison calculation part 24 will transfer to step S407.

In step S407, a process of determining whether or not the process of calculating the degree of weakness has been performed for all the links ("execute the process for all the links" shown in the drawing) is performed.
In step S407, when it is determined that the process of calculating the degree of weakness is performed for all the links (“Yes” shown in the drawing), the process performed by the link travel history comparison calculation unit 24 is ended (END). .

On the other hand, if it is determined in step S407 that the process of calculating the degree of weakness is not performed for all links ("No" shown in the figure), the process performed by the link travel history comparison calculation unit 24 is performed in step S400. Migrate to
As described above, in the process performed by the link travel history comparison calculation unit 24, since a change in the travel state of the vehicle C is detected for a link adjacent to the selected one link, the change is not made according to the change in the driving operation of the driver. It is possible to analyze a link whose strength has changed.

(Processing performed by the categorization calculating unit 28)
With reference to FIGS. 1 to 11, the processing performed by the categorization calculator 28 will be described with reference to FIGS. 12 and 13.
The processing performed by the categorization calculating unit 28 of the present embodiment is the same as that of the first embodiment described above, except for processing for searching for the degree of weakness for each link from the degree of weakness calculation link data. For this reason, in the following description, only the process of searching for the degree of weakness for each link from the degree of weakness calculation link data will be described.

  Specifically, in the process of searching for the degree of weakness for each link from the degree of weakness calculation link data, for example, as shown in FIG. ). And link A and link C search that each driver | operator D's weakness is similar. In addition to this, information about the link types of the link A and the link C is acquired from the map DB 16, and it is searched that the link types of the link A and the link C are narrow roads. Thereby, it is searched from the type pattern list shown in FIG. 13 that the type of the driver D1 belongs to the type X.

Note that the link type does not necessarily match 100%, and if the link type is different for the corresponding link, the link type may be determined by adopting a numerically superior link type.
Also, in this embodiment, by categorizing the link type, the guidance route is determined using the unsatisfied degree with respect to the link type even in an area where all drivers do not have a passing record (non-running area). It becomes possible to search. This is indispensable under the condition that link type information can be obtained from the map DB 16 or the like.

As described above, the poor link management unit 18 includes a driving operation performed by each driver on a link for which a poor degree is to be calculated, and a plurality of links adjacent to the link to be calculated. The driving operation performed by each driver is compared to calculate the degree of weakness of each driver.
In addition, the poor link management unit 18 calculates the degree of weakness of each driver by limiting the period during which data to be compared is accumulated.
Further, the weak link management unit 18 associates the link types and calculates the weakness of each driver.
Further, the route search unit 20 searches for a guide route from the degree of unsatisfiedness with respect to the type of link and the degree of unsatisfactory with respect to the type of link of another driver.

(Operation)
Since the operation performed using the route search system S of the present embodiment is the same as that of the first embodiment described above, the description thereof is omitted.

(Effect of the second embodiment)
In the route search system S of the present embodiment, in addition to the effects described in the first embodiment described above, the following effects can be achieved.

(1) The driving of the driving operation performed by each driver by the poor link management unit 18 using the link that is the target of calculation of the poor level and the plurality of links adjacent to the link that is the target of calculation of the poor level By comparing the operation data, the unsatisfactory degree of each driver is calculated.
For this reason, the driver's driving operation is totaled for each link, and the driver's own information can be compared for two or more links adjacent to the link for which the degree of weakness is to be calculated.
As a result, it is possible to detect a change in the driving operation of the driver himself and to analyze and calculate the unsatisfactory degree for each link.

(2) The unsatisfactory degree calculated by the unsatisfactory link management unit 18 by analyzing the action history data in which the unsatisfactory degree correction unit 46 individually detected the action history performed by a plurality of links for each driver and each link. Correct the degree.
For this reason, it becomes possible to correct the unsatisfactory degree calculated by the poor link management unit 18 by analyzing the behavior history data of the driver. In addition, the action history is, for example, reporting information about a point on the Internet cloud through reporting a weak point at a weak link point, detecting tongue hitting at a poor link, or SNS, etc. Etc.
As a result, it is possible to provide the guide route searched by correcting the degree of weakness with respect to each link with high accuracy to the driver who has requested to provide the guide route.

(3) The poor link management unit 18 calculates the degree of weakness of each driver by limiting the period during which data to be compared is accumulated.
For this reason, it becomes possible to analyze and calculate the degree of weakness of the link from the latest data limited for a period of one year or the like.
As a result, it is possible to search for a guide route according to the degree of weakness with respect to the link, reflecting the degree of change (improvement, deterioration) of the driver's driving skill.

(4) The poor link management unit 18 associates the link types to calculate the unsatisfactory degree of each driver, and the route search unit 20 responds to the link type of the driver who made the guidance route provision request. A guide route is searched for from the unsatisfactory degree and the unsatisfactory degree of the other driver's link type.
For this reason, by associating the link dissatisfaction level with the link type, for example, referring to the link type stored in the map DB 16, the link type can be used for an area having no history of all drivers passing. It is possible to search for a guidance route according to the degree of weakness with respect to.
As a result, it becomes possible to search for a guidance route according to the degree of weakness from the types of links accumulated in the map DB 16 for roads where all drivers have not traveled.

(Modification)
(1) In the present embodiment, the weakness degree correction unit 46 analyzes the behavior history data obtained by individually detecting the behavior history performed by a plurality of links for each driver and each link, and the poorness link management unit 18. Although the degree of weakness calculated by has been corrected, the present invention is not limited to this.
That is, the weak link management unit 18 analyzes the action history data obtained by individually detecting the action history performed by a plurality of links for each driver and each link, and the driving operation data, and each driver's corresponding to each link is analyzed. The degree of weakness may be calculated individually for each link.
In this case, it is possible to immediately reflect the action history data detected by each driver and each link with the action history performed by a plurality of links in the calculation of the unsatisfactory degree, and the action history data is reflected. The guide route can be searched according to the degree of weakness.

  DESCRIPTION OF SYMBOLS 1 ... Car-mounted apparatus, 2 ... Information preparation and distribution apparatus, 4 ... Data center, 6 ... Vehicle information acquisition part, 8 ... Route guidance part, 10 ... Vehicle side data transmission / reception part, 12 ... Center side data transmission / reception part, 14 ... Probe Car database (probe car DB), 16 ... map database (map DB), 18 ... poor link management unit, 20 ... route search unit, 22 ... link travel history database (link travel history DB), 24 ... link travel history comparison Calculation unit, 26 ... poor link database (poor link DB), 28 ... categorization calculation unit, 30 ... vehicle interior image detection unit, 32 ... vehicle interior voice detection unit, 34 ... driver biological reaction detection unit, 36 ... own vehicle Position detecting unit, 38 ... CAN connecting unit, 40 ... driver psychology estimating unit, 42 ... server side data transmitting / receiving unit, 44 ... poor information search unit, 46 ... poor degree correction unit, S ... Search system, C ... vehicle, CS ... the cloud server

Claims (9)

Analyzing driving operation data individually detected by each driver for driving operations performed by a plurality of drivers, and calculating the degree of weakness of each driver individually,
A type setting unit that classifies each driver using the calculated degree of weakness and sets a type of each driver;
The first route search process for searching for the guide route from the weakness of the driver who requested the provision of the guide route from the current location to the destination, and the same type as the driver who made the provision request were set. A route search unit capable of performing both of the second route search processing for searching for the guide route from the other driver's weakness, and selectively performing either one of the route search processing;
A route search system comprising: a guide route information providing unit that provides guide route information indicating the searched guide route to a driver who has made the provision request. The unsatisfactory degree calculation unit analyzes driving operation data in which driving operations performed by a plurality of drivers are individually detected for each driver and each link, and determines the unsatisfactory degree of each driver for each link. , Calculate for each link individually,
The route search unit performs the second route search process when the search target of the guide route includes a link whose unsatisfied degree of the driver who has made the provision request has not been calculated. The route search system according to claim 1.   The route search system according to claim 1, wherein the driving operation includes at least one of an acceleration / deceleration operation and a steering operation.   The unsatisfactory degree calculation unit analyzes driving operation data obtained by individually detecting driving operations performed by a plurality of drivers at each driver and each link, and sets the unsatisfactory degree as an object of calculation of the unsatisfactory degree among the links. The driving operation data of the driving operation performed by one driver on the link is compared with the driving operation data of the driving operation performed by the one driver on a plurality of links adjacent to the link to be calculated. The route search system according to any one of claims 1 to 3, wherein the degree of weakness of the one driver is calculated.   The unsatisfactory degree calculation unit includes behavior history data obtained by individually detecting behavior histories performed by a plurality of drivers for each driver and each link, and driving operations performed by a plurality of drivers for each driver and each link. 5. The driving operation data individually detected in step (1) is analyzed, and the unsatisfactory degree of each driver for each link is calculated individually for each link. The route search system described in any one of them.   The said unsatisfactory degree calculation part limits the period which detected the said driving operation data, and calculates the unsatisfactory degree of each said driver, The any one of Claims 1-5 characterized by the above-mentioned. The route search system described in 1. The unsatisfactory degree calculation unit analyzes driving operation data in which driving operations performed by a plurality of drivers are individually detected for each driver and each link, and determines the unsatisfactory degree of each driver for each link. , By associating the link types, calculating each link individually,
The route search unit is unsatisfactory with respect to the type of the link of the driver who has made the provision request, and with respect to the type of the link of another driver set to the same type as the driver who has made the provision request. The route search system according to any one of claims 1 to 6, wherein the guide route is searched based on a degree of weakness.   The route search system according to any one of claims 1 to 7, wherein the unsatisfactory degree calculation unit calculates the unsatisfactory degree of each driver by a plurality of stages of evaluation. Analyzing driving operation data individually detected by each driver for driving operations performed by a plurality of drivers, individually calculating the degree of weakness of each driver,
Classify each driver using the calculated weakness and set the type of each driver,
The first route search process for searching for the guide route from the weakness of the driver who requested the provision of the guide route from the current location to the destination, and the same type as the driver who made the provision request were set. Both of the second route search processing for searching for the guide route from the other driver's unsatisfactory degree can be performed, and either one of the route search processing is selectively performed,
A route search method, characterized in that guide route information indicating the searched guide route is provided to a driver who has made the provision request.

Images