Guide Route Search Device, Guide Route Search Method, and Computer Program Thereof

• US 20080120021A1
• Filed: 02/04/2005
• Published: 05/22/2008
• Est. Priority Date: 02/17/2004
• Status: Abandoned Application

• Current Assignee: Kabushiki Kaisha Kenwood (JVC Kenwood Corporation)
• Original Assignee: Kabushiki Kaisha Kenwood (JVC Kenwood Corporation)
• Inventors: Akiyoshi, Hiromi, Kaneda, Masaki, Ueno, Masahiro
• Application Number:
  US10/589,673
• Publication Number:
  US 20080120021A1
• Time in Patent Office: Days
• US Class Current: 701/201
• CPC Class Codes: G01C 21/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 travelling salesman problem G06Q10/04; optimisation of routes G06Q10/047
• CPC Class Codes: G08G 1/096827 where the route is computed onboard
• CPC Class Codes: G08G 1/096838 where the user preferences are taken into account or the user selects one route out of a plurality
• CPC Class Codes: G08G 1/096844 where the complete route is dynamically recomputed based on new data
• CPC Class Codes: G08G 1/123 indicating the position of vehicles, e.g. scheduled vehicles; Managing passenger vehicles circulating according to a fixed timetable, e.g. buses, trains, tramstransmission of navigation instructions to vehicles G08G1/0968
• CPC Class Codes: G09B 29/10 Map spot or coordinate position indicators; Map reading aids optical projection apparatus per se G03B

Abstract

A guide route search device basically includes specification means, calculation means, judgment means, and selection means. The specification means specifies a plurality of locations. The calculation means calculates the arrival time at each of the locations when successively visiting them with a certain via-sequence while eliminating passing through a place which may be congested. The judgment means judges whether the arrival time of each location calculated is matched with the arrival time condition at each location. The selection means selects the via-sequence where the judgment means has judged that the conditions are matched at all the locations specified, as a via-sequence of the guide route. Thus, it is possible to find a guide route via a plurality of via-locations so that a stay with a desired state can be realized at each via-location.

Claims

1. A guide route search device, the device comprising:

a specification unit adapted to specify a plurality of locations which a user drops in before reaching a destination;

a calculation unit adapted to calculate an arrival time at each of the specified locations when successively visiting those locations in one of via-sequences while avoiding passing through congested places and/or places which may be congested in accordance with predetermined traffic information, the one of via-sequences being any one of all possible routes via those locations;

a judgment unit adapted to judge whether the calculated arrival time of each location matches conditions for an arrival time at each location; and

a selection unit adapted to select the via-sequence being an optimum route via the locations where the judgment unit has judged that the conditions are matched at all the specified locations, as a via-sequence of the guide route.

2. The guide route search device according to claim 1, wherein the calculation unit comprises:

a determination part for determining a via-sequence of the specified plurality of via-locations;

a search part for searching a route between two consecutive locations in the via-sequence;

a re-search part for re-searching a route between the two locations when the searched route includes a congested place and/or a place which may be congested, so as to avoid the congested place and/or the place which may be congested; and

a time calculation part for calculating an arrival time at each of the locations, either based on a travel time between the two locations of a route searched by the search part when the route searched by the search part does not include a congested place and/or a place which may be congested, or based on a travel time between the two locations of a route re-searched by the re-search part when the route searched by the search part includes a congested place and/or a place which may be congested.

3. A guide route search device, the device comprising:

a specification unit adapted to specify a plurality of locations;

a determination unit adapted to determine a via-sequence of the specified plurality of via-locations;

a search unit adapted to search a route between two successive locations in the via-sequence;

a first time calculation unit adapted to calculate an arrival time at each of the locations based on a travel time between the two locations in the route searched by the search unit;

a first judgment unit adapted to judge whether the arrival time of each location calculated by the first time calculation unit matches an arrival time condition at each location;

a re-search unit adapted to re-search a route between the two locations when the route which has been judged by the first judgment unit to match the arrival time condition includes a congested place and/or a place which may be congested, so as to avoid the congested place and/or the place which may be congested;

a second time calculation unit adapted to calculate an arrival time at each of the locations based on a travel time between the two locations in the route re-searched by the re-search unit;

a second judgment unit adapted to judge whether the arrival time at each location calculated by the second time calculation unit matches the arrival time condition at each location; and

a selection unit adapted to select as the via-sequence of a guide route a single via-sequence from the via-sequences where the first judgment unit has judged that the conditions are matched at all the locations specified and which do not include congested places and/or places which may be congested, and from via-sequences where the second judgment unit has judged that the conditions are matched at all the locations specified.

4. The guide route search device according to claim 3, wherein

the second time calculation unit operates so as to generate arrival times for all the selected locations whenever a travel time between the two locations is computed, and

the judgment unit operates so as to judge whether the arrival time of each location generated by the time calculation unit matches the arrival time condition at each location whenever a travel time between the two locations is computed.

5. The guide route search device according to claim 3, wherein

the first judgment unit operates so as to judge whether the arrival time at each location calculated by the first time calculation unit matches a guide time slot at each location;

the second judgment unit operates so as to judge whether the arrival time at each location calculated by the second time calculation unit matches a guide time slot at each location; and

the re-search unit operates so as to re-search a route between the two locations in which the arrival times at a portion of or all of the locations are judged by the first judgment unit to be earlier than the respective guide time slots thereof, and when the route includes congested places and/or places which may be congested for via-sequences where the arrival times of the remaining locations match the respective guide time slots thereof, re-searches a route between the two locations so as to avoid the congested places and/or the places which may be congested.

6. A guide route search method, the method comprising the steps of:

specifying a plurality of locations which a user drops in before reaching a destination;

calculating the arrival time at each of the specified locations when successively visiting those locations in one via-sequences while avoiding passing through congested places and/or places which may be congested in accordance with predetermined traffic information, the one of via-sequences being any one of all possible routes via those locations;

judging whether the calculated arrival time of each location matches conditions for an arrival time at each location; and

selecting the via-sequence being an optimum route via the locations wherein it has been judged by the judging step that the conditions are matched at all the specified location, as a via-sequence of the guide route.

7. A computer program for causing a computer to execute the steps of:

specifying a plurality of locations which a user drops in before reaching a destination;

calculating an arrival time at each of the specified locations when successively visiting those locations in one of via-sequences while avoiding passing through congested places and/or places which may be congested in accordance with predetermined traffic information, the one of via-sequences being any one of all possible routes via those locations;

judging whether the calculated arrival time of each location matches conditions for an arrival time at each location; and

selecting a via-sequence being an optimum route via the locations wherein it has been judge by the judging step that the conditions are matched at all the specified locations, as a via-sequence of the guide route.