# US 2022/0063651 A1 · Vehicle path planning

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

- Number: US 2022/0063651 A1
- Document ID: US20220063651A1
- Status: Published application
- Kind: A1
- Application number: 17/004,342
- Filed: 2020-08-27
- Published: 2022-03-03
- Earliest claimed: 2020-08-27
- Assignees: Ford Global Technologies, LLC
- Applicants: Ford Global Technologies, LLC
- Inventors: Qi Dai; Jinhong Wang; Wen Guo; Xunnong Xu; Suzhou Huang; Dimitar Petrov Filev
- Web page: https://patentgrep.com/patent/US20220063651A1

## CPC

- B60W 60/001: {Planning or execution of driving tasks}
- B60W 10/18: including control of braking systems
- B60W 10/20: including control of steering systems
- B60W 30/085: Taking automatic action to adjust vehicle attitude in preparation for collision, e.g. braking for nose dropping
- B60W 30/18163: {Lane change; Overtaking manoeuvres}
- B60W 50/06: Improving the dynamic response of the control system, e.g. improving the speed of regulation or avoiding hunting or overshoot
- B60W 60/00276: {for two or more other traffic participants}
- G01C 21/3407: {specially adapted for specific applications}
- G01C 21/3492: {employing speed data or traffic data, e.g. real-time or historical (traffic control systems for road vehicles involving transmission of navigation instructions to the vehicle G08G1/0968)}
- G01C 21/3691: {Retrieval, searching and output of information related to real-time traffic, weather, or environmental conditions (arrangements for giving variable traffic instructions G08G1/09)}
- G08G 1/0116: {from roadside infrastructure, e.g. beacons}
- G08G 1/0133: {for classifying traffic situation}
- G08G 1/052: with provision for determining speed or overspeed {(speed measuring in general G01P)}
- G08G 1/056: with provision for distinguishing direction of travel
- G08G 1/20: {Monitoring the location of vehicles belonging to a group, e.g. fleet of vehicles, countable or determined number of vehicles}
- B60W 2050/0083: {Setting, resetting, calibration}
- B60W 2554/40: Dynamic objects, e.g. animals, windblown objects
- B60W 2556/45: External transmission of data to or from the vehicle
- G08G 1/096816: {where the complete route is transmitted to the vehicle at once}
- 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
- 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)
- G08G: TRAFFIC CONTROL SYSTEMS (guiding railway traffic, ensuring the safety of railway traffic B61L; arrangement of road signs or traffic signals E01F9/00; radar or analogous systems, sonar systems, lidar systems specially adapted for traffic control G01S13/91, G01S15/88, G01S17/88; {radar or analogous systems, sonar systems, lidar systems specially adapted for anti-collision purposes G01S13/93, G01S15/93, G01S17/93})

## Abstract

A computer, including a processor and a memory, the memory including instructions to be executed by the processor to calibrate utility functions that determine optimal vehicle actions based on an approximate Nash equilibrium solution for multiple agents by determining a difference between model-predicted future states for the multiple agents to observed states for the multiple agents. The instructions can include further instructions to determine a vehicle path for a vehicle based on the optimal vehicle actions.

## Claims

### Claim 1

A computer, comprising:
a processor; and
a memory, the memory including instructions executable by the processor to:
calibrate utility functions that determine optimal vehicle actions based on an approximate Nash equilibrium solution for multiple agents by determining a difference between possible model-predicted states for the multiple agents and observed states for the multiple agents; and
determine a vehicle path for a vehicle based on the optimal vehicle actions.

### Claim 2 (depends on 1)

The computer of claim 1, wherein the difference between the possible future states for the agents and the observed states includes a noise term that is normally distributed with a constant covariance.

### Claim 3 (depends on 1)

The computer of claim 1, the instructions including further instructions to calibrate the utility functions by minimizing a cost function determined by the difference between the model-predicted states and the observed states.

### Claim 4 (depends on 1)

The computer of claim 1, the instructions including further instructions to determine the observed states based on sensor data acquired from sensors included in a traffic infrastructure system arranged to observe the multiple agents.

### Claim 5 (depends on 1)

The computer of claim 1, wherein the utility functions simulate behavior of the multiple agents to determine the possible future states for the multiple agents based on determining one or more of each of agents' locations, agents' velocities, where velocity includes speed and heading, and one or more possible paths for each agent.

### Claim 6 (depends on 5)

The computer of claim 5, wherein the utility functions includes parameters that determine rewards and penalties for actions of each of the multiple agents based on estimated states of the multiple agents at future time steps t included within a time horizon h.

### Claim 7 (depends on 1)

The computer of claim 1, wherein the approximate Nash equilibrium solution performs an adaptive grid search optimization technique to determine the optimal vehicle actions based on estimating the possible future states of the multiple agents, wherein the multiple agents include one or more of autonomous vehicles, non-autonomous vehicles, stationary objects, and non-stationary objects including pedestrians and the possible future states are estimated by simulating behavior of the multiple agents based on the utility functions to determine the possible future states for the multiple agents.

### Claim 8 (depends on 1)

The computer of claim 1, wherein the utility functions include one or more of moving forward at a desired speed and deviating from smooth vehicle operation, wherein the smooth vehicle operation includes limits on agent acceleration, agent steering and agent braking.

### Claim 9 (depends on 1)

The computer of claim 1, wherein the utility functions include one or more of lane departure, out of roadway departure, collisions with stationary objects, and collisions with non-stationary objects.

### Claim 10 (depends on 1)

The computer of claim 1, wherein the vehicle path based on the optimal vehicle actions is determined based on polynomial functions.

### Claim 11 (depends on 1)

The computer of claim 1, the instructions including further instructions to determine the vehicle path for the vehicle based on the optimal vehicle actions and to download the vehicle path to a second computer including a second processor and second memory included in the vehicle.

### Claim 12 (depends on 11)

The computer of claim 11, wherein the second computer includes instructions to operate the vehicle along the vehicle path by controlling vehicle powertrain, vehicle steering and vehicle brakes.

### Claim 13

A method, comprising:
calibrating utility functions that determine optimal vehicle actions based on an approximate Nash equilibrium solution for multiple agents by determining a difference between model-predicted states for the multiple agents and observed states for the multiple agents; and
determining a vehicle path for a vehicle based on the optimal vehicle actions.

### Claim 14 (depends on 13)

The method of claim 13, wherein the difference between the model-predicted states for the agents and the observed states includes a noise term that is normally distributed with a constant covariance.

### Claim 15 (depends on 13)

The method of claim 13, further comprising calibrating the utility functions by minimizing a cost function determined by the difference between the possible model-predicted states to the observed states.

### Claim 16 (depends on 13)

The method of claim 13, further comprising determining the observed states based on sensor data acquired from sensors included in a traffic infrastructure system arranged to observe the multiple agents.

### Claim 17 (depends on 13)

The method of claim 13, wherein the utility functions simulate behavior of the multiple agents to determine the possible future states for the multiple agents based on determining one or more of each of agents' locations, agents' velocities, where velocity includes speed and heading, and one or more possible paths for each agent.

### Claim 18 (depends on 17)

The method of claim 17, wherein the utility functions includes parameters that determine rewards and penalties for actions of each of the multiple agents based on estimated states of the multiple agents at future time steps t included within a time horizon h.

### Claim 19 (depends on 13)

The method of claim 13, wherein the approximate Nash equilibrium solution performs an adaptive grid search optimization technique to determine the optimal vehicle actions based on estimating the possible future states of the multiple agents, wherein the multiple agents include one or more of autonomous vehicles, non-autonomous vehicles, stationary objects, and non-stationary objects including pedestrians and the possible future states are estimated by simulating behavior of the multiple agents based on the utility functions to determine the possible future states for the multiple agents.

### Claim 20 (depends on 13)

The method of claim 13, wherein the utility functions include one or more of moving forward at a desired speed and deviating from smooth vehicle operation, wherein the smooth vehicle operation includes limits on agent acceleration, agent steering and agent braking.
