# US 2008/0082256 A1 · Providing Routing Information Based on Ambiguous Locations

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2008/0082256 A1
- Document ID: US20080082256A1
- Status: Published application
- Kind: A1
- Application number: 11/465,771
- Filed: 2006-08-18
- Published: 2008-04-03
- Earliest claimed: 2006-08-18
- Assignees: Google Inc.
- Inventors: Hiroyuki Komatsu
- Web page: https://patentgrep.com/patent/US20080082256A1

## CPC

- G01C 21/34: Route searching; Route guidance
- H04L 67/52: specially adapted for the location of the user terminal
- H04W 4/02: Services making use of location information
- H04W 4/024: Guidance services
- G01C: MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY (measuring liquid level G01F; radio navigation, determining distance or velocity by use of propagation effects, e.g. Doppler effects, propagation time, of radio waves, analogous arrangements using other waves G01S)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)

## 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

### Claim 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.

### Claim 2 (depends on 1)

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.

### Claim 3 (depends on 2)

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

### Claim 4 (depends on 1)

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

### Claim 5 (depends on 1)

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

### Claim 6 (depends on 1)

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.

### Claim 7 (depends on 1)

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.

### Claim 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.

### Claim 9 (depends on 8)

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.

### Claim 10 (depends on 9)

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

### Claim 11 (depends on 8)

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

### Claim 12 (depends on 8)

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

### Claim 13 (depends on 8)

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.

### Claim 14 (depends on 8)

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.

### Claim 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.

### Claim 16 (depends on 15)

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.

### Claim 17 (depends on 16)

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

### Claim 18 (depends on 15)

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

### Claim 19 (depends on 15)

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

### Claim 20 (depends on 15)

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.

### Claim 21 (depends on 15)

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.

### Claim 22 (depends on 1)

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

### Claim 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.
