Information processing device, information processing method, program, and storage medium

Abstract

To provide an information processing device and the like capable of presenting a route with high accuracy in a predicted required time as a route from a departure place to a destination.SOLUTION: An information processing device comprises a calculation unit, an identification unit, and a presentation control unit. The calculation unit calculates a predicted required time including a time width predicted to be necessary to travel each of a plurality of routes from a departure point to a destination. The identification unit identifies a first predicted required time having the smallest time width from among the predicted required times corresponding to the plurality of routes, and also identifies a first route corresponding to the first predicted required time from among the plurality of routes. The presentation control unit causes the presentation of the first predicted required time and the first route.SELECTED DRAWING: Figure 5

Description

[Technical Field]

[0001] The present disclosure relates to a technique for predicting the time required for a moving object to travel. [Background technology]

[0002] Techniques have been proposed for predicting the time required for a moving object to travel.

[0003] Specifically, for example, Patent Document 1 discloses a perspective in which, in a route search using search conditions including a departure point, a destination, an acceptable traffic congestion time, and a desired departure time or a desired arrival time, a recommended route and a recommended departure time that satisfy the acceptable traffic congestion time are provided to the user. [Prior art documents] [Patent documents]

[0004] [Patent Document 1] Japanese Patent Application Laid-Open No. 2009-192356 Summary of the Invention [Problem to be solved by the invention]

[0005] However, the technology disclosed in Patent Document 1 has a problem in that it is difficult to present a route with a highly accurate predicted required travel time as a route from a departure point to a destination, for example.

[0006] In view of the above-mentioned problems, a main object of the present disclosure is to provide an information processing device capable of presenting a route from a departure point to a destination with a highly accurate predicted required travel time. [Means for solving the problem]

[0007] The invention described in the claims is an information processing device that includes a calculation unit that calculates a predicted travel time having a time range predicted to be required to travel along a plurality of routes from a departure point to a destination, an identification unit that identifies a first predicted travel time having the smallest time range from the predicted travel times corresponding to the plurality of routes, and identifies a first route from the plurality of routes that corresponds to the first predicted travel time, and a presentation control unit that presents the first predicted travel time and the first route.

[0008] The claimed invention is an information processing device comprising: a first calculation unit that calculates, for each of a plurality of links leading from a departure point to a destination, a first predicted required time, which has a time width predicted to be required to traverse the link; a setting unit that sets, as a recommended route, a route that selectively connects each link that has the smallest time width of the first predicted required time; a second calculation unit that calculates the sum of the first predicted required times corresponding to each link included in the recommended route as a second predicted required time, which has a time width predicted to be required to traverse the entire recommended route; and a presentation control unit that presents the second predicted required time and the recommended route.

[0009] The claimed invention is an information processing method executed by a computer, comprising: a calculation step of calculating a predicted required time for passing through a plurality of routes from a departure point to a destination, the predicted required time having a time range predicted to be required for passing through the route; an identification step of identifying a first predicted required time from the predicted required time corresponding to the plurality of routes, the first predicted required time having the smallest time range, and identifying a first route from the plurality of routes that corresponds to the first predicted required time; and a presentation control step of presenting the first predicted required time and the first route.

[0010] The claimed invention is an information processing method executed by a computer, comprising: a first calculation step of calculating, for each of a plurality of links leading from a departure point to a destination, a first predicted required time, the first predicted required time having a time width predicted to be required to traverse the link; a setting step of setting, as a recommended route, a route that selectively connects each link that has the smallest time width of the first predicted required time; a second calculation step of calculating, as a second predicted required time, the sum of the first predicted required times corresponding to each link included in the recommended route, the second predicted required time having a time width predicted to be required to traverse the entire recommended route; and a presentation control step of presenting the second predicted required time and the recommended route.

[0011] The invention described in the claims is a program executed by a computer, which causes the computer to function as a calculation unit that calculates a predicted required time for passing through a plurality of routes from a departure point to a destination, having a time range predicted to be required for passing through the route; an identification unit that identifies a first predicted required time from the predicted required time range corresponding to the plurality of routes and identifies a first route from the plurality of routes that corresponds to the first predicted required time; and a presentation control unit that presents the first predicted required time and the first route.

[0012] The invention described in the claims is a program executed by a computer, which causes the computer to function as: a first calculation unit that calculates, for each of a plurality of links leading from a departure point to a destination, a first predicted required time, which has a time width predicted to be required to traverse the link; a setting unit that sets, as a recommended route, a route that selectively connects each link that has the smallest time width of the first predicted required time; a second calculation unit that calculates the sum of the first predicted required times corresponding to each link included in the recommended route as a second predicted required time, which has a time width predicted to be required to traverse the entire recommended route; and a presentation control unit that presents the second predicted required time and the recommended route. [Brief explanation of the drawings]

[0013] [Figure 1]FIG. 1 is a diagram showing a configuration example of a guidance system according to an embodiment. [Figure 2] FIG. 1 is a diagram showing a schematic configuration of an information processing apparatus according to an embodiment. [Figure 3] FIG. 1 shows an example of a standard route including n links. [Figure 4] FIG. 10 is a diagram showing an example of a time distribution of the time required to pass through a link. [Figure 5] FIG. 10 is a diagram showing an example of display of information relating to a standard route and a recommended route. [Figure 6] 10 is a flowchart showing an example of processing performed by an information processing device. [Figure 7] FIG. 4 is a diagram for explaining an example of processing related to setting a recommended route. [Figure 8] FIG. 10 is a diagram showing an example of the configuration of a guidance system according to a modified example. [Figure 9] FIG. 10 is a diagram showing a schematic configuration of a server device according to a modified example. DETAILED DESCRIPTION OF THE INVENTION

[0014] In one preferred embodiment of the present invention, an information processing device includes a calculation unit that calculates a predicted travel time having a time range predicted to be required to travel along a plurality of routes from a departure point to a destination; an identification unit that identifies a first predicted travel time having the smallest time range from the predicted travel times corresponding to the plurality of routes and identifies a first route from the plurality of routes that corresponds to the first predicted travel time; and a presentation control unit that presents the first predicted travel time and the first route.

[0015] The information processing device includes a calculation unit, an identification unit, and a presentation control unit. The calculation unit calculates a predicted required time for a plurality of routes from a departure point to a destination, the predicted required time having a time range predicted to be required for travelling along the route. The identification unit identifies a first predicted required time having the shortest time range from the predicted required times corresponding to the plurality of routes, and identifies a first route from the plurality of routes that corresponds to the first predicted required time. The presentation control unit causes the first predicted required time and the first route to be presented. This makes it possible to present a route from the departure point to the destination with a highly accurate predicted required time.

[0016] In one aspect of the above information processing device, the device further includes a route acquisition unit that acquires a second route that is frequently taken by a specified mobile body as a route from the departure point to the destination based on the movement history of the specified mobile body, the calculation unit calculates a second predicted travel time having a time width predicted to be required to travel the entire second route, and the presentation control unit presents the first predicted travel time, the first route, the second predicted travel time, and the second route.

[0017] In one aspect of the above information processing device, the identification unit identifies a third predicted travel time from the predicted travel times corresponding to the multiple routes that is the shortest time corresponding to the lower limit of the time range, and identifies a third route from the multiple routes that corresponds to the third predicted travel time, and the presentation control unit presents the first predicted travel time, the first route, the second predicted travel time, the second route, the third predicted travel time, and the third route.

[0018] In another preferred embodiment of the present invention, an information processing device includes a first calculation unit that calculates, for each of a plurality of links leading from a departure point to a destination, a first predicted required time, the first predicted required time being the time required to travel the link; a setting unit that sets, as a recommended route, a route that selectively connects each link that minimizes the first predicted required time; a second calculation unit that calculates, as a second predicted required time, the sum of the first predicted required times corresponding to each link included in the recommended route, the second predicted required time being the time required to travel the entire recommended route; and a presentation control unit that presents the second predicted required time and the recommended route. This makes it possible to present a route from the departure point to the destination with a highly accurate predicted required time.

[0019] In yet another preferred embodiment of the present invention, an information processing method executed by a computer includes a calculation step of calculating, for a plurality of routes from a departure point to a destination, a predicted required time having a time range predicted to be required to travel along the route, a specification step of specifying a first predicted required time from the predicted required times corresponding to the plurality of routes that has the shortest time range and specifying a first route from the plurality of routes that corresponds to the first predicted required time, and a presentation control step of presenting the first predicted required time and the first route. This makes it possible to present a route from the departure point to the destination with a highly accurate predicted required time.

[0020] In yet another preferred embodiment of the present invention, a computer-executed information processing method includes a first calculation step of calculating, for each of a plurality of links leading from a departure point to a destination, a first predicted required time, the first predicted required time being a time span predicted to be required to travel the link, a setting step of setting, as a recommended route, a route selectively connecting each link that minimizes the first predicted required time, a second calculation step of calculating, as a second predicted required time, the sum of the first predicted required times corresponding to each link included in the recommended route, the second predicted required time being a time span predicted to be required to travel the entire recommended route, and a presentation control step of presenting the second predicted required time and the recommended route. This makes it possible to present a route from the departure point to the destination with a highly accurate predicted required time.

[0021] In yet another preferred embodiment of the present invention, a program executed by a computer causes the computer to function as: a calculation unit that calculates, for a plurality of routes from a departure point to a destination, a predicted required time for travelling along the route, the predicted required time being a range of time predicted to be required; an identification unit that identifies a first predicted required time from among the predicted required times for the plurality of routes and identifies a first route from the plurality of routes that corresponds to the first predicted required time; and a presentation control unit that presents the first predicted required time and the first route. By executing this program on a computer, the information processing device described above can be realized. This program can be stored and used in a storage medium. As a result, routes with highly accurate predicted required times can be presented as routes from a departure point to a destination.

[0022] In yet another preferred embodiment of the present invention, a program executed by a computer causes the computer to function as: a first calculation unit that calculates, for each of a plurality of links leading from a departure point to a destination, a first predicted required time, which has a time range predicted to be required to travel the link; a setting unit that sets, as a recommended route, a route that selectively connects each link that has the shortest time range of the first predicted required time; a second calculation unit that calculates, as a second predicted required time, the sum of the first predicted required times corresponding to each link included in the recommended route, which has a time range predicted to be required to travel the entire recommended route; and a presentation control unit that presents the second predicted required time and the recommended route. By executing this program on a computer, the above-mentioned information processing device can be realized. This program can be stored and used in a storage medium. As a result, a route with a highly accurate predicted required time can be presented as a route from a departure point to a destination. [Example]

[0023] Preferred embodiments of the present invention will now be described with reference to the drawings.

[0024] [System Configuration] (Overall composition) 1 is a diagram illustrating an example of the configuration of a guidance system according to an embodiment. The guidance system 100 includes an information processing device 1 that moves together with a vehicle Ve in which a user rides. The vehicle Ve can be treated as an example of a moving object.

[0025] (Information processing device) The information processing device 1 can provide a user with, for example, information related to the route from the departure point of the vehicle Ve to the destination, and information related to the time required to travel the entire route. Furthermore, the information processing device 1 can provide route guidance to a user, who is a passenger of the vehicle Ve, to a spot designated by the user. Furthermore, the information processing device 1 can provide route guidance so that the vehicle Ve travels along the guidance route. In this embodiment, the information processing device 1 can output various information related to the driving of the vehicle Ve by voice and / or image. For example, the information processing device 1 can output information related to guidance points corresponding to points on the route where guidance is required. Here, guidance points correspond to, for example, intersections where the vehicle Ve must turn right or left, and other important passing points for the vehicle Ve to travel along the guidance route. The information processing device 1 can provide guidance related to guidance points, such as the distance from the vehicle Ve to the next guidance point and the direction of travel at the guidance point.

[0026] The information processing device 1 may be a navigation device installed in a vehicle Ve and providing route guidance to a set destination, or may be a mobile terminal such as a smartphone carried by a user. The information processing device 1 may also be incorporated into the vehicle Ve.

[0027] 2 is a diagram showing a schematic configuration of an information processing device according to an embodiment. The information processing device 1 includes a communication unit 11, a storage unit 12, an input unit 13, a control unit 14, a sensor group 15, a display unit 16, a sound collection unit 17, a sound output unit 18, and an in-vehicle image capture unit 19. The elements of the information processing device 1 are connected to each other via a bus line 10.

[0028] The communication unit 11 performs data communication with an external device under the control of the control unit 14. The communication unit 11 can also acquire driving data indicating the driving conditions and / or driving history of multiple vehicles, such as probe data, from the external device. The communication unit 11 can also acquire data used for route guidance, such as map data, road data, and spot data, from the external device. In this embodiment, the driving conditions of the vehicle may be read as the movement conditions of the mobile object. In this embodiment, the driving history of the vehicle may be read as the movement history of the mobile object.

[0029] The storage unit 12 is configured with various storage media such as RAM (Random Access Memory), ROM (Read Only Memory), and non-volatile memory (including a hard disk drive, a flash memory, etc.). The storage unit 12 also stores programs for the information processing device 1 to execute predetermined processes. The storage unit 12 is also used as a working memory for the control unit 14. The programs executed by the information processing device 1 may be stored in a storage medium other than the storage unit 12.

[0030] The storage unit 12 stores a map DB (DataBase) 4, a spot information DB 5, and a travel DB 6.

[0031] The map DB4 includes map data and road data obtained by the communication unit 11. The map data includes, for example, data necessary for displaying a map based on a predetermined position, such as the current location of the vehicle Ve. The road data includes, for example, data representing a road network using a combination of nodes and links. The road data also includes, for example, data indicating the link length and attributes of each link constituting the road network. The data indicating the road attributes may include, for example, the road type, facilities on the road, and the road name. The map data and road data included in the map DB4 may be updated to the latest data, for example, at regular intervals, under the control of the control unit 14. Note that, in this embodiment, links can be set as sections obtained by dividing the road network in any manner. For example, in this embodiment, links can be set as sections having any length and / or any shape. In this embodiment, links can be set as sections including nodes, or as sections not including nodes.

[0032] The spot information DB5 includes spot data obtained by the communication unit 11. The spot data includes data for each spot that can be set as a destination for the vehicle Ve. Specifically, the spot data includes, for example, data indicating the name of the spot, data indicating the type (category) of the spot, and data indicating an evaluation of the spot. The spot data included in the spot information DB5 can be updated to the latest data, for example, at regular intervals, under the control of the control unit 14.

[0033] The travel DB 6 includes travel data obtained by the communication unit 11. The travel data includes, for example, data related to the vehicle speed for each link that makes up the road network. The travel data included in the travel DB 6 can be updated to the latest data, for example, at regular intervals, under the control of the control unit 14.

[0034] The storage unit 12 stores driving condition data 7, which is data indicating the current driving condition of the vehicle Ve, and driving history data 8, which is information indicating the past driving conditions of the vehicle Ve.

[0035] The driving condition data 7 includes, as data related to the current driving of the vehicle Ve, data indicating the departure point of the vehicle Ve, the departure date and time when the vehicle Ve departed from the departure point, and the destination of the vehicle Ve. The driving condition data 7 also includes, as data related to the current driving of the vehicle Ve, data indicating the speed of the vehicle Ve for each link constituting the road network.

[0036] The driving history data 8 includes data related to past driving of the vehicle Ve, recorded for each driving. Each piece of driving history data 8 includes, as information related to one past driving of the vehicle Ve, data indicating, for example, the departure point of the vehicle Ve, the departure date and time when the vehicle Ve departed from the departure point, the destination of the vehicle Ve, and the route from the departure point to the destination. The driving history data 8 also includes, as data related to one past driving of the vehicle Ve, data indicating, for example, the speed of the vehicle Ve for each link constituting the road network. Hereinafter, unless otherwise specified, the driving history data 8 will be described as including the same type of data as the driving data in the driving DB 6.

[0037] The input unit 13 has a user interface that accepts user input. The input unit 13 may include at least one user interface, such as a button, a touch panel, or a remote controller. The display unit 16 displays information under the control of the control unit 14. The display unit 16 may include at least one device, such as a display or a projector. The sound collection unit 17 collects sounds inside the vehicle Ve, particularly the driver's speech. The sound collection unit 17 may include a device, such as a microphone. The sound output unit 18 outputs sounds under the control of the control unit 14. The sound output unit 18 may include a device, such as a speaker. The interior capture unit 19 has at least one camera for capturing images of the interior of the vehicle Ve. It is also desirable that the interior capture unit 19 has a camera installed in a position that can capture images of at least the area around the driver's seat.

[0038] The sensor group 15 includes various sensors that perform sensing of the state of the vehicle Ve or the environment outside the vehicle. The sensor group 15 has an external sensor 20 and an internal sensor 21. The external sensor 20 is one or more sensors for recognizing the environment surrounding the vehicle Ve, such as a lidar, radar, ultrasonic sensor, infrared sensor, sonar, or camera. The internal sensor 21 is a sensor that performs vehicle positioning, such as a GNSS (Global Navigation Satellite System) receiver, a gyro sensor, an IMU (Inertial Measurement Unit), a vehicle speed sensor, or a combination thereof. Note that the sensor group 15 may include any sensor that allows the control unit 14 to directly or indirectly (i.e., by performing estimation processing) derive the position of the vehicle Ve from the output of the sensor group 15.

[0039] The control unit 14 includes a CPU (Central Processing Unit), a GPU (Graphics Processing Unit), etc., and controls the entire information processing device 1. For example, the control unit 14 estimates the position (including the direction of travel) of the vehicle Ve based on the output of one or more sensors in the sensor group 15. When a destination is specified by the input unit 13 or the sound collection unit 17, the control unit 14 generates route information indicating a guide route to the destination, and provides route guidance based on the route information, the estimated position information of the vehicle Ve, and the map DB 4. In this case, the control unit 14 outputs audio related to the guidance for the guide route from the sound output unit 18. The control unit 14 also controls the display unit 16 to display information about music being played, video content, a map of the area around the current location, etc. The control unit 14 can be considered as an example of a computer. The control unit 14 also has functions as a calculation unit, an identification unit, a presentation control unit, a route acquisition unit, and a setting unit.

[0040] The processing performed by the control unit 14 is not limited to being realized by software programs, but may be realized by any combination of hardware, firmware, and software. The processing performed by the control unit 14 may also be realized by a user-programmable integrated circuit, such as an FPGA (Field-Programmable Gate Array) or a microcomputer. In this case, the program executed by the control unit 14 in this embodiment may be realized by using this integrated circuit. Thus, the control unit 14 may be realized by hardware other than a processor.

[0041] The configuration of the information processing device 1 shown in FIG. 2 is an example, and various modifications may be made to the configuration shown in FIG. 2. For example, instead of the memory unit 12 storing the map DB 4 and the spot information DB 5, the control unit 14 may receive information corresponding to the map DB 4 and the spot information DB 5 from a map management server (not shown) via the communication unit 11. In another example, at least one of the input unit 13, the display unit 16, and the sound output unit 18 may be provided in the target vehicle as an external device of the information processing device 1 and supply the generated signal to the information processing device 1. Furthermore, at least some of the sensors in the sensor group 15 may be sensors provided in the vehicle Ve. In this case, the information processing device 1 may acquire information output by the sensors provided in the vehicle Ve from the vehicle Ve based on a communication protocol such as CAN (Controller Area Network).

[0042] [Specific example] Next, a specific example of the processing performed by the information processing device 1 will be described.

[0043] FIG. 3 is a diagram showing an example of a standard route including n links. The control unit 14 sets the standard route HR for the vehicle Ve based on the driving history data 8 stored in the memory unit 12. Specifically, the control unit 14 sets, for example, one of the routes recorded in the driving history data 8 that is most frequently used as the standard route HR for the vehicle Ve. The standard route HR can be treated as a route that is frequently passed by the vehicle Ve. Furthermore, the control unit 14 acquires a departure point HSS and a destination HDS corresponding to the standard route HR based on the driving history data 8 stored in the memory unit 12. Note that the following description will be given taking as an example a case where a standard route HR including n (n≧2) links L1 to Ln as shown in FIG. 3 is set.

[0044] The control unit 14 extracts road data corresponding to each of the n links included in the standard route HR from each piece of data included in the map DB 4. The control unit 14 also extracts driving history data corresponding to each of the n links included in the standard route HR from each piece of data included in the driving history data 8. Note that hereinafter, an example will be described in which the control unit 14 extracts road data DDj from the map DB 4 as data corresponding to link Lj (1≦j≦n), and also extracts driving history data RDj from the driving history data 8.

[0045] Based on the road data DDj and the driving performance data RDj, the control unit 14 obtains a time distribution DTj of the time required for the vehicle Ve to pass through the link Lj and a speed distribution DVj of the passing speed when the vehicle Ve passes through the link Lj.

[0046] FIG. 4 is a diagram illustrating an example of a time distribution of the time required to pass through a link. The control unit 14 uses the time distribution DTj to calculate a required time TSj corresponding to an expected value in the time distribution DTj. The control unit 14 also acquires two required times TLj and TUj corresponding to two predetermined percentile values ​​of the time distribution DTj. Specifically, the control unit 14 acquires, for example, the required time TLj corresponding to the 16th percentile of the time distribution DTj. The control unit 14 also acquires, for example, the required time TUj corresponding to the 84th percentile of the time distribution DTj. Note that, according to this specific example, the control unit 14 may set the predetermined two percentile values ​​as desired values ​​set by the user and acquire two required times TLj and TUj corresponding to the desired values.

[0047] The control unit 14 uses the speed distribution DVj to calculate an average value VAj of the passing speeds in the speed distribution DVj. The control unit 14 also uses the speed distribution DVj to calculate a variance σj of the passing speeds in the speed distribution DVj.

[0048] The control unit 14 acquires the link length Kj corresponding to the distance of the link Lj from the road data DDj.

[0049] The control unit 14 calculates a predicted required time SLj corresponding to the required time TLj by applying the required time TLj, the link length Kj, the average value VAj, and the variance σj to the following mathematical formula (1). "f(Kj, VAj, σj)" in the following mathematical formula (1) represents a mathematical model used to correct the required time TLj. Specifically, the mathematical model corresponding to "f(Kj, VAj, σj)" in the following mathematical formula (1) can be constructed as a function including the link length Kj, the average value VAj, and the variance σj as variables. Furthermore, it is desirable that the mathematical model corresponding to "f(Kj, VAj, σj)" in the following mathematical formula (1) be constructed as a mathematical model different from "g(Kj, VAj, σj)" described below. Furthermore, it is desirable that "f(Kj, VAj, σj)" in the following mathematical formula (1) be constructed as a mathematical model in which parameters are adjusted to satisfy SLj≦TLj. Furthermore, the value obtained as a calculation result of "f(Kj, VAj, σj)" in the following formula (1) can be treated as a correction coefficient for correcting the required time TLj.

[0050]

number

[0051] The control unit 14 calculates a predicted required time SUj corresponding to the required time TUj by applying the required time TUj, the link length Kj, the average value VAj, and the variance σj to the following mathematical formula (2). "g(Kj, VAj, σj)" in the following mathematical formula (2) represents a mathematical model used to correct the required time TUj. Specifically, the mathematical model corresponding to "g(Kj, VAj, σj)" in the following mathematical formula (2) can be constructed as a function including the link length Kj, the average value VAj, and the variance σj as variables. It is preferable that the mathematical model corresponding to "g(Kj, VAj, σj)" in the following mathematical formula (2) be constructed as a mathematical model different from the aforementioned "f(Kj, VAj, σj)." The value obtained as a calculation result of "g(Kj, VAj, σj)" in the following mathematical formula (2) can be used as a correction coefficient for correcting the required time TUj.

[0052]

number

[0053] The control unit 14 applies the required time TSj and the predicted required time SLj to the following equation (3) to calculate the predicted required time RLT, which corresponds to the shortest time predicted to be required to pass through the links L1 to Ln.

[0054]

number

[0055] "TSj+SLj" in the above formula (3) represents the predicted required time RLj, which corresponds to the shortest time predicted to be required to pass through link Lj. Therefore, by performing processing using the above formula (3), the control unit 14 can obtain the predicted required time RLT corresponding to the entire standard route HR and the predicted required times RL1-RLn corresponding to each of links L1-Ln.

[0056] The control unit 14 applies the required time TSj and the predicted required time SUj to the following equation (4) to calculate the predicted required time RUT, which corresponds to the longest time predicted to be required to pass through the links L1 to Ln.

[0057]

number

[0058] "TSj+SUj" in the above formula (4) represents the predicted required time RUj, which corresponds to the longest time predicted to be required to pass through link Lj. Therefore, by performing processing using the above formula (4), the control unit 14 can obtain the predicted required time RUT corresponding to the entire standard route HR and the predicted required times RU1-RUn corresponding to each of links L1-Ln.

[0059] According to the above-described process, the control unit 14 can correct the time width WTj from the required time TLj to the required time TUj to the time width WSj from the required time SLj to the required time SUj for each of the links L1 to Ln included in the standard route HR using the link length Kj, average value VAj, and variance σj. The control unit 14 can also obtain a predicted time width WLj predicted to be required to travel each of the links L1 to Ln included in the standard route HR by applying the time width WSj to the required time TSj. The control unit 14 can also obtain the time width from the predicted required time RLj to the predicted required time RUj as the predicted time width WLj. The control unit 14 can also calculate the sum of the predicted time widths WLj of the links L1 to Ln as a total predicted time width WRT predicted to be required to travel the entire standard route HR. Furthermore, the control unit 14 can acquire the time span from the predicted required time RLT to the predicted required time RUT as a total predicted time span WRT.

[0060] The control unit 14 sets a guide candidate route CR that is different from the standard route HR by searching for a route from the departure point HSS to the destination HDS. Note that the following description will be given taking as an example a case where a guide candidate route CR that includes q (q≧2) links L1 to Lq has been set.

[0061] The control unit 14 extracts road data and driving data corresponding to each of the q links included in the guide candidate route CR from the data included in the map DB 4 and the driving DB 6. Note that the following description will be given taking as an example a case where the control unit 14 extracts road data DDk from the map DB 4 and driving data RDk from the driving DB 6 as data corresponding to link Lk (1≦k≦q).

[0062] The control unit 14 acquires a time distribution DTk of the time required to pass through the link Lk and a speed distribution DVk of the passing speed when passing through the link Lk, based on the road data DDk and the travel data RDk.

[0063] The control unit 14 uses the time distribution DTk to calculate a required time TSk corresponding to an expected value in the time distribution DTk. The control unit 14 also acquires two required times TLk and TUk corresponding to two predetermined percentile values ​​of the time distribution DTk. Specifically, the control unit 14 acquires, for example, the required time corresponding to the 16th percentile of the time distribution DTk as the required time TLk. The control unit 14 also acquires, for example, the required time corresponding to the 84th percentile of the time distribution DTk as the required time TUk.

[0064] The control unit 14 uses the speed distribution DVk to calculate an average value VAk of ​​the passing speeds in the speed distribution DVk. The control unit 14 also uses the speed distribution DVk to calculate a variance σk of the passing speeds in the speed distribution DVk.

[0065] The control unit 14 obtains the link length Kk, which corresponds to the measured value of the distance of the link Lk, from the road data DDk.

[0066] The control unit 14 calculates a predicted required time SLk corresponding to the required time TLk by applying the required time TLk, link length Kk, average value VAk, and variance σk to the above formula (1) in which "j" is replaced with "k." The control unit 14 also calculates a predicted required time SUk corresponding to the required time TUk by applying the required time TUk, link length Kk, average value VAk, and variance σk to the above formula (2) in which "j" is replaced with "k." The control unit 14 also calculates a predicted required time RLA corresponding to the shortest time predicted to be required to pass through links L1 to Lq by applying the required time TSk and predicted required time SLk to the above formula (3) in which "j" is replaced with "k" and "n" is replaced with "q." Furthermore, the control unit 14 can calculate a predicted required time RLk, which corresponds to the shortest time predicted to be required to pass through link Lk, by calculating "TSk+SLk." The control unit 14 also calculates a predicted required time RUA, which corresponds to the longest time predicted to be required to pass through links L1 to Lq, by applying the required time TSk and the predicted required time SUk to a formula obtained by replacing "j" with "k" and "n" with "q" in the above formula (4). The control unit 14 can also calculate a predicted required time RUk, which corresponds to the longest time predicted to be required to pass through link Lk, by calculating "TSk+SUk."

[0067] According to the above-described process, the control unit 14 can correct the time width WTk from the required time TLk to the required time TUk to the time width WSk from the required time SLk to the required time SUk. Furthermore, the control unit 14 can obtain the predicted time width WLk predicted to be required to pass through each of the links L1 to Lq included in the guide candidate route CR by applying the time width WSk to the required time TSk. Furthermore, the control unit 14 can obtain the time width from the predicted required time RLk to the predicted required time RUk as the predicted time width WLk. Furthermore, the control unit 14 can calculate the sum of the predicted time widths WLk of the links L1 to Lq as the overall predicted time width WRA predicted to be required to pass through the links L1 to Lq. Furthermore, the control unit 14 can obtain the time width from the predicted required time RLA to the predicted required time RUA as the overall predicted time width WRA.

[0068] The control unit 14 performs the above-described process on a plurality of guided route candidate CR set as mutually different routes, thereby obtaining a plurality of total predicted time ranges WRA corresponding to the plurality of guided route candidate CR.

[0069] The control unit 14 acquires at least one route from among the plurality of guide candidate routes CR as the recommended route SR based on the plurality of total predicted time widths WRA. Specifically, the control unit 14 acquires, for example, from among the plurality of guide candidate routes CR, the route with the smallest total predicted time width WRA as the recommended route SR. Furthermore, the control unit 14 acquires, for example, from among the plurality of guide candidate routes CR, the route with the smallest predicted required time RLA, which corresponds to the lower limit of the total predicted time width WRA, as the recommended route SR.

[0070] According to the above-described process, the control unit 14 can calculate the total predicted time width WRA predicted to be required to travel along a plurality of guided route candidate CRs from the departure HSS to the destination HDS. The control unit 14 can also identify the total predicted time width WRA1, which has the smallest time width, from among the plurality of total predicted time widths WRAs corresponding to the plurality of guided route candidate CRs. The control unit 14 can also identify the recommended route SR1, which corresponds to the total predicted time width WRA1, from among the plurality of guided route candidate CRs. The control unit 14 can also identify the total predicted time width WRA2, which has the smallest predicted required time RLA, from among the plurality of guided route candidate CRs. The control unit 14 can also identify the recommended route SR2, which corresponds to the total predicted time width WRA2, from among the plurality of guided route candidate CRs.

[0071] The information control unit 14 controls the display unit 16 to display information indicating the standard route HR and the total predicted time range WRT. Furthermore, the control unit 14 controls the display unit 16 to display information indicating the recommended route SR and the total predicted time range WRA for the route acquired as the recommended route SR. FIG. 5 is a diagram showing an example of display of information related to the standard route and the recommended route. According to this control, when the control unit 14 acquires, for example, two recommended routes SR1 and SR2, it can cause the display unit 16 to display information such as that shown in FIG. 5.

[0072] In the display example of FIG. 5, a standard route HR from the departure point HSS to the destination HDS and display information HJT including a character string indicating a total predicted time range WRT corresponding to the standard route HR are displayed. The display information HJT includes the character string "usually used route" indicating the standard route HR. The display information HJT also includes the character string "predicted required time: 15 to 20 minutes" indicating the total predicted time range WRT. "15 minutes" in the display information HJT is a character string indicating the calculation result of the predicted required time RLT, which corresponds to the lower limit of the total predicted time range WRT. "20 minutes" in the display information HJT is a character string corresponding to the calculation result of the predicted required time RUT, which corresponds to the upper limit of the total predicted time range WRT.

[0073] In the display example of FIG. 5, a recommended route SR1 from a departure point HSS to a destination HDS and display information HJS1 including a character string indicating a total predicted time range WRA1 corresponding to the recommended route SR1 are displayed. The display information HJS1 includes the character string "Route with the least delay factors" indicating the recommended route SR1. The display information HJS1 also includes the character string "Predicted required time: 15 to 17 minutes" indicating the total predicted time range WRA1. The "15 minutes" in the display information HJS1 is a character string indicating the calculation result of the predicted required time RLA1, which corresponds to the lower limit of the total predicted time range WRA1. The "17 minutes" in the display information HJS1 is a character string indicating the calculation result of the predicted required time RUA1, which corresponds to the upper limit of the total predicted time range WRA1. That is, in the display example of FIG. 5, the control unit 14 acquires the route with the smallest total predicted time range WRA from among multiple recommended candidate routes CR as the recommended route SR1, and can display the total predicted time range WRA1 corresponding to the acquired recommended route SR1 on the display unit 16.

[0074] In the display example of FIG. 5, a recommended route SR2 from a departure point HSS to a destination HDS and display information HJS2 including a character string indicating a total predicted time range WRA2 corresponding to the recommended route SR2 are displayed. The display information HJS2 includes the character string "Route with the shortest required time" indicating the recommended route SR2. The display information HJS2 also includes the character string "Predicted required time: 13 to 19 minutes" indicating the total predicted time range WRA2. The "13 minutes" in the display information HJS2 is a character string indicating the calculation result of the predicted required time RLA2, which corresponds to the lower limit of the total predicted time range WRA2. The "19 minutes" in the display information HJS2 is a character string indicating the calculation result of the predicted required time RUA2, which corresponds to the upper limit of the total predicted time range WRA2. That is, in the display example of FIG. 5, the control unit 14 can acquire the route with the smallest predicted required time RLA from among multiple recommended candidate routes CR as the recommended route SR2, and can display the total predicted time range WRA2 corresponding to the acquired recommended route SR2 on the display unit 16.

[0075] [Processing flow] Next, a description will be given of the flow of processing performed by the information processing device 1. Fig. 6 is a flowchart showing an example of processing performed by the information processing device.

[0076] First, the information processing device 1 sets a standard route HR for the vehicle Ve based on the travel history data 8 stored in the storage unit 12 (step S11).

[0077] Next, the information processing device 1 acquires a time distribution related to the travel time from the departure point HSS to the destination HDS of the standard route HR (step S12). Through this process, the information processing device 1 can acquire, for example, a time distribution DTj of the travel time required to pass through the link Lj for each of the links L1 to Ln included in the standard route HR.

[0078] Next, the information processing device 1 performs processing using the time distribution DTj etc. obtained in step S12 to obtain the overall predicted time width WRT corresponding to the standard route HR (step S13), and then performs processing in step S14.

[0079] The information processing device 1 performs a route search from the departure point HSS to the destination HDS, and sets a guide candidate route CR that is different from the standard route HR (step S14).

[0080] Next, the information processing device 1 acquires a time distribution related to the required time from the departure point HSS to the destination HDS of the guided route candidate CR (step S15). Through this process, the information processing device 1 can acquire, for example, a time distribution DTk of the required time required to pass through link Lk for each of links L1 to Lq included in the guided route candidate CR.

[0081] Next, the information processing device 1 performs processing using the time distribution DTk etc. obtained in step S15 to acquire a total predicted time width WRA corresponding to the guide candidate route CR (step S16), and then performs processing in step S17.

[0082] The information processing device 1 determines whether or not a plurality of total predicted time ranges WRA corresponding to a plurality of guided route candidate CR have been acquired (step S17).

[0083] When the information processing device 1 has completed acquisition of a plurality of total predicted time ranges WRA corresponding to a plurality of guided route candidate CR (step S17: YES), it performs the process of step S18. When the information processing device 1 has not completed acquisition of a plurality of total predicted time ranges WRA corresponding to a plurality of guided route candidate CR (step S17: NO), it performs the processes from step S14 onwards again.

[0084] The information processing device 1 acquires at least one route from among the plurality of guide candidate routes CR as a recommended route SR based on the plurality of total predicted time widths WRA obtained by the processes of steps S14 to S17 (step S18).

[0085] Next, the information processing device 1 displays information related to the standard route HR and the recommended route SR on the display unit 16 (step S19). Specifically, the information processing device 1 displays, as information related to the standard route HR, information indicating the standard route HR and information indicating a total predicted time width WRT on the display unit 16. Furthermore, the information processing device 1 displays, as information related to the recommended route SR, information indicating the recommended route SR and information indicating a total predicted time width WRA on the display unit 16. Note that, when the information processing device 1 acquires a plurality of recommended routes SR by the processing of step S18, the information processing device 1 displays, on the display unit 16, information indicating the plurality of recommended routes SR and information indicating a plurality of total predicted time widths WRA corresponding to each of the plurality of recommended routes SR.

[0086] As described above, according to this embodiment, the route with the smallest total predicted time range WRA among the multiple candidate recommended routes CR can be presented as the recommended route SR1. Therefore, according to this embodiment, a route with a highly accurate predicted required time can be presented as a route from the departure point to the destination.

[0087] As described above, according to this embodiment, it is possible to display both information indicating the total predicted time width WRT corresponding to the standard route HR and information indicating the total predicted time width WRA corresponding to the recommended route SR. Therefore, according to this embodiment, it is possible to easily grasp the predicted required time for a route that is frequently used by the user and the predicted required time for the recommended route.

[0088] <Modification> Next, preferred modifications of the above-described embodiment will be described. For simplicity, detailed descriptions of the applicable parts of the above-described processes will be omitted. The following modifications may be combined and applied to the above-described embodiment.

[0089] [Variation 1] As long as the control unit 14 performs the process related to the presentation of the recommended route SR1 and the total predicted time width WRA1, it is not necessary for the control unit 14 to perform at least a part of the process related to the presentation of other routes and the total predicted time width. In other words, the control unit 14 is not necessary to perform at least one of the process related to the presentation of the standard route HR and the total predicted time width WRT and the process related to the presentation of the recommended route SR2 and the total predicted time width WRA2.

[0090] According to the processing of this modified example, the control unit 14 can display at least the recommended route SR1 and the display information HJS1 on the display unit 16. Furthermore, according to the processing of this modified example, the control unit 14 can display the standard route HR, the display information HJT, the recommended route SR1, and the display information HJS1 on the display unit 16. Furthermore, according to the processing of this modified example, the control unit 14 can display the recommended route SR1, the display information HJS1, the recommended route SR2, and the display information HJS2 on the display unit 16.

[0091] [Variation 2] When the control unit 14 acquires the departure HSS and the destination HDS, it may calculate a predicted time width WLk corresponding to each of a plurality of links from the departure HSS to the destination HDS, and set a route obtained by selectively connecting each link for which the calculated predicted time width WLk is the minimum as the recommended route SR3. The processing performed in such a case will be described while referring to FIG. 7. FIG. 7 is a diagram for explaining an example of the processing related to the setting of the recommended route. <> <>

[0092] <> For example, when there are links LU1 and LT1 that are the closest to the departure HSS and lead to the destination HDS, the control unit 14 calculates the predicted time width WLU1 corresponding to the link LU1 and the predicted time width WLT1 corresponding to the link LT1. Further, for example, when WLU1 < WLT1, the control unit 14 selects the link LU1 as the link L1 and acquires the predicted time width WLU1 as the predicted time width WL1. Further, for example, when WLU1 > WLT1, the control unit 14 selects the link LT1 as the link L1 and acquires the predicted time width WLT1 as the predicted time width WL1. Incidentally, for example, when WLU1 = WLT1, the control unit 14 may select the link L1 based on the calculation results of the predicted time width WLk at the next link of the link LU1 and the next link of the link LT1. <> <>

[0093] <> According to the above-described process, the control unit 14 can calculate the predicted time width WLk for each of the multiple links leading from the departure HSS to the destination HDS. Furthermore, by repeatedly performing the above-described process, the control unit 14 can select, as links L1 to Lq, the link with the smallest predicted time width WLk from among the multiple links leading from the departure HSS to the destination HDS. Furthermore, the control unit 14 can set the route connecting the selected links L1 to Lq as the recommended route SR3. Furthermore, the control unit 14 can calculate the sum of the predicted time widths WLk corresponding to each link included in the recommended route SR3 as the overall predicted time width WRA3 predicted to be required to travel the entire recommended route SR3. Furthermore, the control unit 14 can display the overall predicted time width WRA3 and the recommended route SR3 on the display unit 16.

[0094] [Variation 3] According to the above-described embodiment, at least a part of the processes performed by the information processing device 1 may be performed by a server device that performs data communication with the information processing device 1.

[0095] 8 is a diagram showing an example of the configuration of a guidance system according to a modified example. Guidance system 100A includes information processing device 1A and server device 200. Information processing device 1A and server device 200 perform data communication via network 150.

[0096] The information processing device 1A has the same configuration as the information processing device 1 described in the above embodiment (see FIG. 2). Note that, when the server device 200 performs processing based on data stored in the map DB 4, the spot information DB 5, and the travel DB 6, the information processing device 1A does not need to store the data. Furthermore, the information processing device 1A transmits information input via the input unit 13, information obtained by the sensor group 15, and the like to the server device 200.

[0097] Fig. 9 is a diagram showing a schematic configuration of a server device according to a modified example. As shown in Fig. 9, server device 200 includes a communication unit 301, a storage unit 302, and a control unit 304. Communication unit 301, storage unit 302, and control unit 304 are connected to each other via a bus line 300.

[0098] The communication unit 301 transmits and receives various data via the network 150 under the control of the control unit 304. The storage unit 302 is configured with, for example, an HDD. The storage unit 302 also stores data necessary for acquiring the overall predicted time widths WRT and WRA, such as a map DB4, a spot information DB5, and a driving DB6. The control unit 304 has memories such as a CPU, ROM, and RAM, and performs overall control of the server device 200 by executing programs stored in the memory. The control unit 304 can also be considered as an example of a computer.

[0099] According to the configuration described above, the control unit 304 can set a standard route HR for the vehicle Ve based on the travel history data 8 received from the information processing device 1A of the vehicle Ve, and acquire the departure HSS and destination HDS corresponding to the standard route HR. The control unit 304 can also acquire a time distribution DTj of the travel time required to pass through link Lj for each of links L1 to Ln included in the standard route HR. The control unit 304 can also acquire a total predicted time range WRT by performing processing using the time distribution DTj, etc. The control unit 304 can also set multiple guide candidate routes CR by searching for a route from the departure HSS to the destination HDS. The control unit 304 can also acquire multiple total predicted time ranges WRA corresponding to the multiple guide candidate routes CR. The control unit 304 can also acquire at least one route from the multiple guide candidate routes CR as a recommended route SR based on the multiple total predicted time ranges WRA. Furthermore, the control unit 304 can generate, as information related to the standard route HR, information indicating the standard route HR and information indicating a total predicted time width WRT, and transmit the generated information to the information processing device 1A. Furthermore, the information processing device 1A can generate, as information related to the recommended route SR1, information indicating the recommended route SR1 and information indicating a total predicted time width WRA1, and transmit the generated information to the information processing device 1A. Furthermore, the information processing device 1A can generate, as information related to the recommended route SR2, information indicating the recommended route SR2 and information indicating a total predicted time width WRA2, and transmit the generated information to the information processing device 1A.

[0100] According to this modification, the same processing as that performed in the server device 200 may be performed in a server system having a plurality of server devices.

[0101] In each of the above-described embodiments, the program can be stored using various types of non-transitory computer-readable media and supplied to a control unit, such as a computer. Non-transitory computer-readable media include various types of tangible storage media (tangible storage media). Examples of non-transitory computer-readable media include magnetic storage media (e.g., flexible disks, magnetic tapes, hard disk drives), magneto-optical storage media (e.g., magneto-optical disks), CD-ROMs (Read Only Memory), CD-Rs, CD-R / Ws, and semiconductor memories (e.g., mask ROMs, PROMs (Programmable ROMs), EPROMs (Erasable PROMs), flash ROMs, and RAMs (Random Access Memory).

[0102] Although the present invention has been described above with reference to the embodiments, the present invention is not limited to the above embodiments. Various modifications within the scope of the present invention that would be understood by those skilled in the art can be made to the configuration and details of the present invention. In other words, the present invention naturally includes various modifications and alterations that would be possible for those skilled in the art based on the entire disclosure, including the claims, and the technical ideas. Furthermore, the disclosures of the above-cited patent documents and other documents are incorporated herein by reference. [Explanation of symbols]

[0103] 1, 1A Information processing equipment 11, 301 Communications Department 12, 302 Storage section 13 Input section 14, 304 Control section 15 Sensors 16 Display section

Claims

1. a calculation unit that calculates a predicted required time for passing through a plurality of routes from a departure point to a destination, the predicted required time having a time range predicted to be required for passing through the route; an identification unit that identifies a first predicted required time having the shortest time width from among the predicted required times corresponding to the plurality of routes, and identifies a first route from among the plurality of routes that corresponds to the first predicted required time; a presentation control unit that causes the first predicted required time and the first route to be presented; An information processing device having the above.

2. a route acquisition unit that acquires, as a route from the departure point to the destination based on a movement history of a predetermined mobile object, a second route that is frequently passed by the predetermined mobile object; the calculation unit calculates a second predicted required time having a time width predicted to be required to travel the entire second route; The information processing device according to claim 1 , wherein the presentation control unit causes the first predicted required time, the first route, the second predicted required time, and the second route to be presented.

3. the identification unit identifies a third predicted required time from among the predicted required times corresponding to the plurality of routes, the third predicted required time being the shortest time corresponding to a lower limit of the time range, and identifies a third route from among the plurality of routes that corresponds to the third predicted required time; The information processing device according to claim 2 , wherein the presentation control unit causes the first predicted required time, the first route, the second predicted required time, the second route, the third predicted required time, and the third route to be presented.

4. a first calculation unit that calculates, for each of a plurality of links leading from the departure point to the destination, a first predicted required time having a time width predicted to be required to pass through the link; a setting unit that sets, as a recommended route, a route that selectively connects each link that minimizes the time width of the first predicted required time; a second calculation unit that calculates a sum of the first predicted required times corresponding to each link included in the recommended route as a second predicted required time having a time width predicted to be required to travel the entire recommended route; a presentation control unit that presents the second predicted required time and the recommended route; An information processing device having the above.

5. 1. A computer-implemented information processing method, comprising: a calculation step of calculating a predicted required time having a time range predicted to be required to travel along a plurality of routes from a departure point to a destination; a specifying step of specifying a first predicted required time from among the predicted required times corresponding to the plurality of routes, the first predicted required time being the smallest in the time range, and specifying a first route from among the plurality of routes that corresponds to the first predicted required time; a presentation control step of presenting the first predicted required time and the first route; An information processing method comprising:

6. 1. A computer-implemented information processing method, comprising: a first calculation step of calculating, for each of a plurality of links leading from the departure point to the destination, a first predicted required time having a time width predicted to be required to pass through the link; a setting step of setting, as a recommended route, a route that selectively connects each link that minimizes the time width of the first predicted required time; a second calculation step of calculating a sum of the first predicted required times corresponding to each link included in the recommended route as a second predicted required time having a time width predicted to be required to travel the entire recommended route; a presentation control step of presenting the second predicted required time and the recommended route; An information processing method comprising:

7. A program executed by a computer, a calculation unit that calculates a predicted required time having a time range predicted to be required to pass through a plurality of routes from a departure point to a destination; an identification unit that identifies a first predicted required time from among the predicted required times corresponding to the plurality of routes, the first predicted required time being the shortest, and that identifies a first route from among the plurality of routes that corresponds to the first predicted required time; and a program that causes the computer to function as a presentation control unit that presents the first predicted required time and the first route;

8. A program executed by a computer, a first calculation unit that calculates, for each of a plurality of links leading from the departure point to the destination, a first predicted required time having a time width predicted to be required to pass through the link; a setting unit that sets, as a recommended route, a route that selectively connects each link that minimizes the time width of the first predicted required time; a second calculation unit that calculates a sum of the first predicted required times corresponding to each link included in the recommended route as a second predicted required time having a time width predicted to be required to travel the entire recommended route; and a program that causes the computer to function as a presentation control unit that presents the second predicted required time and the recommended route;

9. A storage medium storing the program according to claim 7 or 8.

Images