Method and system for shared transport

• US 9,939,279 B2
• Filed: 11/16/2015
• Issued: 04/10/2018
• Est. Priority Date: 11/16/2015
• Status: Active Grant

• Current Assignee: Uber Technologies, Inc.
• Original Assignee: Uber Technologies, Inc.
• Inventors: Pan, Bin, Godil, Hasrat, Tolkin, Brian
• Primary Examiner(s): EL CHANTI, HUSSEIN A
• Application Number:
  US14/942,361
• Publication Number:
  US 20170138749A1
• Time in Patent Office: 876 Days
• CPC Class Codes: G01C 21/3438 Rendez-vous, i.e. searching a destination where several users can meet, and the routes to this destination for these users; Ride sharing, i.e. searching a route such that at least two users can share a vehicle for at least part of the route

Abstract

A transport arrangement system operates to provide a service, which can receive a transport pool request from a rider. The transport pool request can specify a set of parameters, including a pickup location and a drop-off location. A candidate set of transport providers are identified that satisfy one or more criterion, including a criterion of proximity relative to the pickup location. One of the candidate set of drivers is selected to provide a transport pool for the rider. The selection can be based at least in part on determining which individual drivers of the candidate set satisfy one or more constraints, including a first constraint that relate to a predicted trip completion time for the rider.

Claims

1. A non-transitory computer-readable medium that stores instructions, that when executed by one or more processors of a network computer system, cause the network computer system to use computing resources to perform operations that include:

receiving, over a given time interval, a plurality of transport-related requests from a plurality of corresponding computing devices of requesters, each transport-related request specifying a set of parameters, including a pickup location and a drop-off location, and each transport-related request being for on-demand transport;

selecting a service provider to provide a transport pool for a set of transport-related requests from the plurality of transport-related requests to reduce usage of resources, including computing resources of the network computer system, based on a determination that a duration of the transport pool is acceptable to the corresponding requester;

wherein selecting the service provider includes performing operations that comprise;

determining a number of service providers that satisfy criteria for providing a transport pool for each transport-related request of the set of transport-related requests over the given time interval, the criteria specifying;

(i) a distance proximity for each service provider of the number of service providers relative to the pickup locations of the set of transport-related requests, based on current location information provided by geo-aware components of a computing device of each service provider, and

(ii) an availability of each service provider during at least a portion of the given time interval;

determining, based at least in part on the number of service providers, a range of trip completion times for the set of transport-related requests to be fulfilled by transport pool;

determining an alternative trip completion time for a singular transport without transport pooling, based on the set of parameters;

determining a first constraint that sets a limit for the range of trip completion times based on the alternative trip completion time; and

determining that the selected service provider from the number of service providers satisfies the first constraint.

2. The non-transitory computer-readable medium of claim 1, wherein determining the first constraint includes adding a predetermined extension to the alternative trip completion time.

3. The non-transitory computer-readable medium of claim 1, wherein the range of trip completion times is based on an assumption that at least a portion of a trip provided by the selected service provider is shared with another requester.

4. The non-transitory computer-readable medium of claim 1, wherein at least one of the range of trip completion times or the alternative trip completion time is based at least in part on historical information.

5. The non-transitory computer-readable medium of claim 1, wherein the range of trip completion times is based on a likelihood that at least a portion of a trip provided by the selected service provider is shared with another requester.

6. The non-transitory computer-readable medium of claim 1, further comprising instructions, which when executed by the one or more processors, cause the one or more processors to perform operations comprising:

for each transport-related request, using the range of trip completion times to display, before when the corresponding requester starts to receive the transport pool from the selected service provider, a value that is based on a latest estimated time or duration for the corresponding requester to arrive at the drop-off location using the transport-related request.

7. The non-transitory computer-readable medium of claim 6, wherein the value is displayed on an interface before the corresponding requester triggers the transport-related request for the transport pool.

8. The non-transitory computer-readable medium of claim 6, wherein the value is displayed on an interface after the corresponding requester triggers the transport-related request for the transport pool.

9. The non-transitory computer-readable medium of claim 1, wherein selecting the service provider further includes:

determining a set of service providers that are fulfilling an existing transport-related request and that also satisfy the first constraint and a second constraint, the second constraint relating to an extension of time that would be added to the existing transport-related request to deviate the selected service provider from a planned route of the existing transport-related request to the pickup location of a second transport-related request of a second requester.

10. The non-transitory computer-readable medium of claim 1, wherein selecting the service provider further includes:

determining a second constraint that is based on a maximum number of requesters permitted in a vehicle of a service provider.

11. The non-transitory computer-readable medium of claim 1, wherein determining that the selected service provider satisfies the first constraint includes determining a range of completion times for the selected service provider.

12. The non-transitory computer-readable medium of claim 11, wherein the range of trip completion times includes an earliest arrival time and a latest arrival time, each of the earliest arrival time and latest arrival time being based on a different prediction as to a portion of a trip provided by the selected service provider being shared with another requester.

13. The non-transitory computer-readable medium of claim 1, further comprising instructions, that when executed by the one or more processors, cause the one or more processors to perform operations that include:

providing a time value for receiving the transport pool to a computing device of the corresponding requester, based on at least on the first constraint or a determined range of trip completion times for the selected service provider.

14. The non-transitory computer-readable medium of claim 13, wherein the time value is provided at any time after selection of the service provider for each transport-related request of the set of transport-related requests.

15. A computer system comprising:

computing resources, including (i) memory resources to store a set of instructions;

(ii) network resources to communicate with computing devices of a plurality of users, including computing devices of service providers and requesters; and

(iii) processing resource that use the set of instructions and the network resources to;

receive, over a given time interval, a plurality of transport-related requests from a plurality of corresponding computing devices of requesters, each transport-related request specifying a set of parameters, including a pickup location and a drop-off location, and each transport-related request being for on-demand transport;

select a service provider to provide a transport pool for a set of transport-related requests from the plurality of the transport-related requests to reduce usage of resources, including computing resources of a network computer system, based on a determination that a duration of the transport pool is acceptable to the corresponding requester;

wherein the processing resources select the service provider by;

determining a number of service providers that satisfy criteria for providing a transport pool for each transport-related request of the set of transport-related requests over the given time interval, the criteria specifying;

(i) a distance proximity for each service provider of the number of service providers relative to the pickup locations of the set of transport-related requests, based on current location information provided by geo-aware components of a computing device of each service provider, and

(ii) an availability of each service provider during at least a portion of the given time interval;

determining, based at least in part on the number of service providers, a range of trip completion times for the set of transport-related request to be fulfilled by transport pool;

determining an alternative trip completion time for a singular transport without transport pooling, based on the set of parameters;

determining a first constraint that sets a limit for the range of trip completion times based on the alternative trip completion time; and

determining that the selected service provider from the number of service providers, satisfies the first constraint.

16. The computing system of claim 15, wherein the computing resources are distributed on the computing devices of the plurality of users.

17. The computing system of claim 16, wherein the computing resources include one or more servers.

18. The computing system of claim 16, wherein determining that the selected service provider satisfies the first constraint includes determining a range of trip completion times for the selected service provider.

19. The computing system of claim 18, wherein the range of trip completion times includes an earliest arrival time and a latest arrival time, each of the earliest arrival time and latest arrival time being based on a different prediction as to a portion of a trip provided by the selected service provider being shared with another requester.

20. The computing system of claim 16, wherein the processing resources perform operations that include:

providing a time value for receiving the transport pool to the computing device of the corresponding requester, based on at least on the first constraint or the determined range of trip completion times for the selected service provider.