JP5402749B2 - Communication system and data center - Google Patents

Description

  The present invention relates to a communication system and a data center.

  Conventionally, there is known a navigation device that selects and uses a route search algorithm suitable for an area where the host vehicle is present from a plurality of route search algorithms (see Patent Document 1).

JP 2008-76363 A

  However, in this technique, areas are classified into types such as tourist areas, new residential areas, educational districts, etc., and which algorithm is suitable for each classified type is fixedly assigned in advance. Therefore, it does not reflect the actual condition of the road when actually traveling in such an area.

  SUMMARY OF THE INVENTION In view of the above, the present invention aims to make a selection rule for a route search method more reliable reflecting the actual situation of a road in a technique for selecting and using one of a plurality of route search methods. And

  In order to achieve the above object, the invention according to claim 1 is a data center (2) for recording a plurality of user travel lists relating to a travel history of a vehicle on a storage medium, and communication capable of communicating with the data center (2). Each of the plurality of user travel lists includes a plurality of records, and each record includes a travel history from departure to arrival of the vehicle. And the communication device (4, 6) transmits selection information for selecting a part of the plurality of records in the plurality of user travel lists to the data center (2), and the data center (2) Receives the selection information transmitted from the communication device (4, 6), extracts the part of records according to the received selection information, and targets each of the extracted records When the travel history indicated by the code has the first point as the departure point and the second point as the arrival point, the first point and the second point are selected from the records in the plurality of user travel lists. The fastest route from the first point to the second point is extracted based on a record made up of travel histories in order, and a parameter value used in a route search algorithm has the highest degree of coincidence with the fastest route. Of the parameter values determined by the record fastest route parameter determination means (215-230) for determining a parameter value for calculating a high route as the optimum route, and the record fastest route parameter determination means (215-230) Optimal parameter determination means (235, 240, 245) for setting a set as an optimal parameter value, and the optimal parameter And recording means for recording the value in the storage medium (255), a communication system, comprising the.

  Thus, the data center (2) in the communication system records a plurality of user travel lists, and selects a part of the plurality of records in the plurality of user travel lists from the communication device (4, 6). When the information is received, some records are extracted according to the selection information, and for each record, the fastest route from the first point to the second point in the record is selected from the records in the plurality of travel lists. Then, a value of a parameter for a route search algorithm that realizes the fastest route or a route having a high coincidence with the fastest route is calculated, and one set of the calculated parameter values is recorded as an optimum parameter value.

  That is, for each selected record of travel history, the fastest route parameter value for traveling at the fastest speed between two traveled points is determined, and one set of these parameters is determined as the optimum parameter value. The fastest route is determined using the travel history in the record that is not selected. As described above, the optimum parameter value is determined in a form reflecting the actual state of travel including the other records from the departure point (first point) to the arrival point (second point) in the selected record. So it is highly reliable.

  The invention according to claim 2 is the communication system according to claim 1, wherein the fastest route parameter determining means (215 to 230) for each record targets each of the extracted records. When the travel history indicated by indicates that the first point is the departure point, the second point is the arrival point, and the first point is departing at the first time, the records of the plurality of user travel lists Of these, the first point and the second point travel in this order, and the first point and the second point are based on a record that includes a travel history of traveling the first point within a predetermined time with respect to the first time. The fastest route from one point to the second point is extracted, and the route having the highest degree of coincidence with the fastest route is selected as a parameter value used in the route search algorithm. And determines the parameter values for calculating as a suitable route.

  In this way, as the record for extracting the fastest route, the fastest route that matches the actual condition of the road at each time is selected by selecting a record that has approximately the same travel time as the original target record and the first point. It is possible to calculate an optimum parameter value that matches the actual condition of the road at each time.

  The invention according to claim 3 is the communication system according to claim 1 or 2, wherein each of the plurality of user travel lists corresponds to a different user ID, and each of the plurality of user travel lists. Each of the records included in the vehicle includes a travel history from departure to arrival of the vehicle of the corresponding user ID, and the selection information transmitted by the communication device (4, 6) includes the user ID. The fastest route parameter determining means for each record (215-230) extracts a record in the user travel list corresponding to the user ID included in the received selection information, and targets each of the extracted records as a target. When the travel history indicated by the record is such that the first point is the departure point and the second point is the arrival point, the plurality of user travel lists Among the records in the middle, based on the record consisting of the travel history that has traveled the first point and the second point in this order, extract the fastest route from the first point to the second point, As a parameter value used in a route search algorithm, a parameter value for calculating a route having the highest degree of coincidence with the fastest route as an optimum route is determined, and the recording means corresponds to the optimum parameter value corresponding to the user ID. And recording on the storage medium.

  As described above, when the data center (2) in the communication system records the user travel list for each user ID and receives the user ID from the communication device (4, 6), the data center (2) travels from the user travel list of the user ID. A record of history is extracted, and for each record, the fastest route from the first point to the second point in the record is selected from the traveling list of a plurality of user IDs, and the degree of coincidence with the fastest route is the highest The value of the parameter for the route search algorithm that realizes the route with a high is calculated, and one set of the calculated parameter values is recorded as the optimum parameter value.

  That is, the fastest route parameter value for traveling at the fastest speed between two traveled points is determined for each travel history record of a certain user ID, and one set of these parameters is determined as the optimal parameter value. Since this is the case, it is possible to select an algorithm parameter value suitable for the user ID.

  According to a fourth aspect of the present invention, in the communication system according to any one of the first to third aspects, the selection information transmitted by the communication device (4, 6) includes an area, The record-by-record fastest route parameter determining means (215-230) extracts records having a departure point and an arrival point in the area included in the received selection information from the plurality of user travel lists, and extracted records When the travel history indicated by the target record is the first point as the departure point and the second point is the arrival point, among the records in the plurality of user travel lists, The fastest route from the first point to the second point is extracted based on a record consisting of the points and the travel history of traveling the second point in this order. Then, as a parameter value used in the route search algorithm, a parameter value for calculating a route having the highest degree of coincidence with the fastest route as an optimum route is determined, and the recording means stores the optimum parameter value in the area. The information is recorded in the storage medium in association with each other.

  Thus, by limiting the records to be extracted from the travel list to records having the departure point and the arrival point in the received area, it is possible to determine the optimum parameter value suitable for route calculation in the specific area. it can.

  According to a fifth aspect of the present invention, in the communication system according to any one of the first to fourth aspects, the optimum parameter determining means (235, 240, 245) is the fastest route parameter determining means for each record. The records extracted in accordance with the selection information by (215-230) are grouped by records with the same parameter value determined, and the parameter value corresponding to the group with the most travel amount is set as the optimum parameter value. .

  As described above, the most used route parameter value used in the travel history of the user ID is determined as the optimum parameter value. This improves the usefulness when using the optimum parameter value.

  The invention according to claim 6 is the communication system according to claim 5, wherein the optimum parameter determining means (235, 240, 245) is the record-specific fastest route parameter determining means (215-230). For records extracted according to the selection information, records with the same parameter value determined are grouped into the same group, and the total travel time (Tsum) from the departure point to the arrival point of the record in each group is calculated. (235), and the parameter value of the maximum group in which the calculated total sum (Tsum) is maximum is set as the optimum parameter value (240, 245).

  In this way, the total travel time (Tsum) from the departure point to the arrival point of the records (records extracted according to the selection information) in the group having the same fastest route parameter is compared between the groups, and the total (Tsum By adopting the fastest route parameter value of the group with the largest) as the optimum parameter value, the fastest route parameter value that is most likely to be the fastest time among the fastest route parameter values is optimal. It can be adopted as a parameter value.

  The invention according to claim 7 is the communication system according to claim 6, wherein the record in the maximum group is within the maximum group with respect to the total travel time (Tsum) from the starting point to the arrival point of each record in the maximum group. Score calculating means (250) using the ratio (Tm / Tsum) of the total travel time (Tm) of the fastest route from the starting point to the arriving point of the record in the record as the optimal parameter value score, 255) is characterized in that the optimum parameter value and the score of the optimum parameter value are recorded in the storage medium.

  In this way, by recording the optimal parameter value score together with the optimal parameter value, the optimal parameter value corresponding to the extracted record and other optimal parameter values corresponding to the separately extracted record are used as indices. Can be compared.

  According to an eighth aspect of the present invention, in the communication system according to the seventh aspect, there are a plurality of the communication devices (4, 6), and the data center (2) includes the plurality of communication devices (4, 6). ), Each of the plurality of selection information is processed, and processing A, processing B, and processing C are performed. In the processing A, the fastest route parameter determining means for each record (215-230) ) To extract the part of the records according to the target selection information, and for each of the extracted records, the travel history indicated by the target record arrives at the second point starting from the first point A record consisting of a travel history of traveling through the first point and the second point in this order among the records in the plurality of user travel lists Based on this, the fastest route from the first point to the second point is extracted, and the route having the highest degree of coincidence with the fastest route is calculated as the optimum route as the parameter value used in the route search algorithm. In the process B, the optimum parameter determination means (235, 240, 245) performs the grouping of records in which the same parameter value is determined as the same group with respect to the extracted records. And calculate the sum (Tsum) of the travel time from the first point to the second point of each record in each group, and calculate the parameter value of the maximum group that maximizes the calculated sum (Tsum). In the process C, the maximum group value is set by the score calculation means (250). The ratio of the total travel time (Tm) of the fastest route from the start point to the arrival point of the record in the maximum group with respect to the total travel time (Tsum) of the record from the start point to the arrival point (Tm / Tsum) is a score of the optimum parameter value, and the data center (2) further includes, for each of the plurality of selection information, the selection information, the optimum parameter value corresponding to the selection information, and the optimum parameter value. The score is recorded on the storage medium together as one optimum parameter record, and the plurality of optimum parameter records recorded as one of the plurality of communication devices (4, 6) or another as the optimum parameter list. To the communication device (4, 6) and the destination user terminal (4, 6) The data list information is displayed to the user.

  By doing in this way, the user who saw the information of the optimal parameter list can select the optimal parameter Po to be used with reference to information such as score and selection information.

  The invention according to claim 9 is the communication system according to claim 5, wherein the optimum parameter determining means (235, 240, 245) is the record-specific fastest route parameter determining means (215-230). For records extracted according to the selection information, records with the same parameter value determined are grouped into the same group, and the total amount of travel (Tsum) from the departure point to the arrival point of the records in each group is calculated. (235), and the parameter value of the maximum group in which the calculated total sum (Tsum) is the maximum is set as the optimal parameter value (240, 245), and the communication system performs the arrival point from the starting point of each record in the maximum group. Within the maximum group for the total travel (Tsum) Score calculating means (250), which uses the ratio (Tm / Tsum) of the total travel time (Tm) of the fastest route from the departure point to the arrival point of the code as a score of the optimum parameter value, includes the recording means (255). ) Is characterized in that the optimum parameter value and the score of the optimum parameter value are recorded in the storage medium.

  The invention according to claim 10 is a data center that communicates with the communication device (4, 6), and is a plurality of user travel lists related to the travel history of the vehicle, each including a plurality of records, Each record further includes a storage unit (22) for storing a plurality of user travel lists including a travel history from departure to arrival of the vehicle, and a communication device (4, 6) from the communication devices (4, 6). When selection information for selecting a part of a plurality of records is received, the part of the records is extracted according to the received selection information, and the driving history indicated by the target record is the first for each of the extracted records. When the first point is a departure point and the second point is an arrival point, among the records in the plurality of user travel lists, the first point and the second place The fastest route from the first point to the second point is extracted based on a record consisting of the travel history of traveling in this order, and the parameter value used in the route search algorithm most closely matches the fastest route The fastest route parameter determining means for each record (215 to 230) for determining a parameter value for calculating a route having a high degree as the optimum route, and the parameter values determined by the fastest route parameter determining means for each record (215 to 230). Optimum parameter determination means (235, 240, 245) using one set as an optimum parameter value, and recording means (255) for recording the optimum parameter value in a storage medium in association with the user ID. Is a data center characterized by As described above, the feature of the present invention can be understood as the feature of the data center.

  In addition, the code | symbol in the bracket | parenthesis in the said and the claim shows the correspondence of the term described in the claim, and the concrete thing etc. which illustrate the said term described in embodiment mentioned later. .

It is a schematic diagram which shows the structure of the communication system which concerns on embodiment of this invention. It is a figure which shows exchange of the data between the data center 2, the user terminal 4, and the navigation apparatus 6 for vehicles. 2 is a configuration diagram of a data center 2. FIG. 3 is a configuration diagram of a user terminal 4. FIG. It is a block diagram of the navigation apparatus 6 for vehicles. It is a flowchart of the transmission process of the travel history in the vehicle navigation apparatus. It is a flowchart of the reception process of the travel history in a data center. It is a figure which shows an example of a user travel list. It is a flowchart performed in order for a user terminal to communicate with a data center. It is a figure of a setting menu screen. It is a flowchart of the process which a data center performs in order to determine an optimal parameter. It is a figure which illustrates the records 51-54 of the travel history in the area 50 extracted by step 219 of FIG. It is a figure which shows the example of the same ODT list | wrist. It is the figure which represented each entry in the same ODT list | wrist in map format. It is a figure which shows the relationship of the extracted records 71a-74a, the fastest records 71b-74b, and the fastest route parameter value 71c-74c. It is a figure of the fastest parameter list represented in list format.

  Hereinafter, an embodiment of the present invention will be described. FIG. 1 schematically shows a configuration of a communication system according to the present embodiment. This communication system includes a data center 2 connected to a wide area network 1 such as the Internet, a user terminal device 4 (corresponding to an example of a communication apparatus) that can be connected to the wide area network 1 via a router 3 in a house, A vehicle navigation device 6 (corresponding to an example of a communication device) mounted on the vehicle 5 is provided. The vehicle navigation device 6 can be connected to a communication base station 7 connected to the data center 2 via a plurality of roadside transmission / reception devices 8 (for example, road beacons) installed along the road. .

  There are a plurality of sets of the vehicle 5 and the vehicle navigation device 6. That is, the communication system of this embodiment includes a plurality of vehicle navigation devices 6 mounted on each of the plurality of vehicles 5. The number of sets of the vehicle 5 and the vehicle navigation device 6 may be, for example, between several thousand to several tens of millions. Each vehicle 5 is assigned a unique user ID for distinguishing it from other vehicles 5. There are also a plurality of user terminals 4.

  In the present embodiment, as shown in FIG. 2, each of the vehicle navigation devices 6 transmits the user ID of the vehicle 5 to the data center 2 and the vehicle 5 via the roadside transmission / reception device 8 and the communication base station 7. The travel history of is to be sent. This travel history includes information on the travel position and travel time from departure to arrival. The data center 2 records these received travel histories in groups for each user ID.

  The user terminal 4 communicates with the data center 2 via the router 3 and the wide area network 1, and at the time of the communication, the data including the algorithm for route calculation, the area (geographic range), and the user ID is transmitted to the data center 2. Send to. Then, based on this data, the data center 2 uses the parameters of the route search algorithm that are optimal for the vehicle navigation device 6 mounted on the vehicle 5 of the user ID to calculate the guide route in the area (that is, , Optimal parameters). The calculated optimum parameter is transmitted to the user terminal 4 and the vehicle navigation device 6, the optimum parameter is displayed on the user terminal 4, and the vehicle navigation device 6 calculates the guidance route of the area. In this case, the algorithm is used, and the optimum parameter is used in the algorithm.

  Further, the user terminal 4 calculates a score, which is an index indicating how suitable the optimum parameter is, and transmits the calculated score to the user terminal 4 and the vehicle navigation device 6. Then, the user terminal 4 and the vehicle navigation device 6 display the received score together with the optimum parameter.

  Hereinafter, the configuration of the data center 2, the user terminal 4, and the vehicle navigation device 6 will be described.

  FIG. 3 shows the configuration of the data center 2. The data center 2 includes a communication interface 21, a storage unit 22, and a control unit 23. The communication interface 21 is a well-known network interface for connecting to the wide area network 1 and communicating with the communication base station 7. The storage unit 22 is a writable nonvolatile storage medium such as a hard disk or a flash memory. The storage unit 22 stores the same map data (described later) as the vehicle navigation device 6. The control unit 23 is a device such as a microcomputer including a CPU, a RAM, a ROM, and the like.

  FIG. 4 shows the configuration of the user terminal 4. The user terminal 4 includes a communication interface 41, an image display device 42, an operation unit 43, a storage unit 44, and a control unit 45. The communication interface 41 is a known network interface for connecting to the wide area network 1 via the router 3. The image display device 42 is a device that displays an image such as a liquid crystal display. The operation unit 43 is a device that receives user operations such as a keyboard and a mouse. The storage unit 44 is a writable nonvolatile storage medium such as a hard disk or a flash memory. The control unit 45 is a device such as a microcomputer provided with a CPU, RAM, ROM and the like.

  FIG. 5 shows a configuration of the vehicle navigation device 6. The vehicle navigation device 6 includes a position detector 61, an image display device 62, an operation unit 63, a speaker 64, a communication unit 65, a map data acquisition unit 66, and a control unit 67.

  The position detector 61 includes a well-known acceleration sensor, geomagnetic sensor, gyro sensor, vehicle speed sensor, GPS receiver, and other sensors (not shown), and the current vehicle state based on the characteristics of each of these sensors. Information for specifying the position, orientation, and speed is output to the control circuit 67.

  The image display device 62 displays a video based on the video signal output from the control circuit 67 to the user. Examples of the display image include a map centering on the current location.

  The operation unit 63 includes a plurality of mechanical switches provided in the vehicle navigation device 1 and an input device such as a touch panel provided so as to overlap the display surface of the image display device 62. The user presses the mechanical switch and touches the touch panel. Is output to the control circuit 67.

  The communication unit 65 is a well-known wireless communication interface for communicating with the data center 2 via the communication base station 7 by wirelessly communicating with the roadside transmission / reception device 8.

  The map data acquisition unit 66 includes a nonvolatile storage medium such as a DVD, a CD, and an HDD, and a device that reads data (and writes data if possible) to these storage media. The storage medium stores a program executed by the control circuit 67, map data for route guidance, and the like.

  The map data has road data and facility data. The road data includes link position information, type information, node position information, type information, information on connection relations between nodes and links, and the like. The facility data has a plurality of records for each facility, and each record has data indicating name information, location information, land lot number information, facility type information, and the like of the target facility.

  A control circuit (corresponding to a computer) 67 is a microcomputer having a CPU, a RAM, a ROM, an I / O, and the like. The CPU executes a program for the operation of the vehicle navigation device 1 read from the ROM or the map data acquisition unit 66, and reads information from the RAM, the ROM, and the map data acquisition unit 66 when executing the program. And, if possible, information is written to the storage medium of the map data acquisition unit 66, and the position detector 61, the image display device 62, the operation unit 63, the speaker 64, and the traffic information receiver 65 are connected with the signal. Give and receive.

  Specific processing performed by the control circuit 67 executing the program includes current position specifying processing, map display processing, guidance route calculation processing, route guidance processing, and the like.

  The current position specifying process is a process for specifying the current position and direction of the vehicle based on a signal from the position detector 61 using a known technique such as map matching.

  The map display process is a process for causing the image display device 62 to display a map of a specific area such as the vicinity of the current position of the vehicle. At this time, information used for map display is acquired from the map data.

  The guidance route calculation process is a process that receives an input of a destination by the user from the operation unit 63, calculates an optimum route from the current position to the destination, and uses the optimum route as a guidance route. The control unit 67 of the present embodiment selects and employs one of a plurality of types of route search algorithms as the route search algorithm used for calculating the guidance route. Examples of the multiple types of route search algorithms include Dijkstra method, A * algorithm, genetic algorithm, uniform cost search, and bidirectional search.

  Each route search algorithm is provided with a changeable parameter group. For example, in the Dijkstra method, the cost given to one highway link, the cost given to one national road link, and the cost given to one narrow street link are included in the changeable parameter group. . The control unit 67 is configured to calculate the guidance route after setting the parameter group values (that is, parameter values) of the adopted route search algorithm.

  The selection of the route search algorithm and the setting of the parameter of the route search algorithm in the control unit 67 may be performed in accordance with the user's selection and setting operation on the operation unit 63, or received from the data center 2 as will be described later. It may be performed in accordance with the optimum parameters.

  The route guidance process is a process that guides the travel along the calculated guidance route, sequentially monitoring the positional relationship between the guidance route and the vehicle position, and before a guidance point such as a right-left turn intersection on the guidance route. When the host vehicle arrives, a guidance voice instructing a right turn, a left turn, etc. is output to the speaker 64, and an enlarged view of the guidance point is displayed on the image display device 62, thereby driving the vehicle along the guidance route. It is a process to guide.

  Hereinafter, the operation of the communication system configured as described above will be described. First, an operation in which each of the vehicle navigation devices 6 transmits a travel history (see FIG. 2) to the data center 2 will be described.

  For this operation, the controller 67 executes a process as shown in FIG. 6 when the host vehicle 5 starts to travel. In this process, first, in step 605, the timer for measuring the passage of time is reset, and then in step 610, the current position (that is, the traveling position) and the current time (that is, the traveling time) of the host vehicle 5 , Minutes and seconds information are recorded in a RAM or the like, and then, in step 615, when a predetermined time (specifically, 5 minutes) has passed since the last timer reset or the parking brake is applied. It is determined whether or not. If the predetermined time has not elapsed, the process proceeds to step 630, and if it has elapsed, the process proceeds to step 620.

  If the predetermined time has not elapsed, it is subsequently determined in step 630 whether or not the host vehicle 5 has arrived at the arrival point. Whether or not the host vehicle 5 has arrived at the arrival point is determined as having arrived at the arrival point when it is determined that the destination has been reached in the route guidance process. Is stopped for a reference time (for example, 10 minutes) or more, it is determined that the host vehicle 5 has arrived at the arrival point. If the arrival point has been reached, the process proceeds to step 635. If the arrival point has not been reached, the process returns to step 610.

  Therefore, the vehicle navigation device 6 repeats the processing of steps 610, 615, and 630 (for example, once per second) until the vehicle 5 arrives at the arrival point after the vehicle 5 starts to travel. Then, the data of the set of the traveling position and traveling time of the vehicle is sequentially accumulated in the traveling order.

  Then, when the predetermined time has elapsed, the process proceeds to step 620, where all of the set of travel position and travel time currently stored in the RAM are transmitted to the data center 2 as a part of the travel history, and the transmitted data is read from the RAM. delete. The user ID of the host vehicle 5 is also transmitted to the data center 2 together with a part of the travel history. This user ID information is recorded in the ROM or the map data acquisition unit 66.

  That is, the control unit 67 accumulates the set of the travel position and the travel time at a predetermined cycle (for example, 1 second cycle), and every time a predetermined time (specifically 5 minutes) longer than the predetermined cycle elapses. A set of travel position and travel time accumulated within a predetermined time is transmitted to the data center 2 together with the user ID as a part of the travel history.

  If it is determined in step 630 that the vehicle has arrived at the arrival point, then in step 635, all of the set of the travel position and travel time stored in the RAM at that time are part of the travel history together with the user ID. Transmit to the data center 2. At this time, arrival information indicating that the host vehicle 5 has arrived at the arrival point is also transmitted to the data center 2. After step 635, the transmission process of FIG. 6 is interrupted until the host vehicle 5 starts to travel again.

  The control unit 23 of the data center 2 executes the process shown in FIG. 7 in order to receive the traveling history transmitted in this way. Specifically, every time the control unit 23 receives a part of the travel history and the user ID (step 201), the control unit 23 accumulates them in the RAM (step 203), and receives arrival information together with a part of the travel history and the user ID. If this is the case (step 205), a part of the traveling history accumulated this time and so far for the user ID is arranged in chronological order, and the resulting traveling history data is stored as the user traveling of the user ID in the storage unit 22. In the list, it is additionally recorded as one record (step 207), and the accumulated data in the RAM for the additional recording is deleted.

  By performing such processing, the control unit 23 creates user travel lists corresponding to the user IDs as many as the received user IDs. FIG. 8 illustrates a user travel list corresponding to one user ID. As shown in this figure, each of the plurality of user travel lists includes a plurality of records. Each row after the second row in the table of FIG. 8 corresponds to one record.

Each record includes a travel list ID, which is a serial number in one user travel list, and a travel history from departure to arrival of the vehicle 5 corresponding to a specific user ID.
The travel history from the departure to the arrival of the vehicle 5 is the travel point (departure point, passing point, Information on a set of the position of the arrival point) and the time (departure time, passage time, arrival time) of traveling at the travel point. Of the travel points, the first point is the departure point and the last point is the arrival point.

  Next, an operation in which the user terminal 4 communicates with the data center 2 will be described. In this operation, the user terminal 4 uses the route search algorithm that is optimal for the vehicle navigation device 6 mounted on the vehicle 5 having a specific user ID from the data center 2 to calculate a guide route in a specific area. Parameters (ie, optimum parameters) are calculated.

  In FIG. 9, the process which the control part 45 of the user terminal 4 performs for this operation | movement is demonstrated. The control unit 45 starts the processing in FIG. 9 when the user inputs the user ID of the vehicle 5 owned by the user and performs an operation to communicate with the data center 2 using the operation unit 43. First, in step 405, a setting menu screen 30 as shown in FIG.

  The setting menu screen 30 includes an algorithm selection unit 31, an area selection unit 32, an area display unit 33, a switch unit 34, and a result display unit 35.

  The algorithm selection unit 31 displays a list of route calculation algorithms that can be selected by the user using the operation unit 43. Note that the list of selectable route calculation algorithms may be created in advance in the user terminal 4 or may be received from the data center 2. When the user selects one route calculation algorithm from the list using the operation unit 43, the control unit 45 selects the one route calculation algorithm according to the selection operation (step 410).

  The area selection unit 32 displays a list of areas that can be selected by the user using the operation unit 43. Note that the list of selectable areas may be created in advance in the user terminal 4 or may be received from the data center 2.

  The selectable area includes a route traveled by the vehicle having the user ID in the past year, a route traveled by the vehicle having the user ID in a specific time zone on a specific day, a specific region (for example, a central area), and the like. is there. When the user selects one area from the list using the operation unit 43, the control unit 45 selects the one area according to the selection operation (step 415).

  The area display unit 33 is a part that displays the selected area in a map format. When the control unit 45 selects an area in step 415, the control unit 45 displays the area range on the area display unit 33. At that time, the travel history of the user ID included in this area may be represented by an arrow from the departure point to the arrival point. In this case, the travel history of the user ID may be requested and acquired from the data center 2. By performing such display, the user can visually grasp the position and size of the area to be selected.

  The switch unit 34 is a display unit that prompts the user to perform an operation to execute transmission. When the user performs an operation of selecting the switch unit 34 using the operation unit 43, the control unit 45 uses the route search algorithm and the area determined in steps 410 and 415 as inquiry data together with the user ID. The data is transmitted to the center 2 (step 420). The user ID and area information included in the inquiry data correspond to an example of selection information for selecting a part of a plurality of records in a plurality of user travel lists.

  After the transmission, the control unit 45 waits until a response to the inquiry data is received from the data center 2 (step 425). When the response is received, the optimum parameter included in the response is displayed on the result display unit 35 (step 425). 430). At this time, a score (described later) included in the response may also be displayed on the result display unit 35. After step 430, the algorithm and area can be selected again by returning to step 410.

  Next, the operation in which the data center 2 determines optimum parameters and the like according to the inquiry data transmitted from the user terminal 4 will be described. For this operation, the control unit 23 of the data center 2 executes the processing shown in FIG.

  In this process, the control unit 23 first waits until the inquiry data is received from the user terminal 4 in step 215, and then receives the user ID in the received inquiry data (hereinafter referred to as inquiry user ID) in step 217. One user travel list corresponding to is extracted from the storage unit 22. In step 219, a record having a departure point and an arrival point in the area in the received inquiry data is extracted from the extracted user travel list. There may be one or more records to be extracted. In FIG. 12, the example of the record in the extracted area 50 is represented by the arrows 51-54 from the departure point to the arrival point.

  Subsequently, the loop R1 is executed once for each of the records extracted in step 219. That is, the loop R1 is repeated by the number of records extracted in step 219.

  Hereinafter, the record that is the target in one loop R1 is called the target record, the starting point of the travel history included in the target record is called the first point, the arrival point is called the second point, and the departure The traveling time of the point is called the first time.

  In each loop R1, the control unit 23 first travels in this order through the first point and the second point among all the records in all the user travel lists recorded in the storage unit 22 in step 220. At the same time, a record including a travel history of traveling at the first point within a predetermined time (for example, within 15 minutes before and after the first time) is extracted and listed. In addition, driving | running | working the 1st, 2nd point is driving | running | working the substantially same point as the 1st, 2nd point (specifically, a point within the predetermined distance of about 15 meters from the 1st point). It is a concept that includes doing.

  The data listed in this way is called the same ODT (Orientation, Destination, and departure Time) list. As illustrated in FIG. 13, this same ODT list has a plurality of entries, and each entry is composed of a set of one record in the user travel list and a user ID corresponding to the user travel list. In FIG. 13, each line after the second line corresponds to one entry.

  As illustrated in FIG. 13, all entries in the same ODT list are traveling at the departure point and the arrival point of the target record, and are traveling at the departure point at approximately the departure time of the target record. . In the map format, as illustrated in FIG. 14, the travel history (represented by a single line) of each entry in the same ODT list passes through the same points O1 and D1, but the route that passes is different. Yes.

  Subsequently, in step 225, among the entries in the created same ODT list, for the entry having the shortest travel time from the first point to the second point, the entry from the first point to the second point in the entry is performed. The route is extracted as the fastest route. However, for entries where the value obtained by dividing the length of the route from the first point to the second point by the travel time exceeds the reference speed (for example, the legal speed of 60 km / h for general roads) For reasons of being too fast, it may be excluded from being extracted as the fastest route.

  The fastest route extracted in this manner may be the same as or different from the route of the target record. The fact that the fastest route is different from the route of the target record means that the vehicle 5 corresponding to the inquiry user ID is different from the vehicle 5 corresponding to the inquiry user ID, even though the vehicle traveled at the first point at approximately the same time as the vehicle 5 corresponding to the inquiry user ID. This means that there was another vehicle 5 that arrived at the second point faster than the vehicle 5. Such a fastest route is an optimal route candidate for the user having the inquiry user ID.

  Subsequent to step 225, in step 230, parameter values for calculating the fastest route as the optimum route as the value of the parameter group of the route search algorithm in the inquiry data received in step 215 (hereinafter referred to as the fastest route parameter value). Is determined as the parameter value of the fastest route.

  Specifically, each of the possible combinations of parameter groups is adopted, and the route search algorithm calculates a guide route from the first point to the second point. Among the calculated guide routes, If there is a route having the same route as the fastest route, the parameter value adopted when the route is calculated as the guide route is set to the parameter value P of the fastest route, that is, the fastest route P.

  For example, the route search algorithm in the inquiry list is the Dijkstra method, and the parameter group includes a cost C1 given to one highway link, a cost C2 given to one national highway link, and one narrow street When there are three costs C3 to be given to the link, and those values can take either 1, 2, or 3, respectively, the control unit 23 has 3 × 3 × 3 = 27 types. 27 parameter paths are calculated using the parameter values, and among these, parameter values (for example, (C1, C2, C3) used for calculating the guide path (s) matching the fastest route are calculated. = (1, 3, 2)) is the fastest route P of the fastest route.

  In addition, if the guide route that is the same route as the fastest route cannot be calculated with any parameter value, the parameter used when calculating the guide route with the highest degree of coincidence with the fastest route among the calculated guide routes The value is the parameter value P of the fastest route. Here, it is assumed that the degree of coincidence between routes increases, for example, as the route length of the matching part increases, or decreases as the travel time difference between different route parts increases.

  Subsequently, in step 235, the travel time from the first point to the second point of the target record is added to the value of the function Tsum (P) of the fastest route parameter value P. Note that the values of the function Tsum (P) for all parameter values are reset to zero when step 217 in FIG. 11 is executed.

  By repeatedly executing such steps 220 to 230 in the loop R1, each of the extracted records is the target (R1), and the travel history indicated by the target record is the second starting from the first point. When the point is set as the arrival point and the first point is departed at the first time, the first point and the second point among the records in the plurality of user travel lists travel in this order and The record which consists of the driving | running history which drive | worked the 1st point within predetermined time with respect to 1 time is extracted (step 220), and the driving | running time from the 1st point to the 2nd point is extracted among the extracted records. For the shortest record, the route from the first point to the second point in the record is extracted as the fastest route (225), and the received route search algorithm As the value of the parameter, the parameter value P for calculating the highest degree of coincidence is high route fastest route as the optimum route is determined (step 230).

  Note that the fastest route parameter value P for calculating the fastest route as the optimum route is the fastest route parameter value P for calculating the route that completely matches the fastest route as the optimum route, and therefore, the fastest route has the highest degree of coincidence. This is a kind of parameter value P for calculating a high route as an optimum route.

  For example, as shown in FIG. 15, the records 71a to 74a in the area are extracted from the travel list of the inquiry user ID, and the records 71b to 74b passing through the fastest route corresponding to the records 71 to 74 are all the users' records. The fastest route parameter value 71c that is selected from the records in the travel list and realizes (or most closely matches) the fastest route 71b-74b from each of the fastest route records 71b-74b (denoted as the fastest record in the figure). ˜74c is calculated. Among the plurality of fastest route parameter values 71c to 74c calculated in this way, there may be those having the same value. In the example of FIG. 15, the fastest route parameter value 71c and the parameter value 74c are the same value.

  Further, by repeatedly executing step 235 in the loop R1, the travel time from the departure point to the arrival point of the target record for which the same parameter value is calculated is added. As a result, for each fastest route parameter value P, Tsum The value of (P) is calculated.

  That is, Tsum (P) = Σ [Tu (i) × δ (P, Pi)]. Here, Σ represents the sum from 1 to the number of all records extracted in step 219, and Tu (i) is the travel time from the departure point to the arrival point of the i-th record. Pi is the fastest route parameter value corresponding to the i-th record, and δ (P, Pi) is 1 only when P = Pi, and 0 otherwise.

  The value of Tsum (P) calculated in this way is obtained by grouping the records of the inquiry user ID extracted in step 219 with the records for which the same fastest route parameter value P is determined. This corresponds to the sum total Tsum (P) of the travel time from the departure point to the arrival point of each record. In the example of FIG. 15, the records 71a and 74a belong to the same group, and at least the travel time Tu (1) of the record 71a and the travel time Tu (4) of the record 74a are added to Tsum (P1). ing.

  Following the loop R1, in step 240, all the fastest route parameter values P calculated repeatedly in step 230 are sorted by the total travel time Tsum (P). This makes it possible to determine which group has the largest sum Tsum (P).

  Subsequently, in step 240, the group having the maximum total travel time Tsum (P) (hereinafter referred to as the maximum group) and the fastest route parameter value P of the group are specified from the sorting result in step 230, and the fastest route. The parameter value is the optimum parameter value Po. The reason why the fastest route parameter value P of the maximum group is set as the optimum parameter Po is that, when the inquiry user's vehicle 5 adopts the optimum parameter Po, it seems that the overall effect of shortening the traveling time is the highest.

  Subsequently, in step 250, the score of the optimum parameter value Po is calculated. The score of the optimal parameter value Po is the ratio of the value Tm (Po) to the total travel time Tsum (Po) of the maximum group. The value Tm (Po) is the sum of the travel times (Tmin (1), Tmin (4)) of the fastest route corresponding to each of the records in the maximum group (for example, the records 71a and 74a in FIG. 15).

  That is, Tm (Po) = Σ [Tmin (i) × δ (Po, Pi)]. Here, Σ represents the sum from 1 to the number of all records extracted in step 219 for i, and Tmin (i) is the number from the first point of the fastest route corresponding to the i-th record. Is the travel time to point 2, Pi is a parameter value corresponding to the i-th record, and δ (Po, Pi) is 1 only when Po = Pi, and 0 otherwise. It is.

  Subsequently, in step 255, the optimum parameter value Po calculated in step 245, the score of the optimum parameter value calculated in step 250, the route search algorithm in the inquiry data received in step 215, and the inquiry data received in step 215. The area is recorded in the storage unit 22 in association with the user ID in the inquiry data received in step 215. Thus, the optimum parameter Po recorded in association with the user ID is a search parameter to be used in the vehicle navigation device 6 mounted on the vehicle 5 of the user ID.

  Subsequently, in step 260, the recorded optimum parameter value Po, score, route search algorithm, and area are transmitted as a response to the user terminal 4 that has transmitted the inquiry data. Then, the control unit 45 of the user terminal 4 determines that there is a response from the data center 2 in step 430 of FIG. 9, and in step 430, the received optimum parameter value Po and the like are displayed in the result display unit 35 of FIG. Display.

  The user who sees the display of the optimum parameter value Po selects the route search algorithm by operating the operation unit 63 of the vehicle navigation device 6 of the host vehicle 5 before traveling in the area of the host vehicle 5. Further, this optimum parameter value Po is set. Thus, the route search algorithm and the optimum parameter value Po are used in calculating the guidance route in the area.

  In step 260, the recorded optimum parameter value Po, score, route search algorithm, and area are transmitted not only to the user terminal 4 as the inquiry data transmission source but also to the vehicle navigation device 6 of the vehicle 5 corresponding to the inquiry user ID. You may come to do. In this case, the control unit 67 of the vehicle navigation device 6 employs the received optimum parameter value Po and the route search algorithm when calculating the guidance route in the received area. The storage unit 22 of the data center 2 stores a table indicating the correspondence between the user ID and the destination vehicle navigation device 6, and the control unit 23 uses this table to store the destination. The navigation device 6 is determined.

  As described above, in the communication system of this embodiment, the user terminal 4 transmits selection information (area, user ID) for selecting a part of a plurality of records in a plurality of user travel lists to the data center 2. The data center 2 receives the selection information transmitted from the user terminal 4 (step 215), extracts some records according to the received selection information (step 219), and targets each of the extracted records, When the travel history indicated by the target record has the first point as the departure point and the second point as the arrival point, among the records in the plurality of user travel lists, the first point and the second point travel in this order. The fastest route from the first point to the second point is extracted on the basis of the record (step 220) composed of the travel history (step 225). The parameter value used to calculate the fastest route as the optimum route is determined as the parameter value used in the route search algorithm, or the parameter value for calculating the route having the highest degree of coincidence with the fastest route as the optimum route Is determined (step 230). Then, the data center 2 sets one set of the determined parameter values as the optimum parameter value Po, and records the optimum parameter Po in the storage unit 22 in association with the user ID.

  As described above, when the data center 2 that records a plurality of user travel lists in the communication system receives selection information from the user terminal 4, a part of the records is extracted according to the selection information, and the record is recorded for each record. The fastest route from the first point to the second point is selected from the records in the plurality of driving lists, and the value of the parameter for the route search algorithm that realizes the fastest route or a route having a high degree of coincidence is selected. Calculate and record one set of the calculated parameter values as the optimum parameter value.

  That is, for each selected record of travel history, the fastest route parameter value for traveling at the fastest speed between two traveled points is determined, and one set of these parameters is determined as the optimum parameter value. The fastest route is determined using the travel history in the record that is not selected. As described above, the optimum parameter value is determined in a form reflecting the actual state of travel including the other records from the departure point (first point) to the arrival point (second point) in the selected record. So it is highly reliable.

  More specifically, the data center 2 targets each of the extracted records, and the travel history indicated by the target record sets the first point as the departure point, the second point as the arrival point, and the first point. When the vehicle departs at the first time, among the records in the plurality of user travel lists, the vehicle travels in this order through the first point and the second point, and within a predetermined time with respect to the first time. The fastest route from the first point to the second point is extracted based on the record that includes the travel history of traveling at the first point.

  In this way, as the record for extracting the fastest route, the fastest route that matches the actual condition of the road at each time is selected by selecting a record that has approximately the same travel time as the original target record and the first point. It is possible to calculate an optimum parameter value that matches the actual condition of the road at each time.

  More specifically, the data center 2 extracts a record in the user travel list corresponding to the user ID included in the received selection information, extracts the fastest route for each of the extracted records, and determines a parameter value. To do.

  That is, the fastest route parameter value for traveling at the fastest speed between two traveled points is determined for each travel history record of a certain user ID, and one set of these parameters is determined as the optimum parameter. Since this is the case, it is possible to select an algorithm parameter value suitable for the user ID.

  More specifically, the data center 2 extracts records having a departure point and an arrival point in an area included in the received selection information from a plurality of user travel lists. In this way, the optimum parameter value suitable for route calculation in a specific area is determined by limiting the records extracted from the travel list of the user ID to records having the departure point and the arrival point in the received area. can do.

  In addition, the data center 2 groups the extracted records into records in which the same parameter value is determined, and has the largest travel amount (specifically, the travel time may be the longest or the distance may be the longest). Is the optimum parameter value Po.

  In this way, the fastest route parameter value that is most used in the travel history of the user ID is determined as the optimum parameter. This improves the usefulness when using the optimum parameters.

  More specifically, the data center 2 divides the records with the same parameter value into the same group for the extracted user ID records, and sets the first record of each record in each group. The total travel time Tsum (P) from the point to the second point is calculated, and the parameter value of the maximum group in which the calculated total sum Tsum (P) is maximum is set as the optimum parameter value Po.

  As described above, the total time Tsum (P) of the travel times from the first point to the second point of each record in the group having the same fastest route parameter is compared between the groups, and the sum Tsum (P) is the highest. By adopting the fastest route parameter of a large group as the optimum parameter Po, among the fastest route parameter values, the fastest route parameter value that has the highest possibility of being the longest traveling time is adopted as the optimum parameter Po. can do.

  In addition, the data center 2 adds the total travel time Tm of the fastest route corresponding to each record in the maximum group with respect to the total travel time Tsum (Po) of the travel time from the start point to the arrival point of each record in the maximum group. The communication system according to claim 6, wherein a ratio Tm (Po) / Tsum (Po) of (Po) is used as a score of an optimum parameter value, and the optimum parameter value Po and the score of the optimum parameter value Po are recorded. .

  In this way, by recording the optimal parameter value score together with the optimal parameter value, the optimal parameter value corresponding to a certain user ID and the optimal parameter value corresponding to another user ID can be compared using the score as an index. Can do.

  In the above embodiment, the control unit 23 of the data center 2 functions as an example of the fastest route parameter determining unit for each record by executing steps 215 to 230 in FIG. 11, and steps 235, 240, and 245 are performed. By executing, it functions as an example of the optimum parameter determining means, executing step 250 functions as an example of the score calculating means (250), and executing step 255 functions as an example of the recording means.

(Other embodiments)
As mentioned above, although embodiment of this invention was described, the scope of the present invention is not limited only to the said embodiment, The various form which can implement | achieve the function of each invention specific matter of this invention is included. It is.

  For example, the data center 2 receives inquiry data including different user IDs, areas, and route search algorithms from a plurality of user terminals 4, and targets each of the plurality of inquiry data as in the above embodiment. Different optimum parameters Po and scores can be calculated and recorded as one optimum parameter record in the storage unit 22 together with the user ID, area, and route search algorithm in the corresponding inquiry data. In this case, a plurality of optimum parameter records corresponding to a plurality of inquiry data and one-to-one are recorded in the storage unit 22.

  In this case, the control unit 23 of the data center 2 uses the optimum parameter Po, the score, the area, and the route search algorithm in the recorded optimum parameter records as the optimum parameter list. Any one or another user terminal 4 may be transmitted. In that case, the control unit 45 of the user terminal 4 may use the image display device 42 to display the received information of the optimum parameter list in a list format as shown in FIG. However, for the optimum parameter Po, the name given to the optimum parameter Po may be displayed instead of the value itself. Or the name may be omitted.

  By doing in this way, the user who sees this list can select the optimum parameter Po to be used with reference to the score and the area, and can use the selected parameter.

  In addition, the data center 2 transmits the optimum parameter Po to the vehicle navigation device 6 in step 260 of FIG. 11, and the second point from the first point in each fastest route corresponding to the optimum parameter Po. The travel time information up to may be transmitted. In that case, when the own vehicle 5 travels from the first point corresponding to a certain fastest route to the second point, the control unit 67 of the vehicle navigation device 6 receives the travel time received corresponding to the fastest route. And the actual travel time from the first point to the second point may be compared, and the time difference between the two travel times may be displayed on the image display device 62.

  The optimum parameter Po transmitted from the data center 2 to the user terminal 4 may be transmitted from the user terminal 4 to the vehicle navigation device 6 by communication, or via a portable storage medium (for example, a USB memory). The user terminal 4 may be transferred to the vehicle navigation device 6. That is, as long as the user of the vehicle navigation device 6 can obtain the optimum parameter, the optimum parameter can be finally used in the vehicle navigation device 6.

  In addition, when the data center 2 calculates the optimum parameter Po of the received route search algorithm, the data center 2 determines that the starting point in the area and the destination point in the area separately transmitted from the user terminal 4 from the starting point. The guidance route to the destination point may be calculated using the algorithm and using the optimal parameter in the algorithm, and the calculated route may be displayed on the user terminal 4. That is, the data center 2 may be configured to execute a guidance route calculation process.

  In the above embodiment, the route search algorithm, the user ID, and the area are transmitted from the user terminal 4 to the data center 2, but if the route search algorithm to be used is determined in advance, the route search algorithm Information does not necessarily have to be transmitted.

  Moreover, even if the data center 2 keeps the freshness of a user driving | running | working list by discarding the record which has driving | running | working time more than predetermined time (for example, 1 year) among the records in a user's driving | running list. Good.

  Further, the selection information transmitted from the user terminal 4 to the data center 2 does not necessarily have to be both the user ID and the area, and may be only one of them, or information other than the user ID and the area.

  Moreover, the navigation apparatus 6 for vehicles may perform the process of the user terminal 4. In that case, the vehicle navigation device 6 corresponds to an example of the communication device in the claims.

DESCRIPTION OF SYMBOLS 1 Wide area network 2 Data center 4 User terminal 5 Vehicle 6 Vehicle navigation apparatus 7 Communication base station 8 Roadside transmission / reception apparatus 30 Setting menu screen 31 Algorithm selection part 32 Area selection part 33 Area display part 34 Switch part 35 Result display part 50 Area 51 ~ 54 Running history

Claims (10)

A data center (2) for recording a plurality of user travel lists relating to the travel history of the vehicle in a storage medium;
A communication system (4, 6) capable of communicating with the data center (2),
Each of the plurality of user travel lists includes a plurality of records, and each record includes a travel history from departure to arrival of the vehicle,
The communication device (4, 6) transmits selection information for selecting a part of the plurality of records in the plurality of user travel lists to the data center (2),
The data center (2)
The selection information transmitted from the communication device (4, 6) is received, the part of records are extracted according to the received selection information, and each of the extracted records is a target and the travel indicated by the target record When the history has the first point as the departure point and the second point as the arrival point, the first point and the second point among the records in the plurality of user travel lists have traveled in this order. Based on a record consisting of history, the fastest route from the first point to the second point is extracted, and the route with the highest degree of coincidence with the fastest route is optimized as a parameter value used in the route search algorithm Fastest route parameter determining means (215-230) for each record for determining a parameter value to be calculated as a route;
Optimum parameter determination means (235, 240, 245) using one set of the parameter values determined by the record fastest route parameter determination means (215-230) as the optimum parameter value;
And a recording means (255) for recording the optimum parameter value on a storage medium.   The fastest route parameter determining means (215-230) for each record, for each of the extracted records, the travel history indicated by the target record is the first point as the departure point and the second point as the arrival point. When the first point is departed at the first time, the first point and the second point are driven in this order among the records in the plurality of user travel lists and the first point The fastest route from the first point to the second point is extracted on the basis of a record consisting of a travel history that has traveled the first point within a predetermined time with respect to a time of 1, and a route search algorithm As a parameter value to be used, a parameter value for calculating a route having the highest degree of coincidence with the fastest route as an optimum route is determined. Communication system according to claim 1. Each of the plurality of user travel lists corresponds to a different user ID, and each of the records included in each of the plurality of user travel lists includes a travel history from departure to arrival of the vehicle of the corresponding user ID. Contains
The selection information transmitted by the communication device (4, 6) includes the user ID,
The record-by-record fastest route parameter determination means (215-230) extracts a record in the user travel list corresponding to the user ID included in the received selection information, and targets each of the extracted records as a target. When the travel history indicated by the record to be used is the first point as the departure point and the second point as the arrival point, among the records in the plurality of user travel lists, the first point and the second point are The fastest route from the first point to the second point is extracted on the basis of a record composed of the travel history traveled in this order, and the degree of coincidence with the fastest route is the parameter value used in the route search algorithm. Determine the parameter value to calculate the route with the highest as the optimal route,
The communication system according to claim 1, wherein the recording unit records the optimum parameter value in the storage medium in association with the user ID. The selection information transmitted by the communication device (4, 6) includes an area,
The record-by-record fastest route parameter determining means (215-230) extracts records having a departure point and an arrival point in the area included in the received selection information from the plurality of user travel lists, and extracted records When the travel history indicated by the target record is the first point as the departure point and the second point is the arrival point, among the records in the plurality of user travel lists, The fastest route from the first point to the second point is extracted based on a record consisting of a point and a travel history of traveling the second point in this order, and as a parameter value used in a route search algorithm , Determine a parameter value for calculating the route with the highest degree of coincidence with the fastest route as the optimum route,
The communication system according to any one of claims 1 to 3, wherein the recording unit records the optimum parameter value in the storage medium in association with the area.   The optimum parameter determination means (235, 240, 245) groups the records extracted by the record-based fastest route parameter determination means (215-230) according to the selection information into records with the same parameter value determined, The communication system according to any one of claims 1 to 4, wherein a parameter value corresponding to a group having the largest traveling amount is set as an optimum parameter value.   The optimum parameter determining means (235, 240, 245) records records having the same parameter value in the same group with respect to the records extracted by the record-specific fastest route parameter determining means (215-230) according to the selection information. To calculate the total travel time (Tsum) from the departure point to the arrival point of the records in each group (235), and calculate the parameter value of the largest group that maximizes the calculated total sum (Tsum). 6. Communication system according to claim 5, characterized in that it is an optimal parameter value (240, 245). The total travel time (Tm) of the fastest route from the start point to the arrival point of the record in the maximum group with respect to the total travel time (Tsum) from the start point to the arrival point of each record in the maximum group Score calculating means (250) which uses the ratio (Tm / Tsum) as the score of the optimum parameter value;
The communication system according to claim 6, wherein the recording means (255) records the optimum parameter value and the score of the optimum parameter value in the storage medium. There are a plurality of the communication devices (4, 6),
The data center (2) receives different selection information from the plurality of communication devices (4, 6), performs processing A, processing B, and processing C for each of the plurality of selection information,
In the process A, the record-specific fastest route parameter determining means (215-230) extracts the part of records according to the target selection information, and the target record indicates each of the extracted records. When the travel history has the first point as the departure point and the second point as the arrival point, the first point and the second point are traveled in this order among the records in the plurality of user travel lists. The fastest route from the first point to the second point is extracted based on a record consisting of a travel history, and the route having the highest degree of coincidence with the fastest route is selected as a parameter value used in a route search algorithm. Determine the parameter value to calculate as the optimal route,
In the process B, the optimum parameter determining means (235, 240, 245) performs grouping on the extracted records so that records having the same parameter value are determined as the same group, and records in each group The total travel time (Tsum) from each of the first point to the second point is calculated, and the parameter value of the maximum group in which the calculated total (Tsum) is the maximum is the optimum parameter value.
In the process C, from the starting point of the record in the maximum group to the arrival point with respect to the total traveling time (Tsum) from the starting point to the arrival point of the record in the maximum group by the score calculation means (250). The ratio (Tm / Tsum) of the total travel time (Tm) of the fastest route of is the optimal parameter value score,
The data center (2) further stores, for each of the plurality of selection information, the selection information, the optimum parameter value corresponding to the selection information, and the score of the optimum parameter value as one optimum parameter record. And the plurality of optimum parameter records thus recorded are transmitted as an optimum parameter list to one of the plurality of communication devices (4, 6) or to another communication device (4, 6),
8. The communication system according to claim 7, wherein the destination user terminal (4, 6) displays the received information of the optimum parameter list to the user. The optimum parameter determining means (235, 240, 245) records records having the same parameter value in the same group with respect to the records extracted by the record-specific fastest route parameter determining means (215-230) according to the selection information. To calculate the sum (Tsum) of the travel amount from the starting point to the arriving point of the record in each group (235), and calculate the parameter value of the maximum group that maximizes the calculated sum (Tsum) The optimum parameter value (240, 245),
The communication system determines the travel time of the fastest route from the start point to the arrival point of the record in the maximum group with respect to the total amount (Tsum) of the travel amount from the start point to the arrival point of each record in the maximum group. Score calculating means (250), which uses the ratio (Tm / Tsum) of the sum (Tm) as the score of the optimum parameter value,
6. The communication system according to claim 5, wherein the recording means (255) records the optimum parameter value and the score of the optimum parameter value on the storage medium. A data center that communicates with communication devices (4, 6),
A storage unit for storing a plurality of user travel lists related to a travel history of a vehicle, each of which includes a plurality of records, each record including a travel history from departure to arrival of the vehicle. (22)
When selection information for selecting a part of the plurality of records in the plurality of user travel lists is received from the communication device (4, 6), the part of the records is extracted according to the received selection information and extracted. For each of the recorded records, when the travel history indicated by the target record has the first point as the departure point and the second point as the arrival point, among the records in the plurality of user travel lists, The fastest route from the first point to the second point is extracted based on a record made up of travel history of traveling in this order at the point 1 and the second point, and the parameters used in the route search algorithm As a value, a fastest route parameter for each record that determines a parameter value for calculating a route having the highest degree of coincidence with the fastest route as an optimum route. And over data decision means (215 to 230),
Optimum parameter determination means (235, 240, 245) using one set of the parameter values determined by the record fastest route parameter determination means (215-230) as the optimum parameter value;
And a recording unit (255) for recording the optimum parameter value in a storage medium in association with the user ID.

Images