IP Library Granted Patent US 11,549,818
Granted Patent B2
US 11,549,818 · App. 16/859,773 · Granted Jan 10, 2023

Casual driver ride sharing

Inventors: David Dryjanski (San Francisco, CA); Lev Popov (San Francisco, CA); Timothy Brown (San Francisco, CA); Logan Green (San Francisco, CA); Austin Broyles (San Francisco, CA)
Assignee: Lyft, Inc.
G01C21/3438G01C21/343G01S19/42G07B15/02G08G1/202H04W4/14
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 11,549,818
App. No.
16/859,773
Granted
Jan 10, 2023
Kind
B2
Abstract

A system for casual driver ride sharing includes an interface and processor. The interface is to receive a request for a ride from a user, wherein the request includes GPS information for the user. The processor is to determine compatibility between the typical route information and the request for the ride; determine a ranked list based at least in part on the compatibility; and provide a ride offer to a driver of the one or more casual drivers based at least in part on the ranked list.

Claims (63)

1. A method, comprising:

receiving, by a ride matching system, a transportation request comprising a pickup location and a destination location;

determining a route associated with a driver system based on stored location information generated by a location device of the driver system over time;

determining a compatibility between the transportation request and the determined route associated with the driver system, wherein determining the compatibility comprises:

determining an extra distance added to the determined route as a result of the transportation request;

comparing the extra distance added to the determined route as a result of the transportation request to an extra distance threshold;

determining an extra time added to the determined route as a result of the transportation request; and

comparing the extra time added to the determined route as a result of the transportation request to an extra time threshold;

ranking the driver system based at least in part on the compatibility between the transportation request and the determined route associated with the driver system; and

matching, by the ride matching system, the transportation request to the driver system based at least in part on the ranking to connect a rider of the transportation request to a driver of the driver system.

2. The method of claim 1 , wherein the ranking comprises ranking a plurality of driver systems comprising the driver system.

3. The method of claim 2 , wherein ranking the plurality of driver systems comprises prioritizing at least one newly-activated driver system.

4. The method of claim 2 , wherein ranking the plurality of driver systems comprises:

determining that at least one driver system is associated with an area or employer having a threshold number of drivers; and

prioritizing the at least one driver system based on the at least one driver system being associated with the area or employer having a threshold number of drivers.

5. The method of claim 2 , wherein ranking the plurality of driver systems comprises:

determining that at least one driver system is associated with a route having a threshold number of drivers; and

prioritizing the at least one driver system based on the at least one driver system being associated with the route having a threshold number of drivers.

6. The method of claim 1 , further comprising causing the driver system to display a user interface comprising information associated with the extra distance and the extra time.

7. The method of claim 6 , wherein the user interface further comprises a map indicating the determined route and an additional route between the pickup location and the destination location.

8. A non-transitory computer readable storage medium comprising instructions that, when executed by at least one processor, cause a computing device to:

receive a transportation request comprising a pickup location and a destination location;

determine a route associated with a driver system based on stored location information generated by a location device of the driver system over time;

determine a compatibility between the transportation request and the determined route associated with a driver system, wherein determining the compatibility comprises:

determining an extra distance added to the determined route as a result of the transportation request;

comparing the extra distance added to the determined route as a result of the transportation request to an extra distance threshold;

determining an extra time added to the determined route as a result of the transportation request; and

comparing the extra time added to the determined route as a result of the transportation request to an extra time threshold;

rank the driver system based at least in part on the compatibility between the transportation request and the determined route associated with the driver system; and

match the transportation request to the driver system based at least in part on the ranking to connect a rider of the transportation request to a driver of the driver system.

9. The non-transitory computer readable storage medium of claim 8 , wherein the ranking comprises ranking a plurality of driver systems comprising the driver system.

10. The non-transitory computer readable storage medium of claim 9 , wherein ranking the plurality of driver systems comprises prioritizing at least one newly- activated driver system.

11. The non-transitory computer readable storage medium of claim 9 , wherein ranking the plurality of driver systems comprises:

determining that at least one driver system is associated with an area or employer having a threshold number of drivers; and

prioritizing the at least one driver system based on the at least one driver system being associated with the area or employer having a threshold number of drivers.

12. The non-transitory computer readable storage medium of claim 9 , wherein ranking the plurality of driver systems comprises:

determining that at least one driver system is associated with a route having a threshold number of drivers; and

prioritizing the at least one driver system based on the at least one driver system being associated with the route having a threshold number of drivers.

13. The non-transitory computer readable storage medium of claim 8 , further comprising causing the driver system to display a user interface comprising information associated with the extra distance and the extra time.

14. The non-transitory computer readable storage medium of claim 13 , wherein the user interface further comprises a map indicating the determined route and an additional route between the pickup location and the destination location.

15. A system comprising:

one or more memory devices; and

one or more computing devices configured to:

receive a transportation request comprising a pickup location and a destination location;

determine a route associated with a driver system based on stored location information generated by a location device of the driver system over time;

determine a compatibility between the transportation request and the determined route associated with a driver system, wherein determining the compatibility comprises:

determining an extra distance added to the determined route as a result of the transportation request;

comparing the extra distance added to the determined route as a result of the transportation request to an extra distance threshold;

determining an extra time added to the determined route as a result of the transportation request; and

comparing the extra time added to the determined route as a result of the transportation request to an extra time threshold;

rank the driver system based at least in part on the compatibility between the transportation request and the determined route associated with the driver system; and

match the transportation request to the driver system based at least in part on the ranking to connect a rider of the transportation request to a driver of the driver system.

16. The system of claim 15 , wherein the ranking comprises ranking a plurality of driver systems comprising the driver system.

17. The system of claim 16 , wherein the one or more computing devices are further configured to rank the plurality of driver systems by prioritizing at least one newly-activated driver system.

18. The system of claim 16 , wherein the one or more computing devices are further configured to rank the plurality of driver systems by:

determining that at least one driver system is associated with an area or employer having a threshold number of drivers; and

prioritizing the at least one driver system based on the at least one driver system being associated with the area or employer having a threshold number of drivers.

19. The system of claim 16 , wherein the one or more computing devices are further configured to rank the plurality of driver systems by:

determining that at least one driver system is associated with a route having a threshold number of drivers; and

prioritizing the at least one driver system based on the at least one driver system being associated with the route having a threshold number of drivers.

20. The system of claim 15 , wherein the one or more computing devices are further configured to cause the driver system to display a user interface comprising:

information associated with the extra distance and the extra time; and

a map indicating the determined route and an additional route between the pickup location and the destination location.

Assignments (2)
SECURITY INTEREST Recorded Nov 3, 2022
From: LYFT, INC.
To: JPMORGAN CHASE BANK, N.A., AS ADMINISTRATIVE AGENT
Reel/Frame 061880/0237 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 8, 2020
From: DRYJANSKI, DAVID; POPOV, LEV; BROWN, TIMOTHY; GREEN, LOGAN; BROYLES, AUSTIN
To: LYFT, INC.
Reel/Frame 053716/0626 →
Continuity (4)
Continuation 15956459 · Apr 18, 2018
Continuation 15143406 · Apr 29, 2016
Provisional Application 62314894 · Mar 29, 2016
Related Publication 20200393257A1 · Dec 17, 2020
Cited By (1)
US 12,449,267