SYSTEMS AND METHODS FOR PROVIDER CLAIMING AND MATCHING OF SCHEDULED REQUESTS

• US 20180300660A1
• Filed: 04/17/2018
• Published: 10/18/2018
• Est. Priority Date: 04/18/2017
• Status: Active Application

• Current Assignee: LYFT Incorporated
• Original Assignee: LYFT Incorporated
• Inventors: Coan, Kassandra, Afzal, Danial, Law, Brady Andrew, Person, Robert J., Trager, Drew
• Application Number:
  US15/955,603
• Publication Number:
  US 20180300660A1
• Time in Patent Office: Days
• CPC Class Codes: G01C 21/26 specially adapted for navigation in a road network
• CPC Class Codes: G06Q 10/02 Reservations, e.g. for tickets, services or events
• CPC Class Codes: G06Q 10/06311 Scheduling, planning or task assignment for a person or group
• CPC Class Codes: G08G 1/202 Dispatching vehicles on the basis of a location, e.g. taxi dispatching
• CPC Class Codes: H04W 4/029 Location-based management or tracking services

Abstract

Embodiments provide techniques, including systems and methods, for allowing providers to claim scheduled rides. For example, a provider (e.g., a driver) may review and claim scheduled rides through a scheduled rides interface before the scheduled ride is ready to be provided. The scheduled rides provided through the scheduled ride interface may be limited to those requests that are associated with areas and times that have a lower chance of successfully being matched at the request time. Accordingly, scheduled requests may be filtered from a real-time scheduled ride feed based on the chance of successfully matching a scheduled ride at the time of the request and may be targeted to candidate providers for review and claiming by the candidate providers.

Claims

1. A method comprising:

providing, by a dynamic transportation matching system, a scheduling interface for display by a provider computing device, the scheduling interface including one or more scheduling options;

receiving, from the provider computing device by way of the scheduling interface, a selection of at least one scheduling option, the at least one scheduling option indicating a future destination and a future time;

receiving, by the dynamic transportation matching system, a request associated with a request location and a destination location;

determining, in response to receiving the request, that completing the request from the request location to the destination location would allow a provider associated with the provider computing device to arrive at the future destination by the future time; and

sending, based on determining that completing the request would allow the provider to arrive at the future destination by the future time, the request to the provider computing device.

2. The method of claim 1, wherein the one or more scheduling options comprise one or more available scheduled rides.

3. The method of claim 1, wherein determining that completing the request would allow the provider to arrive at the future destination by the future time comprises:

determining an estimated arrival time for the provider to arrive at the future destination if the provider completes the request; and

comparing the estimated arrival time with the future time to determine that, based on the estimated arrival time, the provider will arrive at the future destination by the future time.

4. The method of claim 3, further comprising determining the estimated arrival time by determining an amount of time to travel from a current location of the provider computing device to a pickup location associated with the request.

5. The method of claim 3, further comprising determining the estimated arrival time further by determining, for a route from a current location of the provider to a pickup location associated with the request, one or more of traffic information, weather information, route distance information, road condition information, or road closure information.

6. The method of claim 1, wherein providing the scheduling interface to the provider computing device comprises:

determining a relevance score of each of a plurality of scheduling options for the provider;

ranking the plurality of scheduling options based on the determined relevance score for each of the plurality of scheduling options; and

selecting the one or more scheduling options for display within the scheduling interface based on the ranking of the plurality of scheduling options.

7. The method of claim 1, wherein providing the scheduling interface to the provider computing device comprises filtering overlapping scheduling options, the overlapping scheduling options conflicting in request time such that only one of the overlapping scheduling options could be completed by the provider.

8. The method of claim 1, wherein providing the scheduling interface to the provider computing device comprises:

determining a value of each of a plurality of scheduling options for the provider, the value being based on at least one of an estimated amount of payment or a travel distance;

ranking the plurality of scheduling options based on the determined value for each of the plurality of scheduling options; and

selecting the one or more scheduling options for display within the scheduling interface based on the ranking of the plurality of scheduling options.

9. The method of claim 1, further comprising:

receiving a second request;

determining, in response to receiving the second request, that completing the second request would prevent the provider from arriving at the future destination by the future time; and

in response to determining that completing the second request would prevent the provider from arriving at the future destination by the future time, refraining from sending the second request to the provider computing device.

10. The method of claim 9, wherein determining that completing the second request would prevent the provider from arriving at the future destination by the future time comprises:

determining an estimated arrival time for the provider to arrive at the future destination if the provider completes the second request; and

comparing the estimated arrival time with the future time to determine that, based on the estimated arrival time, the provider will not arrive at the future destination by the future time.

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

provide, by a dynamic transportation matching system, a scheduling interface for display by a provider computing device, the scheduling interface including one or more scheduling options;

receive, from the provider computing device by way of the scheduling interface, a selection of at least one scheduling option, the at least one scheduling option indicating a future destination and a future time;

receive, by the dynamic transportation matching system, a request associated with a request location and a destination location;

determine, in response to receiving the request, that completing the request from the request location to the destination location would allow a provider associated with the provider computing device to arrive at the future destination by the future time; and

send, based on determining that completing the request would allow the provider to arrive at the future destination by the future time, the request to the provider computing device.

12. The non-transitory computer readable medium of claim 11, wherein the one or more scheduling options comprise one or more available scheduled rides.

13. The non-transitory computer readable medium of claim 11, wherein the instructions cause the computer device to determine that completing the request would allow the provider to arrive at the future destination by the future time by:

determining an estimated arrival time for the provider to arrive at the future destination if the provider completes the request; and

comparing the estimated arrival time with the future time to determine that, based on the estimated arrival time, the provider will arrive at the future destination by the future time.

14. The non-transitory computer readable medium of claim 13, further comprising instructions that, when executed by the at least one processor, cause the computer device to determine the estimated arrival time by determining a distance from a location of the provider to the pickup location associated with the request.

15. The non-transitory computer readable medium of claim 13, wherein the instructions cause the computer device to provide the scheduling interface to the provider computing device by:

determine a relevance score of each of a plurality of scheduling options for the provider;

rank the plurality of scheduling options based on the determined relevance score for each of the plurality of scheduling options; and

select the one or more scheduling options for display within the scheduling interface based on the ranking of the plurality of scheduling options.

16. The non-transitory computer readable medium of claim 11, further comprising instructions that, when executed by the at least one processor, cause the computer device to:

receive a second request;

determine, in response to receiving the second request, that completing the second request would prevent the provider from arriving at the future destination by the future time; and

in response to determining that completing the second request would prevent the provider from arriving at the future destination by the future time, refrain from sending the second request to the provider.

17. The non-transitory computer readable medium of claim 16, wherein the instructions cause the computer device to determine that completing the second request would prevent the provider from arriving at the future destination by the future time by:

determining an estimated arrival time for the provider to arrive at with the future destination if the provider completes the second request; and

comparing the estimated arrival time with the future time to determine that, based on the estimated arrival time, the provider will not arrive at the future destination by the future time.

18. A system comprising:

at least one processor; and

a non-transitory computer readable medium comprising instructions that, when executed by at the least one processor, cause the system to;

provide, by a dynamic transportation matching system, a scheduling interface for display by a provider computing device, the scheduling interface including one or more scheduling options;

receive, from the provider computing device by way of the scheduling interface, a selection of at least one scheduling option, the at least one scheduling option indicating a future destination and a future time;

receive, by the dynamic transportation matching system, a request associated with a request location and a destination location;

determine, in response to receiving the request, that completing the request from the request location to the destination location would allow a provider associated with the provider computing device to arrive at the future destination by the future time; and

send, based on determining that completing the request would allow the provider to arrive at the future destination by the future time, the request to the provider computing device.

19. The system of claim 18, wherein the one or more scheduling options comprise one or more available scheduled rides.

20. The system of claim 18, wherein the instructions cause the system to determine that completing the request would allow the provider to arrive at the future destination by the future time by:

determining an estimated arrival time for the provider to arrive at with the future destination if the provider completes the request; and

comparing the estimated arrival time with the future time to determine that, based on the estimated arrival time, the provider will arrive at the future destination by the future time.