JP2014178160A - Travel support device and travel support method - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a technology capable of having a plurality of grouped vehicles merge while heading toward a destination.SOLUTION: A server 3 includes: a storage unit 32 for storing map data 32a; a communication unit 31 for receiving positions of a plurality of vehicles 2 and one common destination to the plurality of vehicles 2; and a control unit 33. The control unit 33 calculates a merging point where respective vehicles 2 are capable of merging while proceeding toward the destination based on the positions of the map data 32a, plurality of vehicles 2 and the destination and has a route for the respective vehicles 2 to proceed to the destination via the merging point displayed to respective car navigation devices 1.

Description

  The present invention relates to a travel support device that supports travel of a plurality of vehicles using notifications from a plurality of notification devices respectively mounted on the plurality of vehicles, and a method thereof.

  2. Description of the Related Art A travel support device such as a server that supports travel of a vehicle using a notification from a notification device mounted on the vehicle is known. For example, Patent Document 1 discloses a server that supports traveling of a plurality of vehicles by grouping a plurality of car navigation devices and then controlling display of the plurality of car navigation devices in units of groups.

  Patent Document 1 also describes that when a plurality of vehicles located at different points merge at one point, a merge point that can be merged with a short waiting time is described.

JP 2004-125483 A

  As a scene that can actually occur, there are cases where a plurality of vehicles located at different points meet at a junction and then go to a common destination. However, in the apparatus described in Patent Document 1, the merge point is calculated in consideration of the positions of a plurality of vehicles, but the merge point is not calculated in consideration of the position of the destination.

  For this reason, for example, when the junction point between the first vehicle close to the destination and the second vehicle far from the destination is calculated, the point between the first vehicle and the second vehicle is calculated as the junction point. There was a thing. In this case, in order to join the second vehicle, the user of the first vehicle has to go from the current position to the joining point in the direction opposite to the destination, which is burdensome.

  Therefore, the present invention has been made in view of the above-described problems, and an object of the present invention is to provide a technique that allows a plurality of grouped vehicles to join together while facing a destination.

  A driving support device according to the present invention is a driving support device that supports driving of a plurality of vehicles using notifications of a plurality of notification devices respectively mounted on a plurality of grouped vehicles, and acquires map data. A data acquisition unit, a position acquisition unit that acquires the positions of a plurality of vehicles, and a destination acquisition unit that acquires one destination common to the plurality of vehicles. Then, the driving support device calculates a merging point where each vehicle can merge while facing the destination based on the map data, the positions of the plurality of vehicles, and the destination, and each vehicle passes through the merging point to the destination. The control part which makes each notification apparatus notify the path | route for heading to is provided.

  According to the present invention, a plurality of grouped vehicles can merge while heading to a destination.

It is a figure which shows the car navigation apparatus and server which concern on Embodiment 1. FIG. 1 is a block diagram showing a configuration of a car navigation device according to Embodiment 1. FIG. 6 is a diagram showing group information according to Embodiment 1. FIG. 2 is a block diagram illustrating a configuration of a server according to Embodiment 1. FIG. 4 is a flowchart showing the operation of the server according to the first embodiment. FIG. 6 is a diagram illustrating an operation of a server according to the first embodiment. FIG. 6 is a diagram illustrating an operation of a server according to the first embodiment. FIG. 6 is a diagram illustrating an operation of a server according to the first embodiment. FIG. 6 is a diagram illustrating an operation of a server according to the first embodiment. FIG. 6 is a diagram illustrating an operation of a server according to the first embodiment. 6 is a flowchart illustrating an operation of a server according to the second embodiment. FIG. 10 is a diagram illustrating an operation of a server according to the second embodiment. FIG. 10 is a diagram illustrating an operation of a server according to the second embodiment. 10 is a flowchart illustrating an operation of a server according to the third embodiment. FIG. 10 is a diagram illustrating an operation of a server according to the third embodiment. FIG. 10 is a diagram illustrating an operation of a server according to the third embodiment. FIG. 10 is a diagram illustrating an operation of a server according to the third embodiment. FIG. 10 is a diagram illustrating an operation of a server according to the fourth embodiment. FIG. 10 is a diagram illustrating an operation of a server according to the fourth embodiment. FIG. 10 is a diagram illustrating an operation of a server according to the fourth embodiment. FIG. 20 is a diagram illustrating an operation of a server according to the sixth embodiment. FIG. 20 is a diagram illustrating an operation of a server according to the sixth embodiment. FIG. 20 is a diagram illustrating an operation of a server according to the seventh embodiment. FIG. 20 is a diagram illustrating an operation of a server according to the seventh embodiment. FIG. 20 is a diagram illustrating an operation of a server according to the seventh embodiment.

<Embodiment 1>
FIG. 1 is a diagram showing a car navigation device 1 (1A, 1B) mounted on a vehicle 2 (2A, 2B) and a server 3 capable of communicating with the car navigation device 1. In the first and subsequent embodiments of the present invention, a case where the travel support apparatus according to the present invention is applied to the server 3 will be described as an example.

  Although details will be described later, the server 3 groups a plurality of car navigation devices 1 (hereinafter, may be described as “grouping a plurality of vehicles 2”). The server 3 can support the traveling of the plurality of vehicles 2A and 2B by using the display (notification) of the plurality of grouped car navigation devices 1 (the plurality of grouped vehicles 2). It has become.

<Car navigation device 1>
FIG. 2 is a block diagram showing a configuration of the car navigation apparatus 1. The car navigation apparatus 1 shown in FIG. 2 controls the display unit 11, the input unit 12, the communication unit 13, the storage unit 14, the GPS (Global Positioning System) signal receiving unit 15, and these. And a control unit 16. Hereinafter, among the vehicles 2 on which the car navigation device 1 is mounted, a focused vehicle is referred to as “own vehicle”, and vehicles other than the own vehicle belonging to the same group as the own vehicle are also referred to as “other vehicles”. is there.

  The display unit 11 includes, for example, a display device and displays (notifies) various information to the user.

  The input unit 12 includes, for example, a push button device or a touch panel integrated with the display unit 11 and receives various information such as a destination from a user operation. Here, the input unit 12 will be described as a touch panel integrated with the display unit 11.

  The communication unit 13 is configured to be able to communicate various information with the server 3 and the communication unit 13 of another vehicle, for example, by wireless communication. Here, the communication unit 13 transmits group information to the server 3 and receives group information from the server 3.

  Here, the group information includes information on the host vehicle detected by the host vehicle and information on other vehicles received by the communication unit 13 from the server 3. FIG. 3 is a diagram illustrating group information of a group having a group number 1 as an example of group information. As shown in FIG. 3, the group information includes, for example, the name, position, route, waypoint and state (remaining gasoline amount) of each of the plurality of vehicles 2 (own vehicle and other vehicles) belonging to the same group, One destination common to the plurality of vehicles 2 is included.

  Returning to FIG. 2, the storage unit 14 includes a storage device such as a hard disk drive (HDD) and a semiconductor memory. The storage unit 14 stores map data 14a and group information 14b.

  The map data 14a includes information on a map for display, information for route calculation (for example, information on links that classify roads, and information on costs such as charge, distance, fuel consumption, and time for each link). including.

  The group information 14b is the group information (FIG. 3) described above.

  The GPS signal receiving unit 15 receives a GPS signal from a GPS satellite, and generates GPS information based on the GPS signal.

  The control unit 16 is configured by, for example, a CPU (Central Processing Unit), and when the CPU executes a program stored in the storage unit 14 or the like, the map data analysis unit 16a, the vehicle signal analysis unit 16b, Functions of the own vehicle position data management unit 16c, the spot data acquisition unit 16d, the route calculation unit 16e, and the group information management unit 16f are realized. However, these functions may not be realized by one CPU. For example, one function may be realized by one CPU.

  The map data analysis unit 16a analyzes the map data 14a to display a map of a necessary range (for example, a range around the host vehicle or a range around the point specified by the input unit 12). 11 is displayed. Moreover, the map data analysis part 16a acquires the cost required for route calculation from the map data 14a by analyzing the map data 14a.

  The vehicle signal analysis unit 16b receives a vehicle signal (for example, a pulse signal corresponding to the number of revolutions per unit time of the axle of the own vehicle, a rotation angle such as a yaw angle of the own vehicle, and a remaining amount of gasoline) from the own vehicle. The vehicle signal is analyzed. For example, the vehicle signal analysis unit 16b calculates the speed of the host vehicle by analyzing the pulse signal.

  The own vehicle position data management unit 16 c detects the current position of the own vehicle (for example, coordinates such as latitude and longitude) based on the GPS information generated by the GPS signal receiving unit 15. In addition, the host vehicle position data management unit 16c displays the detected current position of the host vehicle on the display unit 11 so as to overlap the map. In addition, the own vehicle position data management unit 16c may correct the detected current position of the own vehicle using the speed of the own vehicle calculated by the vehicle signal analysis unit 16b.

  The point data acquisition unit 16d is based on the touch position input from the user to the input unit 12 and the map displayed on the display unit 11 on the map or the location of the facility corresponding to the touch position (for example, latitude)・ Acquire coordinates such as longitude as a destination (or waypoint). For example, a characteristic place without a building such as a mountain top or a park is applied as the point, and a characteristic place with a building such as a convenience store is applied as the facility.

  The route calculation unit 16e determines the current position of the host vehicle based on the current position of the host vehicle detected by the host vehicle position data management unit 16c and the destination acquired by the point data acquisition unit 16d or the destination of the group information 14b. The route from to the destination is calculated.

  Here, first, the route calculation unit 16e calculates a plurality of routes from the current position of the host vehicle to the destination as route candidates. The map data analysis unit 16a described above determines the link cost included in each candidate for the priority item (for example, any one of charge, distance, fuel consumption, time, etc.) input from the user to the input unit 12 as map data. From 14a. After that, the route calculation unit 16e compares the costs acquired by the map data analysis unit 16a (the total cost when a plurality of costs are acquired for one route candidate), and compares the cost of the route with the low cost. Candidates are calculated (determined) as routes. As a result, an appropriate route for the priority item input to the input unit 12 is calculated.

  The group information management unit 16f appropriately stores the name and group number input to the input unit 12 by the user in the storage unit 14 as group information 14b. Further, the group information management unit 16f appropriately stores the current position of the host vehicle detected by the host vehicle location data management unit 16c and the route received from the server 3 by the communication unit 13 in the storage unit 14 as group information 14b. To do. Further, the group information management unit 16f appropriately stores the destination acquired by the spot data acquisition unit 16d in the storage unit 14 as group information 14b.

  The group information management unit 16 f manages the group information 14 b stored in the storage unit 14. Here, the group information management unit 16 f uses the communication unit 13 to appropriately transmit the group information 14 b in the storage unit 14 to the server 3.

<Server 3>
FIG. 4 is a block diagram showing the configuration of the server 3. The server 3 shown in FIG. 4 includes a communication unit 31, a storage unit 32, and a control unit 33 that controls these in an integrated manner.

  The communication unit 31 is configured to be able to communicate various information with the plurality of car navigation devices 1 by, for example, wireless communication. Here, the communication unit 31 transmits group information (FIG. 3) to the plurality of car navigation devices 1 and receives group information (FIG. 3) from the plurality of car navigation devices 1.

  Here, since the group information includes the current positions of the plurality of grouped vehicles 2, the communication unit 31 (position acquisition unit) receives group information from the plurality of car navigation devices 1. Thus, the current positions of the plurality of vehicles 2 are received (acquired). Further, since the group information includes one destination common to the plurality of grouped vehicles 2, the communication unit 31 (destination acquisition unit) receives the group information from the plurality of car navigation devices 1. Is received (acquired) as one destination common to the plurality of vehicles 2.

  The storage unit 32 includes a storage device such as a hard disk drive (HDD) and a semiconductor memory. The storage unit 32 (data acquisition unit) acquires the same map data as the map data 14a from the outside of the server 3 at the time of product shipment, and stores the map data 32a after the acquisition. The storage unit 32 stores group information received by the communication unit 31 and grouped in the same group number unit as group information 32b.

  The control unit 33 is constituted by, for example, a CPU, and when the CPU executes a program stored in the storage unit 32 or the like, the map data analysis unit 33a, the group information management unit 33b, and the confluence calculation unit 33c. The function is realized. However, these functions may not be realized by one CPU. For example, one function may be realized by one CPU.

  The map data analysis unit 33a analyzes the map data 32a in the same manner as the map data analysis unit 16a of FIG. 2 analyzes the map data 14a, thereby acquiring the cost necessary for route calculation from the map data 32a.

  The group information management unit 33b appropriately stores the group information received by the communication unit 31 in the storage unit 32 as group information 32b. The group information management unit 33b manages the group information 32b stored in the storage unit 32. Here, the group information management unit 33b uses the communication unit 31 to appropriately transmit the group information 32b in the storage unit 32 to the car navigation device 1 belonging to the same group number.

  The junction point calculation unit 33c will be described in detail later using a flowchart, but the map data 32a, the positions of the plurality of vehicles 2 received by the communication unit 31, the one destination received by the communication unit 31, and Based on the above, a junction point where the plurality of grouped vehicles 2 can merge while heading to a common destination is calculated. Here, the merging point calculation unit 33c has a route calculation function equivalent to that of the route calculation unit 16e in FIG. 2, and calculates a merging point by using the function.

  Next, the operation of the server 3 according to the first embodiment will be described. Here, after the operation in which the server 3 groups the plurality of vehicles 2 is described, the operation in which the server 3 (the confluence calculation unit 33c) calculates the confluence is described.

<Grouping>
First, an outline of grouping will be described. The user of each vehicle 2 inputs one group number determined in advance between the users to the input unit 12 of each car navigation device 1. Each car navigation device 1 transmits the input one group number to the server 3, and the server 3 groups a plurality of car navigation devices 1 (a plurality of vehicles 2) having the same group number as one group. To do.

  Next, a specific example of grouping will be described. First, the group number, name, and destination that the leader user has determined in advance among the users are stored in the car navigation device 1 that is the master (hereinafter sometimes referred to as “master device 1”). input. The master device 1 transmits the input one group number, name, and destination to the server 3. The server 3 registers the transmitted one group number, name, and destination. As a result of such registration being performed by each group, a plurality of group numbers, names and destinations are registered in the server 3.

  On the other hand, the other user communicates with the car navigation device 1 serving as a slave (hereinafter sometimes referred to as “slave device 1”) and the server 3 to thereby make a plurality of group numbers and names registered in the server 3. The destination is displayed on the display unit 11 of the slave device 1. The other user confirms one group number, name and destination determined in advance among the plurality of displayed group numbers, names and destinations, and the one group. The number is input to the input unit 12 of the slave device 1. The slave device 1 transmits the input one group number to the server 3, and the server 3 uses a plurality of the same group numbers based on the transmitted one group number and the registered group numbers. The car navigation devices 1 are grouped into one group.

  When the server 3 receives the group information from the grouped one car navigation device 1, the server 3 updates the group information 32b in the storage unit 32 with the received group information. Then, the server 3 transmits the updated group information 32 b to the car navigation device 1 in the same group as the one car navigation device 1. Each car navigation device 1 updates the group information 14b in the storage unit 14 with the group information transmitted from the server 3, and the updated group information 14b (information on the car navigation device 1 in the same group as itself). It is displayed on the display unit 11.

  An example of the operation of the grouped car navigation apparatus 1 will be described with reference to FIG. Here, it is assumed that the car navigation apparatuses 1A and 1B are grouped by the server 3.

  The display unit 11 of the car navigation device 1A displays the position and name (“AA” in the example shown in FIG. 1) of the own vehicle (vehicle 2A) on the map in the lower center of the display screen on the map using graphics and characters. The position and name of the other vehicle (vehicle 2B) (“BB” in the example shown in FIG. 1) are also displayed on the map with graphics and characters. For example, these figures and characters are displayed in different colors so that the own vehicle and the other vehicle can be easily distinguished. Similarly, the display unit 11 of the car navigation device 1B displays the position and name of the own vehicle (vehicle 2B) on the map in the lower center of the display screen on the map and the position of the other vehicle (vehicle 2A). And the name is also displayed on the map with graphics and characters.

  Thereby, the user of the several car navigation apparatus 1 grouped can confirm the condition of the vehicle 2 of the same group suitably. In addition, although the structure which the display part 11 displays the name and present position of the vehicle 2 of the same group was demonstrated here, it is not restricted to this, The structure which also displays a route and a waypoint may be sufficient. . In this configuration as well, for example, these figures and characters may be displayed in different colors so that the own vehicle and other vehicles can be easily distinguished.

<Calculation of confluence>
FIG. 5 is a flowchart showing an operation of calculating a confluence by the server 3 according to the first embodiment. As a premise, it is assumed that the communication unit 31 has already received the current positions and destinations of the plurality of grouped vehicles 2 by the grouping described above. In the description here, “a plurality of vehicles 2 belonging to the same group” is abbreviated as “a plurality of vehicles 2”.

  FIG. 6 is a diagram illustrating an example of the operation of steps S1 to S5 (FIG. 5) of the junction point calculation unit 33c. First, in step S1, the merge point calculation unit 33c is configured to allow the plurality of vehicles 2 to go from the current position to the destination based on the map data 32a, the current positions of the plurality of vehicles 2, and the destination. A plurality of first paths are calculated.

  In the example shown in FIG. 6, the plurality of first routes 4A, 4B, and 4C calculated for the plurality of vehicles 2A, 2B, and 2C are indicated by bold lines, and the other routes are indicated by thin lines. The destination is indicated with a G-mark flag. Note that it is assumed that which one of the priority items such as fee, distance, fuel consumption, and time is used to calculate the first route is set in advance when grouping is performed.

  In step S2, the merging point calculation unit 33c calculates a first cost for each of the plurality of first routes calculated in step S1. In the example shown in FIG. 6, the charge, distance, fuel consumption, and time cost are calculated for each of the plurality of first routes 4A, 4B, 4C. As the first cost, any one of a charge, a distance, a fuel consumption, and a time cost may be applied, or a total cost thereof (for example, a weight, a distance, a fuel consumption, and a time cost may be weighted). The sum of the values obtained) may be applied. Hereinafter, a case where the total cost is applied as the first cost will be described.

  In step S3, the merging point calculation unit 33c specifies the first route having the lowest first cost calculated in step S2. And the confluence | merging point calculation part 33c determines whether only one 1st path | route was able to be specified. If there are a plurality of first costs having the lowest value and one of the first routes cannot be specified, the process proceeds to step S4, where there is only one first cost having the lowest value, and one first route is selected. If it can be specified, the process proceeds to step S5. In the example shown in FIG. 6, the first cost of the first route 4A is lower than the first cost of the first routes 4B and 4C, and only the first route 4A can be specified in step S3. The process proceeds to step S5.

  In step S4, the server 3 causes the display unit 11 of the master device 1 to display the first route for each of the plurality of first costs having the lowest value. The user specifies one first path from among the displayed plurality of first paths and inputs the first path to the input unit 12 of the master apparatus 1, and the master apparatus 1 uses the input first path as a server. 3 to send. The communication unit 31 of the server 3 receives (acquires) one first route specified by the user. Thereby, one first route is specified in the server 3. In addition, although the structure which makes the user of the master apparatus 1 specify one 1st path | route was demonstrated here, it is not restricted to this, A plurality of lowest cost is given to all the users of the master apparatus 1 and the slave apparatus 1. The first route may be input from among the first routes, and the first route may be specified by majority vote. Thereafter, the process proceeds to step S5.

  Hereinafter, the first route specified in step S3 or step S4 is referred to as a “reference route”.

  FIG. 7 is a diagram illustrating an example of the operation of step S5 of the confluence calculation unit 33c. Here, it is assumed that the junction calculation unit 33c specifies the first route 4A between the vehicle 2A and the destination as the reference route among the plurality of first routes 4A, 4B, and 4C. In FIG. 7, the reference path 4A is indicated by a bold line.

  In step S5, the merging point calculation unit 33c extracts a merging point (for example, an intersection) or a facility (for example, a facility with a parking lot) on the reference route as a merging point candidate point. In the example illustrated in FIG. 7, the junction point calculation unit 33c extracts three candidate points 5A, 5B, and 5C from the reference route 4A.

  Steps S6 and S7 to be described next are performed for all of the plurality of candidate points extracted in step S5.

  FIG. 8 is a diagram illustrating an example of the operation of steps S6 and S7 of the merge point calculation unit 33c for the candidate point 5A illustrated in FIG. In step S6, the junction point calculation unit 33c is based on the map data 32a, the current positions of the plurality of vehicles 2, the destination, and any one candidate point extracted in step S5. Thus, a plurality of second routes for the plurality of vehicles 2 to go from the current position to the destination via the one candidate point are calculated. In FIG. 8, as an example of a plurality of second routes calculated by the junction calculation unit 33c in step S6, a plurality of vehicles 2A, 2B, 2C pass from the current position to the destination via the candidate point 5A. A plurality of second paths 6A, 6B, and 6C for going to each are calculated, and these are indicated by bold lines.

  In step S7, the merging point calculation unit 33c calculates a second cost for each of the plurality of second paths calculated in step S6. And the confluence | merging point calculation part 33c calculates the total value of the 2nd cost regarding the said some 2nd path | route, and hold | maintains the said total value. In the example shown in FIG. 8, the charge, distance, fuel consumption, and time cost are calculated for each of the plurality of second routes 6A, 6B, and 6C. As the second cost, any one of a cost, a distance, a fuel consumption, and a time cost may be applied, or the total cost described above may be applied. Hereinafter, a case where the total cost is applied as the second cost will be described. In this case, the total value of the second cost reflects all the cost values shown in FIG.

  Through the above steps S6 and S7, the total value of the second costs is obtained for one candidate point (for example, candidate point 5A). Such operations in steps S6 and S7 are performed on the remaining candidate points (for example, candidate points 5B and 5C).

  FIG. 9 is a diagram illustrating an example of the operations of steps S6 and S7 of the merge point calculation unit 33c for the candidate point 5B. By performing step S6, a plurality of second routes 6A, 6B, and 6C for the plurality of vehicles 2A, 2B, and 2C to go from the current position to the destination via the candidate points 5B are calculated. . And the total value of the 2nd cost about the said 2nd path | route 6A, 6B, 6C is calculated by performing step S7.

  FIG. 10 is a diagram illustrating an example of the operation of steps S6 and S7 of the merge point calculation unit 33c with respect to the candidate point 5C. By performing step S6, a plurality of second routes 6A, 6B, and 6C for the plurality of vehicles 2A, 2B, and 2C to go from the current position to the destination via the candidate points 5C are calculated. . And the total value of the 2nd cost about the said 2nd path | route 6A, 6B, 6C is calculated by performing step S7.

  As described above, when steps S6 and S7 are performed on all of the plurality of merge points extracted in step S5, the process proceeds to step S8.

  In step S8, the merge point calculation unit 33c identifies the candidate point having the lowest total value of the second costs calculated for each candidate point as the merge point. Then, the merge point calculation unit 33c determines whether only one merge point has been specified (calculated). When there are a plurality of total values that take the lowest value and one junction point cannot be specified, the process proceeds to step S9, where there is only one total value that takes the lowest value and one junction point can be specified. The process proceeds to step S10.

  Here, the time (45 minutes) of the second path 6C of the candidate point 5B shown in FIG. 9 is longer than the time (40 minutes) of the second path 6C of the candidate point 5A shown in FIG. Other costs are the same. Further, the time (35 minutes) of the second path 6B of the candidate point 5C shown in FIG. 10 is longer than the time (30 minutes) of the second path 6B of the candidate point 5A shown in FIG. Other costs are the same. Therefore, in the example shown in FIGS. 8 to 10, the total value of the second costs of the candidate points 5A (FIG. 8) is larger than the total value of the second costs of the candidate points 5B and 5C (FIGS. 9 and 10). Since it is low and only the candidate point 5A can be specified as the candidate point 5 in step S8, the process proceeds to step S10.

  Returning to FIG. 5, in step S <b> 9, similarly to step S <b> 4, the server 3 causes the user of the master device 1 to specify one confluence from among the plurality of calculated confluences. That is, in the first embodiment, the communication unit 31 (specific acquisition unit) of the server 3 receives (acquires) one junction point specified by the user when a plurality of junction points are calculated. It has become. Note that the method of specifying one confluence is not limited to this, and as described above, one confluence is specified (obtained) by majority vote of all users of the master device 1 and the slave device 1. It may be. Thereafter, the process proceeds to step S10.

  In step S10, the merging point calculation unit 33c stores (updates) the second route for each vehicle 2 toward the destination via the specified one merging point in the storage unit 32 as group information 32b. ) In the example illustrated in FIGS. 8 to 10, the junction point calculation unit 33 c stores the second paths 6 </ b> A, 6 </ b> B, and 6 </ b> C (FIG. 8) that pass through the candidate point 5 </ b> A identified as the junction point 5 in the storage unit 32. (Update. As a result, when the group information 32b is transmitted to each car navigation device 1 belonging to the group by the operation of the control unit 33 of the server 3, the second route is displayed on each car navigation device 1 (display unit 11) ( Notification).

  According to the server 3 according to the first embodiment as described above, the control unit 33 (confluence calculating unit 33c) determines that each vehicle 2 is based on the map data 32a, the positions and destinations of the plurality of vehicles 2. A confluence point that can be merged while calculating the destination is calculated, and each car navigation apparatus 1 is notified of a route for each vehicle 2 to go to the destination via the junction point. Therefore, the plurality of grouped vehicles 2 can merge while heading to the destination. As a result, for example, a user of a vehicle near the destination does not have to travel in the opposite direction to the destination in order to join another vehicle. Can be reduced.

  Moreover, according to the said control part 33, it becomes possible to calculate a confluence on the reference | standard path | route (one 1st path | route) with the lowest 1st cost. Therefore, since the merge point can be assigned to the relatively short first path, the number of candidate points can be reduced. Therefore, the calculation load of the confluence can be reduced.

  In addition, according to the control unit 33, the candidate point having the lowest total value of the second costs is identified as a meeting point among the candidate points on the reference route. Therefore, an appropriate candidate point can be calculated as a merging point from the viewpoint of the second cost.

  Moreover, according to the said control part 33 (merging point calculation part 33c), when a several merging point is calculated, the user can designate a desired merging point from several merging points.

  In the above configuration, the server 3 or the car navigation device 1 is configured to accept an input of the time of arrival at the junction and calculate a recommended departure time for each vehicle 2 to depart based on the time. May be.

<Embodiment 2>
FIG. 11 is a flowchart showing the operation of calculating the confluence by the server 3 according to Embodiment 2 of the present invention. In the car navigation device 1 and the server 3 according to the second embodiment, the same or similar components as those described in the first embodiment are denoted by the same reference numerals, and different points are mainly described below. Explained.

  In the flowchart shown in FIG. 11, a new step S101 is added before step S1 in the flowchart shown in FIG. 5, and step S5 is replaced with new steps S102 to S105. Therefore, below, step S101-S105 are mainly demonstrated.

  In step S101, the user specifies the type of a point or facility (for example, a parking lot, a convenience store, a supermarket, a service area, etc.) that the user wants to apply to the confluence, and inputs the type to the input unit 12 of the master device 1, and the master The device 1 transmits the input type to the server 3. The communication unit 31 (type acquisition unit) of the server 3 receives (acquires) the type specified by the user. Note that the method for specifying the type is not limited to this, and as described above, the type may be specified (acquired) by majority of all users of the master device 1 and the slave device 1. . After that, steps S1 to S4 are performed as in the first embodiment, and then the process proceeds to step S102.

  FIG. 12 is a diagram illustrating an example of operations of steps S102 and S103 of the junction point calculation unit 33c. In step S102, the merge point calculation unit 33c can calculate a point or facility corresponding to the type acquired in step S101 on the reference route (hereinafter referred to as “type-corresponding point etc.”) as a merge point. Determine whether. If there is a type-corresponding point or the like on the reference route, it is determined that a junction point can be calculated, and the process proceeds to step S105. On the other hand, if there is no type-corresponding point or the like on the reference route, it is determined that the merging point cannot be calculated, and the process proceeds to step S103. In the example shown in FIG. 12, the confluence calculation unit 33c specifies the first route 4A indicated by a bold line as a reference route, and the type acquired in step S101 (hereinafter, the type is indicated on the reference route 4A). Since there is no point or facility corresponding to the convenience store), the process proceeds to step S103.

  In step S103, the merge point calculation unit 33c responds to the type on the periphery of the reference route (for example, one or several adjacent routes from the reference route, or within a range of about 50 m from the reference route in the width direction). It is determined whether or not a point or the like can be calculated as a meeting point. If there is a type-corresponding point or the like on the periphery of the reference route, it is determined that a junction point can be calculated, and the process proceeds to step S105. On the other hand, if there is no type-corresponding point or the like on the periphery of the reference route, it is determined that the junction point cannot be calculated, and the process proceeds to step S104. In the example shown in FIG. 12, since convenience stores 5X and 5Y corresponding to the type exist around the reference route 4A, the process proceeds to step S105.

  In step S104, the server 3 causes the car navigation device 1 to display that the type corresponding point or the like cannot be calculated as a meeting point. Then, it returns to step S101.

  In step S105, the merging point calculation unit 33c extracts the type corresponding points on the reference route or the periphery of the reference route as candidate points for the merging point. Thereafter, the operations after step S6 are performed as in the first embodiment.

  FIG. 13 is a diagram illustrating an example of the operation after step S6 of the junction calculation unit 33c. In the example illustrated in FIG. 13, as a result of steps S6 to S8 being performed on the convenience stores 5X and 5Y extracted as candidate points in step S103, the convenience store having a total value of the second cost lower than that of the convenience store 5Y. 5X is calculated as the merge point 5.

  According to the control unit 33 (merge point calculation unit 33c) provided in the server 3 according to the second embodiment as described above, the type corresponding point or the like (the point or facility corresponding to the type) on the reference route, It can be calculated as a confluence. Therefore, the type-corresponding point desired by the user can be calculated as a confluence.

  Further, according to the control unit 33, when the type corresponding point or the like cannot be calculated as a meeting point, the type corresponding point or the like on the periphery of the reference route can be calculated as the meeting point. Therefore, it is possible to reliably calculate the kind of confluence that the user desires.

<Modification of Embodiment 2>
In the second embodiment described above, the control unit 33 (the confluence calculation unit 33c) can calculate the type correspondence points and the like on the periphery of the reference route as the confluence when the type correspondence points and the like cannot be calculated as the confluence. Met.

  However, the present invention is not limited to this, and when the control unit 33 (confluence point calculation unit 33c) cannot calculate a type-corresponding point or the like as a confluence, another first route (the first cost that is the second lowest in cost after the reference route) A point corresponding to the type on the following (hereinafter referred to as “next reference route”) may be calculated as a confluence. According to the control unit 33 (confluence point calculation unit 33c) provided in the server 3 according to this modification example, it is possible to reliably calculate the type of confluence desired by the user as in the second embodiment. it can.

  Or you may combine Embodiment 2 mentioned above and this modification. For example, first, the merging point calculation unit 33c calculates the type corresponding point on the periphery of the reference route as the merging point when the type corresponding point on the reference route cannot be calculated as the merging point. If the calculation still fails to calculate the type-corresponding point or the like as a merge point, the merge point calculation unit 33c may calculate the type-corresponding point or the like on the next reference route as the merge point.

  Further, in this example, the merging point calculation unit 33c switches the order of the calculation using the type corresponding point on the periphery of the reference route as the merging point and the calculation using the type corresponding point on the next reference route as the merging point. May be performed.

<Embodiment 3>
FIG. 14 is a flowchart showing an operation of calculating a confluence by the server 3 according to Embodiment 3 of the present invention. In the car navigation device 1 and the server 3 according to the third embodiment, the same or similar components as those described in the second embodiment are denoted by the same reference numerals, and different points are mainly described below. Explained.

  The flowchart shown in FIG. 14 is obtained by adding new steps S201 and S202 between steps S8 and S9 and step S10 of the flowchart shown in FIG. Therefore, below, step S201-S202 are mainly demonstrated.

  FIG. 15 is a diagram illustrating an example of the operation of steps S101 to S105 of the merge point calculation unit 33c. In the example shown in FIG. 15, a plurality of first routes 4A, 4B, and 4C calculated for a plurality of vehicles 2A, 2B, and 2C in step S1 are indicated by bold lines, and the other routes are indicated by thin lines. Has been. In addition, ordinary roads are indicated by broken lines, and highways are indicated by solid lines.

  Here, it is assumed that the junction calculation unit 33c specifies the first route 4A between the vehicle 2A and the destination as the reference route among the plurality of first routes 4A, 4B, and 4C. Since there is a convenience store 5X corresponding to the type on the reference route 4A, in step S105, the merge point calculation unit 33c extracts the convenience store 5X on the reference route 4A as a candidate point of the merge point. . Then, it progresses to step S6.

  FIG. 16 is a diagram illustrating an example of the operation of steps S6 to S9 of the junction calculation unit 33c. In FIG. 16, as an example of a plurality of second routes calculated by the junction calculation unit 33c in step S6, vehicles 2A, 2B, and 2C move from the current position via the convenience store 5X on the reference route 4A. A plurality of second paths 6A, 6B, 6C for respectively going to the destination are calculated, and these are indicated by bold lines. In the example shown in FIG. 16, since there is no convenience store other than the convenience store 5X on the reference route 4A, the confluence calculation unit 33c performs the operations related to the plurality of second routes 6A, 6B, 6C in step S7. After calculating the total value of the two costs, the convenience store 5X is calculated as the junction 5 in step S8.

  However, in order for the vehicles 2B and 2C to go to the destination via the convenience store 5X, even if the highway usage fee does not increase and the vehicle can travel to the destination near the destination, it gets off the highway. In addition, it is unpreferable from the viewpoints of charge cost, distance cost, etc.

  Therefore, in the present third embodiment, in step S201 after step S8 or step S9, the merge point calculation unit 33c determines in advance the total value of the second costs related to the merge point specified in step S8 or step S9. It is determined whether or not the specified standard is exceeded. For example, the junction calculation unit 33c calculates the same type of cost as the second cost for the plurality of first routes calculated in step S1, and calculates the total value (hereinafter referred to as “reference total value”). calculate. The junction calculation unit 33c determines that the second cost exceeds the reference when the total value of the second costs is equal to or greater than a reference total value obtained by summing the reference total value and the deviation allowable value. When the total value of the two costs is smaller than the reference total value, it is determined that the above criterion is not exceeded. If it is determined in step S201 that the above standard is exceeded, the process proceeds to step S202. If it is determined that the standard is not exceeded, the process proceeds to step S10.

  In step S202, the merging point calculation unit 33c uses the next reference route (another first route having the first lowest cost next to the reference route) instead of the reference route, and performs steps S102 to S105 and steps S6 to S6. The same operation as S10 is performed.

  FIG. 17 is a diagram illustrating an example of the operation in step S202 of the merge point calculation unit 33c. However, here, for the plurality of second paths 6A, 6B, 6C (FIG. 16) passing through the convenience store 5X identified as the merge point 5 in the immediately preceding step S201, the total value of the second costs is the above-described value. Assume that it is determined that the standard is exceeded.

  In this case, in step S202, the merging point calculation unit 33c specifies the next reference route from the plurality of first routes 4A, 4B, and 4C. Here, the junction calculation unit 33c specifies the first route 4B between the vehicle 2B and the destination as the next reference route among the plurality of first routes 4A, 4B, and 4C shown in FIG. And Since the convenience store 5Y corresponding to the type exists on the next reference path 4B, the junction point calculation unit 33c calculates the convenience store 5Y as the junction point 5. Then, the merging point calculation unit 33c causes the total value of the second costs to exceed the above-mentioned standard with respect to the plurality of second paths 6A, 6B, 6C (FIG. 17) that pass through the convenience store 5Y calculated as the merging point 5. It is determined whether or not. When the confluence calculation unit 33c determines that the total value does not exceed the reference, the second route 6A, 6B, 6C (FIG. 17) passing through the convenience store 5Y is stored (updated). )

  According to the control unit 33 (junction point calculation unit 33c) provided in the server 3 according to the third embodiment as described above, the total value of the second costs of the plurality of second routes calculated based on the reference route. However, if it exceeds a predetermined standard, a point corresponding to a type on the next reference route or the like (a point or facility corresponding to the type) can be calculated as a confluence. Therefore, it is possible to reliably calculate the type of confluence desired by the user from the viewpoint of the second cost.

<Embodiment 4>
In the above-described third embodiment, when the total value of the second costs of the plurality of second routes calculated based on the reference route exceeds a predetermined reference, the type corresponding point on the next reference route, etc. It could be calculated as a confluence. On the other hand, in the fourth embodiment of the present invention, even when the total value of the second costs of the plurality of second routes calculated based on the periphery of the reference route exceeds a predetermined criterion, the next criterion A type-corresponding point on the route can be calculated as a confluence.

  18-20 is a figure which shows an example of operation | movement of the confluence | merging point calculation part 33c. In the car navigation device 1 and the server 3 according to the fourth embodiment, the same or similar components as those described in the third embodiment are denoted by the same reference numerals, and different points are mainly described below. Explained. Also, the flowchart showing the operation of the server 3 according to the fourth embodiment is the same as the flowchart according to the third embodiment.

  FIG. 18 is a diagram illustrating an example of the operation of steps S101 to S105 of the junction calculation unit 33c. In the example shown in FIG. 18, the plurality of first routes 4A, 4B, and 4C calculated for the plurality of vehicles 2A, 2B, and 2C in step S1 are indicated by bold lines, and the other routes are indicated by thin lines. Has been.

  Here, it is assumed that the junction calculation unit 33c specifies the first route 4A between the vehicle 2A and the destination as the reference route among the plurality of first routes 4A, 4B, and 4C. Since there is no type-corresponding point or the like on the reference route 4A, in step S105 after step S103, the merging point calculation unit 33c uses the convenience store 5X on the periphery of the reference route 4A as a candidate point for the merging point. Extract. Then, it progresses to step S6.

  FIG. 19 is a diagram illustrating an example of the operation of steps S6 to S9 of the merge point calculation unit 33c. In FIG. 19, as an example of a plurality of second routes calculated by the junction calculation unit 33c in step S6, the vehicles 2A, 2B, 2C are located at the current position via the convenience store 5X on the periphery of the reference route 4A. A plurality of second routes 6A, 6B, 6C for respectively going from to the destination are calculated, and these are indicated by bold lines. In the example shown in FIG. 19, since there is no convenience store other than the convenience store 5X on the periphery of the reference route 4A, the junction calculation unit 33c relates to the plurality of second routes 6A, 6B, 6C in step S7. After calculating the total value of the second costs, the convenience store 5X is calculated as the junction 5 in step S8.

  However, since the vehicles 2B and 2C are far away from the current position to go to the destination via the convenience store 5X, it is not preferable from the viewpoints of charge cost and distance cost.

  Therefore, the fourth embodiment performs the same operation as that of the third embodiment even in this case. That is, in step S201 after step S8 or step S9, the merge point calculation unit 33c determines whether the total value of the second costs related to the merge point specified in step S8 or step S9 is a predetermined standard (embodiment). 3), it is determined whether or not the same. If it is determined in step S201 that the above standard is exceeded, the process proceeds to step S202. If it is determined that the standard is not exceeded, the process proceeds to step S10.

  In step S202, the merging point calculation unit 33c uses the next reference route (another first route having the first lowest cost next to the reference route) instead of the vicinity of the reference route, and performs steps S102 to S105 and step S6. ˜S10 is performed.

  FIG. 20 is a diagram illustrating an example of the operation in step S202 of the merge point calculation unit 33c. However, here, for the plurality of second paths 6A, 6B, 6C (FIG. 19) that pass through the convenience store 5X identified as the merge point 5 in the immediately preceding step S201, the total value of the second costs is the above-described value. Assume that it is determined that the standard is exceeded.

  In this case, in step S202, the merging point calculation unit 33c specifies the next reference route from the plurality of first routes 4A, 4B, and 4C. Here, the junction calculation unit 33c specifies the first route 4B between the vehicle 2B and the destination as the next reference route among the plurality of first routes 4A, 4B, and 4C shown in FIG. And Since the convenience store 5Y corresponding to the type exists on the next reference path 4B, the junction point calculation unit 33c calculates the convenience store 5Y as the junction point 5. Then, the merging point calculation unit 33c, for the plurality of second paths 6A, 6B, and 6C (FIG. 20) passing through the convenience store 5Y calculated as the merging point 5, the total value of the second costs exceeds the above standard. It is determined whether or not. Then, when it is determined that the total value does not exceed the above standard, the confluence calculation unit 33c stores (updates) the second paths 6A, 6B, and 6C (FIG. 20) that pass through the convenience store 5Y in the storage unit 32. )

  According to the control unit 33 (junction point calculation unit 33c) provided in the server 3 according to the fourth embodiment as described above, the total of the second costs of the plurality of second routes calculated based on the periphery of the reference route. When the value exceeds a predetermined standard, it is possible to calculate a type-corresponding point or the like (a point or facility corresponding to the type) on the next reference route as a merge point. Therefore, it is possible to reliably calculate the type of confluence desired by the user from the viewpoint of the second cost.

<Embodiment 5>
In the first to fourth embodiments described above, when a plurality of merging points are calculated, in step S9, the user has to input one merging point from the plurality of merging points, which is somewhat troublesome. It will take.

  Therefore, in step S9, the control unit 33 (confluence point calculation unit 33c) provided in the server 3 according to Embodiment 5 of the present invention is used to calculate a plurality of confluence points instead of performing the above-described operation. The first confluence point closest to the vehicle corresponding to the first route is calculated.

  Specifically, in the example illustrated in FIG. 10, if another merging point 5 is calculated from the first path 4A (reference path 4A) in addition to the merging point 5 (candidate point 5A), a merging point calculation is performed. The unit 33c calculates the closest junction 5 to the vehicle 2A that goes to the destination through the first route 4A (reference route 4A). In addition, in the example illustrated in FIG. 17, if another merging point 5 is calculated from the first path 4B (next reference path 4B) other than the candidate point 5 (convenience store 5Y), a merging point calculation unit 33c. Calculates the nearest junction point 5 to the vehicle 2B heading to the destination through the first route 4B (next reference route 4B).

  According to the control unit 33 (junction point calculation unit 33c) provided in the server 3 according to the fifth embodiment as described above, the user does not have to input in step S9, so that convenience is improved. be able to.

<Embodiment 6>
FIG.21 and FIG.22 is a figure which shows operation | movement of the server 3 which concerns on Embodiment 6 of this invention. In the car navigation device 1 and the server 3 according to the sixth embodiment, the same or similar components as those described in the first embodiment are denoted by the same reference numerals, and different points are mainly described below. Explained.

  The block configurations of the car navigation device 1 and the server 3 according to the sixth embodiment are the same as those in the first embodiment, but the operation for calculating the confluence is different from those in the first to fifth embodiments.

  Specifically, as shown in FIG. 21, the junction point calculation unit 33c performs the same operation as in step S1 described above, so that the plurality of vehicles 2A and 2B travel from the current position to the destination. A plurality of first paths 4A and 4B are calculated. In the example shown in FIG. 21, the plurality of first paths 4A and 4B are indicated by thick lines, and the other paths are indicated by thin lines. In addition, ordinary roads are indicated by broken lines, and highways are indicated by solid lines.

  Then, as shown in FIG. 22, the control unit 33 (confluence point calculation unit 33 c) calculates the confluence point 5 on a route where the plurality of first routes 4 </ b> A and 4 </ b> B overlap each other.

  According to the server 3 according to the sixth embodiment as described above, a joining point where a plurality of grouped vehicles 2 can join together from the current position toward the destination differs from the first to fifth embodiments. It can be calculated by the method. In addition, when the positions of a plurality of vehicles 2 are relatively far from the destination, the number of links becomes enormous, and the time and cost for calculating the cost are relatively large. For example, since the number of times of cost calculation can be reduced, the time and calculation load can be suppressed.

  As in the second embodiment, the communication unit 31 (type acquisition unit) receives (acquires) the type specified by the user, and the control unit 33 (junction point calculation unit 33c) sets the received type to the received type. A corresponding point or facility may be calculated as a meeting point. Thereby, also in this Embodiment 6, the classification corresponding | compatible point etc. which a user desires can be calculated as a merge point similarly to Embodiment 2. FIG.

<Embodiment 7>
23 to 25 are diagrams showing operations of the server 3 according to Embodiment 7 of the present invention. Note that in the car navigation device 1 and the server 3 according to the seventh embodiment, the same or similar components as those described in the first embodiment are denoted by the same reference numerals, and different points are mainly described below. Explained.

  The block configurations of the car navigation device 1 and the server 3 according to the seventh embodiment are the same as those in the first embodiment, but the operation for calculating the confluence is different from those in the first to sixth embodiments.

  Specifically, when the vehicles 2A, 2B, 2C and the destination are in the positional relationship shown in FIG. 23, the confluence calculation unit 33c is connected to each vehicle 2A, 2B, 2C as shown in FIG. Line segments 8A, 8B, and 8C connecting the destination are defined.

  Then, as shown in FIG. 25, the merge point calculation unit 33c defines a circle 9A having a predetermined diameter and having a center on the line segment 8A and in contact with the position of the vehicle 2A. Similarly, the merging point calculation unit 33c defines a circle 9B having a predetermined diameter based on the position of the line segment 8B and the vehicle 2B, and has a predetermined diameter based on the position of the line segment 8C and the vehicle 2C. A circle 9C is defined.

  Note that the predetermined diameters of the circles 9A, 9B, and 9C have lengths that allow the circles 9A, 9B, and 9C to overlap each other, for example, the longest line segment among the line segments 8A, 8B, and 8C (here, About half the length of the line segment 8A) is applied.

  Then, as shown in FIG. 25, the merge point calculation unit 33c calculates the merge point 5 in a range where the circles 9A, 9B, 9C of the plurality of vehicles 2A, 2B, 2C overlap.

  The server 3 according to the seventh embodiment as described above is different from the first to sixth embodiments in that the plurality of grouped vehicles 2 can merge while moving from the current position to the destination. It can be calculated by the method. In addition, when the positions of the plurality of vehicles 2 are relatively far from the destination, the time and calculation load required for route calculation are relatively large as well as the cost calculation. Since the number of times of calculation and route calculation can be reduced, the time and calculation load can be suppressed.

  As in the second embodiment, the communication unit 31 (type acquisition unit) receives (acquires) the type specified by the user, and the control unit 33 (junction point calculation unit 33c) sets the received type to the received type. A corresponding point or facility may be calculated as a meeting point. Thereby, also in this Embodiment 7, the classification corresponding | compatible point etc. which a user desires can be calculated as a merge point similarly to Embodiment 2. FIG.

<Modification of Embodiments 1 to 7>
Further, the driving support device described above is not limited to the server 3, the car navigation device 1, a PND (Portable Navigation Device) that can be mounted on a vehicle, and a mobile terminal (for example, a mobile phone, a smartphone, a tablet, etc.) The present invention can also be applied to a driving support device constructed as a system by appropriately combining the above. In this case, each function or each component of the server 3 described above is distributed and arranged in each device constituting the system.

  For example, in the above description, the configuration in which the driving support device is applied to the server 3 has been described. However, the configuration is not limited to this, and any one of a car navigation device (for example, the master device 1), a PND, and a mobile terminal is used. You may apply to.

  In the above description, the configuration in which the map data 32a is acquired at the time of product shipment and the storage unit 32 that stores the map data 32a is applied to the data acquisition unit has been described. However, the data acquisition unit is not limited to the storage unit 32 as long as it acquires map data. For example, when the driving support device is applied to the master device 1, the map data is acquired from the outside of the master device 1 at the time of product shipment or the like, and the storage unit 14 that can store the map data thereafter acquires the data. It may be applied to the part. In addition, for example, when the driving support device is applied to a smartphone, among the constituent elements of the smartphone, a storage unit that can acquire map data from the outside of the smartphone at the time of product shipment and store the map data thereafter Etc. may be applied to the data acquisition unit.

  Moreover, the structure which applied the communication part 31 which receives the position of a some vehicle to the position acquisition part above was demonstrated. However, the position acquisition unit is not limited to the communication unit 31 as long as it acquires the positions of a plurality of vehicles. For example, when the driving support device is applied to the master device 1, the vehicle position data management unit 16c that detects the position of the vehicle on which the master device 1 is mounted, and the position of the vehicle on which the slave device 1 is mounted. The receiving communication unit 13 or the like may be applied to the position acquisition unit. In addition, for example, when the driving support device is applied to a smartphone, among the components of the smartphone, a detection unit that detects the position of the vehicle on which the smartphone is mounted, and a vehicle on which other smartphones are mounted. A communication unit that receives a position may be applied to the position acquisition unit.

  Further, the configuration in which the communication unit 31 that receives one destination common to a plurality of vehicles is applied to the destination acquisition unit has been described above. However, the destination acquisition unit is not limited to the communication unit 31 as long as it acquires one destination common to a plurality of vehicles. For example, when the driving support device is applied to the master device 1, the input unit 12 that receives one destination common to a plurality of vehicles from the user may be applied to the destination acquisition unit. In addition, for example, when the travel support device is applied to a smartphone, an input unit that receives a destination common to a plurality of vehicles from the user among components of the smartphone is applied to the destination acquisition unit. May be. The type acquisition unit and the selection acquisition unit are the same as the destination acquisition unit.

  Moreover, the structure which applied the display part 11 of the car navigation apparatus 1 to the notification apparatus above was demonstrated. However, the notification device is not limited to the display unit 11 as long as the notification for supporting the traveling of each vehicle is possible. For example, a display unit capable of providing notification for supporting the traveling of each vehicle among the components of the smartphone may be applied to the notification device.

  It should be noted that the present invention can be freely combined with each other within the scope of the invention, and each embodiment can be appropriately modified or omitted.

  1, 1A, 1B Car navigation device, 2, 2A, 2B, 2C Vehicle, 3 Server, 4A, 4B, 4C First route, 5 Junction point, 5A, 5B, 5C Candidate point, 6A, 6B, 6C Second route , 8A, 8B, 8C line segment, 9A, 9B, 9C circle, 11 display unit, 31 communication unit, 32 storage unit, 32a map data, 33 control unit.

Claims (14)

A traveling support device that supports traveling of the plurality of vehicles using notifications of a plurality of notification devices mounted on a plurality of grouped vehicles,
A data acquisition unit for acquiring map data;
A position acquisition unit for acquiring the positions of the plurality of vehicles;
A destination acquisition unit for acquiring a destination common to the plurality of vehicles;
Based on the map data, the positions of the plurality of vehicles, and the destination, a joining point where each of the vehicles can join while going to the destination is calculated, and each of the vehicles passes through the joining point and the destination A travel support device comprising: a control unit that notifies each of the notification devices of a route to go to the ground. The driving support device according to claim 1,
The controller is
A first cost is calculated for a plurality of first routes for each of the plurality of vehicles to go to the destination, and the merging is performed on one first route having the lowest first cost among the plurality of first routes. A driving support device that can calculate points. The driving support device according to claim 2,
It further comprises a type acquisition unit that acquires the type of the spot or facility specified by the user,
The controller is
A driving support device capable of calculating a point or facility corresponding to the type on the first route as the junction. It is a driving assistance device according to claim 3,
The controller is
A travel support apparatus capable of calculating a point or facility corresponding to the type on the periphery of the first route as the junction point when a point or facility corresponding to the category cannot be calculated as the junction point. The driving support device according to claim 3 or 4, wherein
The controller is
When a point or facility corresponding to the type cannot be calculated as the confluence, a point or facility corresponding to the type on another first route having the first cost lower than the first route is A driving support device that can be calculated as the junction. It is a driving assistance device according to claim 3,
The controller is
The plurality of vehicles calculate a second cost with respect to a plurality of second routes for respectively going to the destination via a point or facility corresponding to the type on the one first route, and When the total value of the second costs related to the second route exceeds a predetermined standard, the point corresponding to the type on the other first route having the first cost lower than the first route. Or the driving | running | working assistance apparatus which can calculate a facility as the said junction. The driving support device according to claim 4,
The controller is
Calculating a second cost for a plurality of second routes for each of the plurality of vehicles to go to the destination via a point or facility corresponding to the type on the periphery of the one first route; When the total value of the second costs related to the second route exceeds a predetermined criterion, it corresponds to the type on the other first route having the first cost next to the first route. A driving support device capable of calculating a point or facility as the junction. The driving support device according to claim 2,
The controller is
For each candidate point on the one first route, a second cost is calculated for a plurality of second routes for each of the plurality of vehicles to go to the destination via the candidate point, and the plurality of second points The driving support device that identifies the candidate point having the lowest total value of the second costs regarding two routes as the junction. The driving support device according to claim 1,
It further comprises a type acquisition unit that acquires the type of the spot or facility specified by the user,
The controller is
A travel support device that calculates a point or facility corresponding to the type as the junction. It is a driving assistance device according to claim 1 or 9,
The controller is
A travel support apparatus that calculates the junction point on a route where a plurality of first routes for the plurality of vehicles heading to the destination overlap each other. It is a driving assistance device according to claim 1 or 9,
The controller is
A center having a center on a line connecting each vehicle and the destination, defining a circle with a predetermined diameter in contact with the position of the vehicle, and in a range where the circles of the plurality of vehicles overlap each other, A driving support device that calculates a junction. A driving support device according to any one of claims 1 to 11,
When a plurality of the merge points are calculated, the apparatus further includes a specific acquisition unit that acquires the one merge point specified by the user,
The controller is
A travel support device that causes each notification device to notify a route for each of the vehicles to travel to the destination via the one junction. A travel support device according to any one of claims 2 to 8,
The controller is
When a plurality of the junction points are calculated, the one junction point closest to the vehicle corresponding to the first route used for the calculation is calculated, and each vehicle passes through the one junction point. A travel support device that causes each of the notification devices to be notified of a route to the destination. A driving support method for supporting driving of the plurality of vehicles by using notifications of a plurality of notification devices mounted on a plurality of grouped vehicles,
(A) acquiring the positions of the plurality of vehicles;
(B) obtaining one destination common to the plurality of vehicles;
(C) calculating a merge point where each of the vehicles can merge while facing the destination based on the map data, the positions of the plurality of vehicles, and the destination;
And (d) a step of causing each of the vehicles to notify a route for each of the vehicles to go to the destination via the junction.

Images