# US 2021/0342760 A1 · Systems and methods for utilizing constrained modes of transportation

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

- Number: US 2021/0342760 A1
- Document ID: US20210342760A1
- Status: Published application
- Kind: A1
- Application number: 16/862,395
- Filed: 2020-04-29
- Published: 2021-11-04
- Earliest claimed: 2020-04-29
- Assignees: Lyft, Inc.
- Applicants: Lyft, Inc.
- Inventors: Arkesh Jagdish Patel; Rex See Chun Lam; Gavin Sebastian Hurley; Dennis Yu Cheng
- Web page: https://patentgrep.com/patent/US20210342760A1

## CPC

- G06Q 10/06311: {Scheduling, planning or task assignment for a person or group}
- G06F 3/04817: using icons (graphical or visual programming using iconic symbols G06F8/34)
- 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
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

The disclosed computer-implemented method may include efficiently surfacing the availability of constrained transportation options such that the utilization of those options is at least partially maximized and directed to users for whom the options would be a positive user experience. During busy times, requests for transportation with a high estimated arrival time and/or to a low-demand area may not be the most efficient matches for constrained transportation options such as autonomous vehicles. Instead, waiting for a transportation request with a lower estimated arrival time and/or to a higher-demand area may be a better choice in terms of maximizing the percentage of time an autonomous vehicle spends transporting passengers and reducing the time passengers spend waiting for an autonomous vehicle. In some embodiments, dynamically altering the mode-availability radius of an autonomous vehicle may increase the utilization of the autonomous vehicle. Various other methods, systems, and computer-readable media are also disclosed.

## Claims

### Claim 1

A computer-implemented method comprising:
receiving, by a dynamic transportation matching system, a request for transportation from a transportation requestor device;
determining, by the dynamic transportation matching system, that the request is eligible to be fulfilled by at least an unconstrained mode of transportation and a constrained mode of transportation, the constrained mode having at least one constraint that renders the constrained mode ineligible to fulfill one or more other transportation requests that the unconstrained mode is eligible to fulfill;
determining, by the dynamic transportation matching system, an expected impact that fulfilling the request via the constrained mode is expected to have on utilization of the constrained mode;
determining, by the dynamic transportation matching system, that the expected impact satisfies a utilization threshold for the constrained mode; and
directing, by the dynamic transportation matching system and in response to determining that the expected impact satisfies the utilization threshold, the transportation requestor device to present the constrained mode as an option for fulfilling the request for transportation.

### Claim 2 (depends on 1)

The computer-implemented method of claim 1, wherein the constrained mode comprises an autonomous vehicle configured to fulfill the request for transportation without a human operating the autonomous vehicle.

### Claim 3 (depends on 1)

The computer-implemented method of claim 1, wherein calculating the expected impact comprises predicting a future demand for the constrained mode during a window of time after the request for transportation was received.

### Claim 4 (depends on 3)

The computer-implemented method of claim 3, wherein predicting the future demand for the constrained mode comprises at least one of:
determining a future demand for the constrained mode associated with a current location of the constrained mode; or
predicting, for an expected arrival time of the constrained mode at a destination specified by the request for transportation, a future demand for the constrained mode associated with the destination.

### Claim 5 (depends on 3)

The computer-implemented method of claim 3, wherein:
determining the expected impact that fulfilling the request via the constrained mode is expected to have on the utilization of the constrained mode further comprises:
predicting an expected value of fulfilling the request via the constrained mode;
predicting an expected value of the future demand for the constrained mode; and
directing the transportation requestor device to present the constrained mode in response to determining that the expected value of fulfilling the request for transportation is greater than the expected value of the future demand.

### Claim 6 (depends on 3)

The computer-implemented method of claim 3, wherein predicting the future demand expected to be received for the constrained mode comprises predicting an expected wait time for receiving a potential future request that is eligible to be fulfilled by the constrained mode.

### Claim 7 (depends on 1)

The computer-implemented method of claim 1, wherein the utilization of the constrained mode comprises a percentage of operating time that the constrained mode is transporting a transportation requestor.

### Claim 8 (depends on 1)

The computer-implemented method of claim 1, wherein:
calculating the expected impact comprises calculating an expected transit time of the constrained mode to a location of the transportation requestor device; and
directing the transportation requestor device to present the constrained mode is performed in response to determining that the expected transit time of the constrained mode to the location of the transportation requestor device satisfies a predetermined threshold for the expected transit time.

### Claim 9 (depends on 1)

The computer-implemented method of claim 1, wherein directing the transportation requestor device to present the option for the constrained mode comprises:
selecting a format for presenting the option that is correlated with the expected impact of fulfilling the request via the constrained mode; and
directing the transportation requestor device to present the option in the selected format.

### Claim 10 (depends on 9)

The computer-implemented method of claim 9, wherein the selected format comprises at least one of:
displaying the option highest in a list of options;
displaying text associated with the option in a larger font than a font in which additional options are displayed;
displaying at least one icon associated with the option in a larger size than an icon associated with an additional option; and
displaying the option in a different color than a color in which additional options are displayed.

### Claim 11 (depends on 1)

The computer-implemented method of claim 1, further comprising:
receiving, by the dynamic transportation matching system, an additional request for transportation from an additional transportation requestor device;
determining, by the dynamic transportation matching system, that the additional request is eligible to be fulfilled by both the unconstrained mode and the constrained mode;
calculating an additional expected impact that fulfilling the additional request via the constrained mode is expected to have on the utilization of the constrained mode; and
directing, based on the additional expected impact, the additional transportation requestor device to not present the constrained mode as the option for fulfilling the request for transportation.

### Claim 12 (depends on 1)

The computer-implemented method of claim 1:
further comprising determining that fulfilling the request for transportation improves at least one metric of the dynamic transportation network in addition to improving the utilization of the constrained mode; and
wherein directing the transportation requestor device to present the constrained mode as an option for fulfilling the request for transportation is performed in response to determining that fulfilling the request for transportation improves the at least one additional metric.

### Claim 13

A transportation-matching system comprising:
a non-transitory memory; and
one or more hardware processors configured to execute instructions from the non-transitory memory to perform operations comprising:
receiving, by a dynamic transportation matching system, a request for transportation from a transportation requestor device;
determining, by the dynamic transportation matching system, that the request is eligible to be fulfilled by at least an unconstrained mode of transportation and a constrained mode of transportation, the constrained mode having at least one constraint that renders the constrained mode ineligible to fulfill one or more other transportation requests that the unconstrained mode is eligible to fulfill;
determining, by the dynamic transportation matching system, an expected impact that fulfilling the request via the constrained mode is expected to have on utilization of the constrained mode;
determining, by the dynamic transportation matching system, that the expected impact utilization satisfies a predetermined utilization threshold for the constrained mode; and
directing, by the dynamic transportation matching system and in response to determining that the expected impact satisfies the predetermined utilization threshold, the transportation requestor device to present the constrained mode as an option for fulfilling the request for transportation.

### Claim 14 (depends on 13)

The transportation-matching system of claim 13, wherein the constrained mode comprises an autonomous vehicle that is configured to fulfill the request for transportation without a human operating the autonomous vehicle.

### Claim 15 (depends on 13)

The transportation-matching system of claim 13, wherein determining the expected impact comprises predicting a future demand expected to be received for the constrained mode during a window of time after the request for transportation was received.

### Claim 16 (depends on 15)

The transportation-matching system of claim 15, wherein predicting the future demand expected to be received for the constrained mode comprises at least one of:
determining a future demand for the constrained mode for a location of the constrained mode; or
predicting, for an expected arrival time of the constrained mode at a destination of the request for transportation, a future demand for the constrained mode for the destination.

### Claim 17 (depends on 15)

The transportation-matching system of claim 15, wherein:
determining the expected impact that fulfilling the request via the constrained mode is expected to have on the utilization of the constrained mode further comprises:
predicting an expected value of fulfilling the request via the constrained mode; and
predicting an expected value of the future demand for the constrained mode; and
directing the transportation requestor device to present the constrained mode is performed in response to determining that the expected value of fulfilling the request for transportation is greater than the expected value of the future demand.

### Claim 18 (depends on 15)

The transportation-matching system of claim 15, wherein predicting the future demand expected to be received for the constrained mode comprises predicting an expected wait time for receiving a potential future request that is eligible to be fulfilled by the constrained mode.

### Claim 19 (depends on 13)

The transportation-matching system of claim 13, wherein:
calculating the expected impact comprises calculating an expected arrival time of the constrained mode at a location of the transportation requestor device; and
directing the transportation requestor device to present the constrained mode is performed in response to determining that the expected arrival time of the constrained mode at the location of the transportation requestor device satisfies a predetermined threshold for the expected arrival time.

### Claim 20

A non-transitory computer-readable medium comprising computer-readable instructions that, when executed by at least one processor of a computing device, cause the computing device to:
receive, by a dynamic transportation matching system, a request for transportation from a transportation requestor device;
determine, by the dynamic transportation matching system, that the request is eligible to be fulfilled by at least an unconstrained mode of transportation and a constrained mode of transportation, the constrained mode having at least one constraint that renders the constrained mode ineligible to respond to one or more other transportation requests that the unconstrained mode is eligible to fulfill;
determine, by the dynamic transportation matching system, an expected impact that fulfilling the request via the constrained mode is expected to have on utilization of the constrained mode;
determine, by the dynamic transportation matching system, that the expected impact utilization satisfies a predetermined utilization threshold for the constrained mode; and
direct, by the dynamic transportation matching system and in response to determining that the expected impact satisfies the predetermined utilization threshold, the transportation requestor device to present the constrained mode as an option for fulfilling the request for transportation.
