US20090048774A1 - Route information display device and route information display method - Google Patents

Route information display device and route information display method Download PDF

Info

Publication number
US20090048774A1
US20090048774A1 US11/918,604 US91860406A US2009048774A1 US 20090048774 A1 US20090048774 A1 US 20090048774A1 US 91860406 A US91860406 A US 91860406A US 2009048774 A1 US2009048774 A1 US 2009048774A1
Authority
US
United States
Prior art keywords
branch point
route
destination
unit
point
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Abandoned
Application number
US11/918,604
Other languages
English (en)
Inventor
Mototaka Yoshioka
Jun Ozawa
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Panasonic Corp
Original Assignee
Individual
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Individual filed Critical Individual
Priority to US12/048,049 priority Critical patent/US8131467B2/en
Assigned to MATSUSHITA ELECTRIC INDUSTRIAL CO., LTD. reassignment MATSUSHITA ELECTRIC INDUSTRIAL CO., LTD. ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: OZAWA, JUN, YOSHIOKA, MOTOTAKA
Assigned to PANASONIC CORPORATION reassignment PANASONIC CORPORATION CHANGE OF NAME (SEE DOCUMENT FOR DETAILS). Assignors: MATSUSHITA ELECTRIC INDUSTRIAL CO., LTD.
Publication of US20090048774A1 publication Critical patent/US20090048774A1/en
Abandoned legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G01—MEASURING; TESTING
    • G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
    • G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
    • G01C21/34—Route searching; Route guidance
    • G01C21/36—Input/output arrangements for on-board computers
    • G01C21/3679—Retrieval, searching and output of POI information, e.g. hotels, restaurants, shops, filling stations, parking facilities
    • G01C21/3682—Retrieval, searching and output of POI information, e.g. hotels, restaurants, shops, filling stations, parking facilities output of POI information on a road map
    • G—PHYSICS
    • G01—MEASURING; TESTING
    • G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
    • G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
    • G01C21/34—Route searching; Route guidance
    • G01C21/3407—Route searching; Route guidance specially adapted for specific applications
    • G01C21/343—Calculating itineraries, i.e. routes leading from a starting point to a series of categorical destinations using a global route restraint, round trips, touristic trips
    • G—PHYSICS
    • G01—MEASURING; TESTING
    • G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
    • G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
    • G01C21/34—Route searching; Route guidance
    • G01C21/3453—Special cost functions, i.e. other than distance or default speed limit of road segments
    • G01C21/3484—Personalized, e.g. from learned user behaviour or user-defined profiles
    • G—PHYSICS
    • G01—MEASURING; TESTING
    • G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
    • G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
    • G01C21/34—Route searching; Route guidance
    • G01C21/36—Input/output arrangements for on-board computers
    • G01C21/3605—Destination input or retrieval
    • G01C21/3611—Destination input or retrieval using character input or menus, e.g. menus of POIs
    • G—PHYSICS
    • G01—MEASURING; TESTING
    • G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
    • G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
    • G01C21/34—Route searching; Route guidance
    • G01C21/36—Input/output arrangements for on-board computers
    • G01C21/3626—Details of the output of route guidance instructions
    • G01C21/3632—Guidance using simplified or iconic instructions, e.g. using arrows
    • G—PHYSICS
    • G01—MEASURING; TESTING
    • G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
    • G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
    • G01C21/34—Route searching; Route guidance
    • G01C21/36—Input/output arrangements for on-board computers
    • G01C21/3626—Details of the output of route guidance instructions
    • G01C21/3635—Guidance using 3D or perspective road maps
    • G—PHYSICS
    • G01—MEASURING; TESTING
    • G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
    • G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
    • G01C21/34—Route searching; Route guidance
    • G01C21/36—Input/output arrangements for on-board computers
    • G01C21/3626—Details of the output of route guidance instructions
    • G01C21/3641—Personalized guidance, e.g. limited guidance on previously travelled routes
    • G—PHYSICS
    • G01—MEASURING; TESTING
    • G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
    • G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
    • G01C21/34—Route searching; Route guidance
    • G01C21/36—Input/output arrangements for on-board computers
    • G01C21/3626—Details of the output of route guidance instructions
    • G01C21/3655—Timing of guidance instructions
    • G—PHYSICS
    • G01—MEASURING; TESTING
    • G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
    • G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
    • G01C21/34—Route searching; Route guidance
    • G01C21/36—Input/output arrangements for on-board computers
    • G01C21/3667—Display of a road map
    • G01C21/3673—Labelling using text of road map data items, e.g. road names, POI names
    • G—PHYSICS
    • G01—MEASURING; TESTING
    • G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
    • G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
    • G01C21/34—Route searching; Route guidance
    • G01C21/36—Input/output arrangements for on-board computers
    • G01C21/3667—Display of a road map
    • G01C21/3676—Overview of the route on the road map
    • G—PHYSICS
    • G01—MEASURING; TESTING
    • G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
    • G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
    • G01C21/34—Route searching; Route guidance
    • G01C21/36—Input/output arrangements for on-board computers
    • G01C21/3697—Output of additional, non-guidance related information, e.g. low fuel level

Definitions

  • the present invention relates to a destination display device that displays a destination of a user, and is applied, in particular, to a destination display device applied to a mobile terminal device such as a vehicle navigation system (hereinafter referred to as a car navigation system).
  • a vehicle navigation system hereinafter referred to as a car navigation system
  • Patent Reference 1 there is a device that displays information related to final destinations corresponding to a searched keyword, such as “restaurant”, inputted at a mobile terminal such as a car navigation system.
  • Patent Reference 1 Japanese Laid-Open Patent Application No. 2004-132884
  • Patent Reference 2 Japanese Laid-Open Patent Application No. 2005-91249
  • a user may often require not just route information to each destination, but also information related to branch points that are boundaries between common and different portions among the routes to the respective destinations.
  • a branch point is a point that is invariably passed regardless of which destination the user is headed.
  • An estimated time of arrival at the branch point or traffic information is information that is important to the user, and in some cases, the user may also require an arrival time at a destination beyond the branch point.
  • the above-mentioned Patent Reference 2 discloses a device that searches a plurality of travel routes with respect to a single inputted destination and calculates a branch point from congruities and differences among the searched travel routes.
  • the device disclosed in the Patent Reference 2 is limited to one destination, and is not arranged to calculate branch points for a plurality of different destinations as is the case with the present invention.
  • an object of the present invention is to provide a route information display device that calculates a branch point among routes to a plurality of inputted destinations, and uses the branch point to control information modes.
  • a route information display device of the present invention includes: a departure point input unit which accepts input of a departure point; a multiple destination input unit which accepts input of a plurality of different destination points; a route search unit which searches for routes from the departure point to the respective destinations as point sequences; a branch point calculation unit which calculates a last point among points that are shared by the respective routes as a branch point; and a route information display unit which displays information regarding the route using the branch point
  • a route information display device enables a user to comprehend necessary information among information regarding a plurality of inputted destinations in an easy manner by, for instance, contrasting and displaying information required by the user such as estimated times of arrival at branch points, congestion information, as well as information regarding routes to respective destinations beyond the branch points.
  • FIG. 1 is a system configuration diagram according to a first embodiment.
  • FIG. 2 is a diagram showing a display screen according to the first embodiment.
  • FIG. 3 is a diagram showing a plurality of destinations according to the first embodiment.
  • FIG. 4 is a diagram showing searched routes according to the first embodiment.
  • FIG. 5 is a diagram showing searched routes according to the first embodiment.
  • FIG. 6 is a diagram showing mode information according to the first embodiment.
  • FIG. 7 is a diagram showing a display example of a screen according to the first embodiment.
  • FIG. 8 is a diagram describing determination of a display area according to the first embodiment.
  • FIG. 9 is a diagram showing a display example of a screen according to the first embodiment.
  • FIG. 10 is a diagram showing a display example of a screen according to the first embodiment.
  • FIG. 11 is a flowchart according to the first embodiment.
  • FIG. 12 is a flowchart according to 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 showing a display example of a screen according to the first embodiment.
  • FIG. 16 is a diagram showing a display example of a screen according to the first embodiment.
  • FIG. 17 is a system configuration diagram according to a second embodiment.
  • FIG. 18 is a diagram showing travel histories according to the second embodiment.
  • FIG. 19 is a diagram showing calculation of a branch point according to the second embodiment.
  • FIG. 20 is a diagram showing searched routes according to the second embodiment.
  • FIG. 21 is a diagram showing searched routes according to the second embodiment.
  • FIG. 22 is a diagram showing searched routes according to the second embodiment.
  • FIG. 23 is a diagram showing a display example of a screen according to the second embodiment.
  • FIG. 24 is a flowchart according to the second embodiment.
  • FIG. 25 is a flowchart according to the second embodiment.
  • FIG. 26 is a system configuration diagram according to the second embodiment.
  • FIG. 27 is a system configuration diagram according to the second embodiment.
  • FIG. 28 is a diagram showing branch point calculation according a variation of the second embodiment.
  • FIG. 29 is a diagram showing branch point calculation according to the variation of the second embodiment.
  • FIG. 30 is a diagram showing branch point calculation according to the variation of the second embodiment.
  • FIG. 31 is a diagram showing branch point calculation according to the variation of the second embodiment.
  • FIG. 32 is a diagram showing branch point calculation according to the variation of the second embodiment.
  • FIG. 33 is a diagram showing branch point calculation according to the variation of the second embodiment.
  • FIG. 34 is a system configuration diagram according to a third embodiment.
  • FIG. 35 is a diagram showing branch point calculation according to the third embodiment.
  • FIG. 36 is a diagram showing branch point calculation according to the third embodiment.
  • FIG. 37 is a diagram showing branch point calculation according to the third embodiment.
  • FIG. 38 is a diagram showing branch point calculation according to the third embodiment.
  • FIG. 39 is a flowchart according to the third embodiment.
  • FIG. 40 is a system configuration diagram according to a variation of the third embodiment.
  • FIG. 41 is a diagram showing route search according to the variation of the third embodiment.
  • FIG. 42 is a diagram showing route search according to the variation of the third embodiment.
  • FIG. 43 is a diagram showing a display example according to the variation of the third embodiment.
  • FIG. 44 is a diagram showing route search according to the variation of the third embodiment.
  • FIG. 45 is a diagram showing route search according to the variation of the third embodiment.
  • FIG. 46 is a diagram showing route search according to the variation of the third embodiment.
  • FIG. 47 is a diagram showing route search according to the variation of the third embodiment.
  • FIG. 48 is a diagram showing route search according to the variation of the third embodiment.
  • FIG. 49 is a system configuration diagram according to a fourth embodiment.
  • FIG. 50 is a diagram showing branch point selection according to the fourth embodiment.
  • FIG. 51 is a diagram showing branch point selection according to the fourth embodiment.
  • FIG. 52 is a diagram showing branch point selection according to the fourth embodiment.
  • FIG. 53 is a diagram showing durations of stay for respective categories according to the fourth embodiment.
  • FIG. 54 is a diagram showing branch point selection according to the fourth embodiment.
  • FIG. 55 is a diagram showing travel histories according to the fourth embodiment.
  • FIG. 56 is a diagram showing branch point selection according to the fourth embodiment.
  • FIG. 57 is a diagram showing branch point selection according to the fourth embodiment.
  • FIG. 58 is a diagram showing branch point selection according to the fourth embodiment.
  • FIG. 59 is a diagram showing branch point selection according to the fourth embodiment.
  • a route information display device of the present invention includes a departure point input unit which accepts input of a departure point; a multiple destination input unit which accepts input of a plurality of different destination points; a route search unit which searches for routes from the departure point to the respective destinations as point sequences; a branch point calculation unit which calculates a last point among points that are shared by the respective routes as a branch point; and a route information display unit which displays information regarding the route using the branch point.
  • the route information display device further includes: a destination selection unit which selects one of the destinations inputted to the destination input unit; a branch point candidate selection unit which selects, as a branch point candidate, a point included in a route from the departure point to the destination selected by the destination selection unit; a branch point route search unit which searches for a route from the branch point selected by the branch point candidate selection unit to a destination inputted to the destination input unit other than the destination selected by the destination selection unit; and a branch point selection unit which selects a branch point from the route searched out by the branch point route search unit.
  • the route information display unit may display information regarding the route using the branch point selected by the branch point selection unit.
  • the route information display device further includes a route comparison unit which compares, using route costs, the route searched out by the branch point route search unit with the route from the departure point to the destination which has been searched out by the route search unit.
  • the branch point selection unit may select from the branch point candidates a branch point having a route cost that is within a predetermined range, according to the route comparison unit, and the display unit may display information regarding the route using the branch point selected by the branch point selection unit.
  • the route information display device further includes a destination estimated arrival time acquisition unit which acquires estimated times of arrival at the respective destinations inputted to the destination input unit.
  • the branch point selection unit may select a branch point from the branch point candidates based on the route searched out by the branch point route search unit and the destination estimated times of arrival.
  • the destination estimated arrival time acquisition unit may acquire the estimated times from an external information providing service via a network.
  • the route information display device further includes a destination classification judgment unit which judges classifications of destinations inputted to the destination input unit.
  • the branch point selection unit may select the branch point by setting the destinations as branch point candidates according to similarities/differences of the classifications of the destinations classified by the destination classification judgment unit.
  • the route information display device further includes a destination duration-of-stay judgment unit which judges a duration of stay for each classification of the destinations inputted to the destination input unit.
  • the branch point selection unit may select the branch point according to the durations of stay judged by the destination duration-of-stay judgment unit.
  • the route information display device further includes a travel history accumulation unit which accumulates a point and a transit time history of the point.
  • the branch point selection unit may judge, using the travel history accumulation unit, whether a history that passes through the destinations inputted to the destination input unit exists, and to select the branch point according to whether the pass-through exists.
  • the route information display device further includes a traffic regulation accumulation unit which accumulates information regarding a traffic regulation of a route.
  • the branch point selection unit may correct the location of the selected branch point based on the traffic regulation indicated by the information accumulated in the traffic regulation accumulation unit.
  • the route search unit further searches for a plurality of different routes from the departure point to the respective destinations
  • the branch point calculation unit further includes: a branch point candidate calculation unit which selects a route from the routes searched out by the route search unit per destination, and to calculate a plurality of branch point candidates using combinations of the selected routes; and a branch point selection unit which selects a branch point from the branch point candidates, based on distances from the departure point to the branch point candidates calculated by the branch point candidate calculation unit.
  • the route information display unit may display information regarding the route using the branch point selected by the branch point selection unit.
  • the branch point selection unit may select a branch point at a location that is further away from the departure point.
  • the display unit may display information regarding the route from the departure point to the branch point and the information regarding the route from the branch point to the destination inputted to the destination input unit in different modes.
  • the display mode for the display unit may be changed according to a degree of coincidence of classifications of the destinations inputted to the destination input unit.
  • the display unit may display information regarding a route from the departure point to the branch point calculated by the branch point calculation unit.
  • the display unit may display information regarding a route from the branch point calculated by the branch point calculation unit to the destination.
  • the route information display device is display contents displayed by the display unit are changed based on a distance from the departure point to the branch point calculated by the branch point calculation unit.
  • the display unit may display information regarding the route from the departure point to the branch point.
  • the display unit may display information regarding the route from the branch point to the destination.
  • the display unit may change and display information regarding a route, according to the ratio of the distance from the departure point to the branch point calculated by the branch point calculation unit to the distance from the branch point to the destination.
  • the display unit may display information regarding the route from the departure point to the branch point.
  • the route information display device further includes a travel history accumulation unit which accumulates a point and a history of a transit time at the point.
  • the route search unit may search for a route using a travel history accumulated in the travel history accumulation unit.
  • the route information display device further includes a destination prediction unit which predicts a plurality of future destinations from the travel histories accumulated in the travel history accumulation unit.
  • the plurality of destinations predicted by the destination prediction unit may be inputted to the destination input unit.
  • the present invention may not only be realized as a route information display device such as described above, but also as a route information display method or a computer program.
  • a route information display device according to the present invention will be described below with reference to the drawings.
  • FIG. 1 is a system configuration diagram showing an example of a route information display device according to the present embodiment.
  • the route information display device is realized as, for instance, 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.
  • GPS Global Positioning System
  • a category input unit 1001 is a unit to which a category or the like that becomes a keyword for searching for a destination is inputted. This category is an example of a destination classification.
  • a map information accumulation unit 1003 is a unit which accumulates facility information or map information. Based on the map information accumulated in the map information accumulation unit 1003 , a multiple destination search unit 1002 searches for a plurality of destinations falling under the above-mentioned category to be used as input for a multiple destination input unit 1004 .
  • a name or the like of the destination is often directly inputted, or a category or the like is inputted to search for a destination which is then set as a final destination.
  • a plurality of destinations may be directly inputted to the multiple destination input unit 1004 , or a plurality of destinations may be used as input values for the multiple destination input unit 1004 by inputting a category to the category input unit 1001 and searching for destinations falling under the category by the multiple destination search unit 1002 .
  • a departure point input unit 1012 is a unit to which a departure point is inputted. A user him/herself inputs a given departure point.
  • the departure point input unit 1012 may be configured by a GPS or the like as a unit which searches for a current location of the user, whereby a current position at which the search had been performed may be used as a departure point.
  • the departure point input unit 1012 is assumed to be a unit configured by a GPS or the like which searches for a current location of the user at predetermined intervals, whereby a current point at which a search is performed will be inputted as a departure point.
  • FIG. 2 is a diagram showing a display example of a route information display unit 1011 that is a screen of a car navigation system.
  • the screen shown in FIG. 2 is displaying a current location of the user detected by the departure point input unit 1012 , map information related to the current location based on the map information accumulated in the map information accumulation unit 1003 , and the like.
  • the screen depicted in FIG. 2 also shows an example of a category input. For instance, it is shown that a category “golf course” has been inputted in an “input category” window at the upper right of the screen.
  • the multiple destination search unit 1002 will search for a plurality of destinations falling under the category “golf course”.
  • the multiple destination search unit 1002 is a unit which searches for a plurality of destinations falling under the inputted category based on the map information accumulated in the map information accumulation unit 1003 .
  • the scope of search may be narrowed down based on the user's current location detected by the departure point input unit 1012 .
  • FIG. 3 is a map representation of a positional relationship between searched destinations.
  • the map shows that “Sakura Golf Course” and “Miyazato Golf Course” have been identified as destinations falling under the inputted category “golf course”.
  • the plurality of searched destinations is inputted to the multiple destination input unit 1004 , routes to these destinations are searched by a first route search unit 1005 and a second route search unit 1006 , and a point whereat branching occurs is calculated from the searched routes by a branch point calculation unit 1007 .
  • a point that is common among the routes to the plurality of destinations or, in other words, a branch point is a point that is inevitably visited by the user.
  • the estimated time of arrival or route information to this point is of interest to the user.
  • conditions of routes to the respective destinations beyond the branch point or congestion information and the like are also information that are required by the user in advance, and in many cases, a destination will be ultimately determined by contrasting these information and considering changes in the conditions.
  • the first route search unit 1005 included in a route search unit 1013 is a unit which calculates a route to a single destination among a plurality of destinations inputted to the multiple destination input unit 1004 .
  • the second route search Unit 1006 included in the route search unit 1013 is a unit which calculates a route to another destination among the plurality of inputted destinations. Based on the calculated routes, a branch point of the routes is calculated by the branch point calculation unit 1007 .
  • FIG. 4 shows routes to a plurality of searched destinations.
  • route search is generally calculated using the Dijkstra method or the like, based on route costs (route lengths, route times and the like) of a road network accumulated in map information.
  • route costs route lengths, route times and the like
  • intersections and the like are nodes, whereby route search is performed using route costs of links between nodes.
  • a searched route ID “01” is a route searched by the first route search unit 1005 , and indicates that a route to a final destination “Miyazato Golf Course” which passes the nodes of “Hana 1 Machi (intersection)”, “Hana 2 Machi (intersection)”, “No. 111 (intersection)”, “Hanahigashi IC (interchange)”, and “Ohigashi IC (interchange)” has been searched.
  • a searched route ID “02” is a route searched by the second route search unit 1006 , and indicates that a route to a final destination “Sakura Golf Course” which passes the nodes of “Hana 1 Machi (intersection)”, “Hana 2 Machi (intersection)”, “No. 111 (intersection)”, “Hanahigashi IC (interchange)”, and “Kawamichi IC (interchange)” has been searched.
  • the branch point calculation unit 1007 is a unit which calculates a branch point based on the searched routes. For instance, judgment on whether a node matches may be performed as needed on a sequence of searched nodes, whereby a last matching node may be calculated as a branch point.
  • a route to each of the above-mentioned destinations from a departure point (in the present example, the current position where a search was commenced is the departure point) is searched as a point sequence, and a last point among points common to each of the above-mentioned routes will be calculated as a branch point.
  • FIG. 5 is a map representation of the afore-mentioned searched routes and the calculated branch point.
  • a display screen displaying a current location of the user and the vicinity thereof is shown.
  • a route that passes “Hana 1 Machi”, “Hana 2 Machi”, “No. 111”, “Hanahigashi IC” and “Kawamichi IC” is searched as a route from the current location to one of the destinations, “Sakura Golf Course”, and is indicated by the black bold line.
  • 111 “Hanahigashi IC” and “Ohigashi 10° C.” is searched as a route to “Miyazato Golf Course”. Furthermore, a branch point has been calculated to be “Hanahigashi IC”, and it will be understood that a route beyond “Hanahigashi IC” to “Miyazato Golf Course” branches approximately eastward (rightward), while a route to “Sakura Golf Course” branches approximately northward (upward).
  • a display mode determination unit 1009 is a unit which determines a mode for displaying information related to the plurality of destinations, such as routes to the respective destinations. For instance, determination shall be made by referencing information on modes (hereinafter referred to as mode information) accumulated in a mode information accumulation unit 1008 . Then, under the control of a display control unit 1010 , information is displayed on the route information display unit 1011 that is a display of a car navigation system and the like.
  • the points up to the branch point “Hanahigashi IC” will be inevitably passed by the user regardless of which golf course the user is headed.
  • the estimated time of arrival or route information to “Hanahigashi IC” is a matter of concern to the user.
  • the present invention controls display modes based on branch points.
  • FIG. 6 is a diagram showing an example of mode information accumulated in the mode information accumulation unit 1008 .
  • mode information it is assumed that information such as “category” and “mode format”, as well as “display items” as information related to destinations such as facilities, are accumulated. Information related to a plurality of destinations is displayed by referencing such mode information.
  • FIG. 7 is information related to “Sakura Golf Course” and “Miyazato Golf Course” which is displayed on the route information display unit 1011 .
  • routes and the like are generally displayed for each destination. Therefore, comparisons of differences and the like between both routes may not be performed, and screens must be switched on a case-by-case basis.
  • the present embodiment provides a “contrast map format” as a “mode format” of mode information, which contrasts and displays maps of both routes.
  • a branch point “Hanahigashi IC” is calculated by the branch point calculation unit 1007 , and an estimated time of arrival of “9:15” at the branch point is shown. This is because the user will inevitably pass the points up to the branch point “Hanahigashi IC” regardless of which golf course the user is headed, and the estimated time of arrival, congestion information and the like to “Hanahigashi IC” are matters of concern to the user.
  • estimated times of arrival and amounts of time required beyond the branch point regarding “Sakura Golf Course” and the “Miyazato Golf Course” are displayed such that the differences therebetween are immediately apparent, namely, an estimated time of arrival at “Miyazato Golf Course” of “10:10”, in contrast to an estimated time of arrival at “Sakura Golf Course” of “10:20”, as well as an amount of time required for the route beyond the branch point of “55 minutes” in contrast to “1 hour 5 minutes”.
  • the routes are displayed, for instance, in different colors (for instance, using red or the like for the black bold line that is the route to the branch point “Hanahigashi IC”, while using orange or the like for the dotted lines beyond the branch point).
  • the route to the branch point is a route that will be inevitably passed regardless of which destination the user is headed, while the user will select either one of the routes beyond the branch point. In consideration thereof, by displaying routes before and beyond the branch point in different colors, information may be comprehended more easily.
  • the present invention uses branch points to control modes thereof. For instance, since the route to the branch point is a route that is inevitably passed regardless of which destination the user is headed, map information and the like may be arranged to be displayed in a single screen while considering the current location and the branch point, and contrasting and displaying information beyond the branch point. A specific example will now be described with reference to the drawings.
  • FIG. 8 is a diagram for describing determination of a display area in consideration of a branch point.
  • a display screen 1 shown in FIG. 8 is, for instance, a default display screen, and displays an area having the current location at the center. Since the current location is displayed at the center in the display screen 1, it is impossible to comprehend the route or the like up to the branch point “Hanahigashi IC”.
  • a display area is determined so as to display the current location and the branch point “Hanahigashi IC” to generate a display screen 2. For instance, in this case, an area is determined so that the current location is fitted in the bottom left of the display screen 2, while the branch point is fitted in the top 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 that is a display screen of a car navigation system or the like to generate a display screen 3. Next, by displaying the display screen 3 on the display, it is now possible to comprehend the route to the branch point while comprehending the current location.
  • FIG. 9 is a diagram showing an example that displays a route to the calculated branch point “Hanahigashi IC”.
  • the branch point “Hanahigashi IC” is a point that the user will inevitably pass regardless of which of the plurality of inputted destinations the user is headed, and route information to the branch point and an estimated time of arrival are matters of concern to the user. Therefore, by displaying information up to the branch point, and also displaying information beyond the branch point so that the information may be contrasted, it is now possible to have the user comprehend necessary information more easily. Additionally, in FIG. 9 , information beyond the branch point is displayed on the right-hand side of the screen so that the information may be contrasted and comprehended.
  • the differences between the two destinations are contrasted and displayed, such as an estimated time of arrival at “Miyazato Golf Course” of “10:10” in contrast with an estimated time of arrival at “Sakura Golf Course” of “10:20”.
  • reduced-scale maps beyond the branch point reduced-scale maps of the route from “Hanahigashi IC” to “Sakura Golf Course” and the route from “Hanahigashi IC” to “Miyazato Golf Course” are contrasted and displayed.
  • map scales and the like which have been set by the user.
  • the user will set a detailed scale when wishing to comprehend the vicinity of the current location in greater detail, and will set a broad scale when wishing to comprehend route information for further ahead or for an entire route.
  • a detailed scale has been set in order to better comprehend the current location, as seen in the display example shown in FIG. 9 , information up to the branch point may be displayed across the entire screen, while contrasting and displaying information beyond the branch point to the side of the screen.
  • a category is inputted to the category input unit 1001 (S 3601 ). Then, destinations falling under the inputted category are searched from map information accumulated in the map information accumulation unit 1003 (S 3602 ).
  • Judgment is performed on whether a relevant destination exists in the map information (S 3603 ). If so, the processing proceeds to step S 3604 , and if not, the processing is concluded. If so (Yes in S 3603 ), routes to the relevant destination are searched by the first route search unit 1005 and the second route search unit 1006 (S 3604 ). Then, a branch point is calculated by the branch point calculation unit 1007 (S 3605 ).
  • Calculation of a branch point is commenced by setting a flag to a node nearest to the current position (S 3701 ), and setting the flag to an immediately subsequent node (S 3702 ). With the searched route shown in FIG. 5 , a flag is set to the intersection “Hana 1 Machi”. Next, judgment is performed in whether the set flag is shared (S 3703 ). If shared (Yes in S 3703 ), the processing proceeds to step S 3702 , and if not (No in S 3703 ), the processing proceeds to step S 3704 . In the present embodiment, since “Hana 1 Machi” is shared, a flag is set to the immediately subsequent node (S 3702 ). The flag moves to “Hanahigashi IC” by repeating this loop. In other words, this indicates that the route thus far is shared.
  • flags will be set to different nodes, namely, “Ohigashi IC” and “Kawamichi IC” (No in S 3703 ).
  • the flag is returned to the immediately previous node (S 3704 ), and the node to which the flag is set is calculated as a branch point (S 3705 ).
  • “Hanahigashi IC” becomes the branch point.
  • mode information accumulated in the mode information accumulation unit 1008 is referred to (S 3606 ), and an information display mode is determined by the display mode determination unit 1009 using the calculated branch point (S 3607 ).
  • the display mode is the display example shown in FIG. 9
  • a description will now be given with reference to FIG. 8 .
  • judgment is made on whether a branch point exists in the current screen (S 3801 ). If a branch point exists in the current screen (Yes in S 3801 ), the processing proceeds to step 53805 . If not (No in S 3801 ), the current location is referred to (S 3802 ), and the location of the branch point is referred to (S 3803 ). Then, a screen is generated so that the current location and the location of the branch point fit into the current screen, and the scale of the screen is reduced according to the size of the display (S 3804 ).
  • the route up to the branch point is displayed.
  • the route up to the branch point is displayed (S 3805 ), and information beyond the branch point is further displayed so that, for instance, information may be contrasted and comprehended (S 3806 ).
  • the information is then displayed on the route information display unit 1011 in the mode determined by these flows (S 3608 ).
  • FIG. 9 is a diagram showing a screen displayed on the route information display unit 1011 .
  • the current location and up to the branch point “Hanahigashi IC” are displayed in a scale and at positions which enable the locations to fit into the screen.
  • the route up to the branch point “Hanahigashi IC” is indicated by a bold line.
  • an estimated time of arrival at the branch point “Hanahigashi IC” of “9:15”, as well as “estimated times of arrival” and the like at the respective destinations “Miyazato Golf Course” and “Sakura Golf Course” are also displayed. In this manner, by calculating a branch point, and performing display so that information up to the branch point and information beyond the branch point may be contrasted, it is possible to comprehend information necessary for travel in an easier manner.
  • the multiple destination input unit 1004 with respect to input to the multiple destination input unit 1004 , it is arranged that components such as the category input unit 1001 and the like are provided and points falling under a category is searched from the map information accumulation unit 1003 by the multiple destination search unit 1002 .
  • the arrangement is not limited to this example. Instead, a destination may be directly inputted to the multiple destination input unit 1004 to perform route search and calculate a branch point.
  • route search has been described by providing respective route search units, namely, the first route search unit 1005 and the second route search unit 1006
  • a search of respective routes may be successively performed by, for instance, a single route search unit (for instance, using the first route search unit 1005 as a route search unit 1005 ).
  • modes accumulated in the mode information accumulation unit 1008 have been referred to in order to change modes based on a branch point, such mode information is not a requisite component, and information related to a branch point may be directly displayed on the route information display unit 1011 instead.
  • FIG. 14 shows system components of the present invention, including: the multiple destination input unit 1004 ; the departure point input unit 1012 ; a route search unit 1005 ; the branch point calculation unit 1007 ; and the route information display unit 1011 . Details of the respective components are as described above. Routes from a departure point inputted at the departure point input unit 1012 to respective destinations inputted to the multiple destination input unit 1004 are searched by the route search unit 1005 , and a branch point is calculated by the branch point calculation unit 1007 . Information on the calculated branch point is thus displayed on the route information display unit 1011 .
  • display modes of information related to destinations While a description has been provided on a display example in which, for instance, “Miyazato Golf Course” and “Sakura Golf Course” are used as examples and map information is contrasted based on a branch point, display modes are not limited to this example.
  • mode may be controlled according to a category of destinations.
  • the mode information shown in FIG. 6 described that the category “golf course” is displayed using the “contrast map format”.
  • FIG. 7 is an example of displaying that enabled route maps to the destinations “Miyazato Golf Course” and “Sakura Golf Course” to be contrasted and comprehended.
  • the “contrast menu format” is arranged as a display mode for the category “restaurant”. This is because when searching for a plurality of relatively close destinations such as the category “restaurant”, and displaying information to the destinations, travel distances beyond the branch point are often also short or destinations may be changed easily compared to “golf courses” which are relatively distant. Therefore, instead of displaying the differences in information beyond the branch point in detail, information up to the branch point may be displayed in detail.
  • a display area is determined in consideration of the current location and the location of the branch point, as shown in the present embodiment, and a route to a branch point is displayed on a screen.
  • the screen shown in FIG. 15 depicts a route to, for instance, “Raku 1 Machi intersection”, which has been calculated as a branch point.
  • “entertainment” has been inputted as a search keyword, and “Karaoke No. 1”, which belongs to a category “Karaoke”, and “Star Bowling”, which belongs to a category “bowling”, have been searched and are displayed.
  • display is performed using the entire screen, together with map information, in order to show information up to “Raku 1 Machi intersection”, which has been calculated as a branch point, in greater detail. As seen, in cases where categories differ, information up to the branch point may be displayed in detail.
  • display modes may be arranged to be changed according to distances to and directions of destinations beyond the branch point, instead of category.
  • routes to the respective destinations often vary significantly beyond the branch point.
  • thresholds may be set for directions as well as distances beyond the branch point, whereby, in a case equal to or greater than the threshold, display may be performed under a mode such as a format for detailed display of information up to the branch point (for instance, FIGS. 9 and 15 ) and the like.
  • modes may be changed according to the distance from the current position to the branch point, or according to a ratio of the distance to the branch point with respect to the distance from the current position to the destination.
  • modes may be changed not only according to the ratio of distances, but also according to a ratio of arrival times. For instance, in a case where an arrival time at the branch point is 2 hours, and the arrival times at the respective destinations beyond the branch point are approximately 1 hour, the ratio of the arrival time at the branch point and the arrival times beyond the branch point with respect to a total travel time of 3 hours is 2:1.
  • control may be performed so that, for instance, displaying is performed in the display mode in which information up to the branch point is displayed in detail (for instance, FIG. 9 ).
  • the display control unit 1010 should be arranged to compare the distance between the above-mentioned departure point and the above-mentioned branch point with a threshold, and when the distance is greater than the threshold, adopt a display mode which displays information from the departure point to the branch point in detail. It is needless to say that the display control unit 1010 may adopt such a display mode according to the ratio of the distance between the above-mentioned departure point and the above-mentioned branch point and the distance between the above-mentioned branch point to a destination.
  • a display mode that displays a route from the branch point to a destination in detail (for instance, FIG. 10 ) may be adopted.
  • the display control unit 1010 should be arranged to compare the distance between the above-mentioned departure point and the above-mentioned branch point with a threshold, and when the distance is shorter than the threshold, adopt a display mode which displays information from the branch point to the destination in detail. It is needless to say that the display control unit 1010 may adopt such a display mode according to the ratio of the distance between the above-mentioned departure point and the above-mentioned branch point and the distance between the above-mentioned branch point to a destination.
  • a branch point is calculated by, for instance, respectively searching routes to a plurality of inputted destinations and referencing common points and differences thereof. Since the searched routes are searched based on route costs (required time, distance and the like) of a road network which are accumulated in map information, a branch point is not necessarily appropriate to the user. For instance, depending on the user, there may be cases where a specific route is passed when heading for any of the inputted destinations, and as a result, branch points may vary.
  • FIG. 17 is a system configuration diagram according to the present embodiment.
  • the same reference numbers are assigned to the components shown in the above-described embodiment and the descriptions about the same components will not be provided.
  • a travel history accumulation unit 1101 is a unit which accumulates past traveling of the user as a history. In the present embodiment, it is assumed that a travel history is accumulated according to, for instance, a sequence of passed intersections, based on latitude/longitude information detected by the departure point input unit 1012 that is configured by a GPS and the like and map information accumulated in the map information accumulation unit 1003 .
  • the departure point input unit 1012 is arranged as a unit which detects a current location of the user
  • a unit for detecting a current location of the user may be provided separately and positional information acquired therefrom may be accumulated as a travel history.
  • a GPS provided in a car navigation system and the like detects latitude and longitude at 1 second intervals.
  • the sequence of latitude/longitude information detected with traveling of the user will become enormous.
  • detected latitudes and longitudes generally have some margin of error. Therefore, in consideration of ease of subsequent matching and searching, accumulation will be performed according to a sequence of nodes such as passed intersections using map information, instead of a sequence of latitude/longitude information.
  • route search and calculation of branch points are based on a sequence of these nodes. Therefore, even from the context of consistency therewith, a travel history is preferably accumulated as a node sequence.
  • the travel history accumulation unit 1101 performs conversion of a node sequence from latitude/longitude information
  • the conversion may alternatively be performed by separately providing a unit which performs conversion.
  • FIG. 18 shows histories of destinations accumulated in the travel history accumulation unit 1101 .
  • a sequence of a departure point, passed intersections and transit times, and arrival at a final destination is accumulated as a single travel history.
  • travel history ID “01” indicates that, previously, the user had left “home”, passed “Hana 1 Machi (intersection)”, “Hana 2 Machi”, “No. 111”, “Yamano 2 Machi” and “Yamano 3 Machi”, and arrived at “Miyazato Golf Course”.
  • these travel histories are used to calculate a branch point on routes to a plurality of searched destinations.
  • a description will now be provided using a specific example.
  • FIG. 19 shows the searched routes.
  • a searched route ID “01” is a route searched by the first route search unit 1005 , and indicates that a route to a final destination “Miyazato Golf Course” which passes the nodes of “Hana 1 Machi”, “Hana Machi IC (interchange)”, “Hanahigashi IC”, and “Ohigashi IC”, has been searched out.
  • a searched route ID “02” is a route searched by the second route search unit 1006 , and indicates that a route to a final destination “Sakura Golf Course” which passes the nodes of “Hana 1 Machi”, “Hana Machi IC”, “Hanahigashi IC”, and “Kawamichi IC”, has been searched out.
  • a calculation of a branch point by the branch point calculation unit 1007 reveals that the nodes “Hana 1 Machi”, “Hana Machi IC” and “Hanahigashi IC” match, while the nodes “Ohigashi IC” and “Kawamichi IC” differ.
  • FIG. 20 is a map representation of a relationship between the afore-mentioned searched routes.
  • FIG. 20 shows a current location of the user, “Miyazato Golf Course” and “Sakura Golf Course” which are destinations, as well as the searched routes to the respective golf courses.
  • the routes to both golf courses proceed from the current location and straight through the intersection “Hana 1 Machi”, gets on the expressway at “Hana Machi IC”, and branches at “Hanahigashi IC”.
  • a branch point suitable to the user is not necessarily calculated.
  • the routes and the branch point shown in FIG. 20 are a result of searching for respective routes by using the respective destinations of “Miyazato Golf Course” and “Sakura Golf Course” as final destinations.
  • a route search unit provided in a car navigation system and the like is arranged to calculate a route having a minimum cost based on the route costs of a road network which are accumulated in the map information. Therefore, in FIG. 20 , shortest routes to the destinations “Miyazato Golf Course” and “Sakura Golf Course” which use the expressway are searched, and a branch point of “Hanahigashi IC” is calculated accordingly.
  • a route indicated by the black dotted line is a previous travel history of the user which is accumulated in the travel history accumulation unit 1101 shown in FIG. 18 .
  • a history is accumulated in which, after turning right at “Hana 1 Machi”, the user reached “Miyazato Golf Course” via “Hana 2 Machi”, “No. 111”, “Yamano 2 Machi” and “Yamano 3 Machi” ( FIG. 18 ).
  • the branch point for the user is not “Hanahigashi IC” but “Hana 1 Machi”.
  • the user determines to head for “Miyazato Golf Course”
  • the user must turn right at “Hana 1 Machi”.
  • the branch point is obviously “Hana 1 Machi” ( FIG. 21 ).
  • a branch point calculated by simply searching for routes to the respective destinations is not necessary suitable to the user. Therefore, travel histories of the user may be accumulated, whereby a branch point may be calculated by reflecting the travel histories.
  • a travel history reflects tendencies in the everyday activities of the user, such as a tendency in which the user does not use expressways in order to save money, a tendency in which the user usually uses bypaths, or conversely, being a novice driver, a tendency to use wider roads. Therefore, a branch point that is more suitable may be calculated using a travel history.
  • the branch point calculation unit 1007 further includes a branch point candidate calculation unit 1021 and a branch point selection unit 1022 ( FIG. 17 ).
  • the route search unit 1013 searches for a plurality of routes from a departure point inputted to the departure point input unit 1012 (in the present embodiment, a current point whereat searching is performed) to a destination inputted to the multiple destination input unit 1004 so that a route indicated in the travel history of the user, which is accumulated in the travel history accumulation unit 1101 , is traced as long as possible. Then, from the different searched routes, the branch point candidate calculation unit 1021 calculates a plurality of branch point candidates using the respective searched routes thereof. A description will now be provided using a specific example.
  • the branch point with the searched route to the other destination “Sakura Golf Course”, which passes “Hana 1 Machi”, “Hana Machi IC” and “Hanahigashi IC”, is “Hanahigashi IC” in the case of the former route and “Hana 1 Machi” in the case of the latter route. Calculations may be performed using these points as branch point candidates.
  • the branch point selection unit 1022 is a unit which selects a branch point from the branch point candidates calculated by the branch point candidate calculation unit 1021 . For instance, branch point selection may be delegated to the user to select which of the branch points should be preferably displayed as information, or automatic selection may be performed according to the distance from the current location.
  • a branch point from a route which traces the longest the route indicated in the user's travel history may be automatically selected. More specifically, in the present embodiment, the route that passes “Hana 1 Machi”, “Hana 2 Machi” and “No. 111” may be prioritized on the basis that such a route exists in the travel history and is likely to be used by the user. In other words, the branch point “Hana 1 Machi” may be automatically selected.
  • this travel history may also be reflected on the route to “Sakura Golf Course” to calculate a more suitable branch point.
  • the user of the present example saves the expressway toll by turning right at “Hana 1 Machi” and using general roads such as “Hana 2 Machi” and “No. 111”.
  • a travel history thereto does not exist. Therefore, a general route search is performed and a route that proceeds straight through “Hana 1 Machi”, gets on “Hana Machi IC”, and reaches “Sakura Golf Course” via “Hanahigashi IC” and “Kawamichi IC” is searched.
  • a branch point “Hana 1 Machi” is calculated from these routes.
  • a branch point calculated simply from a route with a minimum cost may not necessary be suitable to the user.
  • general roads such as “Hana 2 Machi” and “No. 111” may also be used when heading for “Sakura Golf Course”. Therefore, a suitable branch point may be calculated by once again searching a route to “Sakura Golf Course” so that the route to “Miyazato Golf Course”, which is a route to the other destination and which is accumulated in the history, may be traced as long as possible.
  • FIG. 22 shows a branch point calculated by once again searching for a route to “Sakura Golf Course” using the route to “Miyazato Golf Course”, which exists in the history. For instance, as a result of a search for a route to “Sakura Golf Course” from a given intersection on the route to “Miyazato Golf Course” that exists in the history, in the case of the present example, a route that turns right at “Hana 1 Machi” and includes “Hana 2 Machi” and “No. 111” is shared, and a subsequent route is searched which departs from “No. 111” in a northward direction (upward direction), gets on the expressway at “Hanahigashi IC” and heads for “Sakura Golf Course”. In addition, “No. 111” is set as the branch point.
  • routes may be searched in consideration to a travel history to calculate a branch point.
  • calculating a route to the other destination based on a route existing in the travel history of the one of the routes instead of simply searching for a shortest route will also mean that the user will head for the other destination from a route which the user frequently uses and is familiar with. Therefore, even in cases where the user is an inexperienced driver or in cases where the user is unfamiliar with the area, the user may head for the final destination with ease.
  • FIG. 23 shows an example in which route information is displayed based on the above-mentioned calculated branch point “No. 111”. For instance, route information beyond the branch point “No. 111” is contrasted and displayed at the right-hand side of the screen in the same manner as in FIG. 9 . This allows differences in the required times subsequent to the branch point and the like to be easily comprehended.
  • the left-hand side of the screen is an example of a detailed display of the position of the branch point “No. 111”.
  • the branch point “No. 111” is an intersection, and that stores such as “Toyosan Motors”, “Shinjin Bank” and “Shopper's K” are located near the intersection.
  • an arrow (dotted line) indicates that “Miyazato Golf Course” may be reached by turning right as usual at “No. 111”.
  • an arrow black bold line indicates that “Sakura Golf Course” may be reached by proceeding straight through “No. 111”.
  • Intersection “No. 111” is a position accumulated in the travel history or, in other words, a position that the user is familiar with. Therefore, by displaying the vicinity of “No. 111” in detail, the user will be able to comprehend in greater detail how routes may branch at the usually familiar intersection towards the other destination.
  • a variation may be contemplated which uses a travel history for the estimation of a destination.
  • the multiple destination input unit 1004 may search for positions included in a predetermined range from the direction in which a vehicle is currently headed from the travel history accumulation unit 1101 , whereby the searched positions are inputted as an estimated destination.
  • This case is an example in which the multiple destination input unit 1004 doubles as a destination prediction unit and a destination input unit as described in the claims.
  • a category is inputted to the category input unit 1001 (S 3601 ). Then, destinations falling under the inputted category is searched from a travel histories accumulated in the travel history accumulation unit 1101 (S 3902 ). Judgment is performed on whether a relevant destination exists in the travel history (S 3903 ). If so, the processing proceeds to step S 3904 , and if not, a branch point is calculated in the same manner as the above-described first embodiment (to S 3605 ). If so (Yes in S 3903 ), routes accumulated in the travel history accumulation unit are further referred to (S 3904 ). Then, a branch point is calculated by the branch point calculation unit 1007 using the travel history (S 3605 ).
  • a branch point is calculated using a route accumulated in the travel history, instead of using a route searched by the route search unit.
  • Calculation of a branch point is commenced by setting a flag to a node nearest to the current position (S 3701 ), and setting the flag to an immediately subsequent node (S 3702 ). With the searched route shown in FIG. 21 , a flag is set to the intersection “Hana 1 Machi”. Next, judgment is performed in whether the set flag is shared (S 3703 ). If shared (Yes in S 3704 ), the processing proceeds to step S 3702 , and if not (No in S 3704 ), the processing proceeds to step S 3704 .
  • a flag is set to the immediately subsequent node (S 3702 ).
  • the flag moves to “Hana Higashi IC” by repeating this loop. In other words, this indicates that the route thus far is shared.
  • flags are set to different nodes, namely, “Ohigashi IC” and “Kawamichi IC” (No in S 3703 ).
  • the flag is returned to the immediately previous node (S 3704 ), and the node to which the flag is set is calculated as a branch point (S 3705 ).
  • “Hanahigashi IC” becomes the branch point.
  • “Hana 1 Machi” becomes the branch point.
  • mode information is referred to (S 3606 ), mode information is determined (S 3607 ), and information display is performed using the calculated branch point (S 3608 ).
  • inputs to the multiple destination input unit 1004 While, in the present embodiment, components such as the category input unit 1001 and the like are provided and points falling under a category is searched from the map information accumulation unit 1003 by the multiple destination search unit 1002 , inputs are not limited to this arrangement. Instead, a destination may be directly inputted to the multiple destination input unit 1004 to perform route search and calculate a branch point.
  • route search has been described by providing respective route search units, namely, the first route search unit 1005 and the second route search unit 1006
  • search of respective routes may be performed by, for instance, a single route search unit (for instance, using the first route search unit 1005 as a route search unit 1005 ).
  • modes accumulated in the mode information accumulation unit 1008 have been referred to in order to change modes based on a branch point, such mode information is not a requisite component, and information related to a branch point may be directly displayed on the route information display unit 1011 instead.
  • FIG. 26 shows system components of the present invention, including: the multiple destination input unit 1004 ; the departure point input unit 1012 ; the route search unit 1005 ; the branch point calculation unit 1007 ; the branch point candidate calculation unit 1021 ; the branch point selection unit 1022 ; the route information display unit 1011 ; and the travel history accumulation unit 1101 .
  • the travel history accumulation unit 1101 is not always necessary.
  • a branch point may be selected based on the distance from a departure point (in the present embodiment, the current position of the user is used) inputted to the departure point input unit 1012 . Therefore, selection of a branch point may be performed using, for instance, the components shown in FIG. 27 .
  • FIG. 27 shows system components of the present invention, including: the multiple destination input unit 1004 ; the departure point input unit 1012 ; a route search unit 1005 ; the branch point calculation unit 1007 ; the branch point candidate calculation unit 1021 ; the branch point selection unit 1022 ; and the route information display unit 1011 .
  • FIG. 28 is a map representation of the current location of the user as well as the locations of “Karaoke Dom” and “Star Bowling”.
  • routes to these destinations are first calculated. Routes from the current point inputted at the departure point input unit 1012 to the respective destinations are searched by the route search unit 1005 .
  • a shortest route is searched for using costs corresponding to transmit times or distances of routes.
  • the black bold lines in FIG. 28 indicate searched routes to these destinations, and are considered the results of a search performed by, for instance, a general route search unit.
  • the route to “Karaoke Dom” is a route that passes the intersections of “Raku 1 Machi”, “Raku 2 Machi” and “Raku Dori 1”.
  • the route to “Star Bowling” is a route that passes the intersections of “Raku 1 Machi”, “Raku 3 Machi”, “Raku 4 Machi”, “Kyo 4 Machi” and “Kyo 3 Machi”.
  • the route costs are the transit times between these intersections (nodes). These costs are shown in FIG. 28 . For instance, the cost from the current location to “Raku 1 Machi” is 5 minutes; from “Raku 1 Machi” to “Raku 2 Machi” is 5 minutes; from “Raku 2 Machi” to “Raku Dori 1” is 10 minutes; and from “Raku Dori 1” to “Karaoke Dom” is 5 minutes. Therefore, the overall arrival time at “Karaoke Dom” from the current location is 25 minutes.
  • FIG. 29 shows the results of these searched routes in a table format.
  • the table shows the routes to the respective final destinations, as well as transit times up to the final destinations.
  • a searched route ID “01” is a route to “Karaoke Dom”. In this case, accumulated times are shown.
  • the transit time at “Raku 1 Machi” is 5 minutes
  • the transit time at “Raku 2 Machi” is 10 minutes, which is obtained by adding the 5 minutes to “Raku 1 Machi” with the 5 minutes from “Raku 1 Machi”.
  • a searched route ID “02” is a route to “Star Bowling”.
  • costs between respective nodes are computed to calculate a shortest route.
  • branch point candidates are calculated by the branch point candidate calculation unit 1021 , and the branch point is calculated to a location that is closer to the destination or a location that is far from the current location is selected by the branch point selection unit 1022 from the branch point candidates.
  • the destinations are compared and a plurality of routes to the destination that is further away from the current location is once again searched for.
  • a plurality of routes to a destination that is further away is searched for because a plurality of routes is more likely to be calculated for a destination that is further away, and the time difference is smaller.
  • the plurality of routes will prove to be more time-consuming, and will end up being roundabouts.
  • the estimated time of arrival at “Star Bowling” is 27 minutes, which is more distant than the estimated time of arrival at “Karaoke Dom” of 25 minutes, routes to “Star Bowling” is calculated.
  • FIG. 30 shows a plurality of calculated routes to “Star Bowling”. With respect to the shortest route from the current location that turns right at “Raku 1 Machi”, two routes, namely, a route that proceeds straight through “Raku 1 Machi” and turns right at “Raku 2 Machi”, and a route that proceeds straight through “Raku 1 Machi”, “Raku 2 Machi” and turns right at “Raku Dori 1” have been newly calculated.
  • FIG. 31 shows transits times for the plurality of routes using the transit time costs shown in FIG. 30 . A route that turns right at “Raku 2 Machi” is shown as a searched route ID “03”, while a route that proceeds straight through “Raku 1 Machi” and “Raku 2 Machi” is shown as a searched route ID “04”.
  • a searched route ID “03” is a route that turns right at “Raku 2 Machi” and heads for “Star Bowling”. From the current location, the route proceeds straight through “Raku 1 Machi” (transit time cost of 5 minutes), passes “Raku 2 Machi”, “Raku 4 Machi”, “Kyo 4 Machi” and “Kyo 3 Machi”, and arrives at “Star Bowling”. The overall transit time cost for this route is 29 minutes. While arrival time is 2 minutes later than the shortest route to “Star Bowling”, which is indicated by the searched route ID “02” and which takes 27 minutes, this route shares its portion up to “Raku 2 Machi” with the route to “Karaoke Dom” that is indicated by the searched route ID “01”. Thus the branch point is “Raku 2 Machi”, and compared to “Raku 1 Machi”, the branch point is calculated at a location that is further from the current location.
  • a searched route ID “04” is a route that proceeds straight through “Raku 2 Machi” and heads for “Star Bowling”. From the current location, the route proceeds straight through “Raku 1 Machi” and “Raku 2 Machi” (transit time cost of 10 minutes), passes “Raku Dori 1” and “Kyo 3 Machi”, and arrives at “Star Bowling”. The total transit time cost for this route is 37 minutes. This route shares its portion up to “Raku Dori 1” with the route to “Karaoke Dom” that is indicated by the searched route ID “01”. Thus the branch point is “Raku Dori 1”, and compared to “Raku 2 Machi” or “Raku 1 Machi”, the branch point is calculated at a location that is even more distant from the current location.
  • the user is faced with a situation where a plurality of destinations must be searched for and a determination must be made as to which destination the user will ultimately head for.
  • the branch point is relatively close to the current location, the user will soon be faced with the need to decide which destination the user will be heading for. For instance, after further driving for a while, when attempting to change the destination in a flexible manner according to route conditions and final arrival times, the user will not be provided with sufficient time to think.
  • the user will be able to have enough time to comprehend information on a plurality of destinations and ultimately determine a destination.
  • the searched route ID “04” takes 10 more minutes.
  • this branch point is calculated at a location that is furthest from the current location.
  • this also means that the branch point is calculated as a relatively long detour compared to the shortest route.
  • a branch point may be arranged to be calculated in consideration of not only the location of the branch point, but also the route time cost. For instance, with respect to a shortest time of 27 minutes, a branch point may be calculated by setting a threshold (for instance, within plus 20 percent) using the required time of the shortest route as a reference, such as a buffer of plus 20 percent (approximately 6 minutes). In this case, since the searched route ID “04” with an arrival time of 37 minutes exceeds the threshold, the searched route ID “03” is used, and “Raku 2 Machi” becomes the branch point.
  • a threshold for instance, within plus 20 percent
  • FIG. 32 shows a map indicating the current location of the user as well as the locations of the searched destinations “Karaoke Dom” and “Star Bowling”, in the same manner as FIG. 28 and the like.
  • route search is performed using the respective destinations as final destinations, the same routes as shown in FIG. 28 will be calculated.
  • searching for a plurality of destinations and deliberating on which destination to head for the user ultimately makes a final decision in consideration of conditions of destinations as well as conditions of traffic congestions and the like which vary from hour to hour.
  • FIG. 33 shows routes to the respective destinations and transit times calculated using the transit costs of routes, in the same manner as FIG. 29 and the like.
  • the searched route ID “01” is a route to “Karaoke Dom” that passes “Raku 1 Machi”, “Raku 2 Machi” and “Raku Dori 1” before arriving at “Karaoke Dom”.
  • the overall arrival time is shown as “25 minutes”.
  • the searched route ID “02” is a route to “Star Bowling” that passes “Raku 1 Machi”, “Raku 3 Machi” and “Raku 4 Machi” before arriving at “Star Bowling”.
  • the overall arrival time is shown as “27 minutes”.
  • a searched route ID “05” is a result of a route search performed using “Karaoke Dom” as an intermediate point (branch point).
  • the route arrives at “Star Bowling” via “Karaoke Dom”, and passes through “Raku 1 Machi”, “Raku 2 Machi”, “Raku Dori 1”, “Karaoke Dom”, “Ura Raku 1”, “Kyo 2 Machi” and “Kyo 3 Machi”.
  • the final arrival time of 32 minutes is within the threshold with respect to the shortest time of 27 minutes, and does not result in a relatively long detour. Therefore, it is also possible to calculate these routes as routes of a plurality of destinations.
  • a method which calculates a branch point using travel history, and controls display modes of information using the branch point.
  • information may be arranged to be comprehended more effectively by the user by calculating a branch point of the plurality of destinations and displaying information based on the branch point.
  • travel history into consideration and, for instance, calculating a branch point by once again searching for a route to another destination using a route accumulated in the travel histories as a reference, it is also possible to head for a destination from a branch point on a route that is normally used by the user.
  • branch points for instance, a plurality of routes to a destination is calculated, the branch points on the respective routes are used as branch point candidates, and branch point is selected from the branch point candidates based on the current location or travel histories.
  • calculation methods of branch points are not limited to that described above. In this light, for the present variation, a calculation method for branch points will be described.
  • FIG. 34 is a system configuration diagram according to the present embodiment.
  • the dame reference numerals as used for the components in the above-described embodiments are assigned to the same components in FIG. 34 .
  • a multiple destination input unit 1004 is a unit to which a plurality of destinations is inputted.
  • a departure point input unit 1012 is a unit to which a departure point is inputted, and in the case of the present embodiment, detects a current location at which searching is performed and sets the current location as the departure point.
  • a route search unit 1005 is a unit which searches for routes from the inputted current point to the respective destinations.
  • FIG. 35 is a map representation of the current location of the user as well as the locations of “Karaoke Dom” and “Star Bowling”.
  • a shortest route is searched using costs corresponding to transmit times or distances of routes.
  • the black bold lines in FIG. 35 indicate searched routes to these destinations, and are considered the results of, for instance, a search performed by, for instance, a general route search unit.
  • the route to “Karaoke Dom” is a route that passes the intersections of “Raku 1 Machi”, “Raku 2 Machi” and “Raku Dori 1”.
  • the route to “Star Bowling” is a route that passes the intersections of “Raku 1 Machi”, “Raku 3 Machi”, “Raku 4 Machi”, “Kyo 4 Machi” and “Kyo 3 Machi”. Additionally, in this case, it is assumed that transit times between these intersections (nodes) are the costs of routes. These costs are shown in FIG. 35 .
  • the cost from the current location to “Raku 1 Machi” is 5 minutes; from “Raku 1 Machi” to “Raku 2 Machi” is 5 minutes; from “Raku 2 Machi” to “Raku Dori 1” is 10 minutes; and from “Raku Dori 1” to “Karaoke Dom” is 5 minutes. Therefore, the overall arrival time at “Karaoke Dom” from the current location is 25 minutes. In the same manner, to “Star Bowling”, it takes 5 minutes to “Raku 1 Machi”, 2 minutes to “Raku 3 Machi”, 3 minutes to “Raku 4 Machi”, 10 minutes to “Kyo 4 Machi”, 5 minutes to “Kyo 3 Machi” and 2 minutes to “Star Bowling” for a total of 27 minutes.
  • FIG. 36 shows the results of these searched routes in a table format.
  • the table shows the routes to the respective final destinations, as well as transit times up to the final destinations.
  • a searched route ID “01” is a route to “Karaoke Dom”. In this case, accumulated times are shown.
  • the transit time at “Raku 1 Machi” is 5 minutes
  • the transit time at “Raku 2 Machi” is 10 minutes, which is obtained by adding the 5 minutes to “Raku 1 Machi” with the 5 minutes from “Raku 1 Machi”.
  • a searched route ID “02” is a route to “Star Bowling”.
  • costs between respective nodes are computed to calculate a shortest route.
  • a branch point is calculated by selecting one of the inputted plurality of destinations, setting a nodal sequence on a route to the selected destination as a branch point candidate, and once again searching for a route to the other destination from the branch point candidate.
  • a destination selection unit 1024 is a unit which selects either one of the destinations inputted to the multiple destination input unit 1004 .
  • a branch point candidate selection unit 1023 is a unit which selects, as a branch point candidate, a node on a route to the selected destination among the branch point candidates calculated by a branch point candidate calculation unit 1021 .
  • search routes are contrasted and a destination that is closer to the current location is used as the destination.
  • a node on the closer route is a branch point candidate.
  • a destination that is closer to the current location is selected and a node on routes to this destination is used as a branch point candidate because a plurality of routes is more likely to be calculated for a route to the other destination that is further away, and the time difference is smaller.
  • the plurality of routes will prove to be more time-consuming, and will end up being long detours.
  • FIG. 37 is a map representation of a plurality of calculated routes from the respective branch point candidates to “Star Bowling”. Routes from the respective branch point candidates of “Raku 1 Machi”, “Raku 2 Machi”, “Raku Dori 1” and “Karaoke Dom”, which are nodes on a route from the current location to the selected “Karaoke Dom”, to “Star Bowling”, which is the other destination, are searched for. For instance, for a route from “Raku 1 Machi” to “Star Bowling”, a route is searched which passes “Raku 1 Machi”, “Raku 3 Machi”, “Raku 4 Machi”, “Kyo 4 Machi”, “Kyo 3 Machi”, and arrives at “Star Bowling”.
  • FIG. 38 shows transit times for the plurality of routes using the transit time costs shown in FIG. 37 . Shown are searched routes from the respective branch point candidates to the destination “Star Bowling” and route costs thereof.
  • a searched route ID “02” is a route searched using “Raku 1 Machi”, which is a branch point candidate, as its departure point, and transit nodes and costs thereof are shown.
  • the searched route ID “02” since the searched route from the current location to “Star Bowling” is equivalent to the route from the branch point candidate “Raku 1 Machi”, both are indicated as the searched route ID “02”.
  • a searched route ID “03” indicates a route having the branch point candidate “Raku 2 Machi” as the departure point. Since the cost of the route to “Raku 2 Machi” is calculated as being 10 minutes from a searched route ID that is a route to “Karaoke Dom”, a cost is shown to which a subsequent cost has been added.
  • a route having the branch point candidate “Raku 2 Machi” as the departure point and arriving at “Star Bowling”, and costs thereof are calculated as, for instance, 12 minutes to “Raku 4 Machi”, 22 minutes to “Kyo 4 Machi”, 27 minutes to “Kyo 3 Machi”, and 29 minutes to “Star Bowling”.
  • a route that branches from the branch point candidate “Raku Dori 1” and a cost thereof are indicated as a searched route ID “04”. It is shown that it takes 20 minutes to “Raku Dori 1”, 35 minutes to “Kyo 3 Machi”, and 37 minutes to “Star Bowling”.
  • a searched route ID “05” indicates a route to “Star Bowling” which uses “Karaoke Dom” as a branch point candidate, and a cost thereof. For instance, when inputting a plurality of destinations, it is not certain that the user will travel to one of the destinations, and there may be cases where the user will travel to the other destination after heading for one of the destinations. Therefore, as shown, a route may be calculated using one of the destinations as a branch point candidate.
  • the arrival time at “Karaoke Dom” is calculated as 25 minutes by the searched route ID “01”, and for subsequent transit nodes, it is shown that it takes 26 minutes to “Ura Raku 1”, 28 minutes to “Kyo 2 Machi”, 30 minutes to “Kyo 3 Machi”, and 32 minutes to “Star Bowling”.
  • a route comparison unit 1026 is a unit which compares costs of routes from branch point candidates calculated by the branch point route search unit 1025 . Based on the comparison results, a branch point is selected at the branch point selection unit 1022 .
  • a description will be provided using a specific example.
  • the above-mentioned searched route ID “03” is a route that turns right at “Raku 2 Machi” and heads for “Star Bowling”. From the current location, the route proceeds straight through “Raku 1 Machi” (transit time cost of 5 minutes), passes “Raku 2 Machi”, “Raku 4 Machi”, “Kyo 4 Machi” and “Kyo 3 Machi”, and arrives at “Star Bowling”. The total transit time cost for this route is 29 minutes. While arrival time is 2 minutes later than the shortest route to “Star Bowling”, which is indicated by the searched route ID “02” and which takes 27 minutes, this route shares its portion up to “Raku 2 Machi” with the route to “Karaoke Dom” that is indicated by the searched route ID “01”. Thus, “Raku 2 Machi” becomes the branch point, and compared to “Raku 1 Machi”, the branch point is calculated at a location that is further from the current location.
  • a searched route ID “04” is a route that proceeds straight through “Raku 2 Machi” and heads for “Star Bowling”. From the current location, the route proceeds straight through “Raku 1 Machi” and “Raku 2 Machi” (transit time cost of 10 minutes), passes “Raku Dori 1” and “Kyo 3 Machi”, and arrives at “Star Bowling”. The total transit time cost for this route is 37 minutes. This route shares its portion up to “Raku Dori 1” with the route to “Karaoke Dom” that is indicated by the searched route ID “01”. Thus, “Raku Dori 1” becomes the branch point, and compared to “Raku 2 Machi” or “Raku 1 Machi”, the branch point is calculated at a location that is even more distant from the current location.
  • the user is faced with a situation where a plurality of destinations must be searched for and a determination must be made as to which destination the user will ultimately head for.
  • the branch point is relatively close to the current location, the user will soon be faced with the need to decide which destination to head for. For instance, after further driving for a while, when attempting to change the destination in a flexible manner according to route conditions and final arrival times, the user will not be provided with sufficient time to think.
  • the present method to calculate routes from a branch point candidate, reference route costs, and to calculate a branch point at a location that is closer to the destination or a location that is more distant from the current location, it is possible to ultimately determine a destination while comprehending information on a plurality of destinations.
  • the searched route ID “04” takes 10 more minutes.
  • this branch point is calculated at a location that is furthest from the current location.
  • this also means that the branch point is calculated as a relatively long detour with respect to the shortest route.
  • a branch point may be arranged to be calculated in consideration of not only the location of the branch point, but also the route time cost. For instance, a branch point may be calculated by setting a threshold with respect to the shortest travel time of 27 minutes, such as a buffer of plus 20 percent (approximately 6 minutes). In this case, since the searched route ID “04” with an arrival time of 37 minutes exceeds the threshold, the searched route ID “03” is used, and “Raku 2 Machi” becomes the branch point.
  • the route information display unit 1011 is a unit which displays information related to routes and the like using the branch point selected by the branch point selection unit 1022 .
  • information required by the user may be displayed based on the branch point in a manner that is easily comprehended by, for instance, contrasting route information to the branch point with information beyond the branch point.
  • the search range may be narrowed down and route search costs may be reduced.
  • one of the destination routes may be arranged to be, for instance, selected by the user. Since the branch point is calculated on the selected route, it is likely that the branch point will be more suitable to the user.
  • a unit for accumulating travel history may be separately provided, whereby a route existing in the travel history may be selected as one of the destinations.
  • the route may be comprehended in an easier manner since the route branches towards the destination from a route that the user is familiar with. Furthermore, by enabling the user to contrast and comprehend differences between the estimated arrival time at the branch point and arrival times beyond the branch point, more comfortable driving may be promoted.
  • a plurality of destinations is inputted at the multiple destination input unit 1004 (S 4001 ).
  • a departure point is inputted at the departure point input unit 1012 (S 4002 ).
  • routes from the inputted departure point to the respective destinations are searched by the route search unit 1005 (S 403 ).
  • routes are searched by sequences of nodes such as intersections, and a node is calculated as a branch point candidate (S 4004 ). For instance, as shown in FIG. 35 , routes to the inputted destinations “Karaoke Dom” and “Star Bowling” are searched, and a searched node is calculated as a branch point candidate.
  • route costs to the respective destinations are calculated (S 4005 ), and, for instance, the destination with a lower route cost is selected as a reference destination (S 4006 ). Then, a branch point candidate on the route to the selected destination is selected (S 4007 ), and a route from the selected branch point candidate to the other destination is once again searched by the branch point route search unit 1025 .
  • a flag is set to the branch point candidate that is closest to the current point (S 4008 ), and a route from the set branch point candidate is searched for (S 4009 ). Then, the cost of the searched route is compared with a route cost searched from the current position by the route comparison unit 1026 (S 4010 ), and a judgment is made on whether the cost is within a threshold (for instance, plus 20 percent) (S 4011 ). If within the threshold, the flag is set to the next branch point candidate (S 4012 ), and the processing proceeds to step S 4009 .
  • a threshold for instance, plus 20 percent
  • selection of branch points is not limited to this arrangement.
  • the user may input a desired arrival time to the other destination and the like, whereby a branch point may be calculated and displayed based on whether the arrival time is met.
  • FIG. 40 is a system configuration diagram according to the present embodiment, wherein a destination estimated arrival time acquisition unit 1027 is added to the components shown in FIG. 34 .
  • a destination estimated arrival time acquisition unit 1027 is added to the components shown in FIG. 34 .
  • the same reference numerals used in the above-described embodiments are used for the same components in FIG. 40 , and descriptions thereof will not be provided.
  • the destination estimated arrival time acquisition unit 1027 is a unit which acquires a scheduled must-arrive time at an inputted destination.
  • a method for determining a branch point according to an estimated time acquired by the destination estimated arrival time acquisition unit 1027 will be described below using a specific example.
  • FIG. 41 is a map representation of a positional relationship between the current location of the user and the locations of “Movie Theater A”, “Movie Theater B”, and the like.
  • the black bold line indicates respective searched routes searched by the route search unit 1005 to the respective destinations of “Movie Theater A” and “Movie Theater B”.
  • a route to “Movie Theater A” a route is searched which passes “Raku 1 Machi”, “Raku 2 Machi”, “Ura Raku 2”, “Ura Raku 3” and reaches “Movie Theater A”.
  • route costs (defined as required times for transit) between nodes are also shown in FIG. 41 .
  • route search is performed using these route costs. For instance, it is shown that it takes 5 minutes to reach “Raku 1 Machi” from the current location, and 10 minutes from “Raku 1 Machi” to “Raku 2 Machi”. From these route costs, it is learned that a total of 50 minutes (5 min.+10 min.+10 min.+10 min.+15 min.) is required to reach “Movie Theater A”.
  • “Raku 1 Machi” becomes the branch point.
  • this branch point is not necessarily suitable to the user. For instance, as in the case of “Raku 1 Machi”, when the branch point is relatively close to the current position, the user must soon determine to which of the destinations “Movie Theater A” or “Movie Theater B” the user should proceed.
  • suitable branch points differ according to the arrival time at the destination or the like. A description will now be provided using a specific example.
  • FIG. 42 is a display example of a route information display unit 1011 according to the present embodiment.
  • the user in the present example wants to see the movie “Space Wars 3”.
  • the user inputs, as a plurality of destinations, “Movie Theater A” and “Movie Theater B” where “Space Wars 3” is being played.
  • the current time is 11:00, and the showtime of “Space Wars 3” at “Movie Theater A” is 13:00 while the showtime of “Space Wars 3” at “Movie Theater B” is 13:30.
  • the required time to “Movie Theater A” is 50 minutes and the estimated time of arrival is “12:50”, as described above.
  • the required time to “Movie Theater B” is 40 minutes and the estimated time of arrival is “12:40”.
  • the showtime at each movie theater is an example of a scheduled must-arrive time at a destination.
  • the destination estimated arrival time acquisition unit 1027 may acquire such a scheduled must-arrive time at a destination from, for instance, an information providing service operated by a movie theater, a ticket agency or the like via a network.
  • the estimated time of arrival at “Movie Theater B” is 12:40, which allows for sufficient time until the 13:30 showtime at “Movie Theater B”. However, since the 13:30 showtime is later than “Movie Theater A”, assume that the user desires to see the movie at “Movie Theater A” if possible.
  • FIG. 44 shows a current location of the user and route costs after a predetermined time has lapsed (a lapse of 15 minutes is assumed) when the user has been temporarily heading for “Movie Theater A”.
  • a congestion has occurred between, for instance, the intersection of “Ura Raku 3” and “Movie Theater A”, resulting in an increase in route cost.
  • the arrival time at “Movie Theater A” increases, and as a result, the estimated time of arrival is now 13:05 and the user will no longer make it by 13:00.
  • a route which turns right at “Ura Raku 2”, and passes “Ura Raku 4”, “Kyo 2 Machi”, “Kyo 3 Machi” and “Kyo 4 Machi”, is searched out as indicated by the black bold line in FIG. 44 .
  • route costs of, for instance, 5 minutes from “Ura Raku 2” to “Ura Raku 4”, as well as a total route cost of 30 minutes are shown.
  • the estimated time of arrival at “Movie Theater B” is shown as 12:55, which means that the location allows the user to make it to “Movie Theater B” before the showtime of 13:30 even if the user heads for “Movie Theater B” just now.
  • “Ura Raku 2” may be considered as a suitable branch point for the user.
  • FIG. 45 shows a current location of the user at a given point after further driving.
  • the current time is shown as 12:25.
  • the user ultimately decides to head for “Movie Theater B” at the point shown in FIG. 45 .
  • a route search a route which turns right at “Ura Raku 3”, passes “Kyo 1 Machi”, “Kyo 2 Machi”, “Kyo 2 Machi”, “Kyo 3 Machi” and “Kyo 4 Machi”, and arrives at “Movie Theater B”.
  • a route search a route which turns right at “Ura Raku 3”, passes “Kyo 1 Machi”, “Kyo 2 Machi”, “Kyo 2 Machi”, “Kyo 3 Machi” and “Kyo 4 Machi”, and arrives at “Movie Theater B”.
  • the user decides to head for “Movie Theater B” at the point shown in FIG.
  • route costs are 10 minutes to “Ura Raku 3”, 25 minutes to “Kyo 1 Machi”, 20 minutes to “Kyo 2 Machi”, 5 minutes to “Kyo 3 Machi”, 5 minutes to “Kyo 4 Machi”, and 5 minutes to “Movie Theater B” for a total route cost of 70 minutes.
  • the estimated time of arrival at “Movie Theater B” is now 13:55, which means that the user will not make the 13:30 showtime either.
  • a branch point is calculated in consideration of a final estimated time of arrival that is desired by the user.
  • a desired arrival time is acquired by the destination estimated arrival time acquisition unit 1027 .
  • the showtime of “Space Wars 3” at “Movie Theater B” is 13:30, ultimately making this time is suffice, and “13:30” is inputted. Meanwhile, it is assumed that the user will first head for “Movie Theater A” for which the user still has a chance of arriving in time.
  • FIG. 43 shows an example of input of estimated times of arrival at the respective destinations by the destination estimated arrival time acquisition unit 1027 .
  • the respective destinations and estimated times of arrival thereat including the estimated time of arrival at “Movie Theater A” of “13:00” and the estimated time of arrival at “Movie Theater B” of “13:30”, are displayed at the center of the screen, and are acquired when the user selects “YES”.
  • the user it is also possible to have the user set an estimated time of arrival.
  • the estimated time of arrival may be automatically set based on a showtime at a movie theater or the like.
  • FIG. 46 is a diagram describing branch point calculation.
  • a route to the selected destination “Movie Theater A” is searched for, and the nodes “Raku 1 Machi”, “Raku 2 Machi”, “Ura Raku 2” and “Ura Raku 3” are selected as branch point candidates.
  • the branch point route search unit 1025 searches once again for a route to “Movie Theater B” from the selected branch point candidates. For instance, as a route from “Raku 2 Machi” to “Movie Theater B”, a route is searched which passes “Raku 2 Machi”, “Raku Dori 1”, “Kyo 3 Machi”, “Kyo 4 Machi”, and arrives at “Movie Theater B”.
  • FIG. 47 indicates the respective searched routes described above using searched route IDs in the same manner as FIG. 38 and the like, and shows route costs between the respective nodes as well as overall route costs.
  • a searched route ID “01” is a route from the current position to “Movie Theater A” and a route cost thereof, and it is shown that a total of 50 minutes is required.
  • a searched route ID “02” is a route that turns left at “Raku 1 Machi”, and it is shown that a total of 40 minutes is required.
  • a searched route ID “03” is a route from the branch point candidate “Raku 2 Machi” to “Movie Theater B”, and it is shown that a total of 45 minutes is required.
  • a searched route ID “04” is a route from the branch point candidate “Ura Raku 2” to “Movie Theater B”, and it is shown that a total of 55 minutes is required.
  • a searched route ID “05” is a route from the branch point candidate “Ura Raku 3” to “Movie Theater B”, and it is shown that a total of 95 minutes is required.
  • the searched route ID “05” since the estimated time of arrival of 13:35 (12:00+95 minutes) exceeds the inputted arrival time of 13:30 at the present moment, it is not suitable as a branch point. Therefore, the searched route ID “04”, which is furthest from the current point but still does not exceed the inputted arrival time is selected. As a result, “Ura Raku 2” is selected as the branch point.
  • FIG. 48 is an example displaying route information to each destination based on the calculated branch point “Ura Raku 2”.
  • the left-hand side of the screen shows route information to “Movie Theater A”. Since it takes 25 minutes to reach the branch point “Ura Raku 2”, the estimated time of arrival at the branch point is shown as “12:25”.
  • a required time of “25 minutes” is shown from the branch point “Ura Raku 2” to “Movie Theater A”, and the estimated time of arrival at “Movie Theater A” is shown to be “12:50”.
  • a travel route to “Movie Theater B” after passing the branch point “Ura Raku 2” is shown at the right-side of the screen.
  • a required time in the case where the user heads for “Movie Theater B” after passing the branch point is shown to be “30 minutes”. Furthermore, the estimated time of arrival in the case where the user travels to “Movie Theater B” via branch point “Ura Raku 2” is shown to be “12:55”.
  • the arrival time when using the route that proceeds directly to “Movie Theater B” from the current position is “12:40”, which takes 15 more minutes than the route that passes branch point “Ura Raku 2”.
  • the route via the branch point “Ura Raku 2” allows the user to make it in time for the 13:30 showtime.
  • no congestions have occurred at the current position at which “Raku 1 Machi” has not yet been passed, the required time beyond the branch point is shown to be “25 minutes”, and there is still a chance of making the 13:00 showtime at “Movie Theater A” at this stage. Therefore, information may be provided in a manner reflecting actions desired by the user, such as initially heading for “Movie Theater A”.
  • estimated times of arrival at the respective points are displayed in the respective screens in list format. More specifically, “branch point estimated time of arrival 12:55” is displayed at both sides of the screen, while “estimated time of arrival 12:50” at “Movie Theater A” is displayed on the left-hand side of the screen and “estimated time of arrival 12:55” at “Movie Theater B” is displayed on the right-hand side of the screen.
  • display modes of the screen is not limited to this arrangement, and, for instance, a relevant time may be displayed in the vicinity of each point on a screen (for instance, the display example shown in FIG. 9 or the like) which displays a current location.
  • a relevant time may be displayed in the vicinity of each point on a screen (for instance, the display example shown in FIG. 9 or the like) which displays a current location.
  • a user With a car navigation system, generally, a user often drives while performing current location display which displays the current location of the user and the vicinity thereof at a predetermined scale.
  • a transit time at a predetermined point may be displayed on the screen that is currently displayed or, in other words, the respective estimated times of arrival may be displayed near “Movie Theater A”, “Movie Theater B” and the intersection “Ura Raku 2” which is the branch point, instead of displaying by switching screens as shown in FIG. 48 .
  • a transit time at a predetermined point may be displayed on the screen that is currently displayed or, in other words, the respective estimated times of arrival may be displayed near “Movie Theater A”, “Movie Theater B” and the intersection “Ura Raku 2” which is the branch point, instead of displaying by switching screens as shown in FIG. 48 .
  • a method was described for a case where a plurality of destinations is inputted whereby a search is performed using one of the plurality of destinations as an intermediate point. More specifically, in FIG. 32 , “Karaoke Dom” and “Star Bowl” are inputted, whereby a route to “Star Bowl” which uses “Karaoke Dom” as a branch point or, in this case, an intermediate point, is searched out.
  • control thereof may be performed using category types, similarities/differences or resemblances of categories of the final destinations.
  • category types similarities/differences or resemblances of categories of the final destinations.
  • FIG. 49 is a system configuration diagram.
  • a destination category judgment unit 1028 is added to the components shown in FIG. 34 .
  • the destination category judgment unit 1028 is a unit which judges, for instance, similarities/differences of categories of destinations inputted to the multiple destination input unit 1004 . Then, according to the similarities/differences of categories, judgment is made on whether one of the destinations is to be used as an intermediate point, and a branch point is selected by the branch point selection unit 1022 . For instance, when the categories are the same, one of the destinations is not to be selected as a branch point or, in other words, is not to be selected as an intermediate point. On the other hand, when different, one of the destinations is to be selected as a branch point or, in other words, is to be selected as an intermediate point.
  • the destination category judgment unit 1028 is an example of a destination classification judgment unit as described in the claims.
  • the user generally desires to head for one of the plurality of destinations, and attempts to ultimately decide on which destination to head for according to conditions.
  • the categories of the inputted destinations are different, there are cases where the user desires to ultimately proceed to either of the plurality of destinations, and is merely deciding an order of which destination to initially head for according to conditions.
  • control is performed according to the similarities/differences of categories on whether a destination will be selected as a branch point.
  • FIG. 50 is a diagram showing searched routes and branch point candidates.
  • “Karaoke Dom” and “Star Bowling” are inputted to the multiple destination input unit 1004 , and a route to “Karaoke Dom” is searched for by the route search unit 1005 .
  • branch point candidates are calculated by the branch point candidate calculation unit 1021 , and routes from the respective branch point candidates to “Star Bowling” are searched by the branch point route search unit 1025 . For instance, assume that two routes are searched out, namely, a route that turns right at the intersection of “Raku 2 Machi” and heads straight for “Star Bowling”, and a route that proceeds to “Star Bowling” via “Karaoke Dom”.
  • routes is compared by the route comparison unit 1026 and an optimum branch point is selected by the branch point selection unit 1022 , in the present example, control is further performed according to categories of destinations.
  • FIG. 51 is a diagram showing a case where destinations falling under different categories are inputted. “Karaoke Dom” and “Karaoke Utamaru” are inputted to the multiple destination input unit 1004 , and a route to “Karaoke Dom” is searched for by the route search unit 1005 .
  • branch point candidates are calculated by the branch point candidate calculation unit 1021 , and routes from the respective branch point candidates to “Karaoke Utamaru” are searched by the branch point route search unit 1025 .
  • an optimum branch point may be arranged to be selected in consideration of time and the like, as shown in the above-described embodiment.
  • FIG. 52 is a diagram describing selection of branch point candidates.
  • “Star Bowling” and “Macdoness Burgers” are inputted as a plurality of destinations.
  • a route to “Macdoness Burgers”, as well as routes from the respective branch point candidates to “Star Bowling” are searched out. Assume that, for instance, two routes are searched out, namely, a route that turns right at the intersection of “Raku 2 Machi” and heads straight for “Star Bowling”, and a route that proceeds to “Star Bowling” via “Macdoness Burgers”. In this case, “Macdoness Burgers” falls under the category of fastfood.
  • fastfood restaurants such as “Macdoness Burgers” are places where refreshments are taken and where people generally do not stay long.
  • Fastfood restaurants are also provided with drive-throughs and the like, and are positions where business may be concluded in a relatively short period of time before moving on. Assume that, for instance, the user of the present example ultimately heads for “Star Bowling”, but intends to stop by “Macdoness Burgers” if time permits, and is attempting to make a determination according to traffic conditions. Assume also that the plurality of destinations has been inputted.
  • route search may be performed by using a destination with a relatively short duration of stay as an intermediate point, while a destination with a relatively long duration of stay is not selected as an intermediate point.
  • the destination category judgment unit 1028 may be arranged to accumulate categories as well as information indicating general duration of stay at destinations falling under the categories.
  • the destination category judgment unit 1028 is an example of a destination duration judgment unit as described in the claims. Then, according to the obtained duration of stay, judgment is made on whether one of the destinations is to be used as an intermediate point for the other destination, and a branch point is selected by the branch point selection unit 1022 .
  • FIG. 53 is a diagram showing information indicating a relationship between categories and durations of stay. Durations of stay at destinations falling under the respective categories are shown, with 15 minutes for fastfood, 1 hour for a restaurant, 2 hours for a movie theater, and 1 hour for bowling. For instance, a branch point may be accurately calculated from branch point candidates by judging a duration of stay based on these categories of destinations and calculating route costs by adding durations of stay.
  • judgment may be made on whether a destination is to be selected as a intermediate point by judging whether a predetermined range is exceeded, such as whether the overtime equals or exceeds 1 hour.
  • FIG. 54 is a diagram describing control of intermediate point selection according to category.
  • “Star Bowling” and “Michael Movie Theater” are inputted as a plurality of destinations.
  • a route to “Michael Movie Theater” a route that turns right at the intersection of “Raku 2 Machi” and heads straight for “Star Bowling”, and a route via “Michael Movie Theater” are searched for.
  • the category of “Michael Movie Theater” is movie theater, and a duration of stay of 2 hours is shown in FIG. 53 .
  • traveling via “Michael Movie Theater” results in a considerable delay in comparison to the required time when heading straight for “Star Bowling”.
  • the travel history of the user may be accumulated as shown in the above-described embodiment, whereby control may be performed using the travel history.
  • the travel history of the user may be accumulated by, for instance, adding the travel history accumulation unit 1101 shown in FIG. 17 to the configuration shown in FIG. 49 .
  • FIG. 55 is a diagram showing accumulated travel histories. Similar to the travel histories shown in FIG. 18 , travel histories accumulated in association with driving by the user is shown. For instance, as a travel history ID “01”, a history has been accumulated in which the user had left home at 9:40 on Sep. 10, 2006, and arrived at a final destination, “Macdoness Burgers”, at 10:00 on the same day. In addition, as a travel history ID “02”, a history has been accumulated in which the user had left “Macdoness Burgers” at 10:18 on the same day, and arrived at a final destination, “Star Bowling”, at 10:41 on the same day.
  • control of whether a route to the other destination is to be searched for once again after passing the branch point may be performed according to a category. Passing a selected branch point means that one of the destinations has been selected, and the other had not been selected. Therefore, automatic deletion may be performed without once again searching for a route to the other destination that has not been selected.
  • FIG. 56 is a diagram describing route search after passing a branch point. Similar to FIGS. 41 , 45 and the like, for FIG. 56 , a plurality of destinations, namely, “Movie Theater A” and “Movie Theater B”, have been inputted, the intersection of “Ura Raku 2” has been selected as the branch point from branch point candidates, and a route to “Movie Theater A” and a route to “Movie Theater B” which branches at the intersection of “Ura Raku 2” are shown. As described above, this enables driving while contrasting the arrival time at “Movie Theater A” with the arrival time at “Movie Theater B” without cumbersome operations.
  • FIG. 57 is a diagram showing a situation where the user has passed the intersection of “Ura Raku 2” that is a branch point. In this case, passing and proceeding straight through the intersection of “Ura Raku 2” means that the user has ultimately selected “Movie Theater A”. With a conventional car navigation system or the like which, generally, subsequently continues to search for routes to the inputted destinations, routes to “Movie Theater B” is to be searched once again.
  • FIG. 58 is a diagram showing a case where the user recommences traveling after heading for “Movie Theater A”. Assume that the user, who has proceeded straight through the intersection of “Ura Raku 2” and selected “Movie Theater A” in FIG. 57 , subsequently arrives at “Movie Theater A”, and recommences traveling immediately afterwards.
  • the duration of stay for a movie theater is shown as 2 hours.
  • the actual duration of stay for the user at a destination is, for instance, around 10 minutes, which is shorter than the duration of stay related to the category of the destination, it is conceivable that the user recommences traveling because the original purpose cannot be achieved since, for instance, the movie theater is full. Therefore, in a case where the duration of stay is shorter than the average duration of stay of 2 hours, a route to the other destination among the inputted plurality of destinations or, in other words, “Movie Theater B”, may be once again searched for and displayed. In FIG. 58 , a route from “Movie Theater A” to “Movie Theater B” is searched out.
  • branch points are calculated from map information accumulated in the map information accumulation unit 1003 , using points (nodes) such as intersections and landmarks as candidates thereof.
  • nodal information based on units of intersections or landmarks are accumulated in the map information, and route search is generally performed based on temporal costs which accrue between these nodes.
  • a branch point may be obtained by searching for a sequence of nodes such as intersections as routes and calculating a branch point.
  • the point at which information related to the branch point should be provided to the user is not the calculated branch point, but the point where the right-turn lane and the straight through lane provided at the intersection begin.
  • the location of a branch point may be corrected using not only nodes such as intersections, but also using information related to traffic regulations of the route, such as left-turn and right-turn lanes.
  • FIG. 59 is a diagram describing branch point calculation using traffic regulations. Similar to FIG. 23 , for FIG. 59 , “Sakura Golf Course” and “Miyazato Golf Course” are inputted as destinations. In addition, as a result of a route search using intersections and the like as nodes, the intersection of “No. 111” is calculated as a branch point. The user proceeds straight through the intersection of “No. 111” when heading for “Sakura Golf Course”, and turns right at the intersection of “No. 111” when heading for “Miyazato Golf Course”.
  • the map information accumulation unit 1003 is an example of a traffic regulation accumulation unit as described in the claims.
  • the present invention may be utilized as a route information display device that is installed in, for instance, a car navigation device or a mobile terminal, and which enables easier comprehension of information by considering branch points of routes to a plurality of destinations.

Landscapes

  • Engineering & Computer Science (AREA)
  • Radar, Positioning & Navigation (AREA)
  • Remote Sensing (AREA)
  • Automation & Control Theory (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Human Computer Interaction (AREA)
  • Health & Medical Sciences (AREA)
  • General Health & Medical Sciences (AREA)
  • Social Psychology (AREA)
  • Navigation (AREA)
  • Instructional Devices (AREA)
  • Traffic Control Systems (AREA)
US11/918,604 2005-12-07 2006-11-16 Route information display device and route information display method Abandoned US20090048774A1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US12/048,049 US8131467B2 (en) 2005-12-07 2008-03-13 Route information display device and route information display method

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
JP2005-354052 2005-12-07
JP2005354052 2005-12-07
PCT/JP2006/322858 WO2007066483A1 (fr) 2005-12-07 2006-11-16 Dispositif d’affichage d’informations de route et méthode d’affichage d’informations de route

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2006/322858 A-371-Of-International WO2007066483A1 (fr) 2005-12-07 2006-11-16 Dispositif d’affichage d’informations de route et méthode d’affichage d’informations de route

Related Child Applications (2)

Application Number Title Priority Date Filing Date
US12/047,925 Continuation US20080167802A1 (en) 2005-12-07 2008-03-13 Route information display device and route information display method
US12/048,049 Continuation US8131467B2 (en) 2005-12-07 2008-03-13 Route information display device and route information display method

Publications (1)

Publication Number Publication Date
US20090048774A1 true US20090048774A1 (en) 2009-02-19

Family

ID=38122633

Family Applications (2)

Application Number Title Priority Date Filing Date
US11/918,604 Abandoned US20090048774A1 (en) 2005-12-07 2006-11-16 Route information display device and route information display method
US12/048,049 Expired - Fee Related US8131467B2 (en) 2005-12-07 2008-03-13 Route information display device and route information display method

Family Applications After (1)

Application Number Title Priority Date Filing Date
US12/048,049 Expired - Fee Related US8131467B2 (en) 2005-12-07 2008-03-13 Route information display device and route information display method

Country Status (5)

Country Link
US (2) US20090048774A1 (fr)
EP (1) EP1959237A4 (fr)
JP (1) JP4059919B2 (fr)
CN (5) CN101430210A (fr)
WO (1) WO2007066483A1 (fr)

Cited By (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080275638A1 (en) * 2007-05-02 2008-11-06 Ian Cummings Conducting localized searches in a wireless client-server navigation system
US20090024318A1 (en) * 2007-07-19 2009-01-22 Aisin Aw Co., Ltd. Navigation apparatus and navigation program
US20090119012A1 (en) * 2007-11-07 2009-05-07 Honda Motor Co., Ltd. Navigation apparatus
US20100131304A1 (en) * 2008-11-26 2010-05-27 Fred Collopy Real time insurance generation
US20100241623A1 (en) * 2009-03-23 2010-09-23 Acker Robert L User generated notes integrated with location-based application
US20100248746A1 (en) * 2009-03-30 2010-09-30 Rafael Saavedra Predictive search with location-based application
US20100332406A1 (en) * 2009-06-30 2010-12-30 Siemens Aktiengesellschaft Method and apparatus for transporting a set of articles to destinations and for analyzing the transportation process
US20110238457A1 (en) * 2009-11-24 2011-09-29 Telogis, Inc. Vehicle route selection based on energy usage
US8831879B2 (en) 2012-06-22 2014-09-09 Google Inc. Presenting information for a current location or time
US9002636B2 (en) 2012-06-22 2015-04-07 Google Inc. Contextual traffic or transit alerts
US20150177017A1 (en) * 2011-10-19 2015-06-25 Google Inc. Method, System, and Computer Program Product For Visual Disambiguation For Directions Queries
US20150228192A1 (en) * 2012-09-20 2015-08-13 Toyota Jidosha Kabushiki Kaisha On-demand vehicle operation management device, on-demand vehicle operation management method, and on-demand vehicle operation management system
US9503516B2 (en) 2014-08-06 2016-11-22 Google Technology Holdings LLC Context-based contact notification
US9958272B2 (en) * 2012-08-10 2018-05-01 Telogis, Inc. Real-time computation of vehicle service routes
US10746559B2 (en) 2016-08-15 2020-08-18 International Business Machines Corporation Dynamic route guidance based on real-time data

Families Citing this family (54)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP4944551B2 (ja) * 2006-09-26 2012-06-06 日立オートモティブシステムズ株式会社 走行制御装置、走行制御方法、および、走行制御プログラム
US8862710B2 (en) 2007-09-11 2014-10-14 Telecommunication Systems, Inc. Dynamic configuration of mobile station location services
US8428869B2 (en) * 2008-04-07 2013-04-23 Telecommunication Systems, Inc. Context enabled address selection
KR101538653B1 (ko) * 2008-06-25 2015-07-29 삼성전자주식회사 경로 방향에 기초한 맵 표시 방법 및 장치
US9846049B2 (en) 2008-07-09 2017-12-19 Microsoft Technology Licensing, Llc Route prediction
US8594627B2 (en) * 2008-10-06 2013-11-26 Telecommunications Systems, Inc. Remotely provisioned wirelessly proxy
US8396658B2 (en) * 2008-10-06 2013-03-12 Telecommunication Systems, Inc. Probabilistic reverse geocoding
US9200913B2 (en) * 2008-10-07 2015-12-01 Telecommunication Systems, Inc. User interface for predictive traffic
US20100094550A1 (en) * 2008-10-07 2010-04-15 Kevin Tsurutome User interface for dynamic user-defined stopovers during guided naviation ('side trips")
US9285239B2 (en) * 2008-10-07 2016-03-15 Telecommunication Systems, Inc. User interface for content channel HUD (heads-up display) and channel sets for location-based maps
US20100088018A1 (en) * 2008-10-08 2010-04-08 Kevin Tsurutome Glance ahead navigation
US8156068B2 (en) * 2008-11-13 2012-04-10 Telecommunication Systems, Inc. Predictive ephemeral points-of-interest (PEPOI)
US8340894B2 (en) * 2009-10-08 2012-12-25 Honda Motor Co., Ltd. Method of dynamic intersection mapping
JP2011214948A (ja) * 2010-03-31 2011-10-27 Sony Corp 情報処理装置、行動予測表示方法及びコンピュータプログラム
JP5126272B2 (ja) * 2010-03-31 2013-01-23 株式会社デンソー ナビゲーションシステム
US8754777B1 (en) 2010-08-13 2014-06-17 Google Inc. System and method for predicting user route and destination
CN102410839B (zh) * 2010-09-17 2016-02-17 阿尔派株式会社 导航装置和导航装置的路线引导方法
WO2012046268A1 (fr) * 2010-10-05 2012-04-12 三菱電機株式会社 Dispositif de navigation et terminal d'informations portable
KR101814601B1 (ko) * 2010-12-09 2018-01-04 삼성전자주식회사 택시 안전 귀가 서비스 시스템 및 방법
US9134137B2 (en) 2010-12-17 2015-09-15 Microsoft Technology Licensing, Llc Mobile search based on predicted location
WO2012130716A1 (fr) * 2011-03-25 2012-10-04 Robert Bosch Gmbh Dispositif de navigation-calcul d'un itinéraire selon la destination
NL2008690C2 (en) * 2011-04-25 2014-07-15 Google Inc Dynamic highlighting of geographic entities on electronic maps.
JP5402991B2 (ja) * 2011-06-06 2014-01-29 株式会社デンソー 経路算出装置
CN103164953B (zh) * 2011-12-19 2016-03-02 联想(北京)有限公司 一种显示路线的方法及终端
US20130218445A1 (en) * 2012-02-16 2013-08-22 Intelligent Mechatronic Systems Inc. Traffic portal enquiry and alert system
US9756571B2 (en) 2012-02-28 2017-09-05 Microsoft Technology Licensing, Llc Energy efficient maximization of network connectivity
US9189959B2 (en) * 2012-06-27 2015-11-17 International Business Machines Corporation Navigation system providing a super detail mode of operation to assist user's driving
WO2014002489A1 (fr) * 2012-06-29 2014-01-03 株式会社デンソー Dispositif de navigation et progiciel de navigation
KR101786126B1 (ko) * 2012-10-26 2017-10-17 현대자동차주식회사 변속기 장착 ev차량의 모터토크 제어방법
WO2014069017A1 (fr) * 2012-10-31 2014-05-08 株式会社コナミデジタルエンタテインメント Dispositif de gestion, système de fourniture de service, procédé de commande de dispositif de gestion et support d'enregistrement lisible par ordinateur
DE102012219927A1 (de) * 2012-10-31 2014-04-30 Bayerische Motoren Werke Aktiengesellschaft Fahrzeugassistenzvorrichtung
JP5964728B2 (ja) 2012-11-06 2016-08-03 トヨタ自動車株式会社 ナビゲーションシステム
US20140172292A1 (en) * 2012-12-14 2014-06-19 Ford Global Technologies, Llc Methods and Apparatus for Context Based Trip Planning
CN103047990B (zh) * 2012-12-24 2015-05-20 北京交通发展研究中心 基于骨干路网分层的多路径选择方法
CN103968851B (zh) * 2013-02-01 2016-12-28 北京掌行通信息技术有限公司 一种实现动态调整目的地的导航方法
WO2014203592A1 (fr) * 2013-06-17 2014-12-24 ソニー株式会社 Dispositif de traitement d'image, procédé de traitement d'image et programme
US9534919B2 (en) * 2014-07-08 2017-01-03 Honda Motor Co., Ltd. Method and apparatus for presenting a travel metric
WO2016037130A1 (fr) * 2014-09-04 2016-03-10 Urban Engines, Inc. Pile de cartes
JP6443257B2 (ja) * 2015-01-19 2018-12-26 株式会社デンソー 音声学習システム、音声学習方法
JP6769693B2 (ja) * 2015-02-27 2020-10-14 パイオニア株式会社 提示装置、提示方法及び提示プログラム
JP2016194430A (ja) * 2015-03-31 2016-11-17 パイオニア株式会社 経路探索装置、経路探索方法並びに経路探索用プログラム及び記録媒体
PL3365632T3 (pl) 2015-10-19 2020-11-02 Usadel Gmbh Sposób zmienionego obrazowania lokalizacji wybranych punktów docelowych na mapach
CN105677773A (zh) * 2015-12-30 2016-06-15 厦门欣欣信息有限公司 一种路线显示方法及装置
US9672734B1 (en) 2016-04-08 2017-06-06 Sivalogeswaran Ratnasingam Traffic aware lane determination for human driver and autonomous vehicle driving system
KR101896993B1 (ko) * 2016-06-08 2018-09-11 아주대학교산학협력단 이동체의 경로 결정 방법 및 장치
DE102017207243A1 (de) * 2017-04-28 2018-10-31 Continental Automotive Gmbh Verfahren und Einrichtung zum Erzeugen von dynamischen Hinweisen über eine Änderung einer Routenführung
JP6609606B2 (ja) * 2017-09-28 2019-11-20 株式会社Ｓｕｂａｒｕ 車両の情報表示装置
CN108458705A (zh) * 2017-11-16 2018-08-28 平安科技（深圳）有限公司 目标地点的导航方法、装置、存储介质及终端
JP2019178881A (ja) * 2018-03-30 2019-10-17 株式会社Ｓｕｂａｒｕ 車載ナビゲーション装置およびこれと用いられる地点検索装置
CN108955709A (zh) * 2018-07-16 2018-12-07 深圳市元征科技股份有限公司 一种班车路线规划方法、系统、设备及计算机存储介质
JP7173695B2 (ja) * 2018-10-30 2022-11-16 トヨタ自動車株式会社 情報提供装置、情報提供システム、情報提供方法、情報提供プログラム
CN110608749B (zh) * 2019-09-06 2022-04-22 中国安全生产科学研究院 路径的确定方法、装置及存储介质
CN111102989A (zh) * 2019-12-11 2020-05-05 维沃移动通信有限公司 路线显示方法及电子设备
TWI733481B (zh) * 2020-06-03 2021-07-11 南開科技大學 多目地路徑規劃系統及其方法

Citations (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5845228A (en) * 1996-02-08 1998-12-01 Mitsubishi Denki Kabushiki Kaisha Vehicle-route computing apparatus
US5906654A (en) * 1996-01-18 1999-05-25 Alpine Electronics, Inc. Route guidance for vehicle navigation apparatus to find alternate destination
JPH11149596A (ja) * 1997-11-14 1999-06-02 Nissan Motor Co Ltd 車載情報装置
US6016485A (en) * 1998-02-13 2000-01-18 Etak, Inc. System for pathfinding
US6223124B1 (en) * 1998-01-29 2001-04-24 Fuji Jukogyo Kabushiki Kaisha Route consideration apparatus
US20020188400A1 (en) * 2001-05-10 2002-12-12 Hiroyuki Sato Vehicle navigation system and method
US20030028319A1 (en) * 1998-03-25 2003-02-06 Asta Khavakh Method and system for route calculation in a navigation application
US20030158658A1 (en) * 2001-01-11 2003-08-21 Georg Hoever Navigation method with dynamic destination selection and navigation device
JP2003344074A (ja) * 2002-05-23 2003-12-03 Matsushita Electric Ind Co Ltd 情報提供システム
US6771189B2 (en) * 2002-07-17 2004-08-03 Alpine Electronics, Inc. Display method and apparatus for navigation system
US6832139B2 (en) * 2002-03-21 2004-12-14 Rapistan Systems Advertising Corp. Graphical system configuration program for material handling
US20050033511A1 (en) * 2002-04-30 2005-02-10 Telmap Ltd. Dynamic navigation system
US20050149253A1 (en) * 2004-01-05 2005-07-07 Pioneer Corporation Information-processing device, system thereof, method thereof, program thereof and recording medium storing the program
JP2005201726A (ja) * 2004-01-14 2005-07-28 Denso Corp ナビゲーション装置
US20050187707A1 (en) * 2004-02-19 2005-08-25 Tatsuo Yokota Navigation method and system for visiting multiple destinations by minimum number of stops
US7496484B2 (en) * 2000-03-17 2009-02-24 Microsoft Corporation System and method for abstracting and visualizing a route map

Family Cites Families (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP3580458B2 (ja) * 1996-04-23 2004-10-20 アイシン・エィ・ダブリュ株式会社 車両用ナビゲーション装置
EP0803705B1 (fr) 1996-04-23 2004-11-17 Aisin Aw Co., Ltd. Système de navigation pour véhicules
JPH10153449A (ja) * 1996-09-30 1998-06-09 Aisin Aw Co Ltd 車両用ナビゲーション装置及び記憶媒体
KR100288284B1 (ko) 1996-09-30 2001-05-02 모리 하루오 차량용 네비게이션장치
JP3772586B2 (ja) * 1999-04-23 2006-05-10 アイシン・エィ・ダブリュ株式会社 経路探索装置、経路探索方法及び経路探索のためのコンピュータプログラムを記憶した媒体
JP2002243486A (ja) * 2001-02-16 2002-08-28 Nissan Motor Co Ltd ナビゲーション装置
JP2004132884A (ja) 2002-10-11 2004-04-30 Denso Corp ナビゲーション装置
JP2004177209A (ja) * 2002-11-26 2004-06-24 Alpine Electronics Inc ナビゲーション装置
JP4225194B2 (ja) * 2003-12-25 2009-02-18 アイシン・エィ・ダブリュ株式会社 ナビゲーションシステム
JP4495620B2 (ja) * 2004-03-05 2010-07-07 パナソニック株式会社 移動先予測装置および移動先予測方法

Patent Citations (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5906654A (en) * 1996-01-18 1999-05-25 Alpine Electronics, Inc. Route guidance for vehicle navigation apparatus to find alternate destination
US5845228A (en) * 1996-02-08 1998-12-01 Mitsubishi Denki Kabushiki Kaisha Vehicle-route computing apparatus
JPH11149596A (ja) * 1997-11-14 1999-06-02 Nissan Motor Co Ltd 車載情報装置
US6223124B1 (en) * 1998-01-29 2001-04-24 Fuji Jukogyo Kabushiki Kaisha Route consideration apparatus
US6016485A (en) * 1998-02-13 2000-01-18 Etak, Inc. System for pathfinding
US20030028319A1 (en) * 1998-03-25 2003-02-06 Asta Khavakh Method and system for route calculation in a navigation application
US7496484B2 (en) * 2000-03-17 2009-02-24 Microsoft Corporation System and method for abstracting and visualizing a route map
US20030158658A1 (en) * 2001-01-11 2003-08-21 Georg Hoever Navigation method with dynamic destination selection and navigation device
US20020188400A1 (en) * 2001-05-10 2002-12-12 Hiroyuki Sato Vehicle navigation system and method
US6832139B2 (en) * 2002-03-21 2004-12-14 Rapistan Systems Advertising Corp. Graphical system configuration program for material handling
US20050033511A1 (en) * 2002-04-30 2005-02-10 Telmap Ltd. Dynamic navigation system
JP2003344074A (ja) * 2002-05-23 2003-12-03 Matsushita Electric Ind Co Ltd 情報提供システム
US6771189B2 (en) * 2002-07-17 2004-08-03 Alpine Electronics, Inc. Display method and apparatus for navigation system
US20050149253A1 (en) * 2004-01-05 2005-07-07 Pioneer Corporation Information-processing device, system thereof, method thereof, program thereof and recording medium storing the program
JP2005201726A (ja) * 2004-01-14 2005-07-28 Denso Corp ナビゲーション装置
US20050187707A1 (en) * 2004-02-19 2005-08-25 Tatsuo Yokota Navigation method and system for visiting multiple destinations by minimum number of stops

Cited By (35)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8116974B2 (en) * 2007-05-02 2012-02-14 Ian Cummings Conducting localized searches in a wireless client-server navigation system
US20080275638A1 (en) * 2007-05-02 2008-11-06 Ian Cummings Conducting localized searches in a wireless client-server navigation system
US20090024318A1 (en) * 2007-07-19 2009-01-22 Aisin Aw Co., Ltd. Navigation apparatus and navigation program
US20090119012A1 (en) * 2007-11-07 2009-05-07 Honda Motor Co., Ltd. Navigation apparatus
US20100131300A1 (en) * 2008-11-26 2010-05-27 Fred Collopy Visible insurance
US20100131302A1 (en) * 2008-11-26 2010-05-27 Fred Collopy Insurance vertical market specialization
US20100131303A1 (en) * 2008-11-26 2010-05-27 Fred Collopy Dynamic insurance rates
US20100131301A1 (en) * 2008-11-26 2010-05-27 Fred Collopy Insurance vertical market specialization
US20100131307A1 (en) * 2008-11-26 2010-05-27 Fred Collopy Monetization of performance information of an insured vehicle
US20150324928A1 (en) * 2008-11-26 2015-11-12 Great Lakes Incubator, Llc Insurance vertical market specialization
US9996884B2 (en) 2008-11-26 2018-06-12 Great Lakes Incubator, Llc Visible insurance
US20100131304A1 (en) * 2008-11-26 2010-05-27 Fred Collopy Real time insurance generation
US20100241623A1 (en) * 2009-03-23 2010-09-23 Acker Robert L User generated notes integrated with location-based application
US20100248746A1 (en) * 2009-03-30 2010-09-30 Rafael Saavedra Predictive search with location-based application
US20100332406A1 (en) * 2009-06-30 2010-12-30 Siemens Aktiengesellschaft Method and apparatus for transporting a set of articles to destinations and for analyzing the transportation process
US8706409B2 (en) 2009-11-24 2014-04-22 Telogis, Inc. Vehicle route selection based on energy usage
US10429199B2 (en) 2009-11-24 2019-10-01 Verizon Patent And Licensing Inc. Vehicle route selection based on energy usage
US20110238457A1 (en) * 2009-11-24 2011-09-29 Telogis, Inc. Vehicle route selection based on energy usage
US9702719B2 (en) 2009-11-24 2017-07-11 Telogis, Inc. Vehicle route selection based on energy usage
US9157756B2 (en) 2009-11-24 2015-10-13 Telogis, Inc. Vehicle route selection based on energy usage
US20150177017A1 (en) * 2011-10-19 2015-06-25 Google Inc. Method, System, and Computer Program Product For Visual Disambiguation For Directions Queries
US9239246B2 (en) * 2011-10-19 2016-01-19 Google Inc. Method, system, and computer program product for visual disambiguation for directions queries
US9002636B2 (en) 2012-06-22 2015-04-07 Google Inc. Contextual traffic or transit alerts
US9587947B2 (en) 2012-06-22 2017-03-07 Google Inc. Presenting information for a current location or time
US9146114B2 (en) 2012-06-22 2015-09-29 Google Inc. Presenting information for a current location or time
US10168155B2 (en) 2012-06-22 2019-01-01 Google Llc Presenting information for a current location or time
US8831879B2 (en) 2012-06-22 2014-09-09 Google Inc. Presenting information for a current location or time
US10996057B2 (en) 2012-06-22 2021-05-04 Google Llc Presenting information for a current location or time
US11765543B2 (en) 2012-06-22 2023-09-19 Google Llc Presenting information for a current location or time
US9958272B2 (en) * 2012-08-10 2018-05-01 Telogis, Inc. Real-time computation of vehicle service routes
US9836974B2 (en) * 2012-09-20 2017-12-05 Toyota Jidosha Kabushiki Kaisha On-demand vehicle operation management device, on-demand vehicle operation management method, and on-demand vehicle operation management system
US20150228192A1 (en) * 2012-09-20 2015-08-13 Toyota Jidosha Kabushiki Kaisha On-demand vehicle operation management device, on-demand vehicle operation management method, and on-demand vehicle operation management system
US9503516B2 (en) 2014-08-06 2016-11-22 Google Technology Holdings LLC Context-based contact notification
US10746559B2 (en) 2016-08-15 2020-08-18 International Business Machines Corporation Dynamic route guidance based on real-time data
US11009361B2 (en) 2016-08-15 2021-05-18 International Business Machines Corporation Dynamic route guidance based on real-time data

Also Published As

Publication number Publication date
CN101430208A (zh) 2009-05-13
CN101228413A (zh) 2008-07-23
CN101430209A (zh) 2009-05-13
CN101430209B (zh) 2011-05-25
CN101430210A (zh) 2009-05-13
CN101430208B (zh) 2011-09-14
CN101430211A (zh) 2009-05-13
JPWO2007066483A1 (ja) 2009-05-14
EP1959237A4 (fr) 2012-03-14
WO2007066483A1 (fr) 2007-06-14
US20080177462A1 (en) 2008-07-24
CN101430211B (zh) 2012-05-23
US8131467B2 (en) 2012-03-06
JP4059919B2 (ja) 2008-03-12
EP1959237A1 (fr) 2008-08-20

Similar Documents

Publication Publication Date Title
US8131467B2 (en) Route information display device and route information display method
US20080167802A1 (en) Route information display device and route information display method
US8560227B2 (en) Route planning apparatus and method for navigation system
US7483788B2 (en) Navigation apparatus and method
CN112041639B (zh) 用于产生停车路线的方法及系统
US7590488B2 (en) Route condition evaluation method and apparatus for navigation system
US7788030B2 (en) Navigation system
JP4266173B2 (ja) 案内経路探索装置
KR20070012272A (ko) 네비게이션 시스템
US7630831B2 (en) Navigation system
KR101843683B1 (ko) 개인 맞춤형 추천 경로를 제공하는 네비게이션 시스템 및 그 구동방법
US8340900B2 (en) Navigation device and alerting method thereof
US20130013189A1 (en) Navigation device
JP2003121182A (ja) ナビゲーション装置
JP4305301B2 (ja) 車両用経路計算装置
JP4108115B2 (ja) 経路情報表示装置および経路情報表示方法
JP4663703B2 (ja) 経路情報表示装置および経路情報表示方法
JP4077864B2 (ja) 経路情報表示装置および経路情報表示方法
JP4077865B2 (ja) 経路情報表示装置および経路情報表示方法
KR20190037989A (ko) 관심지점 검색 장치 및 방법
JP2012154836A (ja) 車載用ナビゲーション装置およびナビゲーション方法

Legal Events

Date Code Title Description
AS Assignment

Owner name: MATSUSHITA ELECTRIC INDUSTRIAL CO., LTD., JAPAN

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:YOSHIOKA, MOTOTAKA;OZAWA, JUN;REEL/FRAME:020759/0374;SIGNING DATES FROM 20070831 TO 20070903

AS Assignment

Owner name: PANASONIC CORPORATION, JAPAN

Free format text: CHANGE OF NAME;ASSIGNOR:MATSUSHITA ELECTRIC INDUSTRIAL CO., LTD.;REEL/FRAME:021832/0215

Effective date: 20081001

Owner name: PANASONIC CORPORATION,JAPAN

Free format text: CHANGE OF NAME;ASSIGNOR:MATSUSHITA ELECTRIC INDUSTRIAL CO., LTD.;REEL/FRAME:021832/0215

Effective date: 20081001

STCB Information on status: application discontinuation

Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION