DISPATCH SYSTEM FOR MATCHING DRIVERS AND USERS

• US 20170011324A1
• Filed: 07/07/2015
• Published: 01/12/2017
• Est. Priority Date: 07/07/2015
• Status: Abandoned Application

• Current Assignee: Uber Technologies, Inc.
• Original Assignee: Uber Technologies, Inc.
• Inventors: Truong, Michael, Purdy, David, Mawas, Rami
• Application Number:
  US14/793,593
• Publication Number:
  US 20170011324A1
• 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 50/60 Business processes related to postal services shipping G06Q10/083; franking apparatus G07B17/00

Abstract

A dispatch system in connection with a transport service is provided. The dispatch system receives pick-up requests from requesting users and identifies a plurality of proximate drivers in relation to each of the requesting users. For each requesting user, the dispatch system runs a matching operation, using a plurality of relevant factors, to select an optimal driver from the plurality of proximate drivers to service the pick-up request.

Claims

1. A dispatch system comprising:

one or more processors; and

one or more memory resources storing instructions that, when executed by the one or more processors, cause the dispatch system to;

receive, from a user device over one or more networks, a pick-up request from a requesting user, the pick-up request specifying a pick-up location;

identify a plurality of proximate drivers based on the pick-up request location;

compute an optimization score for each respective one of the plurality of proximate drivers, the optimization score corresponding to a probability that the requesting user will provide the respective proximate driver with a maximum satisfaction rating; and

select one of the plurality of proximate drivers to service the pick-up request based on the computed optimization scores for the plurality of proximate drivers.

2. The dispatch system of claim 1, wherein the executed instructions further cause the dispatch system to:

store historical user data for the requesting user, historical user data including information from previous transport services received by the requesting user.

3. The dispatch system of claim 2, wherein the executed instructions cause the dispatch system to:

analyze the historical user data to determine a number of user preferences.

4. The dispatch system of claim 3, wherein the executed instructions further cause the dispatch system to:

store historical driver data for each of the plurality of proximate drivers;

compare the historical user data against the historical driver data for each of the plurality of proximate drivers; and

identify a plurality of relevant factors to compute the optimization score based on comparing the historical user data against the historical driver data.

5. The dispatch system of claim 4, wherein the executed instructions cause the dispatch system to compare the historical user data against the historical driver data by (i) for each of the plurality of proximate drivers, identifying a number of the plurality of relevant factors in the historical driver data based on the determined user preferences, and (ii) for each of the plurality of proximate drivers, applying a weighting to each of the identified relevant factors based on a corresponding user preference from the determined user preferences.

6. The dispatch system of claim 5, wherein the identified relevant factors comprise complaint data indicating a number of user complaints against the proximate driver.

7. The dispatch system of claim 5, wherein the identified relevant factors comprise reputation information for each of the plurality of proximate drivers.

8. The dispatch system of claim 4, wherein the historical user data comprise individual user ratings of respective drivers, each of the individual user ratings being specific to a respective user destination.

9. The dispatch system of claim 8, wherein the historical driver data comprise individual driver ratings for each of the plurality of proximate drivers, each of the individual driver ratings being specific to a respective user and a respective driver destination.

10. The dispatch system of claim 9, wherein the executed instructions cause the dispatch system to compute the optimization score for each of the plurality of drivers based on comparing the individual user ratings from the historical user data with the individual driver ratings for the plurality of proximate drivers.

11. The dispatch system of claim 9, wherein the executed instructions further cause the dispatch system to:

identify a destination associated with the pick-up request; and

identify, from the individual driver ratings for each of the plurality of proximate drivers, one or more of the individual driver ratings that match the destination;

wherein computing the optimization score further comprises applying a weighting to each of the one or more individual driver ratings that match the destination.

12. The dispatch system of claim 11, wherein the executed instructions further cause the dispatch system to:

identify a specified proximate driver having a highest individual driver rating that matches the destination;

wherein the dispatch system is to apply a maximum weighting to the highest individual driver rating for the specified proximate driver.

13. The dispatch system of claim 4, wherein the historical driver data comprise driver characteristics for each of the plurality of proximate drivers.

14. The dispatch system of claim 13, wherein the executed instructions cause the dispatch system compute the optimization score by comparing the determined user preferences of the requesting user with the driver characteristics of each of the plurality of proximate drivers.

15. The dispatch system of claim 14, wherein the determined user preferences indicate a preferred type of car, and wherein the driver characteristics for each of the plurality of proximate drivers indicate a type of car.

16. The dispatch system of claim 1, wherein the executed instructions further cause the dispatch system to:

provide a confirmation feature to the user device of the requesting user, the confirmation feature comprising driver data of the selected proximate driver; and

receive one of a confirmation or a rejection of the selected proximate driver from the user device.

17. The dispatch system of claim 16, wherein the executed instructions further cause the dispatch system to:

in response to receiving the confirmation, provide an invitation to the selected driver to service the pick-up request.

18. The dispatch system of claim 16, wherein the executed instructions further cause the dispatch system to:

in response to receiving the rejection, select a second one of the plurality of proximate drivers based on computing the optimization score.

19. A method for matching drivers with requesting users in connection with a transport service, the method performed by one or more processors of a dispatch system and comprising:

receiving, from a user device over one or more networks, a pick-up request from a requesting user, the pick-up request specifying a pick-up location;

identifying a plurality of proximate drivers based on the pick-up request location;

computing an optimization score for each respective one of the plurality of proximate drivers, the optimization score corresponding to a probability that the requesting user will provide the respective proximate driver with a maximum satisfaction rating; and

selecting one of the plurality of proximate drivers to service the pick-up request based on the computed optimization scores for the plurality of proximate drivers.

20. A non-transitory computer-readable medium storing instructions that, when executed by one or more processors of a dispatch system, cause the dispatch system to:

receive, from a user device over one or more networks, a pick-up request from a requesting user, the pick-up request specifying a pick-up location;

identify a plurality of proximate drivers based on the pick-up request location;

compute an optimization score for each respective one of the plurality of proximate drivers, the optimization score corresponding to a probability that the requesting user will provide the respective proximate driver with a maximum satisfaction rating; and

select one of the plurality of proximate drivers to service the pick-up request based on the computed optimization scores for the plurality of proximate drivers.