Route guidance using text

• US 10,066,957 B2
• Filed: 06/23/2015
• Issued: 09/04/2018
• Est. Priority Date: 05/24/2014
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Teraguchi, Masayoshi
• Primary Examiner(s): Black, Thomas G
• Assistant Examiner(s): Li, Ce Li
• Application Number:
  US14/746,884
• Publication Number:
  US 20150338231A1
• Time in Patent Office: 1,169 Days
• CPC Class Codes: G01C 21/3407 specially adapted for specific applications
• CPC Class Codes: G01C 21/3453 Special cost functions, i.e. other than distance or default speed limit of road segments
• CPC Class Codes: G01C 21/3611 using character input or menus, e.g. menus of POIs character input methods in general G06F3/0233
• CPC Class Codes: G01C 21/362 received from an external device or application, e.g. PDA, mobile phone or calendar application
• CPC Class Codes: G01C 21/3626 Details of the output of route guidance instructions traffic control systems for road vehicles involving transmission of navigation instructions to the vehicle G08G1/0968

Abstract

A computer implemented method for performing route guidance using text includes obtaining an optimal route that connects a start point and an end point of a route input by a user; comparing a route history stored in a memory with the optimal route and extracting a route portion from the optimal route, the route portion being replaceable by a route portion in the route history; creating route guidance for the route portion extracted from the optimal route by using a text indication known to the user, the known text indication specifying the replaceable route portion in the route history; and creating route guidance for a route portion in the optimal route, the route portion being not replaceable by a route portion in the route history, by using a new text indication that specifies the route portion that is not replaceable.

Claims

1. A computer implemented method for performing route guidance using text, the method comprising:

obtaining an optimal route that connects a start point and an end point of a route input by a user;

creating a route guidance for the optimal route comprising one or more new text indications that specify directions along the optimal route;

identifying one or more preferred routes along the optimal route from a route history stored in a memory, wherein the one or more preferred routes are routes indicated by the user as being a favorite route, and

wherein the one or more preferred routes includes a user-created label for at least one of the one or more preferred routes;

creating a preferred route guidance for the one or more preferred routes comprising one or more known text indications that specify directions along the one or more preferred routes, wherein the preferred route guidance includes one or more text indications for alternate routes that connects the start point and the end point of the route input by the user;

comparing the route guidance for the optimal route with the preferred route guidance for the one or more preferred routes;

creating a consolidated route guidance by replacing a subset of the one or more new text indications with the one or more known text indications based upon the comparison of the route guidance for the optimal route with the preferred route guidance for the one or more preferred routes, wherein the one or more known text indications utilize fewer characters of text than the one or more new text indications, and

wherein the creating the consolidated route guidance includes the user-created label for at least one of the one or more preferred routes;

transmitting the consolidated route guidance to a terminal operable by the user, wherein the terminal includes a display screen operable to display the consolidated route guidance.

2. The method of claim 1, wherein the optimal route and the route history are each obtained as a graph that includes a plurality of nodes and edges between two adjacent nodes, and a route portion in the route history and a route portion in the optimal route each include the nodes and the edges that form part of the graph.

3. The method of claim 2, wherein the one or more known text indications and the one or more new text indications are created for each of at least one edge that forms part of the graph.

4. The method of claim 2, wherein the one or more known text indications and the one or more new text indications are created as one text indication that corresponds to a plurality of successive edges that form part of the graph.

5. The method of claim 1, wherein the replacing the subset of the one or more new text indications includes replacing with the one or more known text indications in descending order of the number of past replacements.

6. The method of claim 1, wherein the replacing the subset of the one or more new text indications includes replacing the subset of the one or more new text indications, the subset of the one or more new text indications overlapping the one or more known text indications in the route history.

7. The method of claim 1, wherein creating the consolidated route guidance includes creating known route guidance so as to enable the user to uniquely recognize the one or more known routes specified by the one or more known text indication.

8. The method of claim 1, wherein the consolidated route guidance is a route guidance for car navigation, and the start point and the end point are a place of departure and a destination of a travel route respectively.