JP2008089603A - Apparatus and method for displaying route information - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a route information display apparatus for computing branch points in routes to a plurality of inputted destinations and controlling the mode of the information through the use of the branch points. <P>SOLUTION: The route information display apparatus comprises a departure location input part 1012 for detecting a current location of a user; a plurality-of-destination input part 1004 for receiving input of a plurality of destinations; a first route search part 1005 for searching each route to the plurality of destinations from the current location; a branch point computation part 1007 for computing branch points of each searched route; and a route information display part 1011 for displaying information on routes to the branch points and information on routes after the branch points in different modes. By computing branch points of the plurality of inputted destinations and providing information in consideration of the branch points, the route information display apparatus aids the user to easily grasp information. <P>COPYRIGHT: (C)2008,JPO&INPIT

Description

  The present invention relates to a destination display device that displays a destination of a user, and particularly to a destination display device applied to a mobile terminal device such as a car navigation system (hereinafter referred to as a car navigation system).

Conventionally, there is a device that inputs a keyword such as “restaurant” in a mobile terminal such as a car navigation system and displays information related to a destination corresponding to the searched keyword (Patent Document 1). Also, there is an apparatus that inputs a single destination and searches for a plurality of routes to the destination, and displays the plurality of searched routes and their branch points in a simplified diagram (Patent Document 2).
JP 2004-132984 A JP 2005-91249 A

  However, the display of information related to a plurality of destinations searched in Patent Document 1 merely displays a list of searched destinations. Therefore, when displaying route information, traffic information, etc. to each searched destination that is generally required by the user, it is necessary to select and display the destinations one by one, and compare them. It was difficult to grasp.

  In addition to the route information to each destination, the information required by the user is often information about a branch point that is a boundary between a portion different from a common portion in a route to each destination. For example, a branch point is a point that will always pass regardless of the destination, the predicted arrival time to the branch point and traffic information are important information for the user, and further after the branch point There may be times when you need to arrive at your destination.

  On the other hand, in terms of calculation of a branch point, Patent Document 2 searches for a plurality of movement paths for one input destination, and calculates a branch point from the coincidence point and the difference of the searched movement paths. Device. However, there is only one destination in Patent Document 2, and branch points at a plurality of different destinations are not calculated as in the present invention.

  For this reason, there is a problem that it is difficult for the user to obtain effective support for making a decision when selecting one of a plurality of different destinations as a destination and consciously selecting a branch point.

  Accordingly, an object of the present invention is to provide a route information display device that calculates branch points in a plurality of routes to a plurality of destinations that are input and controls the state of information using the branch points.

  In order to solve the above-described problems, a route information display device according to the present invention includes a departure point input unit that receives an input of a departure point, a plurality of movement destination input units that receive inputs of movement destinations at a plurality of different points, and the departure point. Route search means for searching the route from the destination to each destination as a point sequence, a branch point calculation means for calculating a final point among points common to each route as a branch point, and a route using the branch point Route information display means for displaying information on

  The route information display device according to the present invention includes, for example, a predicted arrival time and traffic jam information to a branch point required by the user among information regarding routes to a plurality of destinations that are input, and each movement after the branch point It is possible to easily grasp information necessary for the user, for example, by displaying the information about the previous route in comparison.

  The route information display device according to the present invention includes a departure point input unit that receives an input of a departure point, a plurality of movement destination input units that receive an input of a destination of a plurality of different points, and a distance from the departure point to each of the destinations. Route search means for searching for a route as a point series, branch point calculation means for calculating a final point among points common to each route as a branch point, and route information for displaying information about the route using the branch point Display means, the display means based on the distance from the departure point to the branch point calculated by the branch point calculation means, information on the route from the departure point to the branch point, or the branch Information on a route from a point to the destination is displayed.

  In the route information display device, when the distance from the departure point to the branch point calculated by the branch point calculation unit is longer than a predetermined distance, the display unit displays the distance from the departure point to the branch point. Information about the route may be displayed.

  In the route information display device, when the distance from the departure point to the branch point calculated by the branch point calculation unit is shorter than a predetermined distance, the display unit displays the distance from the branch point to the destination. Information about the route may be displayed.

  Further, in the route information display device, the display means determines a route according to a ratio of a distance from the departure point to the branch point calculated by the branch point calculation unit and a distance from the branch point to the destination. The information regarding may be changed and displayed.

  Furthermore, the present invention can be realized not only as such a route information display device but also as a route information display method or a computer program.

  The route information display apparatus according to the present invention will be described below with reference to the drawings.

  Note that the route information display device described in the claims is mainly described in the first embodiment and a modification regarding the display mode in the first embodiment. The second embodiment, the third embodiment, and the fourth embodiment are described for explaining other suitable modifications.

(Embodiment 1)
FIG. 1 is a system configuration diagram illustrating an example of a route information display device according to the present embodiment. This route information display device is realized as, for example, a car navigation system, and may be configured using a car navigation system main body, a vehicle-mounted display, and a GPS (Global Positioning System) receiver.

  The category input unit 1001 is a means for inputting, for example, a category or the like that is a keyword for searching for a destination. This category is an example of the classification of the destination. The map information accumulating unit 1003 is a means for accumulating facility information and map information. Based on the map information accumulated in the map information accumulating unit 1003, a plurality of destination search units 1002 selects destinations corresponding to the above categories. A plurality of searches are performed and input to a plurality of movement destination input units 1004.

  In general, when searching for a destination in a car navigation system, the name of the destination or the like is directly input, or for example, a destination is searched by inputting a category and set as a destination in many cases. Also in the present embodiment, a plurality of destinations may be input directly by a plurality of destinations by a plurality of destination input unit 1004, or a category is input by category input unit 1001 and a destination corresponding to the category. May be searched by the multiple destination search unit 1002 and used as the input value of the multiple destination input unit 1004.

  The departure point input unit 1012 is a means for inputting a departure point. The user inputs a predetermined departure place by himself / herself. In the present embodiment, the departure point input unit 1012 may be configured with a GPS or the like, and may be a means for detecting the current position of the user, and the current point of the search may be the departure point. In the present embodiment, it is assumed that the departure point input unit 1012 is a means for detecting the current position of a user configured by GPS, for example, at a predetermined interval, and inputs the current position to be searched as the departure point.

  FIG. 2 is a diagram showing a display example of the route information display unit 1011 which is a car navigation screen. The screen shown in FIG. 2 displays map information and the like regarding the current position based on the current position of the user detected by the departure point input unit 1012 and the map information stored in the map information storage unit 1003. Further, the screen shown in FIG. 2 shows an example of category input. For example, the category “golf course” is input in the “category input” window in the upper right of the screen, and a plurality of destinations corresponding to this category “golf course” are searched by the plurality of destination search unit 1002. .

  The multiple destination search unit 1002 is a means for searching for a plurality of destinations corresponding to the input category based on the map information stored in the map information storage unit 1003. Note that the search range may be narrowed based on the current position of the user detected by the departure point input unit 1012.

  FIG. 3 is a map showing the positional relationship of the searched destinations. This indicates that “Sakura Golf Course” and “Miyazato Golf Course” are searched as destinations corresponding to the input category “Golf Course”. Next, a plurality of destinations searched for are input to a plurality of destination input units 1004, and a route to these destinations is searched by the first route searching unit 1005 and the second route searching unit 1006, and branched from the searched routes. The branch point calculation unit 1007 calculates the point to be used.

  Conventionally, when a plurality of searched destinations are displayed, for example, it is common to display information such as a map by switching a screen for each destination. Alternatively, instead of displaying a map, the names of a plurality of searched destinations are only displayed as a list.

  However, when a user searches for a destination, there are many cases in which the user wants to grasp the route of the plurality of destinations by comparing them instead of the independent map information at each destination. For example, a point that is common in the routes to the plurality of destinations, that is, a branch point is always a point to which the user heads, and arrival time and route information to that point are one of the matters of interest to the user. On the other hand, the status of the route to each destination after the branch point and the traffic congestion status are also necessary information depending on the user in advance. Compare these, and finally consider the change in the situation. In many cases, the destination is determined.

  Therefore, in the present invention, a method will be described in which the branch points of a route to a plurality of destinations that have been input are calculated and the information state is changed based on the branch points.

  The first route search unit 1005 included in the route search unit 1013 is a unit that calculates a route to one destination among a plurality of destinations input by the plurality of destination input units 1004. The second route search unit 1006 included in the route search unit 1013 is a unit that calculates a route to the other destination among the plurality of input destinations. Based on the calculated route, a branch point calculation unit 1007 calculates a branch point of the route.

  FIG. 4 shows routes to a plurality of searched destinations. Note that the route search is generally calculated using the Dijkstra method or the like based on the route cost (route length, route time, etc.) of the road network accumulated in the map information. In this embodiment, for example, an intersection or the like is used as a node, and a route search is performed using the route cost of the link between the nodes. In FIG. 4, the searched route ID “01” is a route searched by the first route search unit 1005, and the nodes “Hana 1 town (intersection)”, “Hana 2 town ( This indicates that a route passing through “intersection)”, “No. 111 (intersection)”, “Hana East IC (interchange)”, and “Daito IC (interchange)” has been searched.

  Similarly, the searched route ID “02” is a route searched by the second route searching unit 1006, and the nodes “Hana 1machi (intersection)”, “Hana 2 town (intersection)” as the route to the destination “Sakura Golf Course”. ) "," No. 111 (intersection) "," Hana East IC (interchange) ", and" Riverway IC (interchange) ".

  The branch point calculation unit 1007 is a means for calculating a branch point based on the searched route. For example, it is possible to determine whether or not the nodes match from time to time based on the series of searched nodes, and calculate the node that finally matches as a branch point. That is, the route from the departure point (in this example, the current point where the search is started is the departure point) to the respective destinations is searched as a point sequence, and the final point among the points common to the respective routes is determined. It will be calculated as a branch point.

  Specifically, for example, in the case of the route shown in FIG. 4, the nodes “Hana 1 Machi”, “Hana 2 Machi”, “No. 111”, “Hana Higashi IC” match, and “Daito IC” and “Kawamichi IC” match. Because of the difference, the “Hanahigashi IC” that finally matches is the branching point.

  FIG. 5 is a map showing the searched route and the calculated branch point. First, a display screen displaying the current position of the user and the vicinity of the current position is shown. In addition, as a route from the current position to one of the destinations "Sakura Golf Course", a route that passes through "Hana 1machi", "Hana 2machi", "No. 111", "Hana East IC", "Kawaichi IC" Has been searched, and is indicated by a thick black line here. Similarly, a route passing through “Hana 1machi”, “Hana 2 Machi”, “No. 111”, “Hana East IC”, and “Daito IC” as a route to “Miyazato Golf Course” is searched. The branching point is calculated as “Hana East IC”. From “Hana East IC” to “Miyazato Golf Course” is approximately east (right direction), while “Sakura Golf Course” is approximately north direction (up direction) ).

  The display mode determination unit 1009 is a means for determining the mode when displaying information about the destination such as routes to the plurality of destinations. For example, the determination is made with reference to the mode information stored in the mode information storage unit 1008 (hereinafter referred to as mode information). Under the control of the display control unit 1010, the information is displayed on the route information display unit 1011 which is a display such as a car navigation system.

  Conventionally, when displaying information on the searched destinations, for example, a route or the like is generally displayed for each destination. However, when a user searches for a destination, there are many cases where the user wants to grasp the information while comparing the information so that the difference between the routes of the plurality of destinations can be understood more than the independent information at each destination.

  For example, in the case of the above example, the point to which the golf course goes to the “Hanahigashi IC” is always a point where the user passes, and the arrival time and route information to the “Hanahigashi IC” are one of the matters of interest to the user. One. In addition, it may be preferable to display the difference between the arrival times after the branch point and the difference in the route information in contrast to each other so that the difference between the two can be seen at a glance.

  For example, if there is a traffic jam by “East China IC” and the arrival is delayed, then you can go to “Miyazato Golf Course” where you can arrive in a short time. It is possible to prompt the user's action. Or, if you can get to the “Hanahigashi IC” that will always pass through any golf course in a short time, you need to go out to “Sakura Golf Course” for a short trip today. Can be provided.

  In addition, although the vehicle always passes up to the branch point, one of them will be selected thereafter, so that, for example, a user who is not good at driving may desire an easier road. That is, the status of the route after the branching point is also necessary information for the user, and by displaying these in contrast, it is possible to promote safer driving. Therefore, in the present invention, the display mode is controlled based on the branch point.

  FIG. 6 shows an example of the mode information stored in the mode information storage unit 1008. In this embodiment, for example, it is assumed that information such as “category”, “mode form”, and “display item” is stored as information on a destination such as a facility. Displays information about the destination. Specific examples will be described below with reference to the drawings.

  FIG. 7 shows information related to “Sakura Golf Course” and “Miyazato Golf Course” displayed on the route information display unit 1011. Conventionally, when displaying information related to a plurality of destinations, it is common to display a map such as a route for each destination. Accordingly, the difference between the two routes cannot be compared, and the screen has to be switched each time.

  Therefore, in the present embodiment, the “contrast map format” is used as the “mode format” of the mode information, and the maps of both routes are displayed while being compared. Furthermore, in this embodiment, the branch point “Hanahigashi IC” is calculated in the branch point calculation unit 1007, and the predicted arrival time “9:15” to the branch point is shown. This is because the user must pass through to the “Hanahigashi IC” at the branch point “East China IC”, and the arrival time, traffic information, etc. to “Hanahigashi IC” are one of the matters of interest to the user. is there.

  Also, the predicted arrival time “10:10” to “Miyazato Golf Course” compared to the predicted arrival time “10:20” to “Sakura Golf Course”, and the required time “1 hour 5 required after the branch point” “55 minutes” with respect to “minute”, the estimated arrival time of both, and the required time after the branch point are displayed so that the difference between the two can be grasped at a glance.

  For example, if traffic congestion occurs before “Hana East IC” and arrival is delayed, then you can compare these information without complicated operations such as going to “Miyazato Golf Course” where you can arrive in a short time. It becomes possible to grasp.

  In addition, for example, the color is changed and displayed so that the difference between the route to the branch point “Hana East IC” and the route to each destination after that can be more easily grasped (for example, to the branch point “Hana East IC” (The black thick line is red, etc., and the dotted line after the branch point is orange, etc.). The route to the branch point is a route that must be passed regardless of the destination, and any route after the branch point is selected. Therefore, by displaying, for example, the color before and after the branch point while changing the color, it becomes possible to more easily grasp the information.

  In the case of a car navigation system or the like, the size of the screen is limited, and it is necessary to accurately grasp a large amount of information from the screen in a short time considering the driving task. For example, by changing the colors of both routes, it becomes possible to easily grasp and compare route information and the difference between them, leading to more accurate information grasping and safe driving support.

  By the way, a plurality of different destination routes are different from a plurality of routes searched for only one destination, and their directions may be largely separated after the branch point. For example, in the case of FIG. 5, it can be seen that the direction from the east to “Miyazato Golf Course” is significantly different from the direction from the north to “Sakura Golf Course”. When trying to display a movement destination with these directions greatly different on one screen, the scale of the screen becomes too small, which may cause a problem that the screen does not fit into one screen.

  Therefore, in the present invention, a branch point is used to control the mode. For example, since it is a route that always passes to the branch point when going to any destination, map information etc. is displayed on one screen considering the current position and branch point, and the information after the branch point is compared It may be displayed. Specific examples will be described below with reference to the drawings.

  As shown in FIG. 5, “Sakura Golf Course” is in the north direction (upward direction) with respect to the current position, and “Miyazato Golf Course” is in the east direction (right direction) with respect to the current position. If the screen is reduced so that both of these destinations can be entered when the distance is relatively different from the current position, the map may be displayed in a wide area and it may be difficult to grasp the screen. Therefore, the map area to be displayed is determined in consideration of the current position and the position of the branch point “Hanahigashi IC” that must pass regardless of the destination.

  FIG. 8 is a diagram for explaining the determination of the display area in consideration of the branch point. A display screen 1 shown in FIG. 8 is a default display screen, for example, and displays an area centered on the current position. Since the display screen 1 displays the current position as the center, the route to the branch point “Hanahigashi IC” cannot be grasped.

  Therefore, the display area is determined so that the current position and the branch point “Hanahigashi IC” are displayed, and the display screen 2 is generated. For example, in this case, the area is determined so that the current position is at the lower left of the display screen 2 and the branch point is at the upper right of the screen. Then, the scale of the display screen 2 is controlled according to the size of the route information display unit 1011 which is a display screen of a car navigation system, etc., and the display screen 3 is generated. Then, by displaying the display screen 3 on the display, it is possible to grasp the route to the branch point while grasping the current position.

  FIG. 9 is a diagram illustrating an example of displaying a route to the calculated branch point “Hanahigashi IC”. A branch point is a point that always passes through any of a plurality of input destinations, and route information to the branch point and an estimated arrival time are matters of interest to the user. Therefore, the information up to the branch point is displayed, and the information after the branch point is displayed so that the information after the branch point can be compared. Moreover, in FIG. 9, it is displayed on the right side of the screen so that the information after the branch point can be grasped by comparison. For example, the predicted arrival time “10:20” to “Sakura Golf Course” and the predicted arrival time “10:10” to “Miyazato Golf Course” are displayed in contrast. Further, as a reduced map after the branch point, a route from “Hana East IC” to “Sakura Golf Course” and a reduced map of the route from “Hana East IC” to “Miyazato Golf Course” are displayed in comparison. If you display all routes including branch points, the scale of the map may become too small and it may be difficult to grasp the screen, but by comparing the routes after the branch points with a reduced map, It is also possible to grasp only necessary information.

  Alternatively, it is possible to consider the scale of the map set by the user. In general, the user sets the scale in detail when he wants to grasp the vicinity of the current position in more detail, and sets the scale to a wide area when he wants to grasp earlier route information and the entire route. For example, if the scale is set in detail to grasp the current position, information up to the branch point is displayed on the entire screen as shown in the display example of FIG. May be displayed.

  On the other hand, if you are using it and you already know roughly the information around you, rather than knowing the route information ahead, if the scale is wide-area display, as shown in FIG. Therefore, the information after the branch point may be displayed in contrast on the entire screen. Even if the route information is the same, the information to be grasped by the user is different, and by using the present invention, it is possible to provide information according to the user's needs.

  Hereinafter, the flowchart of the present embodiment will be described with reference to FIGS. 11, 12, and 13. First, a category is input by the category input unit 1001 (S3601). Next, the destination corresponding to the input category is searched from the map information stored in the map information storage unit 1003 (S3602).

  It is determined whether or not the corresponding destination is in the map information (S3603). If there is, the process proceeds to step S3604, and if not, the process ends. If there is (Yes in S3603), the first route search unit 1005 and the second route search unit 1006 search for a route to the corresponding destination (S3604). Then, the branch point calculation unit 1007 calculates the branch point (S3605).

  To calculate a branch point, first, a flag is set at the node closest to the current point (S3701), and the flag is set one ahead (S3702). In the case of the searched route shown in FIG. 5, it is set to the “Hana 1 Town” intersection. Next, it is determined whether or not the set flag is common (S3703). If they are common (Yes in S3703), the process proceeds to step S3702, and if they are different (No in S3703), the process proceeds to step S3704. In this embodiment, both are common with “Hana 1 Machi”, so the flag is set one ahead (S 3702). By repeating this loop, the flag moves to “Hana East IC”. That is, it shows that the route is common so far.

  Next, when the flag is set first (S 3702), “Daito IC” and “Kawaichi IC” are different from the node to which the flag is set (No in S 3703). Therefore, the flag is returned to the previous one (S3704), and the node of the set flag is calculated as a branch point (S3705). That is, “Hanahigashi IC” becomes a branch point.

  Next, the mode information stored in the mode information storage unit 1008 is referred to (S3606), and the display mode determination unit 1009 determines the display mode of information using the calculated branch point (S3607). For example, the display mode is the display example of FIG. 9 and will be described with reference to FIG. First, it is determined whether or not a branch point currently exists in the screen (S3801). If it exists in the current screen (Yes in S3801), go to Step S3805. If it does not exist (No in S3801), refer to the current position (S3802) and refer to the position of the branch point (S3803). Then, a screen is generated so that the current position and the position of the branch point enter the current screen, and the scale of the screen is reduced in accordance with the size of the display (S3804).

  In the case of FIG. 8, since the branch point does not exist in the current screen in the display screen 1 (No in S3801), the current position and the position of the branch point “Hanahigashi IC” are referred to (S3802, S3803), and these enter the screen. The display area is determined to generate the display screen 2. Then, the display screen 3 is generated by reducing the screen (S3804). Since a plurality of destinations are relatively far away or separated from each other, when trying to put them on the current screen, the scale of the screen is too large and it may be difficult to grasp route information. On the other hand, at least the route to the branch point is common, and these adverse effects can be avoided by reducing the size so that at least the branch point can be entered. Next, the route to the branch point is displayed. Then, the route to the branch point is displayed (S3805), and further, the information after the branch point is displayed so that it can be comprehended, for example (S3806). The information is displayed on the route information display unit 1011 in a manner determined by these flows (S3608).

  FIG. 9 is a diagram showing a screen displayed on the route information display unit 1011. In FIG. 9, the current screen is displayed with a scale and a position where the current position and the branch point “Hanahigashi IC” enter the screen. The route to the branch point “Hanahigashi IC” is indicated by a bold line. Furthermore, the predicted arrival time “9:15” to the branch point “Hanahigashi IC” and the “arrival predicted time” of each destination “Miyazato Golf Course” and “Sakura Golf Course” are displayed. Thus, by calculating the branch point and displaying the information up to the branch point so that the information after the branch point can be compared, it is possible to more easily grasp the information necessary for movement.

(Description of minimum components in Embodiment 1)
In the present embodiment, for input to the multiple destination input unit 1004, for example, a component such as a category input unit 1001 is provided, and a point corresponding to the category is searched from the map information storage unit 1003 by the multiple destination search unit 1002. It was decided to do this, but it is not limited to this. The destination may be directly input to the multiple destination input unit 1004 to perform a route search and calculate a branch point.

  Further, the route search has been described by providing the first route search unit 1005 and the second route search unit 1006 and each route search unit as a constituent element. For example, one route search unit (for example, the first route search unit) The search unit 1005 may be used as the route search unit 1005) to sequentially search each route.

  Furthermore, in order to change the mode based on the branch point, the mode stored in the mode information storage unit 1008 is referred to. However, the mode information is not necessarily a necessary component, and information on the branch point is directly displayed as route information. It is good also as displaying on the part 1011.

  That is, the minimum constituent elements necessary for carrying out the present invention are not limited to those shown in FIG. 1, and can be implemented by the constituent elements shown in FIG. 14, for example. FIG. 14 shows system components of the present invention, which includes a multiple destination input unit 1004, a departure point input unit 1012, a route search unit 1005, a branch point calculation unit 1007, and a route information display unit 1011. The detailed description of each component is as described above, and the route search unit calculates a route from the departure point input by the departure point input unit 1012 to each destination input by the plurality of destination input units 1004. Search is performed at 1005, and a branch point is calculated by a branch point calculation unit 1007. Then, the calculated branch point information is displayed on the route information display unit 1011.

(Modification regarding display mode in Embodiment 1)
As for the display mode of information related to the destination, for example, “Miyazato Golf Course” and “Sakura Golf Course” have been explained as examples of display, but map information is compared based on branch points. Not a thing. For example, the mode may be controlled according to the destination category. The mode information shown in FIG. 6 indicates that the category “golf course” is displayed in “contrast map format”. FIG. 7 shows an example in which the route maps to the destinations “Miyazato Golf Course” and “Sakura Golf Course” are displayed so as to be comparably understood based on this mode information. For example, in the case of a destination that is generally far away, such as “Golf course”, the difference in information after the branch point may be information that the user wants to know more because the movement direction and distance after the branch point are greatly different. Many. Therefore, for example, in the case of “golf course” or the like, the display is performed by comparing the maps so that the difference in information after the branch point can be easily understood.

  On the other hand, the mode information shown in FIG. 6 has “contrast menu format” as the display mode of the category “restaurant”. This means that if you search for multiple destinations that are relatively familiar, such as the category “Restaurant”, and display information up to the destination, the distance traveled after the branch point is also less than the “Golf course” that is relatively far away. Since it is often short or easily changeable, the information up to the branch point may not be displayed in detail, but the information up to the branch point may be displayed in more detail.

  For example, FIG. 15 shows a display area determined on the screen by determining the display area in consideration of the current position and the position of the branch point as shown in the present embodiment. The screen shown in FIG. 15 shows a route to “Raku 1 Machi intersection” calculated as, for example, a branch point.

  For example, as shown above, when the category such as “golf course” is the same, it is often the case that one of the destinations is finally selected instead of going to both of these destinations. Therefore, in order to make it easier to grasp the difference after the branch point, the display after the branch point was contrasted.

  On the other hand, if the categories are different, instead of selecting either one, we will eventually go to both, but first want to know the information to either one or the branch point There is also. Therefore, for example, when the categories are different, the information up to the branch point may be displayed in detail.

  For example, in FIG. 16, “entertainment” is input as a search keyword, and “karaoke No1” as a category “karaoke” and “star bowling” as a category “boring” are searched and displayed. Furthermore, in order to show the information up to “Raku 1 intersection” calculated as a branch point in more detail, it is displayed together with the map information on the entire screen. When the categories are different in this way, the information up to the branch point may be displayed in detail.

  In addition, it is good also as changing a display mode not according to a category but according to the distance and direction of the moving destination after a branch point. When calculating routes to a plurality of different destinations, the routes to each destination after the branch point are often very different. When trying to display a moving destination with these directions and the like greatly different on one screen, the scale of the screen becomes too small, which may cause a problem that the screen does not fit on one screen. Therefore, for example, a threshold value may be provided for the direction and distance after the branch point, and when the threshold value is equal to or greater than the threshold value, the information up to the branch point may be displayed in a form (for example, FIG. 9 or FIG. 15). .

  Furthermore, the mode may be changed according to the distance from the current point to the branch point, the ratio of the distance to the branch point with respect to the distance from the current point to the destination, or the like. Or it is good also as changing according to the ratio of not only distance but arrival time. For example, when the arrival time to the branch point is 2 hours and the arrival time to each destination after the branch point is about 1 hour, the ratio to the branch point and the ratio after the branch point to the total travel time of 3 hours is 2 to 1. Become.

  In other words, the proportion of travel to the branch point is large in the total travel time, and the information that the user wants to grasp can be considered to be mainly information up to the branch point. Control may be performed such as displaying information in a display mode (for example, FIG. 9 or the like) for displaying information in detail.

  For this purpose, the display control unit 1010 specifically compares the distance from the departure point to the branch point with a threshold value, and when the distance is longer than the threshold value, information from the departure point to the branch point. May be displayed in detail. It goes without saying that the display control unit 1010 may adopt such a display mode according to the distance from the departure point to the branch point and the ratio of the distance from the branch point to the destination.

  Conversely, when the proportion of travel to the branch point in the total travel time is small, a display mode (for example, FIG. 10) that displays the route from the branch point to the destination in detail may be employed.

  For this purpose, the display control unit 1010 specifically compares the distance from the departure point to the branch point with a threshold value, and when the distance is shorter than the threshold value, information from the branch point to the destination is displayed. May be displayed in detail. It goes without saying that the display control unit 1010 may adopt such a display mode according to the distance from the departure point to the branch point and the ratio of the distance from the branch point to the destination.

  By switching the display mode in this way, it is possible to automatically display information required by the user in a suitable mode without complicated operations.

(Embodiment 2)
In the above embodiment, the method of calculating branch points on a route to a plurality of destinations that have been input and controlling the state of information about the destination using the branch points has been described. For example, when searching for multiple destinations and determining which destination to go to, the information up to the branch point is a matter of interest to the user, and the subsequent destination is determined based on the traffic jam status and estimated arrival time There are many. In addition, there is a case where the destination to be finally traveled is determined by comparing and displaying the information after the branch point. By controlling the state of the information to be provided using the branch point, it can be easily performed without complicated operations. Information can be grasped.

  On the other hand, in the embodiment, for example, a branch point is calculated by searching each of a plurality of input destination routes and referring to the matching points and the differences. Since the searched route is searched based on the route cost (required time, distance, etc.) of the road network accumulated in the map information, it is not always an appropriate branch point by the user. For example, depending on the user, even when heading to any destination that has been input, the user may pass through a certain route, and therefore the branch point may be different.

  Therefore, in the present embodiment, for example, a method for accumulating a user's usual movement history and calculating a branch point in consideration of the movement history will be described.

  FIG. 17 is a system configuration diagram of the present embodiment. The same reference numerals are given to the constituent elements shown in the embodiment, and the description thereof is omitted.

  The movement history accumulation unit 1101 is a means for accumulating a user's past movement as a history. In the present embodiment, the movement history is accumulated, for example, as a series of passing intersections based on the latitude / longitude information detected by the departure point input unit 1012 configured by GPS and the map information accumulated in the map information accumulation unit 1003. I decided to.

  In this embodiment, the departure point input unit 1012 is a means for detecting the current position of the user. However, it is provided with a means for detecting the current position of the user separately, and the position information acquired thereby is accumulated as a movement history. May be. In general, a GPS provided in a car navigation system detects latitude and longitude at intervals of about 1 second, and a series of latitude and longitude information detected as a user moves is enormous. In addition, the detected latitude and longitude generally include some errors. Considering the ease of subsequent matching and searching, nodes such as passing intersections using map information instead of latitude route information series It will be accumulated in the series.

  In the present invention, the route search and the branch point are calculated based on the sequence of these nodes, and it is preferable that the movement history is accumulated in the node sequence from the relationship with the consistency with these. In the present embodiment, the conversion of the node series from the latitude / longitude information is performed by the movement history accumulation unit 1101, but may be performed by providing a separate conversion unit.

  FIG. 18 shows the history of the movement destination accumulated in the movement history accumulation unit 1101. For example, a starting point, a passing intersection, a passing time, and a destination arrival sequence are accumulated as one movement history. For example, the movement history ID “01” leaves “home” and passes through “Hana 1 town (intersection)”, “Hana 2 town”, “No. 111”, “Yamano 2 town”, “Yamano 3 town” This indicates that you have reached the “Miyazato Golf Course” in the past. In the present embodiment, the branch points in the route to a plurality of destinations searched using these movement histories are calculated. Hereinafter, a specific example will be described.

  As in the above embodiment, for example, it is assumed that “golf course” is input as a destination category and “Miyazato golf course” and “Sakura golf course” are searched. Then, the first route search unit 1005 and the second route search unit 1006 search for a route to the plurality of destinations.

  FIG. 19 shows the searched route. In FIG. 19, the searched route ID “01” is a route searched by the first route searching unit 1005, and the nodes “Hana 1machi” and “Hanamachi IC (interchange)” as the route to the destination “Miyazato Golf Course”. , “Hanato IC” and “Daito IC” have been searched. Similarly, the searched route ID “02” is a route searched by the second route searching unit 1006, and the nodes “Hana 1machi”, “Hanamachi IC”, “Hanahigashi IC” are the routes to the destination “Sakura Golf Course”. ”, Indicating that a route passing through“ Riverway IC ”has been searched.

  Similarly to the embodiment, when the branch point is calculated by the branch point calculation unit 1007, the nodes “Hana 1machi”, “Hanamachi IC”, “Hanahigashi IC” match, and “Daito IC” and “Kawamichi IC” match. “Hanahigashi IC” which finally matches is a branch point.

  FIG. 20 is a map showing the relationship between the searched routes. FIG. 20 shows the current location of the user, “Miyazato Golf Course”, “Sakura Golf Course”, which are destinations, and the searched route to each golf course. As shown in FIG. 20, the routes to both golf courses go straight from the current position to the “Hana 1machi” intersection, get on the highway at “Hanamachi IC”, and branch off at “Hana East IC”. After passing through the “Hanahigashi IC” which is a branch point, the route to “Miyazato Golf Course” via the “Daito IC”, while passing through the “Hanato IC” to the “Sakura Golf Course” via the “Kawamichi IC” Shown in black thick line.

  However, when a branch point is calculated simply by searching for a route to each destination with each destination as a destination, a branch point suitable for the user is not always calculated. For example, the routes and branch points shown in FIG. 20 are the results of searching each route with the destinations of “Sakura Golf Course” and “Miyazato Golf Course” as destinations. In general, a route search unit provided in a car navigation system or the like calculates a route with the shortest cost by using the route cost of the road network accumulated in the map information as shown in the above embodiment. Accordingly, in FIG. 20, the shortest route using the expressway is searched to “Sakura Golf Course” and “Miyazato Golf Course” as destinations, and the branch point is also calculated as “Hana East IC”.

  On the other hand, the route indicated by the black dotted line is the user's past movement history accumulated in the movement history accumulation unit 1101 shown in FIG. For example, in the case of this example, it is assumed that when the user goes to “Miyazato Golf Course”, he / she uses a general road without using a highway in order to save a high-speed fee. Specifically, after turning right at “Hana 1 Machi”, the history of reaching “Miyazato Golf Course” via “Hana 2 Machi”, “No. 111”, “Yamano 2 Machi”, “Yamano 3 Machi” is accumulated. (FIG. 18).

  In this case, when it is finally decided to go to “Miyazato Golf Course”, the branch point for the user is not “Hana East IC” but “Hana 1 Machi”. In other words, if you decide to go to “Miyazato Golf Course”, you need to turn right at “Hana 1 Town”, while if you decide to go to “Sakura Golf Course”, you need to go straight on “Hana 1 Town” Therefore, the branch point is “Hana 1 Town” (FIG. 21). Before passing through the branch point “Hana 1 Machi”, it is necessary to display the traffic information up to the branch point or information after the branch point and to prompt the user to finally decide which direction to go.

  The branch point calculated by simply searching for the route to each destination in this way is not necessarily a branch point suitable for the user. The user's movement history is accumulated and the branch point is reflected by reflecting the movement history. It may be calculated. The travel history shows the user's usual behavior tendency, such as the tendency of the user not to use the expressway to save money, the use of the usual roadway, or the use of a wide road to be a beginner. Therefore, a more appropriate branch point can be calculated using the movement history.

  Therefore, in this embodiment, a route to each destination is searched so as to follow the route indicated in the user's movement history for as long as possible (in other words, overlap), and a candidate for a branch point from the searched route. Is calculated, a branch point is selected from the calculated route information, and route information based on the selected branch point is displayed. In this embodiment, the branch point calculation unit 1007 further includes a branch point candidate calculation unit 1021 and a branch point selection unit 1022 (FIG. 17).

  First, the route search unit 1013 obtains a route from the departure point input in the departure point input unit 1012 (in this embodiment, the current position where the search was performed) to the destination input in the multiple destination input unit 1004. A plurality of searches are performed so that the route indicated by the user's movement history accumulated in the movement history accumulation unit 1101 is traced as long as possible. Next, the branch point candidate calculation unit 1021 generates a plurality of branch point candidates from the searched different routes. Is calculated using each search route. Hereinafter, a specific example will be described.

  As shown above, there are several routes to the input destinations “Sakura Golf Course” and “Miyazato Golf Course”. For example, the route to “Miyazato Golf Course”, which is one of the destinations, exists in the history and the route passing through the nodes “Hana 1machi”, “Hanamachi IC”, “Hanahigashi IC”, etc. There is a route (FIG. 22) that passes through “Hana 1 Machi”, “Hana Machi 2 Machi”, “No. 111”, which overlaps with the route that the user often uses. In this case, the branch point of the route that passes the search route “Hana 1machi”, “Hanamachi IC”, and “Hanahigashi IC” to “Sakura Golf Course”, which is the other destination, is “ In the case of “East IC” and “Hana 1cho” in the latter route, these can be calculated as branch point candidates.

  The branch point selection unit 1022 is means for selecting a branch point from the branch point candidates calculated by the branch point candidate calculation unit 1021. For example, the user may select a branch point as to which information should be displayed as a branch point, or may be automatically selected according to the distance from the current position.

  Further, a branch point from a route to a destination that follows the route indicated in the user's movement history as long as possible may be automatically selected. Specifically, in the present embodiment, routes that pass through such routes “Hana 1 town”, “Hanamachi 2 town”, and “No. 111” exist in the movement history, and the frequency of use by the user is low. This is given priority as high, that is, the branch point may be automatically selected as “Hana 1 Machi”.

  Further, the travel history may be reflected in the route to “Sakura Golf Course” to calculate a more appropriate branch point. For example, when moving to “Miyazato Golf Course”, the user of this example turns right at “Hana 1 Machi” and uses a general road such as “Hana 2 Machi”, “No. 111”, etc. to save high-speed charges. . On the other hand, there is no travel history because there was no trip to “Sakura Golf Course”, a general route search was conducted, and after going straight through “Hana 1cho” to “Hanamachi IC”, “ The route to “Sakura Golf Course” passing through “East China IC” and “Kawamichi IC” is being searched. A branch point “Hana 1 Machi” is calculated from these routes.

  However, a branch point calculated from such a route having the shortest cost is not always a branch point suitable for the user. For example, in the case of this example, it is conceivable to use general roads such as “Hana 2 Machi” and “No. 111” even when heading to “Sakura Golf Course”. Therefore, the route to “Sakura Golf Course” is searched again so as to follow the route to “Miyazato Golf Course” that is the route to one of the destinations accumulated in the history as long as possible, and an appropriate branch point is calculated. It is good.

  FIG. 22 shows a branch point calculated by using the route to “Miyazato Golf Course” existing in the history and searching for the route to the other “Sakura Golf Course” again. For example, as a result of searching for a route from a predetermined intersection on the route to “Miyazato Golf Course” in the history to “Sakura Golf Course”, in this example, “Hana 1 Town” is turned to the right and “Hana 2 Town” ”,“ No. 111 ”, and after that, the route to“ Sakura Golf Course ”is searched for by heading“ No. 111 ”northward (upward) to“ Hanahigashi IC ”on the expressway. The branch point is “No. 111”.

  Thus, instead of simply searching for a route from the current position to each destination and calculating a branch point, the route may be searched in consideration of the movement history and the branch point may be calculated. In particular, if one is present in the movement history and the other is not present in the movement history, the route to the other destination is not simply searched for the shortest route, but calculated based on the route existing in one movement history. Therefore, it is also possible to go from the route that is usually used and used, and it is possible to easily go to the destination even if the driver is unfamiliar with driving or does not know much about the area.

  In addition, a branch point is a point that is usually familiar to the user in consideration of the movement history, since there is a high possibility of turning right or left when going to any destination or any destination. By turning left and right based on this, it is possible to drive more safely without increasing the burden of attention, which is a very effective method for providing route information.

  FIG. 23 shows an example in which route information is displayed based on the calculated branch point “111” described above. For example, on the right side of the screen, similar to FIG. 9, the route information after the branch point “111” is displayed in comparison. It is easier to grasp the difference in required time after the branch point.

  The left side of the screen is an example in which the branch point “111” is displayed in detail. For example, the branch point “111” is an intersection, and further, there are stores such as “Toyo Motors”, “Rookie Bank”, and “K Mart” near the intersection. Further, it is indicated by an arrow (dotted line) that when “No. 111” is turned to the right as usual, it reaches “Miyazato Golf Course”. On the other hand, an arrow (black thick line) indicates that “Sakura Golf Course” is reached when going straight on “No. 111”.

  This “No. 111” intersection is a point accumulated in the movement history, that is, a point that is well known by the user. By displaying the vicinity of “No. 111” in detail, it is possible to see how the other It becomes possible to grasp in more detail whether it is possible to branch to the destination.

  In addition, the modification which uses a movement history for estimation of a movement destination is also considered. In this modification, for example, the multiple destination input unit 1004 searches the movement history storage unit 1101 for a point included in a predetermined range from the direction in which the vehicle is currently heading, and the destination where the searched point is estimated. You may enter as In this case, the multiple destination input unit 1004 is an example that serves as both the destination prediction means and the destination input means described in the claims.

  Hereinafter, the operation flow of the present embodiment will be described with reference to the flowcharts of FIGS.

  First, as in the first embodiment, a category is input by the category input unit 1001 (S3601). Next, the destination corresponding to the input category is searched from the movement history accumulated in the movement history accumulation unit 1101 (S3902). It is determined whether or not the corresponding destination is in the movement history (S3903). If there is, the process proceeds to step S3904. If not, the branch point is calculated as in the first embodiment (to S3605). If there is (Yes in S3903), the route accumulated in the movement history accumulation unit is further referred to (S3904). The branch point calculation unit 1007 calculates the branch point using the movement history (S3605).

  The calculation of the branch point is the same as in the first embodiment. However, in this embodiment, the branch point is calculated using the route accumulated in the movement history, not the route searched by the route search unit. To calculate a branch point, first, a flag is set at the node closest to the current point (S3701), and the flag is set one ahead (S3702). In the case of the searched route shown in FIG. 21, it is set to the “Hana 1machi” intersection. Next, it is determined whether or not the set flags are common (S3703). If they are common (Yes in S3703), the process proceeds to Step S3702, and if they are different (No in S3703), the process proceeds to Step S3704. Since both are in common with “Hana 1machi”, the flag is set one ahead (S3702). By repeating this loop, the flag moves to “Hana East IC”. That is, it shows that the route is common so far. Next, when the flag is set first (S 3702), “Daito IC” and “Kawaichi IC” are different from the node to which the flag is set (No in S 3703). Therefore, the flag is returned to the previous one (S3704), and the node of the set flag is calculated as a branch point (S3705). That is, “Hanahigashi IC” becomes a branch point. In the case of FIG. 21, “Hana 1 Machi” is a branch point.

  Next, as in the first embodiment, the mode information is referred to (S3606), the mode information is determined (S3607), and the information is displayed using the calculated branch point (S3608).

(Description of Minimum Components in Embodiment 2)
In the present embodiment, for input to the multiple destination input unit 1004, for example, a component such as a category input unit 1001 is provided, and a point corresponding to the category is searched from the map information storage unit 1003 by the multiple destination search unit 1002. It was decided to do this, but it is not limited to this. The destination may be directly input to the multiple destination input unit 1004 to perform a route search and calculate a branch point.

  Further, the route search has been described by providing the first route search unit 1005 and the second route search unit 1006 and each route search unit as a constituent element. For example, one route search unit (for example, the first route search unit) The search unit 1005 may be used as a route search unit 1005) to search each route.

  Furthermore, in order to change the mode based on the branch point, the mode stored in the mode information storage unit 1008 is referred to. However, the mode information is not necessarily a necessary component, and information on the branch point is directly displayed as route information. It is good also as displaying on the part 1011.

  That is, the constituent elements necessary for carrying out the present invention are not limited to those shown in FIG. 1, but can be implemented by the constituent elements shown in FIG. FIG. 26 shows system components of the present invention. A plurality of destination input units 1004, a departure point input unit 1012, a route search unit 1005, a branch point calculation unit 1007, a branch point candidate calculation unit 1021, a branch point selection unit 1022, a route An information display unit 1011 and a movement history storage unit 1101 are included.

  The detailed description of each component is as described above, and there are several different routes from the departure point input at the departure point input unit 1012 to each of the movement destinations input at the multiple destination input unit 1004. The route search unit 1005 searches and the branch point candidate calculation unit 1021 of the branch point calculation unit 1007 calculates branch point candidates. A branch point selection unit 1022 selects a branch point from the calculated branch point candidates based on the movement history accumulated in the movement history accumulation unit 1101. Then, it is displayed on the route information display unit 1011.

  Note that the movement history storage unit 1101 is not always necessary. The branch point may be selected based on the distance from the departure point (in this embodiment, the current location of the user) input by the departure point input unit 1012. Therefore, for example, it can be performed by the components shown in FIG. FIG. 27 shows system components of the present invention. A plurality of destination input units 1004, a departure point input unit 1012, a route search unit 1005, a branch point calculation unit 1007, a branch point candidate calculation unit 1021, a branch point selection unit 1022, a route An information display unit 1011 is included.

  The detailed description of each component is as described above, and there are several different routes from the departure point input at the departure point input unit 1012 to each of the movement destinations input at the multiple destination input unit 1004. The route search unit 1005 searches and the branch point candidate calculation unit 1021 of the branch point calculation unit 1007 calculates branch point candidates. A branch point selection unit 1022 selects a branch point from the calculated branch point candidates based on the departure point input by the departure point input unit 1012. Then, it is displayed on the route information display unit 1011. Hereinafter, a specific example will be described.

  For example, it is assumed that the user inputs a category “Amusement” and searches for “Karaoke Dom” and “Star Bowling” as destinations. That is, the inputs to the multiple destination input unit 1004 are “Karaoke Dom” and “Star Bowling”. FIG. 28 shows a map of the current position of the user and the positions of “Karaoke Dom” and “Star Bowling”.

  In order to calculate a branch point in the branch point calculation unit 1007, first, a route to these destinations is calculated. A route search unit 1005 searches for a route from the current location input by the departure point input unit 1012 to each destination.

  The route to the destination is generally searched for the shortest route using a cost according to the passage time and distance of the route. The black thick line in FIG. 28 indicates the search route to these destinations, and it is assumed that, for example, the search result is obtained by a general route search unit. In FIG. 28, the route to “Karaoke Dom” is a route passing through the intersections “Raku 1 Machi”, “Raku 2 Machi”, “Raku Dori 1”. On the other hand, the route to “Star Bowling” is a route passing through the intersections “Raku 1 Machi”, “Raku 3 Machi”, “Raku 4 Machi”, “Kyo 4 Machi”, “Kyo 3 Machi”.

  Furthermore, here, the cost of the route is the passage time between these intersections (nodes), and this cost is shown in FIG. For example, it takes 5 minutes from the current position to “Raku 1 Machi”, 5 minutes from “Raku 1 Machi” to “Raku 2 Machi”, 10 minutes from “Raku 2 Machi” to “Rakutsu 1”, “Raku Dori 1” It takes 5 minutes to “Karaoke Dom”. Therefore, the total arrival time from the current position to “Karaoke Dom” is 25 minutes. Similarly, to “Star Bowling”, 5 minutes to Raku 1 Town, 2 minutes to Raku 3 Town, 3 minutes to Raku 4 Town, 10 minutes to Kyo 4 Town, 5 minutes to Kyo 3 Town, 2 minutes to Star Bowling, The total is 27 minutes.

  FIG. 29 is a table showing the results of these search routes. The route to each destination and the transit time are shown in the table. The search route ID “01” is the route to “Karaoke Dom”, 5 minutes to Raku 1 Town, 5 minutes to Raku 1 Town and 5 minutes from Raku 1 Town to Raku 2 Town, totaling 10 Minutes and here the accumulated time. The search route ID “02” is a route to “Star Bowling”. As described above, generally, in route search, the cost between nodes is calculated to calculate the shortest route.

  Focusing on the calculation of the branch point, in this case, “Raku 1 Machi” is common, and the branch point is “Raku 1 Machi”. However, when the branch point is relatively close to the current position as described above, or when the branch point has already branched from the current position, the user needs to immediately determine one of the destinations. For example, if the user travels a little more and changes the destination according to the route situation and the final arrival time, the user cannot be given a grace period.

  Therefore, in the present invention, a plurality of routes are calculated, a branch point candidate is calculated in the branch point candidate calculation unit 1021, and a branch point is closer to the destination from the branch point candidates in the branch point selection unit 1022, A method for calculating a position far from the position will be described.

  For example, among a plurality of input destinations, a plurality of destination paths far from the current position are searched again by comparing them. The reason why a plurality of destination routes are searched is that the routes to the far destination are more easily calculated and the time difference is smaller. On the other hand, if a plurality of routes to the closer destination are searched, the plurality of routes takes a long time and results in a detour. In the case of this example shown in FIG. 28, since the estimated arrival time of 25 minutes to “Karaoke Dom” is far from the estimated arrival time of 27 minutes to “Star Bowling”, the route to “Star Bowling” is calculated.

  FIG. 30 shows a plurality of calculated routes to the star boring. From the current position to the shortest route to turn right on “Raku 1 Machi”, go straight on “Raku 1 Machi” and turn right on “Raku 2 Machi”, and go straight on “Raku 1 Machi” and “Raku 2 Machi” Thus, two routes of a right turn at “Rakutsu 1” are newly calculated. FIG. 31 shows the passage times of these plural routes using the passage time cost shown in FIG. A route that makes a right turn on “Raku 2 Machi” is shown as a search route ID “03”, and a route that goes straight on “Raku 1 Machi” and “Raku 2 Machi” is shown as a search route ID “04”.

  The searched route ID “03” is a route that turns right on “Raku 2 Machi” and heads for “Star Bowling”. Go straight through “Raku 1 Machi” from the current position (passing time cost is 5 minutes), then “Raku 2 Machi”, “Raku 4 Machi”, “Kyo 4 Machi”, “Kyo 3 Machi” and “Star Bowling” To reach. During this time, the total transit time cost is 29 minutes. Although it is 2 minutes slower than the shortest route of 27 minutes until “Star Bowling” indicated by the searched route ID “02”, the route to “Karaoke Dom” indicated by the searched route ID “01” and “Raku 2 Machi” The branch point is “Raku 2 Machi”, and the branch point is calculated at a position farther from the current position than “Raku 1 Machi”.

  Further, in the case of the searched route ID “04”, the route goes straight through “Raku 2 Machi” to “Star Bowling”. From the current position, go straight through “Raku 1 Machi” and “Raku 2 Machi” (passing time cost is 10 minutes) and pass “Raku Dori 1” and “Kyo 3 Machi” to reach “Star Bowling”. During this time, the total transit time cost is 37 minutes. The route to “Karaoke Dom” indicated by the search route ID “01” and “Rakutsu 1” are common, so the branch point is “Rakutsu 1”, which is compared with “Raku 2 Machi” and “Raku 1 Machi”. As a result, a branch point is calculated at a position far from the current position.

  There is a situation in which a user searches a plurality of destinations and finally considers which destination to go. However, when the branch point is relatively close to the current position, the user needs to immediately decide which destination to move to. For example, if the user travels a little more and changes the destination according to the route situation and the final arrival time, the user cannot be given a grace period.

  Therefore, using this method, the user can calculate multiple routes and select a branch point that is closer to the destination or a branch point that is farther from the current position (meaning the departure point). It is possible to obtain more room for grasping information on a plurality of destinations and finally determine the destination.

  On the other hand, the search route ID “04” is 10 minutes later than the shortest route of 27 minutes until “Star Bowling” indicated by the search route ID “02”. In other words, the branch point is calculated at the farthest position among the three points with respect to the current position, but the branch point is calculated by making a relatively large detour with respect to the shortest path. In this case, even if it is calculated at a position far from the current position of the branch point and the user is given a time to make a final decision among a plurality of destinations, the user finally moves to “Star Bowling”. In this case, it is not preferable to take 37 minutes and 10 minutes in excess of the shortest 27 minutes.

  Therefore, the branch point may be calculated in consideration of not only the position of the branch point but also the cost of the route time. For example, a branch point may be calculated by providing a threshold (for example, within plus 20%) based on the required time for the shortest route, such as a grace period of plus 20% (about 6 minutes) for the shortest 27 minutes. In this case, since the searched route ID “04” having an arrival time of 37 minutes exceeds the threshold, the route search ID “03” is used, and the branch point is “Raku 2 Machi”.

  Instead of calculating each route to a plurality of destinations, one may be used as a waypoint. This will be described with reference to FIGS. 32 and 33.

  FIG. 32 is a map showing the current position of the user and the searched destinations “Karaoke Dom” and “Star Bowling”, as in FIG. In this case, when a route search is performed using each destination as the destination, a route similar to that in FIG. 28 is calculated. On the other hand, when a user searches for a plurality of destinations and examines where to go, the user finally makes a decision in consideration of the situation of the destination and the traffic congestion that changes from time to time. In some cases, the user first goes to one destination, sees the degree of congestion of the destination, and then goes to the other destination. Therefore, here, a method for calculating a route to the other destination via one destination will be described.

  FIG. 33 shows the passage time calculated using the route to each destination and the passage cost of the route, as in FIG. 29 and the like. The search route ID “01” is a route to “Karaoke Dom”, and passes through “Raku 1 Machi”, “Raku 2 Machi”, “Raku Dori 1” and reaches “Karaoke Dom”. The arrival time is “25 minutes” in total. On the other hand, the search route ID “02” is a route to “Star Bowling” and has passed “Raku 1 Machi”, “Raku 3 Machi”, “Raku 4 Machi”, etc., and has reached “Star Bowling”. . The arrival time is “27 minutes” in total. Here, a route having a shorter arrival time is set as a passing point (that is, one destination becomes a branch point), and a route to the other destination is searched. The searched route ID “05” is a result when a route is searched using “Karaoke Dom” as a passing point (branch point). “Raku 1 Machi”, “Raku 2 Machi”, “Rakutsu 1”, “Karaoke Dom”, “Ura Raku 1”, “Kyo 2 Machi”, “Kyo 3 Machi” and “Karaoke Dom” Reached “Star Bowling”. Further, the final arrival time is 32 minutes, which is within the threshold for the shortest 27 minutes and does not become relatively large, so it is possible to calculate these routes as a plurality of destination routes.

(Embodiment 3)
In the second embodiment, the method of calculating the branch point using the movement history and controlling the information display mode using the branch point has been described. When a plurality of destinations are searched, the branch points of the plurality of destinations are calculated, and information is displayed based on the branch points, thereby enabling the user to grasp the information more effectively. In addition, considering the travel history, for example, by searching again the route to the other destination based on the route accumulated in the travel history and calculating the branch point, from the branch point of the route that the user normally uses It is possible to head to the destination. As for the method of calculating the branch point, for example, calculate multiple routes to the destination, select the branch point on each route as the branch point candidate, and select the branch point from the branch point candidates based on the current position or movement history did. On the other hand, the method of calculating the branch point is not limited to the above. Therefore, in this modification, a method for calculating a branch point will be described.

  FIG. 34 is a system configuration diagram in the present embodiment. The same reference numerals are given to the constituent elements shown in the embodiment.

  The multiple destination input unit 1004 is means for inputting a plurality of destinations. The departure point input unit 1012 is a means for inputting a departure point. For example, in the case of this embodiment, the departure point input unit 1012 detects the current position where the search is performed and sets the current position as the departure point. The route search unit 1005 is means for searching for a route from the input current location to each destination.

  For example, as in the above embodiment, it is assumed that the user inputs a category “Amusement” and searches for “Karaoke Dom” and “Star Bowling” as destinations. That is, the inputs to the multiple destination input unit 1004 are “Karaoke Dom” and “Star Bowling”. FIG. 35 is a map showing the current position of the user and the positions of “Karaoke Dom” and “Star Bowling”.

  The route to the destination is generally searched for the shortest route using a cost according to the passage time and distance of the route. The black thick line in FIG. 35 indicates the search route to these destinations, and is a result of search by a general route search unit, for example.

  In FIG. 35, the route to “Karaoke Dom” is a route passing through the intersections “Raku 1 Machi”, “Raku 2 Machi”, “Raku Dori 1”. On the other hand, the route to “Star Bowling” is a route passing through the intersections “Raku 1 Machi”, “Raku 3 Machi”, “Raku 4 Machi”, “Kyo 4 Machi”, “Kyo 3 Machi”. Further, here, the cost of the route is the passing time between these intersections (nodes), and this cost is shown in FIG. For example, it takes 5 minutes from the current position to “Raku 1 Machi”, 5 minutes from “Raku 1 Machi” to “Raku 2 Machi”, 10 minutes from “Raku 2 Machi” to “Rakutsu 1”, “Raku Dori 1” It takes 5 minutes to “Karaoke Dom”. Therefore, the total arrival time from the current position to “Karaoke Dom” is 25 minutes. Similarly, to “Star Bowling”, 5 minutes to Raku 1 Town, 2 minutes to Raku 3 Town, 3 minutes to Raku 4 Town, 10 minutes to Kyo 4 Town, 5 minutes to Kyo 3 Town, 2 minutes to Star Bowling, The total is 27 minutes.

  FIG. 36 shows the results of these search routes in a table. The route to each destination and the transit time are shown in the table. The search route ID “01” is the route to “Karaoke Dom”, 5 minutes to Raku 1 Town, 5 minutes to Raku 1 Town and 5 minutes from Raku 1 Town to Raku 2 Town, totaling 10 Minutes and here the accumulated time. The search route ID “02” is a route to “Star Bowling”. As described above, generally, in route search, the cost between nodes is calculated to calculate the shortest route.

  Focusing on the calculation of the branch point, in this case, “Raku 1 Machi” is common, and the branch point is “Raku 1 Machi”. However, when the branch point is relatively close to the current position as described above, or when the branch point has already branched from the current position, the user needs to immediately determine one of the destinations. For example, if the user travels a little more and changes the destination according to the route situation and the final arrival time, the user cannot be given a grace period.

  Therefore, in the present embodiment, one of a plurality of input destinations is selected, a node series on the route to the selected destination is set as a branch point candidate, and the other destination is again started from this branch point candidate. The branch point is calculated by searching the route up to.

  The destination selection unit 1024 is a unit that selects one of the destinations input by the multiple destination input unit 1004. The branch point candidate selection unit 1023 is a unit that selects a node on the route to the selected destination as a branch point candidate among the branch point candidates calculated by the branch point candidate calculation unit 1021. For selection of a destination, for example, a searched route is compared with a destination closer to the current position, and a node on the closer route is set as a branch point candidate.

  Selecting a destination closer to the current location and using nodes on the route to this destination as branch point candidates makes it easier to calculate multiple routes for the other far destination, This is because the time difference is small. On the other hand, if a route to a closer destination is searched again using a far route as a reference, the multiple routes take a long time and result in a detour. Hereinafter, a specific example will be described.

  In the case of this example shown in FIG. 35, since the estimated arrival time of 25 minutes to “Karaoke Dom” is far from the estimated arrival time of 27 minutes to “Star Bowling”, “Karaoke Dom” is selected in the destination selection unit 1024. To do. Then, “Raku 1 Machi”, “Raku Dori 1”, and “Karaoke Dom”, which are nodes on the route to the selected “Karaoke Dom”, are selected as branch point candidates. Then, the route from each branch point candidate to “Star Bowling” is searched again by the branch point route search unit 1025.

  FIG. 37 is a map showing a plurality of routes calculated from each branch point candidate to star bowling. “Raku 1 Machi”, “Raku 2 Machi”, “Raku Dori 1” and “Karaoke Dom” nodes on the route from the current position to the selected “Karaoke Dom”, and the other “Star” The route to “Bowling” is being searched. For example, the route from “Raku 1 Machi” to “Star Bowling” passes “Raku 1 Machi”, “Raku 3 Machi”, “Raku 4 Machi”, “Kyo 4 Machi”, “Kyo 3 Machi” and “Star” The route to “boring” is being searched. The route from “Raku 2 Machi”, the next branch point candidate, to “Star Bowling” passes “Raku 2 Machi”, “Raku 4 Machi”, “Kyo 4 Machi”, “Kyo 3 Machi” and “Star” The route to “boring” is being searched. FIG. 38 shows the passage times of these plural routes using the passage time cost shown in FIG. The search route and route cost from each branch point candidate to the destination “star bowling” are shown.

  For example, the searched route ID “02” is a route searched using “Raku 1 Machi” as a branch point candidate as a departure point, and the passing node and its cost in this case are shown. In the case of this example, the search route from the current position to “Star Bowling” and the route from the branch point candidate “Raku 1 Machi” are equal, and therefore, both are indicated as the search route ID “02”.

  On the other hand, the searched route ID “03” indicates a route starting from the branch point candidate “Raku 2 Machi”. Since the cost of the route to “Raku 2 Machi” is calculated as 10 minutes from the searched route ID that is the route to “Karaoke Dom”, the cost after that is shown. For example, 12 minutes to “Raku 4 Machi”, 22 minutes to “Kyo 4 Machi”, 27 minutes to “Kyo 3 Machi”, and 29 minutes to “Star Bowling”. The route to “Star Bowling” and its cost are calculated.

  Similarly, the route and cost when branching from the branch point candidate “Rakutsu 1” is shown as the searched route ID “04”. It takes 20 minutes to "Rakutsu 1", 35 minutes to "Kyo 3machi", and 37 minutes to "Star bowling".

  The searched route ID “05” indicates the route and cost to “Star Bowling” with “Karaoke Dom” as a branch point candidate. For example, when inputting a plurality of destinations, the destination does not necessarily move to one of the destinations, and may move to the other destination after moving to one destination. A route may be calculated as a branch point candidate. It is calculated from the search route ID “01” to 25 minutes to “Karaoke Dom”, 26 minutes to the subsequent passing node “Urakura 1”, 28 minutes to “Kyo 2cho”, 30 to “Kyo 3cho” Minutes, and “Star Bowling” is 32 minutes.

  The route comparison unit 1026 is a means for comparing the costs of routes from the branch point candidates searched by the branch point route search unit 1025. Based on the comparison result, the branch point selection unit 1022 selects a branch point. This will be described using a specific example.

  The search route ID “03” is a route that turns right on “Raku 2 Machi” and heads for “Star Bowling”. Go straight through “Raku 1 Machi” from the current position (passing time cost is 5 minutes), then “Raku 2 Machi”, “Raku 4 Machi”, “Kyo 4 Machi”, “Kyo 3 Machi” and “Star Bowling” To reach. During this time, the total transit time cost is 29 minutes. Although it is 2 minutes slower than the shortest route of 27 minutes until “Star Bowling” indicated by the searched route ID “02”, the route to “Karaoke Dom” indicated by the searched route ID “01” and “Raku 2 Machi” The branch point is “Raku 2 Machi”, and the branch point is calculated at a position farther from the current position than “Raku 1 Machi”.

  Further, in the case of the searched route ID “04”, the route goes straight through “Raku 2 Machi” to “Star Bowling”. From the current position, go straight through “Raku 1 Machi” and “Raku 2 Machi” (passing time cost is 10 minutes) and pass “Raku Dori 1” and “Kyo 3 Machi” to reach “Star Bowling”. During this time, the total transit time cost is 37 minutes. The route to “Karaoke Dom” indicated by the search route ID “01” and “Rakutsu 1” are common, so the branch point is “Rakutsu 1”, which is compared with “Raku 2 Machi” and “Raku 1 Machi”. As a result, a branch point is calculated at a position far from the current position.

  There is a situation in which a user searches a plurality of destinations and finally considers which destination to go. However, when the branch point is relatively close to the current position, the user needs to immediately decide which destination to move to. For example, if the user travels a little more and changes the destination according to the route situation and the final arrival time, the user cannot be given a grace period. Therefore, using this method, calculate the route from the branch point candidate, refer to the route cost, and calculate the branch point closer to the destination or farther from the current location. It becomes possible to finally determine the destination while grasping the information.

  On the other hand, the search route ID “04” is 10 minutes later than the shortest route of 27 minutes until “Star Bowling” indicated by the search route ID “02”. In other words, the branch point is calculated at the farthest position among the three points with respect to the current position, but the branch point is calculated by making a relatively large detour with respect to the shortest path. In this case, even if it is calculated at a position far from the current position of the branch point and the user is given a time to make a final decision among a plurality of destinations, the user finally moves to “Star Bowling”. In this case, it is not preferable to take 37 minutes and 10 minutes in excess of the shortest 27 minutes. Therefore, not only the position of the branch point but also the branch point may be calculated in consideration of the cost of the route time. For example, a branch point may be calculated by providing a threshold such as a grace period of 20% (about 6 minutes) for the shortest 27 minutes. In this case, since the searched route ID “04” having an arrival time of 37 minutes exceeds the threshold, the route search ID “03” is used, and the branch point is “Raku 2 Machi”.

  The route information display unit 1011 is a unit that displays information about a route using the branch point selected by the branch point selection unit 1022. As for the display of the route information using the branch point, as shown in the first embodiment, the information required by the user such as comparing the route information up to the branch point and the information after the branch point is branched. This makes it possible to display more easily based on the points.

  Unlike the method of calculating a branch point by simply searching a plurality of routes to a destination as shown in the above embodiment, a search is performed by searching for a route based on a node on one destination route. The range can be narrowed down and the route search cost can be reduced. One destination route may be selected by the user, for example. Since the branch point is calculated on the selected route, it is often a branch point more suitable for the user. Alternatively, as shown in the above embodiment, a means for accumulating movement history may be provided separately, and a route existing in this movement history may be selected as one destination. Since the point that the user who is present in the history grasps well is calculated as a branch point, for example, even if it has never been to the other destination, it can branch off from the route that the user knows well, It is possible to easily grasp the route. Furthermore, it is possible to promote more comfortable driving by comparing the estimated arrival time up to this branch point and the difference in arrival time after the branch point.

  Hereinafter, the operation flow of the present embodiment will be described with reference to the flowchart of FIG.

  First, a plurality of destinations are input in the plurality of destination input unit 1004 (S4001). In addition, the departure point is input at the departure point input unit 1012 (S4002). The route search unit 1005 searches for a route from the input departure place to each destination (S4003). In the present embodiment, the route is searched by a series of nodes such as intersections, and this node is calculated as a branch point candidate (S4004). For example, as shown in FIG. 35, a route to the input destinations “karaoke dom” and “star bowling” is searched, and the searched nodes are calculated as branch point candidates.

  Next, in order to select a reference destination in the destination selection unit 1024, a route cost to each destination is calculated (S4005), for example, a destination with a lower route cost is selected as a reference destination. (S4006). Then, a branch point candidate on the route to the selected destination is selected (S4007), and a route from the selected branch point candidate to the other destination is searched again by the branch point route search unit 1025.

  For example, in the case of FIG. 35, the route cost to “Karaoke Dom” is as low as 25 minutes compared to the route cost of 27 minutes to “Star Bowling”. “Raku 1 Machi”, “Raku 1 Machi”, “Raku 2 Machi”, “Raku Dori 1”, “Karaoke Dom” are selected as the diverging point candidates. The route to “boring” will be searched.

  For example, a flag is set for the branch point candidate closest to the current location (S4008), and a route is searched from the set branch point candidate (S4009). Then, the cost of the searched route and the route cost searched from the current point are compared by the route comparison unit 1026 (S4010), and it is determined whether or not the value is within a threshold (for example, plus 20%) (S4011). If it is within the threshold, a flag is set for the next branch point candidate (S4012), and the process proceeds to step S4009. On the other hand, if the route cost exceeds the threshold (No in S4011), the flag is returned by one (S4013), and the branch point candidate set with the flag is selected as a branch point by the branch point selection unit 1022 (S4014). . For example, as in the first embodiment, the mode information is referred to (S4015) and the information is displayed (S4016).

(Modification in Embodiment 3)
In the above-described embodiment, when a branch point is finally determined from among branch point candidates, a branch point is selected using a threshold value (for example, less than 20% based on the cost of the comparison route). It is not limited. For example, the user may input a desired arrival time at the other destination, calculate a branch point based on whether or not it is in time for the arrival time, and display it. Hereinafter, a specific example will be described.

  FIG. 40 is a system configuration diagram in the present embodiment. In addition to the components in FIG. 34, a destination arrival scheduled time acquisition unit 1027 is added. In addition, the same code | symbol is provided to the component shown by the said embodiment, and description is abbreviate | omitted.

  The destination arrival scheduled time acquisition unit 1027 is a means for acquiring the scheduled time to arrive at the input destination. In the present embodiment, a method of determining a branch point based on the scheduled time acquired by the destination arrival scheduled time acquisition unit 1027 will be described below using a specific example.

  For example, assume that the user inputs a plurality of destinations “Movie Theater A” and “Movie Theater B”. FIG. 41 shows a map of the current position of the user and the positional relationship between “Movie Theater A” and “Movie Theater B”. In FIG. 41, black thick lines indicate the searched routes to the destinations “movie theater A” and “movie theater B” searched by the route search unit 1005. The route to “Movie Theater A” is searched for the route to “Movie Theater A” through “Raku 1 Machi”, “Raku 2 Machi”, “Ura Raku 2”, “Ura Raku 3”.

  FIG. 41 shows the route cost between nodes (the time required for passing), and route search is generally performed using these route costs. For example, 5 minutes from the current position to “Raku 1 Machi”, 10 minutes from “Raku 1 Machi” to “Raku 2 Machi” are shown. From this route cost, it can be seen that it takes 50 minutes (5 minutes + 10 minutes + 10 minutes + 10 minutes + 15 minutes) to “Movie Theater A”.

  On the other hand, the route to “Movie Theater B” is searched for the route to “Movie Theater B” through “Raku 1 Machi”, “Raku 3 Machi”, “Raku 4 Machi”, “Kyo 4 Machi”. Yes. It can be seen that the total route cost is 40 minutes (5 minutes + 5 minutes + 10 minutes + 15 minutes + 5 minutes).

  Here, among the common nodes as shown in the first embodiment, “Raku 1 Machi” is a branch point when a finally matching point is a branch point. However, this branch point is not always suitable for the user. For example, when the branch point is relatively close to the current point, such as “Raku 1 Machi”, the user must immediately decide whether to move to “Movie Theater A” or “Movie Theater B”. However, depending on the user, the suitable branch point may differ depending on the arrival time at the destination. Hereinafter, a specific example will be described.

  FIG. 42 is a display example of the route information display unit 1011 in the present embodiment. For example, assume that the user in this example wants to watch the movie “Space Wars 3”. It is assumed that “Movie Theater A” and “Movie Theater B” on which “Space Wars 3” is screened are input as a plurality of destinations. It is assumed that the current time is 11:00, the screening time at “Movie Theater A” of “Space Wars 3” is 13:00, and the screening time at “Movie Theater B” is 13:30. As a result of the route search, the required time to “Movie Theater A” is 50 minutes as shown above, and the estimated arrival time is “12:50”. Similarly, the required time to “Movie Theater B” is 40 minutes, and the estimated arrival time is “12:40”.

  Here, the screening time in each movie theater is an example of a scheduled time to arrive at the destination. The destination arrival scheduled time acquisition unit 1027 may acquire the scheduled time of arrival at such a destination from, for example, an information providing service provided by a movie theater, a play guide dealer, or the like via a network.

  Here, when the branch point is “Raku 1 Machi”, it is necessary to decide whether to go to “Movie Theater A” or “Movie Theater B” in 5 minutes. However, depending on the user, the destination may be finally determined in consideration of the estimated arrival time that varies depending on traffic conditions.

  For example, now, the estimated arrival time to “Movie Theater A” is 12:50, and the movie “Space Wars 3” is screening from 13:00, so the user wishes to move to Movie Theater A. Suppose that However, this is the estimated arrival time at the current stage, and the arrival time will change depending on the traffic conditions, etc., and may not be in time for the screening time of 13:00.

  On the other hand, “Movie Theater B” has a predicted arrival time of 12:40, which is enough time for 13:30, the screening time of “Movie Theater B”. However, the screening time is 13:30, which is later than “Movie Theater A”.

  Therefore, suppose that first head to “Movie Theater A”, and if the situation changes, give up watching the movie at “Movie Theater A” and take action toward “Movie Theater B”. Then, “Raku 1 Machi”, which will pass in 5 minutes, is not preferable for this user, and if there is a branch point that can go to any destination first, it is recommended to use that as a branch point. This is preferable.

  For example, FIG. 44 shows the current position of the user and the route cost after a predetermined time has elapsed (15 minutes have elapsed) while heading to “Movie Theater A” for a while. In the meantime, for example, it is assumed that a traffic jam occurs between the “Ura-Raku 3” intersection and “Movie Theater A”, and the route cost increases. Then, the arrival time to “Movie Theater A” also increases, and as a result, the estimated arrival time is not in time for 13:05 and 13:00. Here, it is assumed that the user finally decides to go to “Movie Theater B”.

  When searching for the route from the current location to “Movie Theater B”, turn right on “Uraku 2” as shown by the thick black line in FIG. 44, “Uraku 4”, “Kyo 2 Machi”, “Kyo 3 Machi”. ", The route passing through" Kyo 4 Town "is searched. This route cost is 30 minutes in total, such as 5 minutes from “Urakuraku 2” to “Urakuraku 4”, and the estimated arrival time to “Movie Theater B” is 12:55. From now on, even toward “Movie Theater B”, it is a point in time for the 13:30 screening time.

  Therefore, even if it is decided to come to “Ura Raku 2” and go to “Movie Theater B”, this “Ura Raku 2” can be considered as a suitable branch point for the user.

  On the other hand, FIG. 45 shows the current position of the user at a certain time point when the vehicle further travels. Also, due to running, the current time is 12:25. For example, suppose that it finally decides to go to “Movie Theater B” at the point shown in FIG. As a result of the route search, turn right on “Urakura 3” and go through “Kyo 1 town”, “Kyo 2 town”, “Kyo 2 town”, “Kyo 3 town”, “Kyo 4 town” It is assumed that a route to reach “Movie Theater B” is searched. However, the route cost when going to “Movie Theater B” at the time shown in FIG. 45 is 10 minutes to “Urakura 3”, 25 minutes to “Kyo 1cho”, 20 minutes to “Kyo 2cho”, “Kyoto” It takes 5 minutes to “3 Town”, 5 minutes to “Kyo 4 Town”, 5 minutes to “Movie Theater B”, and a total arrival time of “Movie Theater B” is 13:35. Therefore, it will not be in time for the 13:30 screening time.

  In other words, in the case of this example, if “Ura Raku 2” is passed and “Ura Raku 3” is reached, it will not be in time for 13:30, which is the desired arrival at “Movie Theater B”. “Raku 3” is not a suitable branch point for the user. Finally, the point where the user can head to “Movie Theater B” is “Ura Raku 2” shown in FIG. In other words, when traveling while considering the final destination of “Movie Theater A” or “Movie Theater B”, the appropriate branch point is “Ura Raku 2”.

  Therefore, in the present embodiment, a method for calculating a branch point in consideration of the final predicted arrival time desired by the user will be described.

  For example, in the present embodiment, the destination arrival scheduled time acquisition unit 1027 acquires the time desired for arrival. In the case of this example, as shown in FIG. 42, the screening time of “Space Wars 3” at “Movie Theater B” is 13:30, so it may be enough in the end, so “13:30 On the other hand, let's go to “Movie Theater A” where there is still a possibility of being in time. FIG. 43 shows an example in which the estimated arrival time at each destination is input by the destination estimated arrival time acquisition unit 1027. In the center of the screen, the estimated arrival time “13:00” to “Movie Theater A”, the estimated arrival time “13:30” to “Movie Theater B”, and each destination and its estimated arrival time are displayed. Therefore, it is acquired when the user selects “YES”. Note that the user can set the estimated arrival time, or may be automatically set based on the movie theater screening time or the like.

  On the other hand, among the input destinations, the destination “1024” is selected by the destination selection unit 1024. The node on the route to “Movie Theater A” selected by the branch point candidate selection unit 1023 is selected as a branch point candidate.

  FIG. 46 is a diagram illustrating calculation of a branch point. The route to the selected destination “Movie Theater A” has been searched, and the nodes “Raku 1 Machi”, “Raku 2 Machi”, “Ura Raku 2”, “Ura Raku 3” on the searched route are found. Selected as a branch point candidate. Then, the branch point route searching unit 1025 searches again for a route from the selected branch point candidate to “Movie Theater B”. For example, the route from “Raku 2 Machi” to “Movie Theater B” is “Raku 2 Machi”, “Rakutsu 1”, “Kyo 3 Machi”, “Kyo 4 Machi” and “Kyoto 4 M”. Has been explored. In addition, as a path from “Urakura 2”, which is a branch point candidate, to “Movie Theater B”, “Urakura 2”, “Urakura 4”, “Kyo 2 Machi”, “Kyo 3 Machi”, “Kyo 4 Machi” The route to “Movie Theater B” is searched for. In addition, as a path from “Urakura 3”, which is a branch point candidate, to “Movie Theater B”, “Urakura 3”, “Kyo 1 Machi”, “Kyo 2 Machi”, “Kyo 3 Machi”, “Kyo 4 Machi” The route to “Movie Theater B” is searched for. FIG. 46 shows the route cost between the nodes.

  47, as in FIG. 38 and the like, each searched route is indicated by a searched route ID, and further, a route cost between nodes and a total sum thereof are shown. For example, the search route ID “01” is a route from the current point to “Movie Theater A” and its route cost, and it is shown that it takes a total of 50 minutes. Further, the searched route ID “02” is a route that turns left on “Raku 1 Machi”, and it is shown that it takes 40 minutes in total. The searched route ID “03” is a route from the branch point candidate “Raku 2 Machi” to “Movie Theater B”, and it is shown that it takes 45 minutes in total. Further, the search route ID “04” is a route from the branch point candidate “Uraku 2” to “Movie Theater B”, and it is shown that it takes 55 minutes in total. The searched route ID “05” is a route from the branch point candidate “Urakura 3” to “Movie Theater B”, and it is shown that it takes 95 minutes in total. Here, the searched route ID “05” is suitable as a branch point because the predicted arrival time exceeds 13:30 of the arrival time input at the current time 13:35 (12: 00 + 95). The search route ID [04] that is farthest from the current location and does not exceed the input arrival time is selected, and “Urakura 2” is selected as the result branch point.

  FIG. 48 is an example in which route information to each destination is displayed based on the calculated branch point “Urakura 2”. The left side of the screen shows the route information to “Movie Theater A”. Since it takes 25 minutes to reach the branch point “Ura Raku 2”, the predicted arrival time at the branch point is “12:25”. The required time from the branch point “Urakura 2” to “Movie Theater A” is “25 minutes”, and the estimated arrival time to “Movie Theater A” is “12:50”. On the other hand, after passing through the branch point “Ura Raku 2”, the movement route to “Movie Theater B” is shown on the right side of the screen. After passing through the branch point, the required time when going to “Movie Theater B” is “30 minutes”. The predicted arrival time when moving to “Movie Theater B” via the branch point “Ura Raku 2” is “12:55”.

  As shown in FIG. 41, when using the route from the current point directly to “Movie Theater B”, the arrival time is “12:40”, which is 15 compared with the route passing through the branch point “Ura Raku 2”. Although it will be a minute later, even if it passes through the branch point “Ura-Raku 2”, the route is in time for 13:30 of the screening time. In addition, there is no traffic jam at the current point before passing “Raku 1 Machi”, and the required time after the branch point is “25 minutes”. Since there is a possibility that it will be in time for the screening time 13:00, it is possible to provide information reflecting the behavior desired by the user, such as going to the movie theater A first.

  In addition, in the display example shown in FIG. 48, the estimated arrival time at each point is displayed in a list format on each screen. More specifically, “branch point arrival prediction time 12:55” on both sides of the screen, “arrival prediction time 12:50” to “movie theater A” on the left side of the screen, and “movie theater B” on the right side of the screen “ "Predicted arrival time 12:55" is displayed. However, the display mode of the screen is not limited to this. For example, the time may be displayed near each point on a screen (for example, a display example in FIG. 9 or the like) displaying the current position. In a car navigation system, a user generally travels while displaying the current position and its surroundings at a predetermined scale.

  At this time, for example, instead of switching and displaying the screen as shown in FIG. 48, the transit time of a predetermined point on the currently displayed screen, that is, “movie theater A” “movie theater B” in this example. Each predicted arrival time may be displayed in the vicinity of the “Uraku 2” intersection, which is a branch point. It is possible to easily provide only necessary information without burdening the information grasping by simply displaying the estimated arrival time required by the user on the currently displayed screen for the driving driver. .

  In recent years when information is acquired in real time and traffic jam information becomes more detailed, a route to both directions is selected until the latest situation is as much as possible, and a destination may be finally determined. In this case, it is necessary not to simply search for a route and obtain a branch point from the searched route, but to calculate an optimal branch point that can be reached by the user and reach both destinations. By using the present invention, it is possible to obtain a more appropriate branch point.

(Embodiment 4)
In the above-described embodiment, the method of searching for one as a waypoint when a plurality of destinations are input has been described. Specifically, in FIG. 32, a karaoke dom and a star ball are input, and a path to the star ball is searched using the karaoke dom as a branch point, in this case, a transit point.

  In general, when a user searches for a plurality of destinations and considers where to go, the user may make a final decision in consideration of traffic conditions that change from moment to moment. There are also cases where the vehicle heads to the other side in view of the availability of the parking lot or the degree of congestion in the store. By searching for a route that uses the other route as described above, it is possible to automatically provide necessary information without complicated operations, and it is possible to travel safely and comfortably.

  Furthermore, it is good also as controlling these by the category kind of a destination, the difference or similarity of a category. Hereinafter, a specific example will be described.

  FIG. 49 is a system configuration diagram. In addition to the components shown in FIG. 34, a destination category determination unit 1028 is added. The destination category determination unit 1028 is a means for determining, for example, the difference between the destination categories input by the multiple destination input unit 1004. Then, based on the difference in category, it is determined whether or not one destination is used as a transit point, and a branch point selection unit 1022 selects a branch point. For example, if the category is the same, one destination is not selected as a branch point, that is, not selected as a transit point, and if it is different, one destination is selected as a branch point, that is, as a transit point. Let's choose. Here, the destination category determination unit 1028 is an example of a destination classification determination unit described in the claims.

  If the entered destination category is the same, the user generally wants to go to one of these destinations, and finally chooses which destination to go to according to the situation. I often try to do it. On the other hand, if the destination category entered is different, the user eventually wants to go to any of these destinations, and depending on the situation, the user should first go to either destination. In some cases, the order is only decided.

  Therefore, it is controlled whether or not the destination is selected as a branch point depending on the category.

  Note that the process from searching for a route from a plurality of destinations input in this system to calculating branch point candidates is the same as in the above embodiment.

  FIG. 50 is a diagram showing searched routes and branch point candidates. Karaoke destination dom and star bowling are input in the multiple destination input unit 1004, and a route to the karaoke dom is searched in the route search unit 1005.

  Further, the branch point candidate calculation unit 1021 calculates a branch point candidate, and the branch point route search unit 1025 searches for a route from each branch point candidate to the star bowling. For example, it is assumed that two routes are searched for: a route that turns right at the Raku 2-cho intersection and goes directly to Star Bowling, and a route that goes to Star Bowling via Karaoke Dom. Here, the route comparison unit 1026 compares the routes, and the branch point selection unit 1022 selects the optimum branch point. In this example, control is performed according to the category of the destination.

  In this example, the karaoke dom category is karaoke and the star bowling category is bowling. In this case, since the categories are different, the karaoke dom is selected as a branch point, that is, as a waypoint, and the route is displayed. When the categories are different in this way, the user desires to go to both karaoke dom and star bowling, and may first select which one to go to. By selecting one of the destinations as a branch point, that is, a waypoint, and providing route information, it is possible to travel safely while taking into account the situation such as traffic congestion without complicated operations.

  FIG. 51 is a diagram illustrating a case where a destination with a different category is input. The karaoke dom and the karaoke utamaru are input in the multiple destination input unit 1004, and the route to the karaoke dom is searched in the route search unit 1005. Further, a branch point candidate is calculated in the branch point candidate calculation unit 1021, and a route from each branch point candidate to the karaoke utamaru is searched in the branch point route search unit 1025. For example, it is assumed that two routes are searched for: a route that turns right at the Raku 2-cho intersection and goes directly to Karaoke Utamaru and a route that goes to Karaoke Utamaru via Karaoke Dom.

  Since both of these destinations are karaoke categories, a route that has a karaoke dom as a branch point, that is, a route that passes through the karaoke dom, is not selected. The route and the route to turn right and go to Karaoke Utamaru will be shown.

  In this way, when the categories are the same, there are few cases where the user eventually wants to go to both karaokes, for example, avoiding traffic jams, thinking that only one of the karaokes is being selected It is done. Therefore, when the category is the same, a route having one destination as a branch point is not selected, and an optimal branch point may be selected in consideration of time or the like as described in the above embodiment.

  Furthermore, it is also possible to control whether or not one of the destinations is used as a transit point to the other depending on the type of category. Hereinafter, description will be made with reference to FIGS. 52, 53, and 54.

  FIG. 52 is a diagram for explaining selection of a branch point candidate. In FIG. 52, star boring and McDones Burger are input as a plurality of destinations. A route to McDones Burger and a route from each branch point candidate to star bowling are searched. For example, it is assumed that a route that turns right at the Rakuchocho intersection and goes directly to Star Bowling and a route that goes to Star Bowling via McDones Burger are being searched. Here, the McDones Burger category is fast food.

  Fast food restaurants such as McDones Burger are generally places where you can have a light meal, staying for a long time is generally rare, and there are also drive-through etc., so you can move around in a relatively short time It is a point. For example, it is assumed that the user of this example finally goes to star bowling but intends to stop if he can stop by McDones Burger in time, and tries to make a judgment according to traffic conditions. It is assumed that a plurality of movement destinations are input.

  In this way, a destination with a relatively short stay time often moves to a new location after a visit, and it is desirable to search for a route with one destination as a branch point, that is, a waypoint, taking time into consideration. . Therefore, for example, according to the input destination category, it may be determined whether or not the destination is a transit point to another destination. For example, a travel destination having a relatively short stay may be searched as a transit point, and a travel destination having a relatively long stay may not be selected as a transit point.

  For example, the destination category determination unit 1028 accumulates information representing a category and a general stay time at the destination belonging to the category, and obtains the stay time for each category of the destination by referring to this information. Good. Here, the destination category determination unit 1028 is an example of a destination stay time determination unit described in the claims. Then, it is determined whether or not one destination is a waypoint to the other according to the obtained stay time, and a branch point selection unit 1022 selects a branch point.

  FIG. 53 is a diagram showing information representing the relationship between the category and the staying time. The stay time at the destination belonging to each category is shown as 15 minutes for fast food, 1 hour for restaurants, 2 hours for movie theaters, and 1 hour for bowling. For example, it is possible to accurately calculate a branch point from a branch point candidate by determining the stay time based on the destination category and calculating the route cost in consideration of the stay time.

  For example, in FIG. 53, the time required for star boring is 20 minutes (= 5 minutes + 15 minutes). On the other hand, it takes 22 minutes (= 5 minutes + 5 minutes + 12 minutes) via McDones Burger, and 37 minutes (= 22 minutes + 15 minutes), taking into account the McDones Burger stay time of 15 minutes. Will be able to go to star bowling in a relatively short time. Here, as shown in the above-described embodiment, it may be determined whether or not a route is selected by determining whether or not it exceeds a predetermined range, for example, one hour or more.

  FIG. 54 is a diagram for explaining the waypoint selection control by category as in FIG. In FIG. 54, Star Bowling and Michael Movie Theater are input as a plurality of destinations. The route to the Michael Movie Theater, the route to the right at the Rakucho 2-machi intersection and heading directly to Star Bowling, and the route going through the Michael Movie Theater are being searched. Here, the category of the Michael movie theater is the movie theater, and the staying time is 2 hours from FIG.

  Here, if the required time for each route is calculated, the required time to star boring is 20 minutes (= 5 minutes + 15 minutes). On the other hand, in the case of going through the Michael movie theater, it takes 25 minutes (= 5 minutes + 10 minutes + 10 minutes), and when the Michael movie theater stay time is 1 hour, it becomes 1 hour 25 minutes (= 1 hour + 25 minutes). In other words, if you go through the Michael Movie Theater, you will be far behind compared to the time required to go directly to Star Bowling.

  In this way, when a destination is input that is considered to be a relatively long time in one side, it is unlikely that multiple destinations were entered at the same time in order to move to the other destination after approaching the destination. In many cases, it is desirable to determine that an input has been made in order to select one of them. Accordingly, as shown in this example, it is possible to determine the waypoint selection with reference to the category of the destination.

  In some cases, it is possible to determine whether one of the two destinations is a transit point to the other, or one of the two destinations is the destination, based on the user's past actions. Therefore, for example, as shown in the above-described embodiment, the user's movement history may be accumulated and controlled using the movement history. The movement history of the user can be accumulated, for example, by adding a movement history accumulation unit 1101 shown in FIG. 17 to the configuration shown in FIG.

  FIG. 55 shows the accumulated movement history. Similar to the movement history shown in FIG. 18, the movement history accumulated as the user travels is shown. For example, as the movement history ID 01, a history of leaving home at 9:40 on September 10, 2006 and arriving at McDones Burger, the destination, on the same day at 10:00 is stored. Further, as the movement history ID 02, there is accumulated a history of leaving MacDones Burger at 10:18 on the same day and arriving at the destination star bowling at 10:41 on the same day.

  From these travel histories, it can be seen that in the past, he first went to McDones Burger and then headed to Star Bowling. Thus, in the past, when the user has first traveled to a destination as a transit point and then to another destination, it can be considered that the same movement is performed again this time. Therefore, it may be possible to control whether or not to make a transit point in consideration of the continuity of movement from the movement history.

  Note that, after passing through the branch point, it may be controlled according to the category whether or not the route to the other destination is re-searched. Passing through the selected branch point means that one destination is selected and the other is not selected. Therefore, the route to the other destination that was not selected may not be re-searched and may be automatically deleted. Hereinafter, description will be made with reference to the drawings.

  FIG. 56 is a diagram for explaining route search after passing through a branch point. In FIG. 56, as in FIG. 41, FIG. 45, etc., a plurality of destinations of the movie theater A and the movie theater B are input, and the back music 2 intersection is selected from the branch point candidates as the branch point. And the route to the cinema B that branches off the 2nd intersection of Urakura. As described above, it is possible to travel while comparing the arrival time to the movie theater A and the arrival time to the movie theater B without complicated operations.

  On the other hand, FIG. 57 is a diagram showing a situation in which the user has passed the Urakura 2 intersection, which is a branch point. Here, passing through the Urakura 2 intersection and proceeding straight means that the user finally selected the movie theater A. Thereafter, in the conventional car navigation system that continues to search for the route to the destination that is generally input, the route to the movie theater B is searched again. That is, in this example, even after passing through the Urakura 2 intersection, it is possible to follow the route indicated by the dotted line toward the cinema B after turning right at the Urakura 3 intersection. Will be re-searched and displayed.

  However, the fact that one route was selected through the calculated branch point shown in the present invention means that the other destination was not selected. If the route to the destination is re-searched, unnecessary information is provided, which is not preferable for driving.

  Therefore, after passing through the branch point, it is preferable to automatically delete the route without re-searching the route to the other destination. For example, in the case of this example, it is assumed that the route to the movie theater B is not searched after passing straight through the Urakura 2 intersection which is a branch point.

  In addition, it is also possible to use the above-described difference in destination category for deleting such a route. For example, when a destination with the same category is input, such as a movie theater, the user intends to go to only one destination in the end, and therefore the route after the branch point shown above when the category is the same. It is good also as deleting.

  Furthermore, it is good also as utilizing the stay time regarding the category of a movement destination for the deletion of such a path | route. For example, FIG. 58 is a diagram illustrating a case where the user moves again after moving to the movie theater A. In FIG. 57, it is assumed that the user who has gone straight through the Urakura 2 intersection and selected movie theater A then arrives at movie theater A and immediately moves again.

  Here, referring to the staying time relating to the destination category shown in FIG. 53, the staying time in the movie theater is 2 hours. Nevertheless, if the actual stay time of the user at the destination is shorter than the stay time for the category of the destination, for example, 10 minutes, the movie can be fulfilled. It can also be thought that it is moving again because there is not. Therefore, when the average stay time is shorter than 2 hours, the other route inputted as a plurality of destinations, that is, the route to the movie theater B may be searched again and displayed. In FIG. 58, the route from movie theater A to movie theater B is searched.

  On the other hand, when staying for 2 hours or more, the route to the movie theater B is not searched because the purpose is fulfilled. In this way, by controlling the route information of multiple destinations in consideration of the stay time related to the destination category, it is possible to provide information reflecting the purpose of the user's action more easily without performing complicated operations. It is possible to support safe driving.

  Heretofore, it has been described that the branch point is calculated from the map information stored in the map information storage unit 1003 as a candidate (node) such as an intersection or a landmark. In general, map information stores node information in units of intersections and landmarks, and route search is generally performed based on the time cost between nodes. . In addition, since a point where a route branches in a car navigation system is generally an intersection, it is shown that a branch point can be obtained by calculating a branch point by searching a series of nodes such as this intersection as a route.

  However, when presenting information about a branch point to a moving user, it may not always be in time if presented at the branch point. For example, when an intersection in which a right turn lane and a straight lane are provided is calculated as a branch point, the point where the branch action can actually be taken is not the intersection but the position where the right turn lane and the straight lane start.

  In this case, the point where the user should be provided with information regarding the branch point is not the calculated intersection but the point where the right turn lane and the straight lane provided at the intersection start. Therefore, for example, instead of using only a node such as an intersection, the position of the branch point may be corrected using information on the traffic rules of the route such as a right / left turn lane. Hereinafter, description will be made with reference to the drawings.

  FIG. 59 is a diagram for explaining the calculation of branch points using traffic rules. 59, as in FIG. 23, Sakura Golf Course and Miyazato Golf Course are input as destinations. In addition, the No. 111 intersection is calculated as a branch point from a route search using the intersection as a node. When going to Sakura Golf Course, go straight at No. 111 intersection, and when going to Miyazato Golf Course, turn right at No. 111 intersection.

  The branch point on the route is the No. 111 intersection. At the No. 111 intersection, if you go to the Sakura Golf Course, go straight to the lane on the left side of the screen. Suppose you do not. In such a case, simply providing information at the No. 111 intersection, which is a branch point on the route, is not appropriate because it is not enough to change the course.

  For example, assume that you are currently driving on a right turn lane. And if you decide to go to Sakura Golf Course from the information about the fee and arrival time, you need to change the course to the straight lane on the left side, but it is impossible to notify such information at the No. 111 intersection Is dangerous.

  Therefore, for example, together with the map information described above, information related to the traffic rules of the route such as a right / left turn lane set at the intersection is stored in the map information storage unit 1003, and the user actually refers to the information. It is desirable to correct the branch point to the point where the branch action is taken. Here, the map information storage unit 1003 is an example of the traffic rule storage unit described in the claims.

  As shown in this example, when a right turn lane and a straight lane are provided and the lanes to be entered differ depending on the destination, the branch point is corrected to the point where those lanes start, and the corrected branch point is used as the basis. It is possible to provide information more safely by providing information to

  Further, here, the left and right turn lanes have been described as an example. However, for example, when a highway and a general road become branch points, the point before the lane entering the highway is the action branch point. Furthermore, as shown in the above-described embodiment, the normal travel history is accumulated, for example, when the user is not good at narrow roads, for beginners, etc. The previous intersection or the like may be calculated as a branch point. It is possible to calculate a branch point in consideration of the driving characteristics of the driver.

  The present invention provides a route information display device that is provided in, for example, a car navigation device or a portable terminal as a device for displaying route information, and makes it easier to grasp information in consideration of branch points of routes to a plurality of destinations. Available as

FIG. 1 is a system configuration diagram according to the first embodiment. FIG. 2 is a diagram showing a display screen in the first embodiment. FIG. 3 is a diagram illustrating a plurality of movement destinations in the first embodiment. FIG. 4 is a diagram showing the searched route in the first embodiment. FIG. 5 is a diagram showing the searched route in the first embodiment. FIG. 6 is a diagram showing the mode information in the first embodiment. FIG. 7 is a diagram showing a display example of the screen in the first embodiment. FIG. 8 is a diagram for explaining determination of a display area in the first embodiment. FIG. 9 is a diagram showing a display example of the screen in the first embodiment. FIG. 10 is a diagram showing a display example of the screen in the first embodiment. FIG. 11 is a flowchart according to the first embodiment. FIG. 12 is a flowchart in the first embodiment. FIG. 13 is a flowchart according to the first embodiment. FIG. 14 is a system configuration diagram according to the first embodiment. FIG. 15 is a diagram illustrating a display example of the screen in the first embodiment. FIG. 16 is a diagram illustrating a display example of the screen in the first embodiment. FIG. 17 is a system configuration diagram according to the second embodiment. FIG. 18 is a diagram showing a movement history in the second embodiment. FIG. 19 is a diagram illustrating calculation of a branch point in the second embodiment. FIG. 20 is a diagram illustrating the searched route in the second embodiment. FIG. 21 is a diagram illustrating the searched route in the second embodiment. FIG. 22 is a diagram showing the searched route in the second embodiment. FIG. 23 is a diagram illustrating a screen display example according to the second embodiment. FIG. 24 is a flowchart in the second embodiment. FIG. 25 is a flowchart in the second embodiment. FIG. 26 is a system configuration diagram in the second embodiment. FIG. 27 is a system configuration diagram according to the second embodiment. FIG. 28 is a diagram illustrating branch point calculation in a modification of the second embodiment. FIG. 29 is a diagram illustrating branch point calculation in a modification of the second embodiment. FIG. 30 is a diagram illustrating branch point calculation in a modification of the second embodiment. FIG. 31 is a diagram illustrating branch point calculation in a modification of the second embodiment. FIG. 32 is a diagram illustrating branch point calculation in a modification of the second embodiment. FIG. 33 is a diagram illustrating branch point calculation in a modification of the second embodiment. FIG. 34 is a system configuration diagram according to the third embodiment. FIG. 35 is a diagram illustrating calculation of a branch point in the third embodiment. FIG. 36 is a diagram illustrating branch point calculation in the third embodiment. FIG. 37 is a diagram illustrating branch point calculation in the third embodiment. FIG. 38 is a diagram illustrating branch point calculation in the third embodiment. FIG. 39 is a flowchart in the third embodiment. FIG. 40 is a system configuration diagram in a modification of the third embodiment. FIG. 41 is a diagram showing a route search in a modification of the third embodiment. FIG. 42 is a diagram illustrating a route search in a modification of the third embodiment. FIG. 43 is a diagram illustrating a display example in the modification of the third embodiment. FIG. 44 is a diagram illustrating a route search in a modification of the third embodiment. FIG. 45 is a diagram illustrating a route search in a modification of the third embodiment. FIG. 46 is a diagram showing a route search in the modification of the third embodiment. FIG. 47 is a diagram showing a route search in the modification of the third embodiment. FIG. 48 is a diagram showing a route search in the modification of the third embodiment. FIG. 49 is a system configuration diagram according to the fourth embodiment. FIG. 50 is a diagram illustrating branch point selection according to the fourth embodiment. FIG. 51 is a diagram illustrating branch point selection in the fourth embodiment. FIG. 52 is a diagram illustrating branch point selection according to the fourth embodiment. FIG. 53 is a diagram showing the stay time of each category in the fourth embodiment. FIG. 54 is a diagram illustrating branch point selection according to the fourth embodiment. FIG. 55 is a diagram showing a movement history in the fourth embodiment. FIG. 56 is a diagram illustrating branch point selection according to the fourth embodiment. FIG. 57 is a diagram illustrating branch point selection according to the fourth embodiment. FIG. 58 is a diagram illustrating branch point selection according to the fourth embodiment. FIG. 59 is a diagram illustrating branch point selection according to the fourth embodiment.

Explanation of symbols

1001 Category input unit 1002 Multiple destination search unit 1003 Map information storage unit 1004 Multiple destination input unit 1005 First route search unit 1006 Second route search unit 1007 Branch point calculation unit 1008 Mode information storage unit 1009 Display mode determination unit 1010 Display Control unit 1011 Route information display unit 1012 Departure point input unit 1013 Route search unit 1021 Branch point candidate calculation unit 1022 Branch point selection unit 1023 Branch point candidate selection unit 1024 Destination selection unit 1025 Branch point route search unit 1026 Route comparison unit 1027 Movement Expected arrival time acquisition unit 1028 Destination category determination unit 1101 Movement history storage unit

Claims (6)

A departure point input means for receiving the input of the departure point;
A plurality of destination input means for accepting inputs of destinations at a plurality of different points;
Route search means for searching a route from the departure place to each destination as a point sequence;
A branch point calculating means for calculating a final point among points common to the respective routes as a branch point;
Route information display means for displaying information about the route using the branch point,
The display means is based on the distance from the departure point to the branch point calculated by the branch point calculation means, or information on the route from the departure point to the branch point, or from the branch point to the destination A route information display device characterized by displaying information on the route of the route. The display means displays information on a route from the departure point to the branch point when a distance from the departure point to the branch point calculated by the branch point calculation unit is longer than a predetermined distance. The route information display device according to claim 1. The display means displays information on a route from the branch point to the destination when the distance from the departure point to the branch point calculated by the branch point calculation means is shorter than a predetermined distance. The route information display device according to claim 1. The display means changes and displays information on the route according to a ratio of the distance from the departure point to the branch point calculated by the branch point calculation means and the distance from the branch point to the destination. The route information display device according to claim 1. A departure point input step for receiving an input of a departure point;
A multi-destination input step for accepting inputs of destinations at a plurality of different points;
A route search step for searching a route from the departure point to each destination as a point sequence;
A branch point calculating step for calculating a final point among points common to the respective routes as a branch point;
A display step of displaying information on the route using the branch point,
In the display step, based on the distance from the departure point to the branch point calculated in the branch point calculation step, information on a route from the departure point to the branch point, or from the branch point to the destination A route information display method characterized by displaying information on the route of the route.   A program causing a computer to execute the steps included in the route information display method according to claim 5.

Images