# US 2026/0073347 A1 · Systems and Methods for Complexity-based Matching Across Delivery Verticals

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2026/0073347 A1
- Document ID: US20260073347A1
- Status: Published application
- Kind: A1
- Application number: 18/827,007
- Filed: 2024-09-06
- Published: 2026-03-12
- Earliest claimed: 2024-09-06
- Assignees: Uber Technologies, Inc.
- Applicants: Uber Technologies, Inc.
- Inventors: Carly Wahlberg; Wafic El-Assi; Albert Lee; Nikolas Thorun; Jacob Edward Sudek; Dustin Wang; Diego Carey Astaburuaga; Samuel Lite; Ankur Jain; Mustafa Sahin; Eric Benjamin Janofsky; Cheng Hao Zheng
- Web page: https://patentgrep.com/patent/US20260073347A1

## CPC

- G06Q 10/0834: Choice of carriers
- G06Q 10/063112: {Skill-based matching of a person or a group to a task}
- G06Q 10/08: Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q 10/083: Shipping
- G06Q 10/0838: {Historical data}
- G06Q 50/40: Business processes related to the transportation industry (shipping G06Q10/083)
- G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR

## Abstract

An example computer-implemented method includes accessing service request data indicative of a service request, the service request having a service type and one or more service parameters. The method includes computing a complexity score associated with the service request based on the service type and the one or more service parameters. The method includes selecting a first courier of a plurality of candidate couriers based on the complexity score associated with the service request. The method includes outputting first instructions to a first courier device associated with the first courier. The first instructions are executable by the first courier device to cause a service assignment to be provided for display via a user interface of the first courier device, the service assignment indicating the first courier is to perform the service request.

## Claims

### Claim 1

A computer-implemented method comprising:
accessing service request data indicative of a service request, the service request having a service type and one or more service parameters;
computing a complexity score associated with the service request based on the service type and the one or more service parameters;
selecting a first courier of a plurality of candidate couriers based on the complexity score associated with the service request; and
outputting first instructions to a first courier device associated with the first courier, wherein the first instructions are executable by the first courier device to cause a service assignment to be provided for display via a user interface of the first courier device, the service assignment indicating the first courier is to perform the service request.

### Claim 2 (depends on 1)

The computer-implemented method of claim 1, wherein the method further comprises:
accessing first courier data associated with the first courier, the first courier data describing values of one or more courier-level features associated with the first courier; and
computing a complexity threshold associated with the first courier based on the first courier data;
wherein selecting the first courier comprises associating the first courier and the service request based on a comparison of the complexity score associated with the service request to the complexity threshold associated with the first courier.

### Claim 3 (depends on 2)

The computer-implemented method of claim 2, wherein selecting the first courier comprises:
computing a first time estimate for the first courier to complete the service request based on the service type and the one or more service parameters;
computing a first adjusted time estimate by adjusting the first time estimate based on the first courier data; and
selecting the first courier based on the first adjusted time estimate.

### Claim 4 (depends on 3)

The computer-implemented method of claim 3, further comprising:
accessing second courier data associated with a second courier, the second courier data describing values of the one or more courier-level features associated with the second courier; and
computing a second time estimate for the second courier to complete the service request based on the service type and the one or more service parameters;
wherein selecting the first courier is based on a comparison between the first adjusted time estimate and the second time estimate.

### Claim 5 (depends on 3)

The computer-implemented method of claim 3, wherein the one or more courier-level features comprise historical service data respective to a plurality of service types, wherein the service type of the service request is a first service type of the plurality of service types; and
wherein computing the first adjusted time estimate comprises adjusting the first time estimate based on the historical service data of the first courier.

### Claim 6 (depends on 5)

The computer-implemented method of claim 5, wherein selecting the first courier comprises:
accessing a service count of a second service type of the plurality of service types in the historical service data of the first courier, the second service type having a second base complexity that is lower than a first base complexity of the first service type;
computing a service count threshold indicative of a number of services of the second service type to be completed by the first courier prior to assigning the first courier to service requests of the first service type;
computing that the service count of the second service type satisfies the service count threshold; and
selecting the first courier in response to computing that the service count of the second service type is greater than the service count threshold.

### Claim 7 (depends on 5)

The computer-implemented method of claim 5, further comprising computing a historical complexity score associated with the historical service data of the first courier;
wherein adjusting the first time estimate is based on a comparison of the historical complexity score to the complexity score of the service request.

### Claim 8 (depends on 7)

The computer-implemented method of claim 7, wherein adjusting the first time estimate comprises decreasing the first time estimate if the historical complexity score is greater than the complexity score of the service request.

### Claim 9 (depends on 3)

The computer-implemented method of claim 3, wherein the one or more courier-level features comprise a courier rank within a plurality of courier ranks;
wherein the computer-implemented method further comprises computing a first courier rank of the first courier, the first courier rank within the plurality of courier ranks; and
wherein computing the first adjusted time estimate is based on the first courier rank.

### Claim 10 (depends on 9)

The computer-implemented method of claim 9, wherein computing the first courier rank comprises:
accessing data indicative of a ranking score of the first courier;
accessing a courier rank table indicating a tiered relationship between ranking scores and the plurality of courier ranks; and
computing the first courier rank based on a comparison of the ranking score of the first courier to the courier rank table based on the tiered relationship between ranking scores and the plurality of courier ranks.

### Claim 11 (depends on 9)

The computer-implemented method of claim 9, further comprising outputting data indicative of the first courier rank to the first courier device.

### Claim 12 (depends on 9)

The computer-implemented method of claim 9, wherein computing the first adjusted time estimate comprises:
computing a first time modifier associated with a first courier rank of the first courier; and
applying the first time modifier to the first time estimate to compute the first adjusted time estimate.

### Claim 13 (depends on 12)

The computer-implemented method of claim 12, wherein computing the first time modifier comprises:
accessing a time modifier table indicating a respective relationship between a plurality of time modifiers and the plurality of courier ranks; and
computing the first time modifier based on a comparison between the first courier rank and the time modifier table based on the respective relationship between the plurality of time modifiers and the plurality of courier ranks.

### Claim 14 (depends on 9)

The computer-implemented method of claim 9, wherein the first time estimate is based on a first distance estimate indicative of distance traveled by the first courier in completing the service request; and
wherein computing the first adjusted time estimate comprises:
computing a first distance modifier associated with a first courier rank of the first courier;
applying the first distance modifier to the first distance estimate to produce a first adjusted distance estimate; and
computing the first adjusted time estimate based on the first adjusted distance estimate.

### Claim 15 (depends on 1)

The computer-implemented method of claim 1, wherein the service type comprises at least one of: food delivery, courier-packed retail delivery, merchant-packed retail delivery, courier-packed grocery delivery, or merchant-packed grocery delivery.

### Claim 16 (depends on 1)

The computer-implemented method of claim 1, wherein the one or more service parameters are indicative of at least one of: a number of items to be transported, an order size, a batch size, a hyperbatching attribute, an item weight, an item size, an origin, an intermediate destination, a final destination, a service quality, a service priority, a service requirements, service metrics, or a product type.

### Claim 17

A computing system comprising:
one or more processors; and
one or more non-transitory, computer-readable media storing instructions that are executable by the one or more processors to cause the computing system to perform operations, the operations comprising:
accessing service request data indicative of a service request, the service request having a service type and one or more service parameters;
computing a complexity score associated with the service request based on the service type and the one or more service parameters;
selecting a first courier of a plurality of candidate couriers based on the complexity score associated with the service request; and
outputting first instructions to a first courier device associated with the first courier, wherein the first instructions are executable by the first courier device to cause a service assignment to be provided for display via a user interface of the first courier device, the service assignment indicating the first courier is to perform the service request.

### Claim 18 (depends on 17)

The computing system of claim 17, wherein the operations further comprise:
accessing first courier data associated with the first courier, the first courier data describing values of one or more courier-level features associated with the first courier; and
computing a complexity threshold associated with the first courier based on the first courier data;
wherein selecting the first courier comprises associating the first courier and the service request based on a comparison of the complexity score associated with the service request to the complexity threshold associated with the first courier.

### Claim 19 (depends on 18)

The computing system of claim 18, wherein selecting the first courier comprises:
computing a first time estimate for the first courier to complete the service request based on the service type and the one or more service parameters;
computing a first adjusted time estimate by adjusting the first time estimate based on the first courier data; and
selecting the first courier based on the first adjusted time estimate.

### Claim 20

One or more non-transitory, computer-readable media storing instructions comprising operations, the operations comprising:
accessing service request data indicative of a service request, the service request having a service type and one or more service parameters;
computing a complexity score associated with the service request based on the service type and the one or more service parameters;
selecting a first courier of a plurality of candidate couriers based on the complexity score associated with the service request; and
outputting first instructions to a first courier device associated with the first courier, wherein the first instructions are executable by the first courier device to cause a service assignment to be provided for display via a user interface of the first courier device, the service assignment indicating the first courier is to perform the service request.
