# US 2020/0393256 A1 · Managing movement of vehicles through directional route corridors

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

- Number: US 2020/0393256 A1
- Document ID: US20200393256A1
- Status: Published application
- Kind: A1
- Application number: 16/441,685
- Filed: 2019-06-14
- Published: 2020-12-17
- Earliest claimed: 2019-06-14
- Assignees: Uber Technologies, Inc.
- Applicants: Uber Technologies, Inc.
- Inventors: Mustafa Sahin; Vishnu Sundaresan; Meisam Vosoughpour; Kenneth Kuhn; Miraj Rahematpura; Danhua Guo; Eoin O'Mahony; Lior Seeman; Denny Tse-Wei Tsai; Philippe Sekine
- Web page: https://patentgrep.com/patent/US20200393256A1

## CPC

- G01C 21/3438: {Rendezvous; Ride sharing}
- G06Q 10/047: Optimisation of routes or paths, e.g. travelling salesman problem
- G06Q 10/063: Operations research, analysis or management
- G06Q 50/40: Business processes related to the transportation industry (shipping G06Q10/083)
- H04W 4/022: {with dynamic range variability}
- H04W 4/024: Guidance services
- H04W 4/42: for mass transport vehicles, e.g. buses, trains or aircraft
- G05D 1/0212: {with means for defining a desired trajectory (involving a plurality of land vehicles G05D1/0287)}
- G05D 1/0287: {involving a plurality of land vehicles, e.g. fleet or convoy travelling (traffic control systems for road vehicles G08G1/00, particularly anticollision systems G08G1/16)}
- H04L 67/12: specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks
- G01C: MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY (measuring liquid level G01F; radio navigation, determining distance or velocity by use of propagation effects, e.g. Doppler effects, propagation time, of radio waves, analogous arrangements using other waves G01S)
- 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
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)
- G05D: SYSTEMS FOR CONTROLLING OR REGULATING NON-ELECTRIC VARIABLES
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A computing system can detect high capacity vehicles (HCVs) coming online to provide transport services. The computing system monitors transport demand for HCV corridors throughout a geographic region. Each HCV corridor comprises a plurality of possible rendezvous locations and a plurality of possible routes that can be traveled by individual HCVs through the HCV corridor, as opposed to having fixed routes with fixed stops. The computing system can determine a schedule for each HCV corridor, and monitor supply flow of HCVs traveling through each HCV corridor. Based on (i) the transport demand, (ii) the schedule, and (iii) the supply flow of the HCVs for each of the HCV corridors, the computing system can match the HCV with a specified HCV corridor, and transmit match data indicating a start zone of the matching HCV corridor to the computing device of the HCV.

## Claims

### Claim 1

A computing system implementing a transport service for a geographic region, comprising:
a network communication interface;
one or more processors;
a memory storing instructions that, when executed by the one or more processors, cause the computing system to:
detect, via the network communication interface, an online status from a computing device of a high-capacity vehicle (HCV), the online status indicating that the HCV is available to provide the transport service;
monitor transport demand for each of a plurality of HCV corridors throughout the geographic region, wherein each respective HCV corridor comprises (i) a plurality of possible rendezvous locations and (ii) a plurality of possible routes that can be traveled by individual HCVs through the respective HCV corridor;
determine a schedule for each of the plurality of HCV corridors;
monitor supply flow of HCVs traveling through each of the plurality of HCV corridors;
based, at least in part, on (i) the transport demand, (ii) the schedule, and (iii) the supply flow of HCVs through each of the plurality of HCV corridors, match the HCV to one of the plurality of HCV corridors; and
transmit, via the network communication interface, match data indicating a start zone of the matching HCV corridor to the computing device of the HCV.

### Claim 2 (depends on 1)

The computing system of claim 1, wherein the schedule for the matching HCV corridor indicates a start interval for HCVs entering the matching HCV corridor.

### Claim 3 (depends on 1)

The computing system of claim 1, wherein the executed instructions further cause the computing system to:
based on the supply flow of HCVs through the matching HCV corridor, transmit, via the network communication interface, a wait instruction to the computing device of the HCV when the supply flow indicates HCV aggregation in a forward operational direction of the HCV.

### Claim 4 (depends on 1)

The computing system of claim 1, wherein the transport demand indicates that current transport demand in a forward operational direction of the HCV within the matching HCV corridor is below a first demand threshold, and wherein the executed instructions further cause the computing system to:
transmit, via the network communication interface, a route command to the computing device of the HCV, the route command routing the HCV to exit the matching HCV corridor prior to an end area of the matching HCV corridor.

### Claim 5 (depends on 4)

The computing system of claim 4, wherein the first demand threshold comprises a lower demand threshold specific to the matching HCV corridor and corresponds to the schedule of the matching HCV corridor.

### Claim 6 (depends on 5)

The computing system of claim 5, wherein the transport demand further indicates that current transport demand in a nearby corridor is above a second demand threshold, and wherein the route command routes the HCV to the nearby corridor.

### Claim 7 (depends on 6)

The computing system of claim 6, wherein the second demand threshold comprises an upper demand threshold specific to the nearby corridor and corresponds to the schedule of the nearby corridor.

### Claim 8

A non-transitory computer-readable medium storing instructions that, when executed by one or more processors, cause the one or more processors to:
detect, via a network communication interface, an online status from a computing device of a high-capacity vehicle (HCV), the online status indicating that the HCV is available to provide a transport service;
monitor transport demand for each of a plurality of HCV corridors throughout a geographic region, wherein each respective HCV corridor comprises (i) a plurality of possible rendezvous locations and (ii) a plurality of possible routes that can be traveled by individual HCVs through the respective HCV corridor;
determine a schedule for each of the plurality of HCV corridors;
monitor supply flow of HCVs traveling through each of the plurality of HCV corridors;
based, at least in part, on (i) the transport demand, (ii) the schedule, and (iii) the supply flow of the HCVs through each of the plurality of HCV corridors, match the HCV to one of the plurality of HCV corridors; and
transmit, via the network communication interface, match data indicating a start zone of the matching HCV corridor to the computing device of the HCV.

### Claim 9 (depends on 8)

The non-transitory computer-readable medium of claim 8, wherein the schedule for the matching HCV corridor indicates a start interval for HCVs entering the matching HCV corridor.

### Claim 10 (depends on 8)

The non-transitory computer-readable medium of claim 8, wherein the executed instructions further cause the one or more processors to:
based on the supply flow of HCVs through the matching HCV corridor, transmit, via the network communication interface, a wait instruction to the computing device of the HCV when the supply flow indicates HCV aggregation in a forward operational direction of the HCV.

### Claim 11 (depends on 8)

The non-transitory computer-readable medium of claim 8, wherein the transport demand indicates that current transport demand in a forward operational direction of the HCV within the matching HCV corridor is below a first demand threshold, and wherein the executed instructions further cause the one or more processors to:
transmit, via the network communication interface, a route command to the computing device of the HCV, the route command routing the HCV to exit the matching HCV corridor prior to an end area of the matching HCV corridor.

### Claim 12 (depends on 11)

The non-transitory computer-readable medium of claim 11, wherein the first demand threshold comprises a lower demand threshold specific to the matching HCV corridor and corresponds to the schedule of the matching HCV corridor.

### Claim 13 (depends on 12)

The non-transitory computer-readable medium of claim 12, wherein the transport demand further indicates that current transport demand in a nearby corridor is above a second demand threshold, and wherein the route command routes the HCV to the nearby corridor.

### Claim 14 (depends on 13)

The non-transitory computer-readable medium of claim 13, wherein the second demand threshold comprises an upper demand threshold specific to the nearby corridor and corresponds to the schedule of the nearby corridor

### Claim 15

A computer-implemented method of facilitating transport, the method being performed by one or more processors and comprising:
detecting, via a network communication interface, an online status from a computing device of a high-capacity vehicle (HCV), the online status indicating that the HCV is available to provide a transport service;
monitoring transport demand for each of a plurality of HCV corridors throughout a geographic region, wherein each respective HCV corridor comprises (i) a plurality of possible rendezvous locations and (ii) a plurality of possible routes that can be traveled by individual HCVs through the respective HCV corridor;
determining a schedule for each of the plurality of HCV corridors;
monitoring supply flow of HCVs traveling through each of the plurality of HCV corridors;
based, at least in part, on (i) the transport demand, (ii) the schedule, and (iii) the supply flow of the HCVs through each of the plurality of HCV corridors, matching the HCV to one of the plurality of HCV corridors; and
transmitting, via the network communication interface, match data indicating a start zone of the matching HCV corridor to the computing device of the HCV.

### Claim 16 (depends on 15)

The method of claim 15, wherein the schedule for the matching HCV corridor indicates a start interval for HCVs entering the matching HCV corridor.

### Claim 17 (depends on 15)

The method of claim 15, further comprising:
based on the supply flow of HCVs through the matching HCV corridor, transmitting, via the network communication interface, a wait instruction to the computing device of the HCV when the supply flow indicates HCV aggregation in a forward operational direction of the HCV.

### Claim 18 (depends on 15)

The method of claim 15, wherein the transport demand indicates that current transport demand in a forward operational direction of the HCV within the matching HCV corridor is below a first demand threshold, the method further comprising:
transmitting, via the network communication interface, a route command to the computing device of the HCV, the route command routing the HCV to exit the matching HCV corridor prior to an end area of the matching HCV corridor.

### Claim 19 (depends on 18)

The method of claim 18, wherein the first demand threshold comprises a lower demand threshold specific to the matching HCV corridor and corresponds to the schedule of the matching HCV corridor.

### Claim 20 (depends on 19)

The method of claim 19, wherein the transport demand further indicates that current transport demand in a nearby corridor is above a second demand threshold, and wherein the route command routes the HCV to the nearby corridor.
