JP2019020172A - Route proposing device and route proposition method - Google Patents

Abstract

To propose a drop-in place that meets a user's desire.SOLUTION: A route proposing device pertaining to an embodiment of the present invention comprises an acquisition unit, a first calculation unit, an extraction unit and a second calculation unit. The acquisition unit acquires requirement information that indicates a desired arrival time at a destination that is desired by a user aboard a vehicle and a desired action that is desired till the desired arrival time. The first calculation unit calculates a first route from the present location of the vehicle to the destination. The extraction unit extracts, on the basis of the requirement information acquired by the acquisition unit, a candidate point existing in a prescribed range from a specific reference point on the first route calculated by the first calculation unit. The second calculation unit calculates a second route to the reference point going via the candidate point extracted by the extraction unit.SELECTED DRAWING: Figure 1B

Description

  The present invention relates to a route proposal device and a route proposal method.

  2. Description of the Related Art Conventionally, there is a route proposal device that proposes a detour to a vehicle user. Such a route proposal device proposes a detour destination when there is enough time before the user's desired arrival time (see, for example, Patent Document 1).

JP 2010-14661 A

  However, in the prior art, there is room for improvement in proposing a detour that meets the user's wishes. In particular, when a user has time to go home in an area where there is no land insight such as a travel destination, a proposal of a detour destination in such an area is desired.

  The present invention has been made in view of the above, and an object of the present invention is to provide a route proposing device and a route proposing method capable of proposing a route according to a user's desire.

  In the route proposal device, the present invention includes an acquisition unit, a first calculation unit, an extraction unit, and a second calculation unit. The acquisition unit acquires request information indicating a desired arrival time of a destination desired by a user on the vehicle and a desired action desired by the desired arrival time. The first calculation unit calculates a first route from the current location of the vehicle to the destination. The extraction unit extracts candidate points existing in a predetermined range from a specific reference point on the first route calculated by the first calculation unit based on the request information acquired by the acquisition unit. The second calculation unit calculates a second route to the reference point via the candidate point extracted by the extraction unit.

  ADVANTAGE OF THE INVENTION According to this invention, the detour destination according to a user's hope can be proposed.

FIG. 1A is a diagram illustrating a configuration of a route proposal system. FIG. 1B is a diagram showing an outline of the route proposal method. FIG. 2 is a block diagram of the route proposal system. FIG. 3A is a diagram illustrating a specific example of a request information input screen. FIG. 3B is a diagram illustrating a specific example of a proposal result for request information. FIG. 4 is a diagram illustrating a specific example of the detour time calculation process. FIG. 5 is a diagram showing a specific example of the map database. FIG. 6A is a diagram (part 1) illustrating a specific example of the calculation process of the second route. FIG. 6B is a second diagram illustrating a specific example of the calculation process of the second route. FIG. 7 is a flowchart illustrating a processing procedure executed by the route proposal device. FIG. 8 is a diagram illustrating an example of setting a reference point.

  Hereinafter, a route proposal device and a route proposal method according to an embodiment will be described in detail with reference to the accompanying drawings. In addition, this invention is not limited by this embodiment.

  First, an outline of a route proposal device and a route proposal method according to the embodiment will be described with reference to FIGS. 1A and 1B. FIG. 1A is a diagram illustrating a configuration of a route proposal system. FIG. 1B is a diagram showing an outline of the route proposal method.

  As illustrated in FIG. 1A, the route proposal system 100 includes a route proposal device 1 and an in-vehicle device 50. The route proposal device 1 is a server that transmits and receives data to and from the in-vehicle device 50 mounted on each vehicle C, for example.

  The in-vehicle device 50 is a navigation device that provides route guidance to the driver of the vehicle C, for example. Upon receiving a user operation for inputting a destination, a desired arrival time at the destination, and the like, the in-vehicle device 50 transmits request information based on the user operation to the route proposal device 1.

  The route proposal device 1 calculates a route based on the request information, and transmits route information indicating the calculated route to the in-vehicle device 50. The in-vehicle device 50 guides the route to the destination to the user based on the route information.

  Further, the route proposal device 1 calculates the required time of the calculated route, and if there is a time margin until the desired arrival time, the route proposal device 1 proposes a detour destination based on the desired behavior desired by the user by the desired arrival time. be able to.

  Here, for example, there is a case where the user has time to go home in an area where there is no land intuition such as a travel destination. In such a case, it is desired to propose a route that can efficiently go around a plurality of detours (sightseeing spots) in a limited time until reaching the return route.

  In particular, if the user himself / herself sets the detour destination in an area where there is no land intuition, it may take a lot of time to select the detour destination and to determine the order through the detour destination. Also, depending on the destination set by the user, the arrival time of the original destination may exceed the desired arrival time. On the other hand, such a problem is unlikely to occur even if the user himself / herself sets a detour for a place where the user feels the land.

  Therefore, in the route proposal method according to the embodiment, paying attention to this point, the user proposes a detour to effectively use the time until the user arrives in the area where there is no land insight such as a travel destination. did.

  Specifically, as shown in FIG. 1B, in the route proposal method, first, a first route R1 from the current location to a destination (for example, home) is calculated (step S1). In the route proposal method, the required time for the first route R1 is calculated, and the detour time that can be detoured is calculated based on the required time and the desired arrival time at the destination.

  Subsequently, in the route proposal method, candidate points Pc within a predetermined range L are extracted from a specific reference point Pr on the first route R1 based on the desired behavior desired by the user (step S2).

  For example, in the route proposal method, when the user wishes to purchase a souvenir, a souvenir shop is extracted as a candidate point Pc, and when the user desires a meal, a restaurant or the like is extracted as a candidate point Pc.

  Here, the reference point Pr is, for example, the entrance of a highway around the current location of the vehicle C, and the first route R1 indicates that the route from the reference point Pr to the destination is via the highway. That is, the reference point Pr is a point that the user should pass to go to the destination. Hereinafter, the vicinity of the reference point Pr may be described as a first area, and the vicinity of the destination may be described as a second area. The final destination in the first area is the reference point Pr, and the final destination in the second area is home.

  In the route proposal method, the time until the vehicle C gets on the expressway is allocated to the detour time, and the detour destination in the first area around the reference point Pr is proposed.

  Thus, in the route proposal method, the user can visit a plurality of candidate points Pc in a short time by extracting the candidate points Pc existing in the predetermined range L based on the reference point Pr. In other words, in the route proposal method, it is possible to propose a route for efficiently traveling around the first area to the user.

  Note that the reference point Pr is not limited to the entrance of the expressway, but can be set by the user himself / herself. The predetermined range L is, for example, a circle with a radius of 5 km centered on the reference point Pr. However, the predetermined range L is not limited to this, and the radius can be changed according to, for example, the detour time. The predetermined range L is not limited to a circle, and may be other shapes such as an ellipse or a rectangle.

  Subsequently, in the route proposal method according to the embodiment, the second route R2 to the reference point Pr via the extracted candidate point Pc is calculated (step S3). In the route proposal method according to the embodiment, route information obtained by rewriting the first route R1 from the current location to the reference point Pr to the second route R2 is transmitted to the in-vehicle device 50.

  Here, in the route proposal method according to the embodiment, the second route R2 is calculated so as to arrive at the reference point Pr within the detour time. That is, in the route proposal method according to the embodiment, it is possible to select a candidate point Pc to be routed according to the detour time instead of going through all the extracted candidate points Pc. Thereby, in the route proposal method according to the embodiment, it is possible to propose a route that can reach the destination by the desired arrival time.

  As described above, in the route proposing method according to the embodiment, the user extracts the candidate points Pc only in the first area without the land intuition, and proposes the route connecting the candidate points Pc to the user. That is, in the route proposal method according to the embodiment, it is possible to propose a route that meets the user's wishes by proposing a route that efficiently travels around the first region.

  In the route proposal method according to the embodiment, since the user only has to input the desired arrival time of the destination and the desired behavior, no complicated operation is required. That is, in the route proposal method according to the embodiment, it is possible to propose a detour destination according to the user's wish with a simple operation.

  Next, the configuration of the route proposal system 100 according to the embodiment will be described with reference to FIG. FIG. 2 is a block diagram of the route proposal system 100. As shown in FIG. 2, the route proposal system 100 includes a route proposal device 1 and an in-vehicle device 50.

  The in-vehicle device 50 is a navigation device mounted on the vehicle C, for example. The in-vehicle device 50 includes a control unit 51, a storage unit 53, a communication unit 55, a GPS (Global Positioning System) 56, an operation unit 57, and a display unit 58.

  The control unit 51 of the in-vehicle device 50 includes an output unit 52. The output unit 52 displays the route to the destination on the display unit 58 based on the route information transmitted from the route proposal device 1. For example, the output unit 52 generates a guide image in which position information input from the GPS 56 and route information are superimposed on the map information 54 stored in the storage unit 53 as needed, and displays the guidance image on the display unit 58.

  Further, the output unit 52 generates request information based on the operation information input from the operation unit 57 and transmits the request information to the route proposal device 1 via the communication unit 55. The request information includes a desired arrival time of the destination set by the user and a desired action desired by the desired arrival time.

  Here, a display screen when the user inputs the request information will be described with reference to FIG. 3A. FIG. 3A is a diagram illustrating a specific example of a request information input screen. As shown in FIG. 3A, for example, the desired arrival time, desired action 1, desired action 2, and the like are displayed on the display unit 58.

  The user refers to the input screen displayed on the display unit 58 and inputs each item on the input screen using the operation unit 57. When the user finishes inputting each item, the input is completed by pressing the enter button.

  The output unit 52 generates request information based on the input and transmits the request information to the route proposal device 1. The route proposal device 1 calculates a route based on the request information and transmits the route information indicating the calculated route to the in-vehicle device 50.

  Here, it is assumed that “desired behavior 1” has a higher priority desired by the user than “desired behavior 2”. In the route proposal system 100, it is possible to select a detour destination according to the priority. In the example shown in the figure, the desired action 1 is “local gourmet” and the desired action 2 is “tourism”.

  Therefore, the route proposal system 100 proposes a route that preferentially passes the candidate point Pc related to “local gourmet” over the candidate point Pc related to “tourism”. In other words, when there is time to detour only one of the “local gourmet” and “sightseeing”, the route goes through the candidate location Pc related to “tourism”, but passes through the candidate location Pc related to “tourism”. Propose a route that does not. Accordingly, it is possible to propose a route that arrives at the destination by the desired arrival time while satisfying the user's wishes.

  Also, as shown in FIG. 3B, the proposal result is displayed on the display unit 58 by the route proposal device 1. In this case, the display unit 58 displays the estimated arrival time of the destination, the name of each candidate point Pc, and the estimated arrival time. FIG. 3B is a diagram illustrating a specific example of a proposal result for the request information.

  The user confirms the proposal result, and if the proposal result is acceptable, the in-vehicle device 50 starts the route guidance by operating the guidance start button.

  Returning to the description of FIG. 2, the route proposal device 1 will be described. The route proposal device 1 includes a control unit 2, a storage unit 3, and a communication unit 10. The communication unit 10 is a communication module that communicates with the in-vehicle device 50. The control unit 2 includes an acquisition unit 21, a first calculation unit 22, an extraction unit 23, and a second calculation unit 24. The storage unit 3 includes a map database 31 and a user database 32.

  The control unit 2 includes, for example, a computer having a central processing unit (CPU), a read only memory (ROM), a random access memory (RAM), a hard disk drive (HDD), an input / output port, and various circuits.

  The CPU of the computer functions as the acquisition unit 21, the first calculation unit 22, the extraction unit 23, and the second calculation unit 24 of the control unit 2, for example, by reading and executing a program stored in the ROM.

  In addition, at least one or all of the acquisition unit 21, the first calculation unit 22, the extraction unit 23, and the second calculation unit 24 of the control unit 2 are configured as ASIC (Application Specific Integrated Circuit), FPGA (Field Programmable Gate Array), or the like. It can also be configured with other hardware.

  The storage unit 3 corresponds to, for example, a RAM or an HDD. The RAM and HDD can store information on the map database 31, the user database 32, and various programs. The route proposal device 1 may acquire the above-described program and various types of information via another computer or a portable recording medium connected via a wired or wireless network.

  The acquisition unit 21 of the control unit 2 acquires request information indicating a desired arrival time of a destination desired by a user boarding the vehicle C and a desired action desired by the desired arrival time. Moreover, the acquisition part 21 acquires the positional information which shows the present location of the vehicle C with a predetermined period.

  The acquisition unit 21 acquires all information transmitted from the in-vehicle device 50 together with identification information for identifying the in-vehicle device 50. The route proposal device 1 can manage information for each in-vehicle device 50 (user) based on the identification information. In addition, the acquisition unit 21 outputs the acquired information to the first calculation unit 22.

  The first calculator 22 calculates a first route R1 from the current location of the vehicle C to the destination. Specifically, the first calculation unit 22 calculates the first route R1 by performing a route search to the destination based on the map database 31.

  The first calculation unit 22 calculates a required time from the current location of the vehicle C to the destination on the first route R1 and a required time from the current location of the vehicle C to the reference point Pr on the first route R1. Calculate the detour time.

  Here, the detour time will be described with reference to FIG. FIG. 4 is a diagram illustrating a specific example of the detour time calculation process. In FIG. 4, a case will be described in which the time until the user goes home on the next day after staying at the travel destination is used as the detour time.

  Further, as shown in FIG. 4, a scene is shown in which the desired arrival time at the destination is 21:00 and the estimated arrival time at the destination is 17:00. Further, it is assumed that the scheduled passage time of the reference point Pr that is the entrance of the expressway is 12:00 and the current time is 10:00.

  The 1st calculation part 22 calculates the time which deducted the arrival time from the desired arrival time as a detour time. In the example shown in the figure, the detour time is 21: 00-17: 00 = 4 hours.

  Therefore, the vehicle C can leave the reference point Pr by 16:00 and reach the destination by the desired arrival time. For this reason, the route proposal device 1 assigns the time until 16:00 to the detour.

  In addition, the 1st calculation part 22 can also correct said detour time based on the traffic congestion prediction information for every time slot | zone, for example. For example, the first calculation unit 22 calculates the required time from the reference point Pr to the destination between 12:00 and 17:00 and between 16:00 and 21:00.

  And the 1st calculation part 22 adjusts the detour time according to the difference of each calculated required time. This makes it possible to calculate the detour time more accurately. Note that the traffic jam prediction information can be acquired from an external server (not shown).

  In addition, although the case where the first calculation unit 22 calculates one first route R1 has been described here, the first calculation unit 22 may calculate a plurality of first routes R1. For example, the first calculation unit 22 may calculate the first route R1 that travels on a general road up to the entrance of an expressway that is closest to the second and subsequent roads.

  Returning to the description of FIG. 2, the extraction unit 23 will be described. Based on the request information acquired by the acquisition unit 21, the extraction unit 23 extracts a candidate point Pc existing in the predetermined range L from the specific reference point Pr calculated on the first route R1 calculated by the first calculation unit 22. .

  For example, the extraction unit 23 extracts the candidate point Pc based on the map database 31. Here, the map database 31 will be described with reference to FIG. FIG. 5 is a diagram showing a specific example of the map database 31.

  As shown in FIG. 5, the map database 31 stores facility information of each facility in association with each other on a map. Such facility information includes, for example, a store name, an address, a genre, business hours, a standard stay time, and the number of parking lots. Here, the standard stay time is, for example, a standard time for a user of the facility to stay in such a facility, and for example, an average time of staying in the facility can be used.

  Based on the map database 31, the extracting unit 23 extracts a facility of a genre that exists in the predetermined range L from the reference point Pr and conforms to the desired behavior as the candidate point Pc.

  For example, when there are a plurality of facilities of a genre along the desired behavior in the predetermined range L, the extraction unit 23 may extract all of the plurality of facilities, or extract one of the plurality of facilities. You may decide.

  In this case, the extraction unit 23 can select a candidate point Pc to be extracted based on a word of mouth (evaluation) of another user. For example, the extraction unit 23 extracts a facility having the highest evaluation among the facilities of the same genre as the candidate point Pc. In other words, the extraction unit 23 can extract a popular facility as a candidate point Pc.

  That is, by extracting a facility with a high evaluation as a detour destination, an effect of increasing user satisfaction can be expected. In addition, the information regarding this review can be acquired from an external server etc. and can be registered into the map database 31, for example.

  In such a case, the extraction unit 23 can also select a candidate point Pc to be extracted based on the user database 32 (see FIG. 2).

  Specifically, in the route proposal device 1, the past detour destination history, the destination history, and the like are stored in the user database 32 for each in-vehicle device 50. Then, the extraction unit 23 analyzes user preferences from the user database 32.

  For example, the extraction unit 23 extracts a ramen shop as a candidate point Pc when the number of times the vehicle C stops at a ramen shop among facilities related to the restaurant or when the genre of the restaurant is selected by the user.

  The extraction unit 23 extracts the museum as the candidate point Pc when the number of times the vehicle C stops at the museum among the facilities related to tourism or when the genre of tourism is selected. That is, the extraction unit 23 can learn the user's preference and can extract the candidate spot Pc based on the learning result. This makes it possible to propose a route that meets the user's wishes without the user having to input preferences and the like.

  Here, as described above, a priority is set for each desired action. For this reason, the extraction unit 23 gives priority to the extracted candidate spot Pc and notifies the second calculation unit 24 of the priority.

  Returning to the description of FIG. 2, the second calculation unit 24 will be described. The second calculation unit 24 calculates the second route R2 to the reference point Pr via the candidate point Pc extracted by the extraction unit 23.

  Here, the calculation process of the second route R2 will be described with reference to FIGS. 6A and 6B. 6A and 6B are diagrams illustrating a specific example of the calculation process of the second route R2. In FIG. 6A, the priorities of the candidate points Pc1 to Pc1 extracted by the extraction unit 23 and the standard stay time are shown. Here, the lower the priority value, the higher the priority.

  As illustrated in FIG. 6A, for example, the second calculation unit 24 calculates a route connecting the candidate points Pc1 to Pc3 in order from the reference point Pr as the second route R2. In other words, the second calculation unit 24 calculates, as the second route R2, a route having a short traveling distance of the vehicle C among a plurality of routes connecting the reference points Pr via the candidate points Pc1 to Pc1.

  As a result, the travel time can be shortened and a route for suppressing the fuel consumption of the vehicle C can be proposed. Note that the second calculation unit 24 is not limited to the above example, and the second calculation unit 24 changes the order of passing through the candidate points Pc1 to 3 when the candidate point Pc is out of business hours at the scheduled time passing through each candidate point Pc. It may be.

  Moreover, the 2nd calculation part 24 can also decide to change the order which passes through each candidate point Pc based on the congestion condition for every time slot | zone of each candidate point Pc. For example, the 2nd calculation part 24 changes the order which passes through candidate point Pc1-3 so that the time slot | zone which is crowded in candidate point Pc may be avoided. As a result, it is possible to avoid a situation where the user is held at the candidate point Pc for a long time. In other words, time efficiency can be improved.

  In addition, the second calculation unit 24 calculates the required time on the second route R2, and when the required time is longer than the detour time, for example, the second route R2 is excluded by excluding the candidate point Pc having the lowest priority. calculate. The required time is the time for traveling on the second route R2 + the standard stay time.

  In the example shown in the figure, since the priority of the candidate spot Pc3 is the lowest, the candidate spot Pc3 is excluded, and the second route R2 (broken line shown in the figure) passing through the candidate spot Pc2 is calculated from the candidate spot Pc1.

  Further, when the required time is longer than the detour time on the second route R2, the second calculation unit 24 further excludes the candidate point Pc2 and calculates the second route R2 connecting the reference point Pr to the candidate point Pc1. .

  That is, the second route R2 passes through the candidate point Pc having a high priority with priority, and passes through the candidate point Pc with a low priority when there is a time margin.

  In this way, when setting the second route R2 from the current location to the reference point Pr, the candidate point Pc within the predetermined range L based on the position of the reference point Pr is selected based on the priority. For example, before moving from the first area where the user has boarded the vehicle C to another second area, the user can move to the first area within a predetermined time via at least one candidate point Pc in the first area. The candidate point Pc is selected so that the final destination (reference point Pr) can be reached. As a result, while satisfying the satisfaction of the user who does not understand the land in the first area, the final destination (for example, the second area) by the desired arrival time via the final destination (reference point Pr) of the first area (for example, It is possible to propose a travel route that can be reached at home.

  Incidentally, the second calculator 24 can also change the reference point Pr to another point on the first route R1 that is closer to the destination than the reference point Pr. For example, as illustrated in FIG. 6B, when the candidate point Pc extracted by the extraction unit 23 is closer to the reference point Pr2 than the reference point Pr1, the second calculation unit 24 passes the reference point Pr2 instead of the reference point Pr1. The second route R2 to be calculated can also be calculated.

  In the example shown in the figure, the route from the candidate point Pc2 to the reference point Pr1 is away from the destination. For this reason, the second calculation unit 24 calculates the second route R2 that passes through the reference point Pr2 in a direction approaching the destination from the candidate point Pc2.

  That is, the second calculation unit 24 calculates, as the second route R2, a route from the reference point Pr to the reference point Pr2, which is an entrance of an expressway closer to the destination than the reference point Pr1. Thereby, it is possible to propose a route with less travel time loss.

  Then, the second calculation unit 24 outputs the calculated route information regarding the second route R <b> 2 to the communication unit 10 and transmits the route information to the in-vehicle device 50 via the communication unit 10. The in-vehicle device 50 proposes a route to the user based on the route information.

  By the way, the 2nd calculation part 24 can also correct | amend 2nd path | route R2, when the actual stay time in each candidate point Pc differs from standard stay time.

  For example, the second calculation unit 24 can measure the actual stay time by counting the stay time from when the vehicle C arrives at the candidate point Pc to the departure based on the position information of the vehicle C. is there.

  Then, when the actual stay time is longer than the standard stay time, that is, when the actual time is behind the original plan, the second calculation unit 24 has the highest priority among the candidate points Pc on the second route R2. The candidate point Pc with a low standard time is deleted, or the candidate point Pc is changed to a candidate point Pc with a short standard stay time among facilities of the same genre, and the second route R2 is calculated again.

  In addition, the second calculation unit 24 can also add a new candidate point Pc to the second route R2 when the actual stay time is shorter than the standard stay time, that is, when the actual stay time is earlier than the initial plan.

  In this case, for example, the second calculation unit 24 adds a facility of the same genre as the candidate point Pc having the highest priority, or adds the second candidate route P2 to which the candidate point Pc that is popular within the predetermined range L is added. calculate. In this case, the second calculation unit 24 may add a rest facility such as a coffee shop to the candidate point Pc in preparation for the subsequent operation. And the 2nd calculation part 24 transmits newly calculated 2nd path | route R2 to the vehicle-mounted apparatus 50 for every calculation.

  In this way, the second calculation unit 24 can correct the second route R2 as needed according to the user's behavior, so that the user can make the detour time more substantial. In addition to the stay time, the second calculation unit 24 may correct the second route R2 based on the expected passing time of each passing point on the second route R2 and the actual passing time. .

  Next, a processing procedure executed by the route proposal device 1 according to the embodiment will be described with reference to FIG. FIG. 7 is a flowchart showing a processing procedure executed by the route proposal device 1.

  As shown in FIG. 7, first, the acquisition unit 21 acquires request information (step S101). Subsequently, the first calculation unit 22 calculates the first route R1 from the current location of the vehicle C to the destination (step S102).

  Next, the first calculation unit 22 calculates the detour time based on the first route R1 (step S103), and the extraction unit 23 extracts the candidate point Pc existing in the predetermined range L from the reference point Pr (step S103). S104).

  Next, the second calculation unit 24 calculates the second route R2 from the current location of the vehicle C to the candidate point Pc to the reference point Pr (step S105). Then, the communication unit 10 transmits route information obtained by rewriting the first route R1 from the current location of the vehicle C to the reference point Pr to the second route R2 (step S106), and ends the process.

  As described above, the route proposal device 1 according to the embodiment includes the acquisition unit 21, the first calculation unit 22, the extraction unit 23, and the second calculation unit 24. The acquisition unit 21 acquires request information indicating a desired arrival time of a destination desired by a user boarding the vehicle C and a desired action desired by the desired arrival time. The first calculator 22 calculates a first route R1 from the current location of the vehicle C to the destination.

  Based on the request information acquired by the acquisition unit 21, the extraction unit 23 extracts a candidate point Pc existing in the predetermined range L from the specific reference point Pr calculated on the first route R1 calculated by the first calculation unit 22. . The second calculation unit 24 calculates the second route R2 to the reference point Pr via the candidate point Pc extracted by the extraction unit 23. Therefore, according to the route proposal device 1 according to the embodiment, it is possible to propose a detour destination according to the user's desire.

  By the way, although embodiment mentioned above demonstrated the case where the reference point Pr near the present location of the vehicle C was an entrance of a highway, it is not limited to this. For example, the reference point Pr can be arbitrarily changed as long as it is a point on the first route R1.

  For example, when the user rents a rental car, the rental car return port, that is, the destination of the vehicle C can be set as the reference point Pr. In such a case, if the user sets the desired arrival time at the destination as the rental car return time, the user can effectively use the time until the rental car is returned.

  In addition, the user can freely select the reference point Pr. Details of this point will be described with reference to FIG. FIG. 8 is a diagram illustrating a setting example of the reference point Pr. For example, as shown in FIG. 8, a plurality of reference points Pr and the first route R1 can be displayed on the display unit 58, and the user can select the reference point Pr.

  Thereby, the route proposal device 1 can propose a detour destination in an area desired by the user, and can propose a route according to the user's desire. In such a case, the reference point Pr does not need to be an entrance of an expressway, and an arbitrary point on the first route R1 such as an intersection, an entrance of a bypass road, a shopping mall, or the like can be set.

  Moreover, although embodiment mentioned above demonstrated the case where request information was transmitted to the route proposal apparatus 1 from the vehicle-mounted apparatus 50, it is not limited to this. Instead of the in-vehicle device 50, the request information may be transmitted to the route proposal device 1 from a terminal device such as a user's smartphone or tablet terminal.

  In the above-described embodiment, the case where the route proposal device 1 and the vehicle-mounted device 50 are separate devices has been described. However, the route proposal device 1 may be included in the vehicle-mounted device 50.

  Further effects and modifications can be easily derived by those skilled in the art. Thus, the broader aspects of the present invention are not limited to the specific details and representative embodiments shown and described above. Accordingly, various modifications can be made without departing from the spirit or scope of the general inventive concept as defined by the appended claims and their equivalents.

DESCRIPTION OF SYMBOLS 1 Route proposal apparatus 21 Acquisition part 22 1st calculation part 23 Extraction part 24 2nd calculation part 50 In-vehicle apparatus 100 Path proposal system C Vehicle R1 1st path R2 2nd path Pr Reference point Pc Candidate point

Claims (7)

An acquisition unit for acquiring request information indicating a desired arrival time of a destination desired by a user boarding the vehicle and a desired action desired by the desired arrival time;
A first calculator that calculates a first route from the current location of the vehicle to the destination;
Based on the request information acquired by the acquisition unit, an extraction unit that extracts candidate points existing in a predetermined range from a specific reference point on the first route calculated by the first calculation unit;
A route proposal device comprising: a second calculation unit that calculates a second route to the reference point via the candidate point extracted by the extraction unit. The second calculator is
2. The second route that sequentially passes through the candidate points far from the reference point among the plurality of candidate points when a plurality of the candidate points are extracted by the extraction unit. The route proposal device described in 1. The second calculator is
The second route that passes through the reference point that is closer to the destination than the candidate point is calculated when a route from the candidate point to the reference point moves away from the destination. Or the route proposal apparatus of 2. The acquisition unit
Obtaining the priority order of the desired action,
The second calculator is
The route proposal device according to claim 1, 2 or 3, wherein the candidate point through which the second route is routed is selected based on the priority. The second calculator is
The route proposal device according to any one of claims 1 to 4, wherein the candidate point to be routed in the second route is selected based on a standard stay time of the candidate point. The second calculator is
The route proposal device according to claim 5, wherein the second route is corrected based on an actual staying time at the candidate point. An acquisition step of acquiring request information indicating a desired arrival time of a destination desired by a user boarding the vehicle and an action desired by the desired arrival time;
A first calculation step of calculating a first route from the current location of the vehicle to the destination;
Based on the request information acquired by the acquisition step, an extraction step of extracting candidate points existing in a predetermined range from a specific reference point on the first route calculated by the first calculation step;
And a second calculation step of calculating a second route to the reference point via the candidate point extracted by the extraction step.

Images