INTELLIGENT DISPATCH SYSTEM FOR SELECTING SERVICE PROVIDERS

• US 20150161554A1
• Filed: 12/10/2014
• Published: 06/11/2015
• Est. Priority Date: 12/11/2013
• Status: Abandoned Application

• Current Assignee: Uber Technologies, Inc.
• Original Assignee: Uber Technologies, Inc.
• Inventors: Sweeney, Matthew, Barreto, Amos, Cui, Sophia, Korsos, Laszlo
• Application Number:
  US14/566,190
• Publication Number:
  US 20150161554A1
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06Q 10/063112 Skill-based matching of a person or a group to a task
• CPC Class Codes: G06Q 10/063114 Status monitoring or status determination for a person or group
• CPC Class Codes: G06Q 10/0834 Choice of carriers
• CPC Class Codes: G06Q 10/08355 Routing methods
• CPC Class Codes: G06Q 50/40 Business processes related to the transportation industry shipping G06Q10/083
• CPC Class Codes: Y04S 10/50 Systems or methods supporting the power network operation or management, involving a certain degree of interaction with the load-side end user applications

Abstract

A system and method for arranging a transport service is described. A server can receive a request for transport from a computing device of a first user. The request can include information about a pickup location of the first user. In response to receiving the request, the server can determine a plurality of drivers that are capable of providing transport for the first user by determining a first set of drivers that are each driving a vehicle that is unoccupied by other users, and determining a second set of drivers that are each providing transport service to one or more other users to a respective destination location that is within a threshold distance or threshold estimated travel time from the pickup location of the first user. The server can select a first driver from the plurality of drivers to provide the transport service for the first user.

Claims

1. A method for arranging a transport service, the method being performed by one or more processors of a server and comprising:

receiving, from a computing device of a first user, a request for transport, the request for transport including information about a pickup location of the first user;

in response to receiving the request for transport, determining a plurality of drivers that are capable of providing transport for the first user by (i) determining a first set of drivers that are each driving a vehicle that is unoccupied by other users, and (ii) determining a second set of drivers that are each providing transport service to one or more other users to a respective destination location that is within a threshold distance or threshold estimated travel time from the pickup location of the first user; and

from the plurality of drivers, selecting a first driver to provide the transport service for the first user.

2. The method of claim 1, wherein determining the first set of drivers includes determining that each driver in the first set of drivers has updated a respective status indicating that the driver is available to provide transport service.

3. The method of claim 1, wherein each of the second set of drivers transmits, to the server over one or more networks, information about the respective destination location using a corresponding computing device.

4. The method of claim 1, wherein determining the first set of drivers that are driving vehicles that are unoccupied by users includes identifying drivers that are driving vehicles that are unoccupied by users having a current location within a predefined distance of the pickup location of the first user.

5. The method of claim 4, wherein determining the second set of drivers includes (i) identifying drivers that are providing transport service to other users, the identified drivers having a current location within the predefined distance of the pickup location of the first user, (ii) for each identified driver, determining a first estimated travel time from that respective destination location to the pickup location of the first user, and (iii) for each identified driver, comparing the first estimated travel time with the threshold estimated travel time.

6. The method of claim 5, further comprising:

determining, for each driver in the first set of drivers, an estimated travel time from a current location of that driver to the pickup location of the first user; and

determining, for each driver in the second set of drivers, a total estimated travel time, the total estimated travel time corresponding to a sum of the first estimated travel time and a second estimated travel time from the current location of that driver to the respective destination location.

7. The method of claim 6, wherein selecting the first driver to provide the transport service for the first user includes selecting, from the plurality of drivers, a driver having the least total estimated travel time.

8. The method of claim 1, further comprising:

transmitting, to a computing device of the selected first driver, a message inviting the first driver to provide the transport service for the first user, the message enabling the first driver to accept or reject the transport service.

9. A non-transitory computer-readable medium storing instructions that, when executed by one or more processors of a server, cause the server to perform operations comprising:

receiving, from a computing device of a first user, a request for transport, the request for transport including information about a pickup location of the first user;

in response to receiving the request for transport, determining a plurality of drivers that are capable of providing transport for the first user by (i) determining a first set of drivers that are each driving a vehicle that is unoccupied by other users, and (ii) determining a second set of drivers that are each providing transport service to one or more other users to a respective destination location that is within a threshold distance or threshold estimated travel time from the pickup location of the first user; and

from the plurality of drivers, selecting a first driver to provide the transport service for the first user.

10. The non-transitory computer-readable medium of claim 9, wherein the instructions cause the server to determine the first set of drivers that are driving vehicles that are unoccupied by users by determining that each driver in the first set of drivers has updated a respective status indicating that the driver is available to provide transport service.

11. The non-transitory computer-readable medium of claim 9, wherein each of the second set of drivers transmits, to the server over one or more networks, information about the respective destination location using a corresponding computing device.

12. The non-transitory computer-readable medium of claim 9, wherein the instructions cause the server to determine the first set of drivers that are driving vehicles that are unoccupied by users by identifying drivers that are driving vehicles that are unoccupied by users having a current location within a predefined distance of the pickup location of the first user.

13. The non-transitory computer-readable medium of claim 12, wherein the instructions cause the server to determine the second set of drivers by (i) identifying drivers that are providing transport service to other users, the identified drivers having a current location within the predefined distance of the pickup location of the first user, (ii) for each identified driver, determining a first estimated travel time from that respective destination location to the pickup location of the first user, and (iii) for each identified driver, comparing the first estimated travel time with the threshold estimated travel time.

14. The non-transitory computer-readable medium of claim 13, wherein the instructions cause the server to perform operations further comprising:

determining, for each driver in the first set of drivers, an estimated travel time from a current location of that driver to the pickup location of the first user; and

determining, for each driver in the second set of drivers, a total estimated travel time, the total estimated travel time corresponding to a sum of the first estimated travel time and a second estimated travel time from the current location of that driver to the respective destination location.

15. The non-transitory computer-readable medium of claim 14, wherein the instructions cause the server to select the first driver to provide the transport service for the first user by selecting, from the plurality of drivers, a driver having the least total estimated travel time.

16. The non-transitory computer-readable medium of claim 9, wherein the instructions cause the server to perform operations further comprising:

transmitting, to a computing device of the selected first driver, a message inviting the first driver to provide the transport service for the first user, the message enabling the first driver to accept or reject the transport service.

17. A method for arranging a transport service, the method being performed by one or more processors of a server and comprising:

receiving, from a computing device of a first user, a request for transport, the request for transport including information about a pickup location of the first user;

in response to receiving the request for transport, determining a plurality of drivers that are each providing transport service to one or more other users to a respective destination location that is within a threshold estimated travel time from the pickup location of the first user; and

from the plurality of drivers, selecting a first driver to provide the transport service for the first user.

18. The method of claim 17, wherein determining the plurality of drivers includes (i) identifying drivers that are providing transport service to other users, the identified drivers having a current location within the predefined distance of the pickup location of the first user, (ii) for each identified driver, determining a first estimated travel time from that respective destination location to the pickup location of the first user, and (iii) for each identified driver, comparing the first estimated travel time with the threshold estimated travel time.

19. The method of claim 17, further comprising:

determining, for each driver of the plurality of drivers, a total estimated travel time, the total estimated travel time corresponding to a sum of the first estimated travel time and a second estimated travel time from the current location of that driver to the respective destination location; and

wherein selecting the first driver to provide the transport service for the first user includes selecting, from the plurality of drivers, a driver having the least total estimated travel time.

20. The method of claim 17, further comprising:

transmitting, to a computing device of the selected first driver, a message inviting the first driver to provide the transport service for the first user, the message enabling the first driver to accept or reject the transport service.