# US 2025/0328397 A1 · Spatio-temporal graph and message passing

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

- Number: US 2025/0328397 A1
- Document ID: US20250328397A1
- Status: Published application
- Kind: A1
- Application number: 18/910,962
- Filed: 2024-10-09
- Published: 2025-10-23
- Earliest claimed: 2024-04-18
- Assignees: Honda Motor Co., Ltd.
- Applicants: Honda Motor Co., Ltd.
- Inventors: Miles PRIEBE; Nawid JAMALI; Snehal Subhash DIKHALE; Soshi IBA
- Web page: https://patentgrep.com/patent/US20250328397A1

## CPC

- G06F 9/546: {Message passing systems or structures, e.g. queues}
- G06F 3/011: {Arrangements for interaction with the human body, e.g. for user immersion in virtual reality (blind teaching G09B21/00)}
- G06F 18/2323: based on graph theory, e.g. minimum spanning trees [MST] or graph cuts
- G06N 3/04: Architecture, e.g. interconnection topology
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS

## Abstract

According to one aspect, spatio-temporal graph message passing may include generating edges for a spatio-temporal graph. Nodes for the spatio-temporal graph may be defined by a first point cloud and a second point cloud. The edges may be generated based on a proximity between nodes of the spatio-temporal graph. The proximity may be defined based on a Euclidean distance or an embedding space distance. Message passing may be performed between respective nodes based on the proximity to generate updated feature vectors for respective nodes and a graph readout may be generated based on the updated feature vectors. Additionally, a downstream task may be performed based on the graph readout.

## Claims

### Claim 1

A system for spatio-temporal graph message passing, comprising:
a memory storing one or more instructions;
a processor executing one or more of the instructions stored on the memory to perform:
generating edges for a spatio-temporal graph, wherein nodes for the spatio-temporal graph are defined by a first point cloud and a second point cloud, wherein the edges are generated based on a proximity between nodes of the spatio-temporal graph, wherein the proximity is defined based on a Euclidean distance or an embedding space distance;
performing message passing between respective nodes based on the proximity to generate updated feature vectors for respective nodes; and
generating a graph readout based on the updated feature vectors.

### Claim 2 (depends on 1)

The system for spatio-temporal graph message passing of claim 1, wherein the processor performs a downstream task based on the graph readout.

### Claim 3 (depends on 1)

The system for spatio-temporal graph message passing of claim 1, wherein the proximity is defined as a Minkowski distance.

### Claim 4 (depends on 1)

The system for spatio-temporal graph message passing of claim 1, wherein the first point cloud is associated with a first sensor type and the second point cloud is associated with a second sensor type.

### Claim 5 (depends on 4)

The system for spatio-temporal graph message passing of claim 4, wherein the processor performs message passing between respective nodes based on the sensor type associated with respective nodes.

### Claim 6 (depends on 5)

The system for spatio-temporal graph message passing of claim 5, wherein the processor performs message passing only between respective nodes having the same sensor type.

### Claim 7 (depends on 1)

The system for spatio-temporal graph message passing of claim 1, wherein the processor performs message passing based on multi-layer perceptron (MLP) functions.

### Claim 8 (depends on 1)

The system for spatio-temporal graph message passing of claim 1, wherein the spatio-temporal graph is formulated as a hypergraph neural network (HGNN).

### Claim 9 (depends on 1)

The system for spatio-temporal graph message passing of claim 1, comprising a pose estimator generating a pose estimation based on the graph readout, wherein the first point cloud and the second point cloud include a depth point cloud and a tactile point cloud.

### Claim 10 (depends on 1)

The system for spatio-temporal graph message passing of claim 1, wherein the processor is configured to minimize a loss associated with the spatio-temporal graph neural network based on a derivative loss function or a Gram Matrix loss function.

### Claim 11

A computer-implemented method for spatio-temporal graph message passing, comprising:
generating edges for a spatio-temporal graph, wherein nodes for the spatio-temporal graph are defined by a first point cloud and a second point cloud, wherein the edges are generated based on a proximity between nodes of the spatio-temporal graph, wherein the proximity is defined based on a Euclidean distance or an embedding space distance;
performing message passing between respective nodes based on the proximity to generate updated feature vectors for respective nodes; and
generating a graph readout based on the updated feature vectors.

### Claim 12 (depends on 11)

The computer-implemented method for spatio-temporal graph message passing of claim 11, comprising performing a downstream task based on the graph readout.

### Claim 13 (depends on 11)

The computer-implemented method for spatio-temporal graph message passing of claim 11, wherein the proximity is defined as a Minkowski distance.

### Claim 14 (depends on 11)

The computer-implemented method for spatio-temporal graph message passing of claim 11, wherein the message passing is performed based on multi-layer perceptron (MLP) functions.

### Claim 15 (depends on 11)

The computer-implemented method for spatio-temporal graph message passing of claim 11, wherein the spatio-temporal graph is formulated as a hypergraph neural network (HGNN).

### Claim 16

A system for spatio-temporal graph message passing, comprising:
a memory storing one or more instructions;
a processor executing one or more of the instructions stored on the memory to perform:
generating edges for a spatio-temporal graph, wherein nodes for the spatio-temporal graph are defined by a first point cloud associated with a first sensor type and a second point cloud associated with a second sensor type, wherein the edges are generated based on a proximity between nodes of the spatio-temporal graph, wherein the proximity is defined based on a Euclidean distance or an embedding space distance;
performing message passing between respective nodes based on the sensor type associated with respective nodes and the proximity to generate updated feature vectors for respective nodes; and
generating a graph readout based on the updated feature vectors.

### Claim 17 (depends on 16)

The system for spatio-temporal graph message passing of claim 16, wherein the processor performs a downstream task based on the graph readout.

### Claim 18 (depends on 16)

The system for spatio-temporal graph message passing of claim 16, wherein the proximity is defined as a Minkowski distance.

### Claim 19 (depends on 16)

The system for spatio-temporal graph message passing of claim 16, wherein the processor performs message passing only between respective nodes having the same sensor type.

### Claim 20 (depends on 16)

The system for spatio-temporal graph message passing of claim 16, wherein the message passing is performed based on multi-layer perceptron (MLP) functions.
