# US 2025/0368232 A1 · Neural network trajectory prediction

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

- Number: US 2025/0368232 A1
- Document ID: US20250368232A1
- Status: Published application
- Kind: A1
- Application number: 19/308,035
- Filed: 2025-08-22
- Published: 2025-12-04
- Earliest claimed: 2022-06-01
- Assignees: NVIDIA Corporation
- Applicants: NVIDIA Corporation
- Inventors: Yuxiao CHEN; Boris IVANOVIC; Marco PAVONE
- Web page: https://patentgrep.com/patent/US20250368232A1

## CPC

- B60W 60/0027: {using trajectory prediction for other traffic participants}
- G06N 3/0442: characterised by memory or gating, e.g. long short-term memory [LSTM] or gated recurrent units [GRU]
- G06N 3/045: Combinations of networks
- G06N 3/0455: Auto-encoder networks; Encoder-decoder networks
- G06N 3/0464: Convolutional networks [CNN, ConvNet]
- G06N 3/047: Probabilistic or stochastic networks
- G06N 3/063: using electronic means
- G06N 3/082: modifying the architecture, e.g. adding, deleting or silencing nodes or connections
- G06N 3/084: Backpropagation, e.g. using gradient descent
- G06N 3/088: Non-supervised learning, e.g. competitive learning
- G06N 3/09: Supervised learning
- B60W 2554/4042: Longitudinal speed
- B60W 2556/10: Historical data
- G06N 3/0495: Quantised networks; Sparse networks; Compressed networks
- 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

## Abstract

Apparatuses, systems, and techniques to generate trajectory predictions. In at least one embodiment, trajectory predictions are generated based on, for example, one or more neural networks.

## Claims

### Claim 1

A system, comprising:
one or more processors to:
obtain a graph representation of a scene;
partition the graph representation to generate one or more groups of agents in the scene;
generate one or more probability distributions corresponding to the one or more groups, the one or more probability distributions indicating one or more modes associated with the one or more groups;
generate one or more trajectories corresponding to the one or more modes of the one or more probability distributions; and
output the one or more trajectories to be used to cause a device to move.

### Claim 2 (depends on 1)

The system of claim 1, wherein the graph representation of the scene comprises one or more nodes representing agents and one or more edges representing interactions between the agents.

### Claim 3 (depends on 1)

The system of claim 1, wherein the one or more trajectories are generated using a neural network, and
the neural network is to perform discrete latent sampling to sample from the one or more probability distributions.

### Claim 4 (depends on 1)

The system of claim 1, wherein the one or more trajectories indicate predicted trajectories of the one or more groups of agents through the scene.

### Claim 5 (depends on 1)

The system of claim 1, wherein generating the one or more trajectories includes using a neural network to generate a set of reference trajectories corresponding to at least one of the one or more groups of agents based, at least in part, on a history of the agents in the one or more groups.

### Claim 6 (depends on 1)

The system of claim 1, wherein the graph representation comprises nodes that represent agents and edges connecting the nodes, and
the edges are to be determined based, at least in part, on a distance-based interaction threshold.

### Claim 7 (depends on 1)

The system of claim 1, wherein the one or more probability distributions include a Gibbs distribution.

### Claim 8 (depends on 1)

The system of claim 1, wherein the one or more modes are determined based, at least in part, on at least one of positional interactions, directional interactions, or velocity-based interactions between agents in the one or more groups.

### Claim 9 (depends on 1)

The system of claim 1, wherein the one or more processors are to train at least one neural network to perform trajectory prediction using conditional value at risk (CVaR) as a loss function.

### Claim 10 (depends on 1)

The system of claim 1, wherein the one or more processors are further to cause a vehicle to navigate through the scene to avoid predicted collisions with other agents based, at least in part, on the one or more trajectories.

### Claim 11

A method, comprising:
obtaining a graph representation of a scene;
partitioning the graph representation to generate one or more groups of agents in the scene;
generating one or more probability distributions corresponding to the one or more groups, the one or more probability distributions indicating one or more modes associated with the one or more groups;
generating one or more trajectories corresponding to the one or more modes of the one or more probability distributions; and
outputting the one or more trajectories to be used to cause a device to move.

### Claim 12 (depends on 11)

The method of claim 11, further comprising:
determining edges of the graph representation, the edges connecting nodes that represent agents in the scene, based, at least in part, on predicted distances between pairs of agents over a prediction period of time.

### Claim 13 (depends on 11)

The method of claim 11, wherein partitioning the graph representation to generate the one or more groups of agents comprises using a clustering algorithm comprising at least one of a Louvain algorithm, a k-means algorithm, a Clauset-Newman-Moore algorithm, or a Pons-Latapy algorithm.

### Claim 14 (depends on 11)

The method of claim 11, further comprising:
assigning weights to one or more edges of the graph representation based, at least in part, on a predefined distance threshold, wherein the predefined distance threshold is determined based on one or more agent types.

### Claim 15

At least one non-transitory computer-readable medium comprising instructions that, when performed by at least one processor of a computing device, cause the computing device to at least:
obtain a graph representation of a scene;
partition the graph representation to generate one or more groups of agents in the scene;
generate one or more probability distributions corresponding to the one or more groups, the one or more probability distributions indicating one or more modes associated with the one or more groups;
generate one or more trajectories corresponding to the one or more modes of the one or more probability distributions; and
output the one or more trajectories to be used to cause a device to move.

### Claim 16 (depends on 15)

The at least one non-transitory computer-readable medium of claim 15, wherein the graph representation of the scene comprises one or more nodes representing agents and one or more edges representing interactions between the agents.

### Claim 17 (depends on 15)

The at least one non-transitory computer-readable medium of claim 15, wherein the one or more trajectories are generated using a neural network, the neural network to perform discrete latent sampling to sample from the one or more probability distributions.

### Claim 18 (depends on 15)

The at least one non-transitory computer-readable medium of claim 15, wherein the one or more trajectories indicate predicted trajectories of the one or more groups of agents through the scene.

### Claim 19 (depends on 15)

The at least one non-transitory computer-readable medium of claim 15, wherein generating the one or more trajectories includes using a neural network to calculate a set of reference trajectories corresponding to at least one of the one or more groups of agents based, at least in part, on a history of the agents in the one or more groups.

### Claim 20 (depends on 15)

The at least one non-transitory computer-readable medium of claim 15, wherein the one or more modes are determined based, at least in part, on at least one of positional interactions, directional interactions, or velocity-based interactions between agents in the one or more groups.
