IP Library Granted Patent US 11,790,289
Granted Patent B2
US 11,790,289 · App. 17/580,994 · Granted Oct 17, 2023

Systems and methods for managing dynamic transportation networks using simulated future scenarios

Inventor: Chinmoy Dutta (Mountain View, CA)
Assignee: Lyft, Inc.
G06Q10/047G01C21/3438G06Q10/067
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,790,289
App. No.
17/580,994
Granted
Oct 17, 2023
Kind
B2
Abstract

The disclosed computer-implemented method may include (i) receiving a first transport request and a second transport request, (ii) evaluating a fitness of matching the first and second transport requests to be fulfilled by a transport provider, based at least partly on a transportation overlap between the first and second transport requests, (iii) generating a simulated future transport request, (iv) evaluating a fitness of matching the first transport request with the simulated future transport request, based at least in part on a transportation overlap between the first transport request and the simulated future transport request, and (v) matching the first and second transport requests based at least in part on the fitness of matching the first and second transport requests and based at least in part on the fitness of matching the first transport request with the simulated future transport request. Various other methods, systems, and computer-readable media are disclosed.

Claims (39)

1. A computer-implemented method comprising:

generating, by a dynamic transportation matching system, a simulated future transport request;

applying at least a portion of simulated transportation provider state information to the simulated future transport request as part of a simulated future scenario;

evaluating, by the dynamic transportation matching system, a fitness of matching a first transport request with the simulated future transport request based on the simulated future scenario;

determining, by the dynamic transportation matching system, that the fitness of matching the first transport request with a second transport request exceeds the fitness of matching the first transport request with the simulated future transport request; and

matching, by the dynamic transportation matching system, the first transport request with the second transport request.

2. The computer-implemented method of claim 1 , wherein the simulated future transport request is generated using the simulated transportation provider state information as part of a simulated future scenario.

3. The computer-implemented method of claim 2 , wherein the simulated future scenario is based on projected future information about a transportation environment that is relevant to dynamic transportation matching decisions.

4. The computer-implemented method of claim 2 , wherein the simulated future scenario includes projected future information about a transportation environment including one or more environmental conditions.

5. The computer-implemented method of claim 2 , wherein the simulated future scenario includes projected future information about a transportation environment including one or more parameters for pricing transportation within the dynamic transportation matching system.

6. The computer-implemented method of claim 2 , wherein the simulated future scenario includes projected future information about a transportation environment including an indication of whether a premium pricing model is in effect.

7. The computer-implemented method of claim 2 , further comprising:

generating, by the dynamic transportation matching system, a plurality of simulated future scenarios using the simulated transportation provider state information; and

assigning, by the dynamic transportation matching system, one or more weights to each of the plurality of simulated future scenarios.

8. The computer-implemented method of claim 1 , wherein the simulated transportation provider state information includes a simulated origin location of a requester device associated with the first transport request or with the second transport request.

9. The computer-implemented method of claim 1 , wherein the simulated transportation provider state information includes a simulated direction of travel of a transportation provider device associated with a transportation provider.

10. The computer-implemented method of claim 1 , wherein the simulated transportation provider state information includes a simulated current destination associated with the simulated future transport request.

11. The computer-implemented method of claim 1 , wherein the simulated transportation provider state information includes a simulated estimated time of arrival of a transportation provider device associated with a transportation provider.

12. The computer-implemented method of claim 1 , wherein the simulated transportation provider state information includes one or more simulated transportation constraints applicable to a transportation provider device associated with a transportation provider.

13. A system comprising one or more physical processors and one or more memories coupled to one or more of the physical processors, the one or more memories comprising instructions operable when executed by the one or more physical processors to cause the system to perform operations comprising:

generating, a simulated future transport request;

applying at least a portion of simulated transportation provider state information to the simulated future transport request as part of a simulated future scenario;

evaluating a fitness of matching a first transport request with the simulated future transport request based on the simulated future scenario;

determining that the fitness of matching the first transport request with a second transport request exceeds the fitness of matching the first transport request with the simulated future transport request; and

matching the first transport request with the second transport request.

14. The system of claim 13 , wherein the simulated future transport request is generated using the simulated transportation provider state information as part of a simulated future scenario.

15. The system of claim 14 , wherein the simulated future scenario includes projected future information about a transportation environment including one or more environmental conditions.

16. The system of claim 14 , wherein the simulated future scenario includes projected future information about a transportation environment including one or more parameters for pricing transportation within a dynamic transportation matching system.

17. The system of claim 14 , wherein the simulated future scenario includes projected future information about a transportation environment including an indication of whether a premium pricing model is in effect.

18. The system of claim 14 , further comprising:

generating a plurality of simulated future scenarios using the simulated transportation provider state information; and

assigning one or more weights to each of the plurality of simulated future scenarios.

19. The system of claim 13 , wherein the simulated transportation provider state information includes a simulated origin location of a requester device associated with the first transport request or with the second transport request.

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

generate, by a dynamic transportation matching system, a simulated future transport request;

apply at least a portion of simulated transportation provider state information to the simulated future transport request as part of a simulated future scenario;

evaluate, by the dynamic transportation matching system, a fitness of matching a first transport request with the simulated future transport request based on the simulated future scenario;

determine, by the dynamic transportation matching system, that the fitness of matching the first transport request with a second transport request exceeds the fitness of matching the first transport request with the simulated future transport request; and

match, by the dynamic transportation matching system, the first transport request with the second transport request.

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 Jul 1, 2022
From: DUTTA, CHINMOY
To: LYFT, INC.
Reel/Frame 060419/0387 →