Providing Routing Information Based on Ambiguous Locations

• US 20080082256A1
• Filed: 08/18/2006
• Published: 04/03/2008
• Est. Priority Date: 08/18/2006
• Status: Active Grant

• Current Assignee: Google LLC (Alphabet Inc.)
• Original Assignee: Google Inc. (Alphabet Inc.)
• Inventors: Komatsu, Hiroyuki
• Granted Patent: US 7,571,048 B2
• Time in Patent Office: Days
• US Class Current: 701/202
• CPC Class Codes: G01C 21/34 Route searching; Route guidance
• CPC Class Codes: H04L 67/52 specially adapted for the location of the user terminal
• CPC Class Codes: H04W 4/02 Services making use of location information
• CPC Class Codes: H04W 4/024 Guidance services

Abstract

A routing server receives a request for routing information. The request specifies one or more locations. A specified location may be ambiguous. For an ambiguous location, the routing server identifies a set of potentially-matching locations and ranks the locations according to a metric. The routing server returns routing information for the highest-ranked location that potentially matches an ambiguous location. If a request for routing information specifies two locations, and at least one location is ambiguous, the routing server pairs combinations of potentially-matching locations based on the query and calculates a metric for each pair. In one case, the metric is the distance between the locations in the pair. The routing server ranks the pairs based on the metric, and returns routing information for the highest-ranked pair.

Claims

1. A computer-implemented method of providing routing information, comprising:

receiving a request for routing information, the request specifying at least one ambiguous location;

identifying locations potentially matching the ambiguous location;

ranking the potentially-matching locations based on a metric; and

providing routing information for the highest-ranked potentially-matching location.

2. The method of claim 1, wherein the metric is distance, and wherein the ranking comprises:

calculating a distance between each location potentially matching the ambiguous location and an other location; and

ranking the potentially-matching locations based on the distances from the potentially-matching locations to the other location.

3. The method of claim 2, wherein the highest-ranked potentially-matching location has the shortest distance to the other location.

4. The method of claim 1, wherein the metric is populations of the potentially-matching locations.

5. The method of claim 1, wherein the metric is frequencies that the potentially-matching locations appear in routing requests.

6. The method of claim 1, wherein the ranking comprises:

generating pairings of locations based on locations specified in the request, each pairing including at least one location potentially matching the ambiguous location;

calculating distances between the locations in the pairs; and

ranking the pairings based on the calculated distances.

7. The method of claim 1, wherein the routing information comprises one or more types of information from the set consisting of:

driving directions, train schedules, bus schedules, and flight schedules.

22. The method of claim 1, wherein the ambiguous location is a starting or ending location of a route for which routing information is requested.

8. A system for providing routing information, comprising:

a request receipt module for receiving a request for routing information, the request specifying at least one ambiguous location;

a location lookup module for identifying locations potentially matching the ambiguous location;

an ambiguous location ranking module for ranking the potentially-matching locations based on a metric; and

a reporting module for providing routing information for the highest-ranked potentially-matching location.

9. The system of claim 8, wherein the metric is distance, and wherein the ambiguous location ranking module is further adapted to:

calculate a distance between each location potentially matching the ambiguous location and an other location; and

rank the potentially-matching locations based on the distances from the potentially-matching locations to the other location.

10. The system of claim 9, wherein the highest-ranked potentially-matching location has the shortest distance to the other location.

11. The system of claim 8, wherein the metric is populations of the potentially-matching locations.

12. The system of claim 8, wherein the metric is frequencies that the potentially-matching locations appear in routing requests.

13. The system of claim 8, wherein the ambiguous location ranking module is further adapted to:

generate pairings of locations based on locations specified in the request, each pairing including at least one location potentially matching the ambiguous location;

calculate distances between the locations in the pairs; and

rank the pairings based on the calculated distance.

14. The system of claim 8, wherein the routing information comprises one or more types of information from the set consisting of:

driving directions, train schedules, bus schedules, and flight schedules.

15. A computer program product having a computer-readable medium having computer program code tangibly embodied therein for providing routing information, comprising:

a request receipt module for receiving a request for routing information, the request specifying at least one ambiguous location;

a location lookup module for identifying locations potentially matching the ambiguous location;

an ambiguous location ranking module for ranking the potentially-matching locations based on a metric; and

a reporting module for providing routing information for the highest-ranked potentially-matching location.

16. The computer program product of claim 15, wherein the metric is distance, and wherein the ambiguous location ranking module is further adapted to:

calculate a distance between each location potentially matching the ambiguous location and an other location; and

rank the potentially-matching locations based on the distances from the potentially- matching locations to the other location.

17. The computer program product of claim 16, wherein the highest-ranked potentially-matching location has the shortest distance to the other location.

18. The computer program product of claim 15, wherein the metric is populations of the potentially-matching locations.

19. The computer program product of claim 15, wherein the metric is frequencies that the potentially-matching locations appear in routing requests.

20. The computer program product of claim 15, wherein the ambiguous location ranking module is further adapted to:

generate pairings of locations based on locations specified in the request, each pairing including at least one location potentially matching the ambiguous location;

calculate distances between the locations in the pairs; and

rank the pairings based on the calculated distance.

21. The computer program product of claim 15, wherein the routing information comprises one or more types of information from the set consisting of:

driving directions, train schedules, bus schedules, and flight schedules.

23. A computer-implemented method of providing routing information, comprising:

receiving a request for routing information, the request specifying at least one ambiguous location;

identifying locations potentially matching the ambiguous location;

ranking the potentially-matching locations based on a metric;

selecting a potentially-matching location based on the ranking; and

providing routing information for the selected location.