JP2015169611A - Route searching device and route searching program - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a route searching device that calculates a route from a place of departure to a place of destination, in which a passing road is automatically set without troubling a user.SOLUTION: The route searching device has a memory for recording one or more records including a set of the place of departure obtained at a certain point of time in the past, the place of departure specified at the point of time, and the passing road specified at the point of time, acquires a specified departure place and a specified destination place which have been specified by the user (steps 105, 110, 114), and when a corresponding record that includes the place of departure in the vicinity of the specified departure place with a predetermined distance therefrom, and the place of destination in the vicinity of the specified destination place with a predetermined distance therefrom in one or more of the records stored in the memory, calculates the route departing from the specified departure place, passing through the passing road included in the record, and reaching the specified destination place (steps 115-140).

Description

  The present invention relates to a route search device and a route search program.

  2. Description of the Related Art Conventionally, there is known a route search device that calculates a route for calculating a route from a departure point to a destination, reflecting a user's preference.

  For example, when the user specifies a road to be passed in addition to the departure place and the destination, the route search device calculates a route from the departure place through the road to be passed to the destination.

JP 2002-310698 A

  However, in the above-described technology, even if the starting point and the destination are the same as those specified in the past, the user needs to specify the road that the user wants to pass every time, and the operation for the specification is troublesome for the user. .

  An object of the present invention is to provide a technique for automatically setting a passing road without bothering a user in a route search device that calculates a route from a departure place to a destination in view of the above points. .

  In order to achieve the above object, the invention described in claim 1 is a past departure place acquired at a certain point in the past, a past destination designated at the point in time, and a past passage designated at the point in time. A memory (16) in which one or more records including one set of roads are recorded; an acquisition means (105, 110, 114) for acquiring a current departure place and a current destination designated by a user; and the memory If there is a corresponding record including a past departure point at the same position as the current departure point and a past destination point at the same position as the current destination in the one or more records recorded in Route search means (115-140) for calculating a first route starting from the starting point of the vehicle, passing through the past passing road included in the corresponding record, and reaching the current destination. It is the location.

  As described above, when the route search device acquires the current departure place and the current destination, the route search apparatus includes the past departure place at the same position as the current departure place and the past destination at the same position as the current destination. If the corresponding record is recorded, the first route including the past passing road included in the corresponding record is calculated. Therefore, a passing road can be automatically set without bothering the user.

  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 lineblock diagram of navigation device 1 for vehicles concerning an embodiment of the present invention. It is a figure which shows the structure of the backup data in 1st Embodiment. It is a flowchart of the route search process which a control circuit performs in 1st Embodiment. It is a flowchart of the route search process which a control circuit performs in 2nd Embodiment. It is a flowchart of the route search process which a control circuit performs in 3rd Embodiment. It is a figure which shows the method of the comparison of the route in 3rd Embodiment. It is a figure which shows the structure of the backup data in 4th Embodiment. It is a flowchart of the route search process which a control circuit performs in 4th Embodiment.

(First embodiment)
The first embodiment of the present invention will be described below. As shown in FIG. 1, a vehicle navigation device 1 (corresponding to an example of a route search device) according to this embodiment is mounted on a vehicle, and includes a position detector 11, a display device 12, an operation unit 13, and an audio output device 14. A map data acquisition device 15, an external memory 16, and a control circuit 17.

  The position detector 11 is a sensor that outputs a signal for specifying the current position of the vehicle to the control circuit 17 such as a GPS receiver, a vehicle speed sensor, an acceleration sensor, and a gyro sensor. The display device 12 is a device such as a liquid crystal display that displays characters and images to the user under the control of the control circuit 17. The operation unit 13 is a device that receives a user operation and outputs a signal corresponding to the received operation to the control circuit 17. The audio output device 14 is a device that outputs audio for the user in the vehicle to hear. The map data acquisition unit 15 is a device that acquires map data under the control of the control circuit 17 and outputs the map data to the control circuit 17.

  The external memory 16 is a non-volatile storage medium that is arranged outside the control circuit 17 and stores backup data configured as illustrated in FIG. This backup data can include a plurality of records. Each record includes information on a set of a current location, a destination, and a passing road at the past time point acquired by the control circuit 17 during a past route search process. More specifically, each record includes only one set of the position coordinates of the past current location, the position coordinates of the past destination, and the position coordinates of the past passing road.

  No record is recorded in this backup data when the use of the vehicle navigation device 1 is started, and one record is written at step 155 of the process of FIG. 3 described later.

  The control circuit 17 is a device (e.g., a microcontroller) that includes a CPU, RAM, ROM, flash memory, and the like, and the CPU executes a program recorded in the ROM or flash memory so that various processes are realized. It has become.

  Specific processing performed by the control circuit 17 executing the program includes current position specifying processing, map display processing, route search 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 11 using a known technique such as map matching.

  The map display process is a process for causing the image display device 12 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 road shape data.

  The route search process is a process of receiving an input of a destination by the user from the operation unit 13 and calculating and displaying an optimum route from the current position (departure position) to the destination.

  The route guidance process is a process for guiding traveling along the route displayed by the route search process. In the route guidance process, the control circuit 17 sequentially monitors the positional relationship between the route and the vehicle position. Then, when the vehicle arrives before a guidance point such as a right-left turn intersection on the route, the voice output device 14 outputs a guidance voice instructing a right-left turn or the like, and an enlarged view of the guidance point is displayed on the display device 12. By displaying the information, the driving of the vehicle along the route is guided.

  Details of the route search process will be described below. The control circuit 17 executes a predetermined program recorded in the ROM or the like of the control circuit 17 based on the fact that the user has performed a predetermined route search start operation on the operation unit 13, whereby the control circuit 17 of FIG. Implement route search processing.

  In the process of FIG. 3, first, in step 105, the current position specifying process described above is performed to obtain the position coordinates of the current location of the vehicle. Subsequently, in step 110, the destination designated by the user is acquired according to the destination designation operation by the user on the operation unit 13. The destination designation method by the user may be a method of designating a specific position on the map displayed on the display device 12 on the touch panel, or a method of designating one destination included in the past destination setting history. Good.

  Subsequently, at step 115, the backup data is read from the external memory 16. In this example, it is assumed that a plurality of records have already been recorded in the past in the backup data in the external memory 16 as illustrated in FIG.

  Subsequently, in step 120, it is determined whether or not there is a corresponding record among a plurality of records in the read backup data. The corresponding record is a record including the past current location at the same position as the current location acquired at step 105 and including the past destination at the same location as the current destination acquired at step 110. For example, if the current location and destination location are a and b, the first record in FIG. 2 is the corresponding record. If it is determined that there is a corresponding record, the process proceeds to step 125.

  If it is determined that there is no corresponding record, the process skips steps 125 and 130 and proceeds to step 135 to search for the optimal (ie, the lowest cost) route from the current location to the current destination. In this search, a passing road (that is, a point on the road that the route to be searched must pass) is not set.

  In step 125, it is determined whether there is passing road designation data in the record. When the first record in FIG. 2 is a corresponding record, it is determined that it exists because it includes the position of the past passing road c, that is, passing road designation data. If it is determined that it exists, the process proceeds to step 130.

  If it is determined that it does not exist, the process bypasses step 130 and proceeds to step 135 to search for the optimum route from the current location to the current destination. During this search, no passing road is set.

  In step 130, all past passage road positions (for example, position c) included in the target passage road designation data determined to exist in the immediately preceding step 125 are not necessarily passed by the passage road (that is, the route to be searched does not pass). Set as one point on the road that should not be. In addition, when the position of a plurality of passing roads is included in the target passing road designation data determined to exist in the immediately preceding step 125, the positions of the plurality of passing roads are set as passing roads.

  Following step 130, in step 135, an optimum route from the current location to the current destination is searched. However, in this search, the route is searched on the assumption that the passing road set in the immediately preceding step 130 is one point on the road on which the route to be searched must pass.

  Therefore, in the case where the process proceeds from step 130 to step 135 and the case where the process proceeds from step 120 or step 125 to step 135 by bypassing step 130, the current position (that is, the departure place) and the destination are the same. However, in the former case, the search is performed with an additional condition that the route to be searched must pass through a passing road (one point on the road), whereas in the latter there is no such additional condition. . Therefore, in many cases, the calculated route is different between the former case and the latter case, and is rarely the same.

  Further, in the former case, the control circuit 17 automatically passes the passage road designated by the user in the past when searching for the route of the same starting point and the same destination without being designated by the user this time. Set on the road. Therefore, a passing road can be automatically set without bothering the user.

  In step 140 following step 135, the route calculated as a result of the route search is displayed on the display device 12.

  Subsequently, in step 145, it is determined whether there is an instruction to correct or add a passing road. When the user wants to correct the current passing road or add a new passing road to the route displayed in step 140, the user performs a predetermined operation for correction or addition on the operation unit 13. Do it. If there is such an operation, the control circuit 17 determines in step 145 that there is an instruction to correct or add a passing road, and proceeds to step 150.

  When the user determines that the route displayed in step 140 does not need to be corrected, the user performs an assumed route determination operation on the operation unit 13. When such an operation has been performed, the control circuit 17 determines in step 145 that there has been no instruction for correction or addition of the passing road, and the processing of FIG. In this case, the control circuit 17 performs route guidance processing later to provide guidance for traveling along the route.

  In step 150, processing for correcting and adding a passing road is performed. Specifically, according to the user's designation operation on the operation unit 13, the position of the currently set passing road is changed, the setting of the passing road itself is deleted, or a new passing road is set.

  Subsequent to step 150, in step 155, the control circuit 17 obtains the current location and the destination location, and the position of the passing road changed or added by the user's designated operation in step 150 as a set of records. Are additionally recorded in the backup data in the external memory 16. However, if a record with the same current location and destination as the record to be recorded this time already exists in the backup data, the record already existing in the backup data is deleted and added to the record backup data to be recorded this time To do.

  The records additionally recorded in this way are stored in the backup data from the set of the present location, destination, and passing road at the past time in steps 115 to 130 of the route search processing executed later with the processing contents as described above. Used as one of the records.

  If all the passing roads are deleted in step 150, the record additionally recorded in the backup data in step 155 is a record that includes only the current location and the destination and does not include the passing point.

  If a plurality of passing roads are finally set in step 150, the record additionally recorded in the backup data in step 155 is a record including a plurality of passing points in addition to the current location and the destination. .

  Following step 155, the process returns to step 135, and the route from the current location to the current destination is re-searched after reflecting the corrected or added passing road. The processing after step 135 is as already described.

  As described above, the external memory 16 stores the past departure place acquired at a certain past time (route search processing execution time), the past destination designated at the relevant time, and the past designated at the relevant time. One or a plurality of records of a set of passing roads are recorded.

  Then, in the record recorded in the external memory 16, the control circuit 17 displays a past departure place in the predetermined vicinity of the current departure place (current position) and a past destination in the predetermined vicinity of the current destination. If there is a corresponding record to be included, calculate a route (corresponding to an example of the first route) that departs from the current departure point, passes through the past passing road included in the corresponding record, and reaches the current destination (step 1). 115-140).

  As described above, when the vehicle navigation apparatus 1 acquires the current departure place and the current destination, the vehicular navigation apparatus 1 includes a past departure place near the current departure place and a past destination near the current destination. If the corresponding record is recorded, the first route including the past passing road included in the corresponding record is calculated. Therefore, a passing road can be automatically set without bothering the user. In other words, when searching for a route that the user wants to use once, the same route as the previous time can be searched with a simple operation by inputting the destination.

  In the present embodiment, “same location as departure location” and “same location as departure location” are employed as examples of “near departure location” and “near destination”.

(Second Embodiment)
Next, a second embodiment of the present invention will be described. This embodiment differs from the first embodiment in that “within a predetermined distance from the departure place” and “within a predetermined distance from the departure place” are adopted as examples of “near departure place” and “near destination”. It is a point. This predetermined distance may be, for example, 200 m, 300 m, or 1 km.

  By adopting such a predetermined distance, the control circuit 17 of the present embodiment performs the process shown in FIG. 4 in the route search process instead of the process of FIG. The processing of FIG. 4 is only that the processing of step 120 is replaced with step 122 and the processing content of step 155 is partially changed.

  Following step 115, the external memory 16 of the present embodiment proceeds to step 122, and determines whether or not there is a corresponding record among the plurality of records in the read backup data. The corresponding record is a record including the past current location of the position around the current location acquired at step 105 and the past destination at the location around the current location acquired at step 110.

  Here, the position around the current location means a location within the predetermined distance from the current location. Accordingly, the same position as the current location corresponds to the current location, and a location different from the current location but within the predetermined distance also corresponds.

  The position around the current destination is a position within the predetermined distance from the current destination. Therefore, the same position as the current destination corresponds, and the position different from the current destination but within the predetermined distance also corresponds.

  For example, when “a” is within the predetermined distance from the current position of the current location and “b” is within the predetermined distance from the current location of the current location, the first record in FIG. If it is determined that there is a corresponding record, the process proceeds to step 125. If it is determined that there is no corresponding record, the process skips steps 125 and 130 and proceeds to step 135 to search for the optimum route from the current location to the current destination. During this search, no passing road is set.

  In step 155, the current position and destination position acquired by the control circuit 17 this time and the position of the passing road changed or added by the user's designation operation in step 150 are set as a set of records in the external memory 16. Record additional backup data. This is the same as in the first embodiment.

  However, in this embodiment, when a record having a current location and a destination similar to the record to be recorded this time is already present in the backup data, the record already recorded in the backup data is deleted and then recorded this time. Record additional data in the record backup data.

  Here, the similarity between records will be described. The current record and the comparison target record are similar only when the current location and destination included in the record to be recorded are close to the current location and destination included in the comparison target record. To do.

  More specifically, the current location included in the record to be compared is within the predetermined distance from the current location included in the record to be recorded this time, and within the predetermined distance from the destination included in the record to be recorded this time. It is assumed that the record to be recorded this time and the record to be compared are similar only when there is a destination included in the record to be compared.

  In the first embodiment and the present embodiment, the departure place is the current position, but even if the current position is the same as the user's recognition, there are different positions as the position coordinates. For example, the north end and the south end of a parking lot correspond. Further, there is an error in the accuracy of the position detector 11. Therefore, as in this embodiment, it is possible to efficiently use past setting records of passing roads by using a common record for current locations that are not pinpointed at the same position but within a predetermined distance. it can.

  As for the destination, when the destination is set by scrolling the map displayed on the display device 12 and then specifying one point on the map with the touch panel, the user intends the same destination. Even if this is done, there will be a slight difference in position from the previously set destination. Therefore, as in the present embodiment, it is possible to efficiently use past setting records of passing roads by using a common record for destinations that are not pinpointed at the same position but within a predetermined distance. Can do.

  As described above, the control circuit 17 includes a predetermined record of the past departure point and the current destination in a predetermined vicinity (within a predetermined distance) of the current departure point (current position) in the record recorded in the external memory 16. If there is a corresponding record that includes a past destination in the vicinity of (within a predetermined distance), a route that departs from this departure point, passes through the past passing road included in the corresponding record, and reaches this destination (Corresponding to an example of the first route) is calculated (steps 115 to 140).

(Third embodiment)
Next, a third embodiment of the present invention will be described. The present embodiment is different from the second embodiment in that an automatic route (which corresponds to an example of a first route) in which a passing road is automatically added and a simple route (a second route before the passing road is automatically added) (Corresponding to an example of a route) and the comparison result is used.

  Specifically, the control circuit 17 of the present embodiment performs the process of FIG. 5 in the route search process instead of the process of FIG. 4 of the second embodiment. The process of FIG. 5 is obtained by adding steps 126, 127, 131, 132, 133, 134, and 160 and deleting step 135 to the process of FIG.

  Hereinafter, the changed part of the route search process will be described. If the control circuit 17 determines in step 122 that there is no corresponding record in the plurality of records in the backup data, and if it is determined in step 125 that there is no passing road designation data in the corresponding record, Proceed to 126. In step 126, an optimum route from the current location to the current destination is searched. During this search, no passing road is set. Thus, a route calculated from the current location to the destination without setting a passing road is called a simple route. Following step 126, the process proceeds to step 140 where the simple route obtained as a result of the search in step 126 is displayed on the display device 12.

  If the control circuit 17 determines in step 125 that there is passing road designation data in the corresponding record, the control circuit 17 proceeds to step 127 and calculates a simple route by the same process as in step 126.

  Subsequently, in step 130, the same processing as in the first and second embodiments is performed. That is, the positions of all past passing roads included in the target passing road designation data determined to exist in the immediately preceding step 125 are set as passing roads.

  Following step 130, in step 131, an optimum route from the current location to the current destination is searched. However, in this search, the route is searched on the assumption that the passing road set in the immediately preceding step 130 is one point on the road on which the route to be searched must pass. In this way, a route calculated from the current location through the point of the passing road using the passing road automatically added in step 130 to the current destination is referred to as an automatic route.

  Following step 131, in step 132, the cost ratio is calculated by comparing the costs of the simple route and the automatic route, and it is determined whether or not the calculated cost ratio exceeds a reference value T (for example, 1.2). .

  When a passing road is specified around the current location (departure point) or around the destination, there may be a case in which an automatic route with a passing road is always employed, resulting in a circuitous route that is not intended by the user. Therefore, in this embodiment, whether to use a simple route or an automatic route is determined based on a comparison of both costs.

  Specifically, as shown in FIG. 6, the current location of this time and the past current location in the corresponding record are at the same position 31, and within the range 33 within the predetermined distance from the current destination 32, It is assumed that the past destination 34 of is included. Further, it is assumed that the position 35 is included in the past passing road in the record.

  In this case, even if there is no problem for the user to set the position 35 as a route from the current location 31 to the past destination 34, the position 35 is set as the route from the current location 31 to the current destination 32. Setting it as a passing road can be a problem because it is too far away.

  Therefore, in this embodiment, the simple route 41 + 42 obtained by connecting the route 41 and the route 42 is compared with the automatic route 41 + 43 obtained by connecting the route 41 and the route 43 passing through the passing road 35 in terms of cost. The cost calculation method here uses the same calculation method as the cost used when determining whether or not the route is optimal in the route search process. Since the calculation method of the route cost is well known, a specific example thereof will not be described here.

  More specifically, a portion common to the simple route and the automatic route (that is, the route 41) is excluded, and a cost ratio of different portions, that is, a value obtained by dividing the cost of the route 43 by the cost of the route 42 is calculated as the cost. Ratio.

  If it is determined that the cost ratio exceeds a reference value T (for example, 1.2), the process proceeds to step 133 and a simple route is selected. If it is determined that the cost ratio is equal to or less than the reference value T, the process proceeds to step 134 and automatic processing is performed. Select a route.

  In this way, the cost ratio is calculated by excluding the common part between the simple route and the automatic route, and the total length becomes longer when the cost ratio of all routes from the current location to the destination 32 is compared. This is because it is difficult to reflect the effect of the roundabout route.

  In step 140 following step 133, the selected simple route is displayed. If it is determined in the following step 145 that there is no instruction for correction or addition of the passing road, the processing in FIG. Guided in the guidance process.

  In step 140 following step 134, the selected automatic route is displayed. If it is determined in step 145 that there has been no instruction for correction or addition of the passing road, the processing in FIG. Guided in the guidance process.

  In addition, the control circuit 17 proceeds to step 160 following step 155, reflects the passing road after being corrected or added in step 155, and re-searches the route from the present location to the present destination. Then, the process returns to step 140.

  As described above, the control circuit 17 according to the present embodiment calculates the automatic route 41 + 43, departs from the current departure point, does not pass the past passing road included in the corresponding record, and reaches the present destination. The simple route 41 + 42 is calculated, the costs of the automatic route and the simple route are compared, and one of the automatic route and the simple route is selected based on the comparison result and displayed to the user. By doing in this way, possibility that a user's unintended detour automatic route will be selected is reduced.

  Note that even when a simple route that does not pass through the passage road 35 is selected, the user performs an instruction operation for correcting or adding the passage road in the subsequent step 145, and adds the position 35 as a passage road in step 150. If the instruction operation is performed using the operation unit 13, the automatic route 41 + 43 is searched in the subsequent step 160, and this automatic route is guided in the route guidance process.

(Fourth embodiment)
Next, a fourth embodiment of the present invention will be described. This embodiment is a modification of the first embodiment so that multiple types of backup data are recorded in the external memory 16.

  In the external memory 16 of this embodiment, as shown in FIG. 7, backup data exists for each route search condition such as toll road priority, general road priority, and recommended road priority. Since route search conditions such as toll road priority, general road priority, and recommended road priority are well known, description thereof will be omitted.

  One or a plurality of records are recorded in the backup data for each route search condition. Each record includes a set of a past departure place (current position) acquired at a certain point in the past, a past destination designated at the point in time, and a past passing road designated at the point in time. A record included in the backup data corresponding to a certain route search condition, that is, a record associated with the route search condition includes a current location, a destination, and a passing road at the time when the route is searched under the route search condition. It consists of a pair.

  As shown in FIG. 7, even for records having the same current location a and the same destination b, the passing roads c1, c2, and c3 may be different from each other depending on the route search conditions with which the records are associated. This is because which road is preferentially used depends on the route search conditions. That is, depending on which road is used preferentially, the point that the user wants to pass through may change.

  Further, in order to use the backup data for each route search condition, the control circuit 17 according to the present embodiment executes the process of FIG. 8 instead of the process of FIG. 3 in the route search process. ing.

  8 differs from the process of FIG. 3 in that steps 114 and 116 are provided instead of step 115, and step 156 is provided instead of step 155. Hereinafter, the change part with respect to the process of FIG. 3 is demonstrated.

  After acquiring the destination in step 110, the control circuit 17 acquires one search condition (current route search condition) designated by the user in step 114 in accordance with the user's search condition designation operation on the operation unit 13. As a search condition designating operation method, for example, there is a method in which the user operates any one of three buttons of toll road priority, general road priority, and recommended road priority.

  Following step 114, in step 116, the backup memory corresponding to the search condition is read. Specifically, the backup memory corresponding to the search condition acquired in step 114 is read. Following step 116, control proceeds to step 120.

  As a result, in steps 120 to 150, the backup memory to be used is limited to the backup memory corresponding to the search condition acquired in step 114.

  Therefore, the control circuit 17 indicates that the corresponding record including the past departure place in the predetermined vicinity of the current departure place (current position) and the past destination in the predetermined vicinity of the current destination is the current route search condition. If it is recorded in the external memory 16 in association with a past route search condition that matches, the route that departs from the current departure point, passes through the past passing road included in the corresponding record, and reaches the present destination (Corresponding to an example of the first route) is calculated according to the current route search condition.

  In this way, when you want to use the toll road positively or when you want to use a general road because there is time to spare by setting the memory of the departure place (current location), passing road, and destination for each search condition For example, it is possible to set a route to be used individually for each search condition, so that the range of use can be expanded.

  Further, following step 150, in step 156, as in step 155, the current location and destination position acquired by the control circuit 17 this time, and the passing road changed or added by the user's designated operation in step 150 Are additionally recorded in the backup data in the external memory 16 as a set of records. However, the backup data of the recording destination is a backup memory corresponding to the search condition acquired in step 114.

  The records additionally recorded in this way are stored in the backup data from the set of the present location, destination, and passing road at the past time in steps 115 to 130 of the route search processing executed later with the processing contents as described above. Used as one of the records.

  In each of the above embodiments, the control circuit 17 functions as an example of an acquisition unit by executing steps 105, 110, and 114, and functions as an example of a route search unit by executing 115 to 140.

  Moreover, since the object set as the “passing road” in the above embodiment corresponds to one point on the road, it can also be expressed by the term “passing point”.

(Other embodiments)
In addition, this invention is not limited to above-described embodiment, In the range described in the claim, it can change suitably. Further, the above embodiments are not irrelevant to each other, and can be combined as appropriate unless the combination is clearly impossible. In each of the above-described embodiments, it is needless to say that elements constituting the embodiment are not necessarily essential unless explicitly stated as essential and clearly considered essential in principle. Yes. Further, in each of the above embodiments, when numerical values such as the number, numerical value, quantity, range, etc. of the constituent elements of the embodiment are mentioned, it is clearly limited to a specific number when clearly indicated as essential and in principle. The number is not limited to the specific number except for the case. Further, in each of the above embodiments, when referring to the shape, positional relationship, etc. of the component, etc., the shape, unless otherwise specified and in principle limited to a specific shape, positional relationship, etc. It is not limited to the positional relationship or the like. For example, the following modifications are allowed. In addition, the following modifications can select application and non-application to the said embodiment each independently. In other words, any combination of the following modifications can be applied to the above-described embodiment.

(Modification 1)
In the route search process, the control circuit 17 of the first to third embodiments acquires only one destination in order to calculate one route. However, the control circuit 17 may acquire a plurality of destinations in order to calculate one route in the route search process.

  For example, a case where the user designates three destinations, ie, a first destination, a second destination, and a third destination, using the operation unit 13 will be described. In this case, first, in the route search process, the control circuit 17 regards the route from the current location to the first destination as a route search in the same manner as in each of the above embodiments by regarding the first destination as the destination of each of the above embodiments. I do. Next, for the route from the first destination to the second destination, the first destination and the second destination are regarded as the current location and the destination of each of the above embodiments, respectively, and the route search is performed in the same manner as each of the above embodiments. I do. Next, the route from the second destination to the third destination (final destination) is the same as that in each of the above embodiments, regarding the second destination and the third destination as the current location and the destination of each of the above embodiments. Route search is performed in the same way. Then, the route guided by the route guidance process is created by connecting all the routes calculated by the route search.

  More specifically, first, in step 110 of FIGS. 3, 4, 5, and 8, the first destination is acquired as the current destination, and the process is performed until the processing of each of the above figures is completed. Next, in steps 105 and 110 in the above figures, the first destination and the second destination are acquired as the current location and the current destination, respectively, and the processing is continued until the processing in each diagram is completed. Next, in steps 105 and 110 in each of the above figures, the second destination and the third destination are acquired as the current location and the current destination, respectively, and the processing is continued until the processing of each diagram is completed. Then, the route guided by the route guidance process is created by connecting all the routes calculated by the above process.

  In this way, for example, if there is a record in the backup data that includes the first destination and the second destination as the past current location and destination, respectively, the first destination is set as the departure location, A route search is performed with the second destination as the destination through the past passing road (point). As a result, the finally connected routes start from the current location, pass through the first destination, the past passing road in the record, the second destination, and reach the third destination.

(Modification 2)
Although the said 4th Embodiment is implement | achieved as a deformation | transformation with respect to 1st Embodiment, it is good also as a deformation | transformation with respect to 2nd Embodiment and 3rd Embodiment. Moreover, although the said 3rd Embodiment is implement | achieved as a deformation | transformation with respect to 2nd Embodiment, it is good also as a deformation | transformation with respect to 1st Embodiment.

(Modification 3)
In the said embodiment, the navigation apparatus 1 for vehicles which performs the said route search process is an apparatus mounted in the vehicle. However, the device that executes the route search process may be a device that is not mounted on the vehicle.

  For example, a route search process may be executed by a mobile terminal carried by the user executing a predetermined program, or a server that can communicate with the user terminal via a wide area network such as the Internet executes the predetermined program. Thus, the route search process may be executed. In the latter case, the “current location” in the above embodiment may be replaced with a “departure location” that is designated by the user using the user terminal and acquired by the server via the wide area network.

1 Vehicle navigation device 16 External memory 17 Control circuit

Claims (5)

Memory in which one or more records including one set of a past departure place acquired at a certain time in the past, a past destination designated at the time, and a past passing road designated at the time are recorded. (16) and
Acquisition means (105, 110, 114) for acquiring the current departure place and the current destination designated by the user;
In the one or more records recorded in the memory, if there is a corresponding record including a past departure point at the same position as the current departure point and a past destination point at the same position as the current destination, A route provided with route search means (115-140) that departs from the current departure point, passes through a past passage road included in the corresponding record, and calculates a first route to the current destination. Search device.   In the one or more records recorded in the memory, the route search means is within a predetermined distance from the previous departure point and the current destination within the predetermined distance from the current departure point. If there is a corresponding record including a past destination, the first route that departs from the current departure point, passes through a past passing road included in the corresponding record, and reaches the current destination is calculated. The route search device according to claim 1.   The route search means calculates the first route (41, 43), departs from the departure point of the current time, does not pass the past passing road included in the corresponding record, and moves to the current destination. The second route (41, 42) to be reached is calculated, the costs of the first route and the second route are compared, and one of the first route and the second route is selected based on the comparison result. The route search device according to claim 1, wherein the route search device displays the information to the user. In the memory, a record including one set of a past departure place acquired at a certain time in the past, a past destination designated at the time, and a past passing road designated at the time is stored in the memory. Recorded in association with past route search conditions used in
The acquisition means further acquires the current route search condition,
The route search means is configured such that a corresponding record including a past departure place at the same position as the current departure place and a past destination at the same position as the current destination matches the current route search condition. If it is recorded in the memory in association with a past route search condition, the first departure from the current departure point, passing through a past passage road included in the corresponding record, and reaching the current destination. 4. The route search device according to claim 1, wherein one route is calculated according to the current route search condition. 5. Memory in which one or more records including one set of a past departure place acquired at a certain time in the past, a past destination designated at the time, and a past passing road designated at the time are recorded. A route search program used for a route search device having (16),
A control circuit (17) included in the route search device;
An acquisition means (105, 110, 114) for acquiring a current departure point and a current destination specified by the user, and the same position as the current departure point in the one or more records recorded in the memory If there is a corresponding record that includes a past departure point of the current time and a past destination at the same position as the current destination, leave the current departure point, pass through the past passing road included in the corresponding record, A route search program that functions as route search means (115-140) for calculating a first route to the destination at this time.

Images