# US 2022/0032947 A1 · Assigning vehicles for transportation services

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

- Number: US 2022/0032947 A1
- Document ID: US20220032947A1
- Status: Published application
- Kind: A1
- Application number: 16/983,594
- Filed: 2020-08-03
- Published: 2022-02-03
- Earliest claimed: 2020-08-03
- Assignees: Waymo LLC
- Applicants: Waymo LLC
- Inventors: Xiang Gao; Ajay Joshi; Gabriel Wolosin
- Web page: https://patentgrep.com/patent/US20220032947A1

## CPC

- B60W 60/001: {Planning or execution of driving tasks}
- B60W 30/18163: {Lane change; Overtaking manoeuvres}
- G06N 5/04: Inference or reasoning models
- G06N 20/00: Machine learning
- G06Q 10/047: Optimisation of routes or paths, e.g. travelling salesman problem
- G06Q 10/06311: {Scheduling, planning or task assignment for a person or group}
- G06Q 10/06315: {Needs-based resource requirements planning or analysis}
- G06Q 50/40: Business processes related to the transportation industry (shipping G06Q10/083)
- B60W: CONJOINT CONTROL OF VEHICLE SUB-UNITS OF DIFFERENT TYPE OR DIFFERENT FUNCTION; CONTROL SYSTEMS SPECIALLY ADAPTED FOR HYBRID VEHICLES; ROAD VEHICLE DRIVE CONTROL SYSTEMS FOR PURPOSES NOT RELATED TO THE CONTROL OF A PARTICULAR SUB-UNIT
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- 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

Aspects of the disclosure provide for the determining whether to assign a driver to a trip. For instance, a route for a trip between a pickup location and a destination location for a passenger may be determined. Branch routes for the route may be determined based on one or more lane changes of the route. A probability of following each determined branch route may be determined. A probability of requiring assistance for each determined branch route may be determined. Whether to assign a driver to the trip may be determined based on the probabilities for each determined branch route. A vehicle of a fleet of vehicles may be assigned to the trip based on the determine of whether to assign a driver.

## Claims

### Claim 1

A method of determining whether to assign a vehicle without a driver to a trip, the method comprising:
determining, by one or more processors, a route for a trip between a pickup location and a destination location for a passenger, the route including one or more lane changes;
determining, by the one or more processors, branch routes for the route based on the one or more lane changes;
determining, by the one or more processors, a probability of following each determined branch route;
determining, by the one or more processors, a probability of requiring assistance for each determined branch route;
determining, by the one or more processors, whether to assign a driver to the trip based the probability of requiring assistance for each determined branch route and the probability of following each determined branch route; and
assigning, by the one or more processors, a vehicle of a fleet of vehicles to the trip based on the determination of whether to assign a driver.

### Claim 2 (depends on 1)

The method of claim 1, wherein determining the branch routes includes determining a likelihood of success of completing each of the one or more lane changes.

### Claim 3 (depends on 2)

The method of claim 2, wherein determining the branch routes is further based on a threshold value.

### Claim 4 (depends on 2)

The method of claim 2, wherein determining each determined likelihood of success includes inputting information about each of the one or more turns into a machine learned model.

### Claim 5 (depends on 1)

The method of claim 1, wherein determining the branch routes includes routing from the pickup location to the destination location and through a location where a vehicle can miss one of the one or more lane changes.

### Claim 6 (depends on 1)

The method of claim 1, wherein determining the branch routes includes determining additional branch routes for any of the branch routes that include at least one lane change where the vehicle can miss the at least one lane change.

### Claim 7 (depends on 1)

The method of claim 1, further comprising, determining a probability of following the route, and wherein determining whether the route requires a driver is further based on the probability of following the route.

### Claim 8 (depends on 7)

The method of claim 7, wherein determining the probability of following the route includes determining a likelihood of completing a lane change for each of the one or more lane changes.

### Claim 9 (depends on 8)

The method of claim 8, wherein determining the probability of following the route include multiplying any likelihood of successfully completing a lane change for each of the one or more lane changes together.

### Claim 10 (depends on 1)

The method of claim 1, wherein determining the probability of following the branch routes includes determining a likelihood of not successfully completing a lane change for at least one of the one or more lane changes.

### Claim 11 (depends on 1)

The method of claim 1, further comprising determining a probability of requiring assistance for the route, and wherein determining whether the route requires a driver is further based on the probability of requiring assistance for the route.

### Claim 12 (depends on 11)

The method of claim 11, wherein determining the probability of requiring assistance includes determining a turn difficulty for each turn along the route.

### Claim 13 (depends on 12)

The method of claim 12, wherein determining the turn difficulty for each turn along the route includes using a machine learned model.

### Claim 14 (depends on 1)

The method of claim 1, wherein determining the probability of requiring assistance for each determined branch route includes determining a turn difficulty for each turn along each determined branch route.

### Claim 15 (depends on 14)

The method of claim 14, wherein determining the turn difficulty for each turn along each determined branch route includes using a machine learned model.

### Claim 16 (depends on 1)

The method of claim 1, wherein determining the probability of requiring assistance for at least one determined branch route is based on whether the at least one determined branch route includes a blockage preventing a vehicle from reaching the destination location.

### Claim 17 (depends on 1)

The method of claim 1, further includes:
determining a probability of following the route;
determining a probability of requiring assistance for the route; and
wherein determining whether to assign a driver includes determining a weighted average of the probability of requiring assistance for the route, the probability of requiring assistance for each determined branch route, the probability of following the route, and the probability of following each determined branch route.

### Claim 18 (depends on 17)

The method of claim 17, wherein the probability of following the route and the probability of following each determined branch route are weights in the weighted average.

### Claim 19 (depends on 17)

The method of claim 17, wherein determining whether to assign a driver includes comparing the weighted average to a threshold value.
