# US 2021/0262823 A1 · Spotfinder

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

- Number: US 2021/0262823 A1
- Document ID: US20210262823A1
- Status: Published application
- Kind: A1
- Application number: 17/286,933
- Filed: 2019-05-08
- Published: 2021-08-26
- Earliest claimed: 2019-05-08
- Assignees: Google Inc.
- Applicants: Google LLC
- Inventors: Omar Abdelaziz
- Web page: https://patentgrep.com/patent/US20210262823A1

## CPC

- G01C 21/3685: {the POI's being parking facilities}
- G01C 21/3492: {employing speed data or traffic data, e.g. real-time or historical (traffic control systems for road vehicles involving transmission of navigation instructions to the vehicle G08G1/0968)}
- G08G 1/144: {on portable or mobile units, e.g. personal digital assistant [PDA]}
- G08G 1/146: {where the parking area is a limited parking space, e.g. parking garage, restricted space}
- 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)
- G08G: TRAFFIC CONTROL SYSTEMS (guiding railway traffic, ensuring the safety of railway traffic B61L; arrangement of road signs or traffic signals E01F9/00; radar or analogous systems, sonar systems, lidar systems specially adapted for traffic control G01S13/91, G01S15/88, G01S17/88; {radar or analogous systems, sonar systems, lidar systems specially adapted for anti-collision purposes G01S13/93, G01S15/93, G01S17/93})

## Abstract

A system (100) and method for finding a likely available parking spot within a geographical area are disclosed. The system (100) may be configured to receive a request for directions for a first vehicle (702) to an open parking spot within a particular geographical area (210, 214), receive sensor information indicating potential open parking spots (346, 348), identify likely available parking spots (346, 348), and receive information regarding other vehicles searching for parking in the same geographical area. The system may use the identified likely available spots and the information regarding other vehicles searching for parking when computing a route (218, 220) to a likely available parking spot.

## Claims

### Claim 1

A system, comprising:
a memory;
one or more processors coupled to the memory, the one or more processors being configured to:
receive a request for directions to an open parking spot for a first vehicle within a particular geographical area;
receive sensor information detected from one or more sensors, the sensor information indicating potential open parking spots;
identify, based on the received sensor information, one or more likely available parking spots;
receive information regarding other vehicles searching for parking within the particular geographical area;
compute, based on at least the identified likely available parking spots and the information regarding other vehicles, a route to one of the identified likely available parking spots; and
provide directions for the first vehicle to the one of the identified likely available parking spots.

### Claim 2 (depends on 1)

The system of claim 1, wherein the particular geographical area is defined by a radius from a destination specified by the first vehicle.

### Claim 3 (depends on 1)

The system of claim 1, wherein the one or more processors are further configured to receive information pertaining to at least one of (i) current traffic or (ii) turn costs.

### Claim 4 (depends on 3)

The system of claim 3, wherein the turn costs are defined by a time required to make a turn.

### Claim 5 (depends on 1)

The system of claim 1, wherein the one or more processors are further configured to receive information pertaining to at least one of (i) historical parking availability, (ii) whether a street has parking lane, or (iii) parking restrictions.

### Claim 6 (depends on 1)

The system of claim 1, wherein the route is a most efficient route based on at least one of (i) a distance to a destination, (ii) a computed time to the destination, or (iii) a time to find one of the identified likely available spots.

### Claim 7 (depends on 1)

The system of claim 1, wherein the one or more processors are further configured to compute, based on at least the identified likely available parking spots and the information regarding other vehicles, a second route to a second one of the identified likely available parking spots for a second vehicle within the particular geographical area, the second open parking spot for the second vehicle being different than the first open parking spot for the first vehicle.

### Claim 8 (depends on 1)

The system of claim 1, wherein the one or more processors are further configured to automatically update an availability of the identified one or more likely available parking spots based on behavior of the first vehicle or the other vehicles.

### Claim 9 (depends on 8)

The system of claim 8, wherein the behavior of the first vehicle or the other vehicles comprises driving past the one or more likely available parking spots without parking.

### Claim 10

A method, comprising:
receiving, by one or more processors, a request for directions to an open parking spot for a first vehicle within a particular geographical area;
receiving, by the one or more processors, sensor information detected from one or more sensors, the sensor information indicating potential open parking spots
identifying, by the one or more processors and based on the received sensor information, one or more likely available parking spots;
receiving, by the one or more processors, information regarding other vehicles searching for parking within the particular geographical area;
computing, by the one or more processors and based on at least the identified likely available parking spots and the information regarding other vehicles, a route to one of the identified likely available parking spots; and
providing, by the one or more processors, directions to the first vehicle to the one of the identified likely available parking spots.

### Claim 11 (depends on 10)

The method of claim 10, wherein the particular geographical area is defined by a radius from a destination specified by the first vehicle.

### Claim 12 (depends on 10)

The method of claim 10, further comprising receiving, by the one or more processors, information pertaining to at least one of (i) current traffic or (ii) turn costs.

### Claim 13 (depends on 10)

The method of claim 10, further comprising receiving, by the one or more processors, information pertaining to at least one of (i) historical parking availability, (ii) whether a street has parking lane, or (iii) parking restriction.

### Claim 14 (depends on 10)

The method of claim 10, wherein the route is a most efficient route based on at least one of (i) a distance to a destination, (ii) a computed time to the destination, or (iii) a time to find one of the identified likely available spots.

### Claim 15 (depends on 10)

The method of claim 10, further comprising computing, by the one or more processors, based on at least the identified likely available parking spots and the information regarding other vehicles, a second most efficient route to a second one of the identified likely available parking spots for a second vehicle within the particular geographical area, the second open parking spot for the second vehicle being different than the first open parking spot for the first vehicle.

### Claim 16 (depends on 10)

The method of claim 10, further comprising automatically updating, by the one or more processors, an availability of the identified one or more likely available parking spots based on behavior of the first vehicle or the other vehicles.

### Claim 17 (depends on 16)

The method of claim 16, wherein the behavior of the first vehicle or the other vehicles comprises driving past the one or more likely available parking spots without parking.

### Claim 18

A non-transitory computer readable storage medium storing instructions executable by a processor for performing a method comprising:
receiving, by one or more processors, a request for directions to an open parking spot for a first vehicle within a particular geographical area;
receiving, by the one or more processors, sensor information detected from one or more sensors, the sensor information indicating potential open parking spots;
identifying, by the one or more processors and based on the received sensor information, one or more likely available parking spots;
receiving, by the one or more processors, information regarding other vehicles searching for parking within the particular geographical area;
computing, by the one or more processors and based on at least the identified likely available parking spots and the information regarding other vehicles, a route to one of the identified likely available parking spots; and
providing, by the one or more processors, directions to the first vehicle to the one of the identified likely available parking spots.

### Claim 19 (depends on 18)

The non-transitory computer readable storage medium of claim 18, the method further comprising computing, by the one or more processors, based on at least the identified likely available parking spots and the information regarding other vehicles, a second most efficient route to a second one of the identified likely available parking spots for a second vehicle within the particular geographical area, the second open parking spot for the second vehicle being different than the first open parking spot for the first vehicle.

### Claim 20 (depends on 18)

The non-transitory computer readable storage medium of claim 18, the method further comprising updating automatically, by the one or more processors, an availability of the identified one or more likely available parking spots based on behavior of the first vehicle or the other vehicles.
