JP2007212265A - Route presentation device - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To improve convenience when selecting the optimum route from among a plurality of routes. <P>SOLUTION: Past traveling routes R1-R3 from a starting place to a destination are stored beforehand; and when acquiring a new starting place (spot A) and a new destination (spot B), the past traveling routes R1-R3, corresponding to the new destination (spot B) from the new starting place (spot A), are retrieved. When the plurality of retrieved past traveling routes R1-R3 exist, sections (route branch sections) C2-C6 where the route is branched and some route is required to be selected are extracted in the plurality of past traveling routes R1-R3 from the starting place to the destination, and the route branch sections C2-C6, extracted based on a road map, are displayed. <P>COPYRIGHT: (C)2007,JPO&INPIT

Description

  The present invention relates to an apparatus for presenting information on a route to a destination.

  There has been known an apparatus that displays a travel route that has traveled in the past and allows an occupant to select an optimal route from these routes (see, for example, Patent Document 1).

Prior art documents related to the invention of this application include the following.
Japanese Patent Laid-Open No. 08-082527

  However, in the above-described conventional apparatus, since all routes from the departure place to the destination that have traveled in the past are displayed and the passenger is allowed to select any one, for example, as shown in FIG. If the route is branched in a part of the route to the destination, and there are multiple routes to be selected, it is necessary to stare at that portion or select the route by enlarging the route. In addition, there is a problem in that convenience is poor because it is necessary to select a route that has almost no difference in travel distance and no problem is selected.

  Memorize the route from the departure point to the destination you drove in the past, and when you get a new departure point and destination, search the past departure route corresponding to the destination from the new departure point, If there are multiple travel routes, extract the section (route branch section) from which the route has branched in the past multiple travel routes from the departure point to the destination, and one of the routes must be selected, and the road map The route branch section extracted based on is displayed.

  According to the present invention, it is easy to see a route to be selected in a route branch section, and convenience for route selection operation can be improved.

  An embodiment in which the present invention is applied to a vehicle navigation apparatus will be described. In addition, this invention is not limited to a vehicle-mounted navigation apparatus, It can apply to all the route presentation apparatuses which display the path | route to the destination.

  FIG. 1 is a diagram illustrating a configuration of a vehicle navigation device according to an embodiment. In addition, illustration and description of a navigation device not directly related to the route presenting device of the present invention are omitted. The GPS receiver 1 detects the current position of the vehicle by satellite navigation. The distance sensor 2 detects the travel distance of the vehicle based on a signal from a sensor that outputs a pulse signal for each predetermined travel distance. The direction sensor 3 detects the traveling direction of the vehicle. The controller 7 to be described later detects the current position of the vehicle by autonomous navigation based on the travel distance of the vehicle detected by the distance sensor 2 and the traveling direction detected by the direction sensor 3.

  The VICS receiver 4 receives FM multiplex broadcasting, radio beacon broadcasting, optical beacon broadcasting, and the like, and obtains traffic information such as road traffic jam information, regulation information, and construction information. The road map storage device 5 stores road map data. Each road is represented by nodes such as intersections and inflection points and links connecting them, and each node data includes position information of latitude and longitude, link connection information of branch and merge, etc. Includes road type information.

  The input device 6 includes operation members such as direction keys and various switches for setting a destination and selecting a travel route, and inputs various information to the controller 7 and performs a display operation of the display device 9.

  Here, when the occupant does not set the destination by the input device 6, the destination can be predicted by the following method and used for route selection described later. From work to customers and customers, we often head from the same departure location to the destination on the day of the week and time, so when we go from a certain departure location to a certain destination, the departure location, destination and day of the week And trip time are recorded as trip data, and when the vehicle departs from a certain departure place, the trip data with the same departure location, day of the week and time is searched from the recorded data, and the trip data with the same departure location, day of the week and time is recorded. If so, the trip data destination is predicted as the current destination.

  Also, since the same route is often used every time when heading to the same destination, roads that have passed in the past are recorded as passing data for each departure point and destination, and the road that is currently running Is searched from the passing data, and if the road currently being traveled is recorded, the destination is predicted as the current destination. In the determination of coincidence or discrepancy between the recorded departure place and the actual departure place, the distance between the actual departure place and the recorded departure place is within the reference distance for determining the same point, for example, within 40 m. If there is, it shall be the same point.

  The controller 7 includes a CPU 7a, a ROM 7b, a RAM 7c, and the like, and searches for an optimum route to the destination, route guidance for guiding the destination along the optimum route, display control of the road map of the display device 9, and the like.

  The travel data storage device 8 is a storage device that stores route data from a departure place that has traveled in the past to a destination. Details of the route data storage method will be described later. The display device 9 displays the optimum route to the destination, the current location of the vehicle, the traffic jam and the restriction information on the road map around the current location of the vehicle at the time of route guidance, and displays a selectable route at the time of route search. The speaker 10 performs route guidance by voice, and also provides voice guidance regarding selectable routes during route search. The ignition switch 11 is a switch that is turned on when the ignition key of the vehicle is set to the ON position.

  Here, a route presentation method according to an embodiment will be described. In general, a vehicle occupant tends to select a route traveled in the past when there are a plurality of routes to a destination. For example, as shown in FIG. 2, when there is a selectable route such as R1 to R3 on the way from the departure point to the destination, the route traveled in the past and the traffic information of each route R1 to R3 are used. To select this route.

  FIG. 3 shows the route shown in FIG. 2 divided by a branch point and a junction. It is necessary to select a route that passes through the sections C2 to C6 in the middle of the route from the starting point to the destination, and this time based on the route information that has passed in the past and the traffic information in this section C2 to C6. Select the route. In the traffic information of the sections C2 to C6, for example, as shown in FIG. 4, for example, the congestion section is generally represented by an arrow on the entire route map from the departure place to the destination.

  However, in order to select the route of a part of the sections C2 to C6 in the middle of the route from the entire route map from the departure point to the destination as shown in FIG. Therefore, it is necessary to stare at the section C2 to C6 or to enlarge the section C2 to C6 to select the route of the section C2 to C6, which is not convenient.

  Therefore, in this embodiment, when the route from the departure point to the destination is branched into a plurality of travelable routes, only such a route branch section is extracted and shown in FIG. Thus, only the route branch section is displayed on the display screen, and the traffic information is superimposed and displayed. The route branch section shown in FIG. 5 is obtained by displaying a traffic congestion section with arrows on the route branch sections C2 to C6 in the route from the departure place to the destination shown in FIG. By adopting such a presentation form, it becomes easier for the occupant to confirm the traffic information of each of the sections C2 to C6 in the route branch section, and it is not necessary to stare at the display screen or to enlarge the route branch section. improves.

  In this specification, for example, as shown in FIG. 2 and FIG. 3, when there are a plurality of routes (R1, R2, R3) from the departure place to the destination, a section that always passes through any route. C1 and C7 are divided into sections C2 to C6 that have branches and merges in the route and may not pass depending on the route, and the latter section C2 to C6 is determined as a route section that must be determined as to which section to pass. For example, as shown in FIG. 5, traffic information is superimposed on the “route branch section” and presented to the passenger. In other words, the “route branch section” is a route section in which a route has branched in a plurality of past travel routes from the departure point to the destination and one of the routes must be selected.

  Next, the operation of storing route data from the departure point to the destination by the controller 7 will be described. The controller 7 stores the starting point, destination, and road link data of one trip in the travel data storage device 8 as one trip route data. Here, one trip means the operation of the vehicle from the point where the engine is started (this is the starting point) to the point where the engine is stopped (this is the destination). The 1-trip road link data is recorded in the order in which the road links passed during one trip are passed. Furthermore, points such as the starting point and destination are represented by latitude and route and stored as point information.

  A specific route data storage method will be described with reference to FIG. Assume that the vehicle travels between points A and B shown in FIG. 6 in the following order. Travel from point A through point R1 to point B during the first vehicle operation, travel from point B through route R4 to point A during the second vehicle operation, and route from point A during the third vehicle operation It is assumed that the vehicle has traveled to point B through R2. Furthermore, the vehicle travels from point B through route R4 to point A during the fourth vehicle operation, travels from point A through route R3 to point B during the fifth vehicle operation, and operates at point B during the sixth vehicle operation. Suppose that it traveled to point A through route R4. It is assumed that the engine has been started and stopped at points A and B, and the engine starting point is the starting point and the engine stopping point is the destination.

  First, when the vehicle travels from the point A through the route R1 to the point B in the first vehicle operation, the controller 7 makes a trip for the point A as the departure point and the point B as the destination as shown in FIG. The road link data of the route R1 is stored in the road link data. Similarly, when the vehicle travels from point B through route R4 to point A in the second vehicle operation, the controller 7 additionally stores the current one-trip route data as shown in FIG. When traveling from the point A through the route R2 to the point B in operation, the controller 7 additionally stores the current one-trip route data as shown in FIG.

  However, when the vehicle travels from the point B through the route R4 to the point A in the fourth vehicle operation, the same one trip route data is already stored in the travel data storage device 8, so that the fourth vehicle operation Do not store duplicate route data. By repeating such a storage operation, a plurality of 1-trip route data as shown in FIG. 10 is stored in the travel data storage device 8 when the first to sixth vehicle operations are completed.

  Next, the search operation of 1 trip route data by the controller 7 will be described. When the starting point and the destination are determined, the controller 7 searches the one trip route data stored in the travel data storage device 8 and reads the one trip route data corresponding to the starting point and the destination at the time of the current vehicle operation. . It is assumed that the travel data storage device 8 stores a plurality of one-trip route data as shown in FIG. 10 by the first to sixth vehicle operations.

  Now, assuming that the engine is started at the point A during the seventh vehicle operation and the occupant sets the point B as the destination, or the controller 7 predicts the point B as the destination, the controller 7 is the driving data storage device. 1 trip route data stored in 8 is retrieved, and all 1 trip route data corresponding to the departure point A and destination B are read. FIG. 11 shows the read one trip route data of the departure place A and the destination B, and FIG. 12 shows the read routes R1 to R3.

  When the controller 7 reads out one trip route data from the travel data storage device 8 and there are a plurality of one trip route data, that is, there are a plurality of routes from the departure point A to the destination B, As described above, of the plurality of routes from the departure point A to the destination B, the route is divided into a section that always passes through any route and a portion that does not pass depending on the route. The section is extracted as the “route branch section”.

  The method for extracting the “route branch section” will be specifically described with reference to FIGS. 12 and 13. Now, as shown in FIG. 12, it is assumed that three routes R1, R2, and R3 from the departure point A to the destination B are extracted from the travel data storage device 8. First, the routes R1 to R3 are divided into sections C1 to C7 as shown in FIG. 13 with the branch point and the junction as a boundary. Next, the routes R1 to R3 passing through each section C1 to C7 are confirmed. Then, it is divided into sections C1 and C7 that always pass through any route and sections C2 to C6 that may not pass depending on the route, and the latter is referred to as a “route branch section”.

  FIG. 14 shows the extracted route branch section. As shown in FIG. 15, the display device 9 displays traffic information such as traffic jam information and traffic regulation information of the sections C2 to C6 superimposed on the route branch section.

  As shown in FIG. 16, when a plurality of route branch sections AE1 and AE2 exist between the departure point and the destination, one route branch section AE1 is displayed first as shown in FIG. Next, the other route branch section AE2 is displayed, for example, for each of the route branch sections AE1 and AE2.

  FIG. 18 is a flowchart illustrating main processing according to an embodiment. This main processing program is stored in the ROM 7b of the controller 7, and the CPU 7a of the controller 7 repeatedly executes this main program when the ignition switch 11 is turned on.

  The point where the ignition switch 11 is turned on in step 1 is acquired by the GPS receiver 1 and set as the departure point. At this time, the current location may be detected by autonomous navigation based on the travel distance detection result of the distance sensor 2 and the traveling direction detection result of the direction sensor 3 and used instead of the current location obtained by the GPS receiver 1. In the subsequent step 2, the destination set by the occupant is obtained from the input device 6. If the occupant has not set a destination, the destination is predicted by the above-described method.

  In step 3, as described above, route data corresponding to the departure point and destination at the time of the current vehicle operation is acquired from a plurality of one-trip route data stored in the travel data storage device 8 (FIG. 11). FIG. 12). Next, in step 4, the route branch section extraction subroutine shown in FIG. 19 is executed to extract the “route branch section” from the route from the departure place to the destination as described above.

  In step 10 of FIG. 19, the route from the starting point to the destination acquired from the travel data storage device 8 is divided into sections with the branch point and the junction as the boundary (see FIG. 13). In step 11, a route that passes through the section is determined, and in a subsequent step 12, a section in which all the routes do not pass is extracted as a route branch section (see FIG. 14).

  In step 5 of FIG. 18 after the route branch section is extracted, traffic information such as traffic congestion and regulations is superimposed on the route branch section and displayed on the display device 9 and presented to the passenger (see FIG. 15).

  In the above-described embodiment, an example is shown in which all 1 trip route data is stored in the travel data storage device 8 as long as all travel routes do not overlap. Since it is considered as a failed route, a route where a passenger picks up a friend, or a route detoured, such route data may be deleted. Note that a route that returns to the original section from the middle of the route can be judged as a route that failed to be detoured or a route that was detoured, and other routes that do not open or close the door on the way If the door is opened or closed on the way, it can be determined that the friend has been picked up and the route data may be deleted. Thereby, the storage capacity of the travel data storage device 8 can be reduced.

  Moreover, when deleting route data as a route with a low operation frequency, it may be determined whether or not the route data is deleted according to the frequency with which the occupant operates the vehicle. For example, for a passenger who operates a vehicle by commuting every day, the route that passes only once a week is deleted, and for a passenger who operates a vehicle only twice a week, it is 1 per week. The route data is not deleted even if the route passes only once. Thereby, 1 trip route data according to the vehicle operation frequency for each occupant can be accumulated, and an optimum route according to the vehicle operation frequency for each occupant can be presented based on the accumulated data.

  When there are multiple routes from a certain starting point to a destination, and the distances or travel times of those routes are compared, a route that is clearly long or has a long travel time, for example, the average distance of multiple routes Alternatively, a route that is 1.7 times or more of the average travel time may be deleted as a route that is not worth selecting as a passenger. As a result, a route having a long distance or a route that requires a required travel time can be excluded in advance, and only a route having a high value can be presented as an occupant selection target. Further, by deleting route data that is not worth selecting as a passenger, the storage capacity of the travel data storage device 8 can be reduced.

<< Modification of Embodiment >>
In the above-described embodiment, an example in which all the extracted route branch sections are displayed and presented to the occupant has been shown. However, there may be a plurality of sections having a short distance from branching to joining in the path branching section. For a plurality of sections having such a short distance, no matter which section is selected, there is no big difference when viewed from all the routes from the departure point to the destination.

  Therefore, in this modified example, when there are a plurality of sections having a short distance from a certain branch point to a certain junction in the route branch section, the section having a long distance is deleted. As a result, the number of determination routes and the number of determinations when the occupant selects any one of the route branch sections can be reduced, and an optimum route can be selected in a short time.

  A method of presenting a route branch section according to a modification will be described with reference to the route shown in FIG. In FIG. 20, a route branch section exists in the middle of routes R11, R12, R13 from the departure point A to the destination B. FIG. 21 shows a route branch section extracted from the routes R11 to R13 by the method described above. In this route branch section, there are sections C1 to C5 from the branch point to the junction or the next branch point. Among these sections, sections C3 and C4 are both short in distance as shown in FIG. 22, and no matter which one is selected, there is no significant difference when viewed from all the routes from departure point A to destination B.

  Therefore, in this modified example, C4 having a long distance between the sections C3 and C4 is deleted. It should be noted that it is desirable to set an optimum distance for the reference distance for determining whether or not to delete based on whether or not it is worth selecting for the passenger. In this modification, the determination reference distance is set to 4 km, for example, and a section of 4 km or less is a section that is not worth selecting as a passenger.

  FIG. 24 is a flowchart showing a route branch section extraction routine according to a modification. With reference to this flowchart, a route branch section extraction process according to a modification will be described. The configuration and main processing of this modification are the same as the configuration and main processing of the embodiment shown in FIGS. 1 and 18, and illustration and description thereof are omitted. Further, the route R11 to R13 from the departure point A2 to the destination B2 as shown in FIG. 20 and the route branching section shown in FIG. 21 in those routes R11 to R13 will be described as an example.

  In Step 20 after completing the processing of Steps 10 to 12 shown in FIG. 19, the start point is a branch point and the end point is a merge point in the sections C1 to C5 divided at the branch point and the merge point in the route branch section. Extract a section that is a point. In the sections C1 to C5 of the path branch section shown in FIG. 21, the sections C1, C3, and C4 all have a start point as a branch point and an end point as a junction. On the other hand, both the start point and the end point of the section C2 are branch points, and the start point and the end point of the section C5 are both junction points.

  In step 21, the section having the smallest distance among the extracted sections C 1, C 3 and C 4, here section C 3 = 3.1 km, is extracted, and the section having the same branch point as section C 3, here section C 4 = 4. 2 km is extracted, and the average distance K = (3.1 + 4.2) /2=3.65 km of these sections C3 and C4 is obtained.

  In subsequent step 22, it is confirmed whether or not the average distance K is equal to or less than the above-described deletion determination reference distance, for example, 4 km. If the average distance K exceeds 4 km, the route branch section extraction process is terminated, and if the average distance K is 4 km or less, the process proceeds to step 23. In step 23, the section where the average distance K is equal to or less than the reference distance 4 km, here the longer section C4 of C3 and C4 is deleted. FIG. 23A shows a route branch section after the deletion process.

  In step 24, the branch point and the merge point are reconfigured in the route branch section after the deletion process. In other words, the route is re-segmented at the new branch point and the merge point, and the route branch section shown in FIG. Then, it returns to step 20 and repeats the process mentioned above. That is, the processes of steps 20 to 23 described above are repeated in the reconstructed route branch section.

  In the reconstructed route branch section shown in FIG. 23B, the section C1 = 14 km having the minimum distance is extracted, and the section C6 = 18.5 km having the same branch point as the section C1 is extracted. However, the average distance K between the sections C1 and C6 is 16.25 km, which exceeds the deletion determination reference distance 4 km. Therefore, the route is worth selecting one of the passengers, and the route branching section extraction process is performed without performing the deletion process. Exit.

  In the above-described modification, an example in which the longer one is deleted when there are a plurality of sections with a short distance from the branch point to the junction in the route branch section is obtained. If there are a plurality of sections where the time is not more than a predetermined time, for example, there are a plurality of sections where the required travel time from the branching to the merge is 5 minutes or less, the longer one may be deleted.

  The distance or the required travel when the average distance or the average required travel time of multiple sections with a short required travel time is less than or equal to the deletion judgment reference value in the route branch section You may delete sections that take a long time, or the distance or required travel time of multiple sections that are less than or equal to the deletion criterion value in the distance or required travel time from the branch point to the junction in the route branch section You may delete the longer one.

  In addition, an example in which the longer one is deleted when there are a plurality of sections with short distances or required travel times from the branch point to the junction in the route branch section is shown, but the history data of the usage frequency of the section is stored. In addition, a section with a low usage frequency may be deleted. Alternatively, if there is a congested section among the plurality of sections, the congested section may be deleted.

  If there is a parallel section with a short distance or time, there is no problem in selecting either from the whole route from the departure point to the destination, so the longer distance or time, the less frequent use in the past By automatically deleting a congested road as a section that is not worth selecting by the occupant, it is not necessary for the occupant to perform an operation for selection, and convenience can be further improved.

  In the above-described embodiment and its modification, the example in which the point where the ignition switch 11 is turned on is the starting point of the vehicle and the point where the ignition switch 11 is turned off is the destination of the vehicle. The acquisition method is not limited to the method described above. For example, when an occupant inputs a destination to the navigation device and instructs a route search, the input destination is set as the vehicle destination, and the point where the route search is instructed is determined. The starting point may be detected by satellite navigation or autonomous navigation.

  The correspondence between the constituent elements of the claims and the constituent elements of the embodiment is as follows. That is, the road map storage device 5 is the map storage means, the GPS receiver 1, the distance sensor 2, the direction sensor 3 and the controller 7 are the departure place storage means, the input device 6 and the controller 7 are the destination acquisition means, and the travel data The storage device 8 is the travel route storage means and the operation frequency storage means, the controller 7 is the route search means, the branch section extraction means, the section information acquisition means and the route deletion means, the display device 9 is the display means, and the VICS receiver 4 is the Each of the traffic information acquisition means is configured. The above description is merely an example, and when interpreting the invention, the correspondence between the items described in the above embodiment and the items described in the claims is not limited or restricted.

  As described above, according to one embodiment, a route from a departure place that has traveled in the past to a destination is stored, and when a new departure place and a destination are acquired, the new departure place and the destination are handled. Search past travel routes, and if there are multiple past travel routes searched, the route must be selected in the past multiple travel routes from the departure point to the destination. Since the section (route branch section) is extracted and the route branch section extracted based on the road map is displayed, it becomes easier to see the route to be selected for the route branch section, and the convenience for the route selection operation is improved. Can do.

  In addition, according to one embodiment, since the traffic information is superimposed on the route branch section and displayed, the traffic information of the route branch section becomes easy to see, and an optimum route without traffic jams or restrictions can be easily selected. be able to.

  Further, according to one embodiment, in the route branch section, there are a plurality of sections where the branch point and the junction point are both the same, and when the distance or the required travel time of those sections is a predetermined value or less, Since the section where the distance or the required travel time is long is not displayed, it is possible to exclude the section that is not worth selecting from the route branching sections from the selection operation, and to select the optimum route in a short time. it can.

  According to one embodiment, when there are a plurality of sections having the same branch point and confluence in the route branch section, and the distance or the required travel time of those sections is less than or equal to a predetermined value, the travel frequency Since the section with a small amount is not displayed, the section having no value as the selection target can be excluded from the selection operation from the route branch sections, and the optimum route can be selected in a short time.

  According to an embodiment, there are a plurality of sections having the same branching point and confluence in the route branching section, and when the distance or the required travel time of these sections is less than or equal to a predetermined value, Since the congestion information of the section is acquired and the section with a high degree of congestion is not displayed, it is possible to exclude the section having no value as the selection target from the route branching section from the selection operation, and the optimum route in a short time Can be selected.

  According to one embodiment, since a travel route having a low travel frequency is deleted from past travel routes stored in the travel data storage device, a route not worthy of selection is excluded from the selection operation. In addition, the storage capacity of the travel data storage device can be reduced.

  According to one embodiment, for the occupant with low vehicle operation frequency, the travel route is not deleted even if the travel frequency is low, so the selection target route corresponding to the vehicle operation frequency of the occupant is stored. I can leave.

  According to one embodiment, a route having the same starting point and destination is extracted from the routes stored in the travel data storage device, and the distance or the required travel time is compared with the distance or the required travel time of another route. Since the route longer than the predetermined multiple is deleted, it is possible to exclude a route that is not valuable as a selection target from the selection operation, and to reduce the storage capacity of the travel data storage device.

  According to one embodiment, a route having the same starting point and destination is extracted from routes stored in the travel data storage device, and a route in which the opening / closing of the vehicle door is stored is deleted along the route. As a result, it is possible to exclude routes that are not worth selecting as a selection target such as a route that picks up a friend or a route that detours, and the storage capacity of the travel data storage device can be reduced. .

It is a figure which shows the structure of one embodiment. It is a figure which shows the several path | route from the departure place to the destination. FIG. 3 is a diagram showing a plurality of paths shown in FIG. 2 separated by a branch point and a junction. It is a figure which shows the example which listed and displayed the traffic information on the some path | route from a departure place to the destination. It is a figure which shows the example of a display of the route branch area of one Embodiment. It is a figure which shows the example of a path | route from the departure place to the destination for demonstrating the memory | storage method of route data. It is a figure explaining the storage method of 1 trip route data. It is a figure explaining the storage method of 1 trip route data. It is a figure explaining the storage method of 1 trip route data. It is a figure explaining the storage method of 1 trip route data. It is the figure which extracted 1 trip route data from the point A to the point B. FIG. It is a figure which shows the example of a path | route for demonstrating the extraction method of a route branch area. It is a figure which shows the example of a path | route for demonstrating the extraction method of a route branch area. It is a figure which shows the path | route branch area extracted from the path | route shown in FIG. 12 and FIG. It is a figure which shows the example of a display which superimposed and displayed the traffic information on the route branch area. It is a figure in case there are a plurality of route branch sections between the departure point and the destination. It is a figure which shows the display method when there exist several route branch sections between the departure place and the destination. It is a flowchart which shows the main process of one Embodiment. It is a flowchart which shows the route branch area extraction subroutine of one Embodiment. It is a figure which shows the example of a path | route from the departure place to the destination. It is a figure which shows the route branch area extracted from the route shown in FIG. It is a figure explaining the deletion method of a section with short distance. It is the figure which deleted the section with short distance, and reconstructed the route branch section. It is a flowchart which shows the route branch area extraction subroutine of a modification.

Explanation of symbols

DESCRIPTION OF SYMBOLS 1 GPS receiver 2 Distance sensor 3 Direction sensor 4 VICS receiver 5 Road map storage device 6 Input device 7 Controller 8 Travel data storage device 9 Display device 10 Speaker 11 Ignition switch

Claims (9)

Map storage means for storing a road map;
A departure point acquisition means for acquiring a departure point;
A destination acquisition means for acquiring a destination;
Travel route storage means for storing a route from the departure place to the destination that has traveled in the past;
A route search means for searching for a past travel route corresponding to the destination from the new departure location from the travel route storage means when a new departure location and destination are acquired by the departure location acquisition means and the destination acquisition means; ,
When there are a plurality of past travel routes searched by the route search means, the route is branched in the plurality of past travel routes from the departure point to the destination, and one of the routes must be selected (hereinafter referred to as a route). Branch section extraction means for extracting a route branch section),
A route presentation apparatus comprising: a display unit that displays a route branch section extracted by the branch section extraction unit based on a road map of the map storage unit. The route presentation device according to claim 1,
A traffic information acquisition means for acquiring traffic information is provided.
The route display device, wherein the display means superimposes and displays the traffic information acquired by the traffic information acquisition means on the route branch section. In the route presentation device according to claim 1 or 2,
The route branch section is divided into a plurality of sections with a branch point and a junction as a boundary, and includes section information acquisition means for acquiring the distance of each section or the required travel time,
The display means includes a plurality of sections having the same branching point and merging point in the route branch section, and the distance or the required travel when the distance or the required travel time of those sections are equal to or less than a predetermined value. A route presenting apparatus characterized by not displaying a section having a long time. In the route presentation device according to claim 1 or 2,
The route branch section is divided into a plurality of sections with a branch point and a junction as a boundary, and provided with section information acquisition means for acquiring the distance of each section or the required travel time,
The travel route storage means stores a travel frequency for each section traveled in the past,
The display means stores the travel route memory when there are a plurality of sections having the same branch point and merge point in the route branch section, and the distance or required travel time of these sections is less than or equal to a predetermined value. A route presenting apparatus characterized in that travel frequencies of those sections are acquired from the means, and sections with a low travel frequency are not displayed. The route presentation device according to claim 2,
The route branch section is divided into a plurality of sections with a branch point and a junction as a boundary, and includes section information acquisition means for acquiring the distance of each section or the required travel time,
The display means obtains the traffic information when there are a plurality of sections having the same branching point and merging point in the route branching section, and the distance or the required travel time of those sections is equal to or less than a predetermined value. A route presenting apparatus characterized in that it acquires traffic information of those sections from the means and does not display sections with a high degree of traffic congestion. In the route presentation device according to any one of claims 1 to 5,
The travel route storage means stores a travel frequency for each route traveled in the past,
A route presentation device comprising route deletion means for deleting a travel route having a low travel frequency from past travel routes stored in the travel route storage means. The route presentation device according to claim 6,
It is provided with operation frequency storage means for storing the vehicle operation frequency for each occupant,
The route deletion device according to claim 1, wherein the route deletion means does not delete the travel route even if the travel frequency is low for an occupant with a low vehicle travel frequency stored in the travel frequency storage means. In the route presentation device according to any one of claims 1 to 5,
A route having the same starting point and destination is extracted from the routes stored in the travel route storage means, and the distance or required travel time is longer than a predetermined multiple compared to the distance or required travel time of other routes. A route presentation device comprising route deletion means for deleting a route. In the route presentation device according to any one of claims 1 to 5,
A door opening / closing detection means for detecting opening / closing of the vehicle door;
The travel route storage means stores opening and closing of the vehicle door during the route,
A route deletion unit is provided for extracting a route having the same starting point and destination from the routes stored in the travel route storage unit and deleting a route in which the opening / closing of the vehicle door is stored in the middle of the route. A route presentation device.

Images