# US 2026/0093980 A1 · Method and Apparatus for Determining the Physical State of an Object

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

- Number: US 2026/0093980 A1
- Document ID: US20260093980A1
- Status: Published application
- Kind: A1
- Application number: 19/342,597
- Filed: 2025-09-28
- Published: 2026-04-02
- Earliest claimed: 2024-09-30
- Assignees: Robert Bosch GmbH
- Applicants: Robert Bosch GmbH
- Inventors: Kaixuan Zhang; Jianing Huang; Youjia Wu; Ze Cheng
- Web page: https://patentgrep.com/patent/US20260093980A1

## CPC

- G06N 3/08: Learning methods
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS

## Abstract

A computer-implemented method for generating training data includes (i) generating a basic shape, (ii) configuring the boundary conditions associated with a first partial differential equation (PDE) for the boundary of the basic shape, and (iii) determining a solution of the first PDE for the basic shape based on the basic shape and the boundary conditions, wherein the solution represents the physical state of an object having the basic shape. The training data is obtained based on the basic shape, the boundary conditions, and the solution.

## Claims

### Claim 1

A computer-implemented method for generating training data, comprising:
generating a basic shape;
configuring the boundary conditions associated with a first partial differential equation (PDE) for the boundary of the basic shape; and
determining a solution of the first PDE for the basic shape based on the basic shape and the boundary conditions, wherein the solution represents the physical state of an object having the basic shape,
wherein the training data is obtained based on the basic shape, the boundary conditions, and the solution.

### Claim 2 (depends on 1)

The computer-implemented method according to claim 1, wherein the basic shape is constrained to be within a predetermined range.

### Claim 3 (depends on 1)

The computer-implemented method according to claim 1, wherein the basic shape comprises a planar polygon with no self-intersections and no holes.

### Claim 4 (depends on 3)

The computer-implemented method according to claim 3, wherein the planar polygon comprises n vertices and 3≤n≤12.

### Claim 5 (depends on 1)

The computer-implemented method according to claim 1, wherein the boundary conditions comprise a plurality of types of boundary conditions, and wherein configuring the boundary conditions associated with the first PDE for the boundary of the basic shape comprises:
partitioning the boundary of the basic shape into a plurality of parts; and
configuring one type of boundary condition from among the plurality of types of boundary conditions for each of the plurality of parts.

### Claim 6 (depends on 5)

The computer-implemented method according to claim 5, wherein the boundary conditions comprise a first type and a second type of boundary conditions, and wherein configuring the boundary conditions associated with the first PDE for the boundary of the basic shape comprises:
partitioning the boundary of the basic shape into a first part and a second part; and
configuring the first type of boundary condition for the first part and the second type of condition for the second part, wherein the first type of boundary condition is the Dirichlet boundary condition and the second type of boundary condition is the Neumann boundary condition.

### Claim 7 (depends on 1)

The computer-implemented method according to claim 1, wherein the value of the boundary condition comprises a random value within a predetermined range.

### Claim 8 (depends on 1)

The computer-implemented method according to claim 1, further comprising: configuring, for the basic shape, a PDE parameter function associated with the first PDE, the PDE parameter function comprising coefficients, and/or source terms associated with the first PDE, wherein determining a solution of the first PDE for the basic shape comprises: determining a solution of the first PDE for the basic shape based on the basic shape, the boundary conditions, and the PDE parameter function.

### Claim 9 (depends on 8)

The computer-implemented method according to claim 8, wherein the value of the PDE parameter function comprises a random value within a predetermined range.

### Claim 10 (depends on 8)

The computer-implemented method according to claim 8, further comprising:
performing data augmentation based on at least one of the basic shape, the value of the boundary condition, the PDE parameter function, and the solution to correspondingly obtain at least one of a data-augmented basic shape, a data-augmented value of the boundary condition, a data-augmented PDE parameter function, and a data-augmented solution; and
the training data is based on at least one of a data-augmented basic shape, a value of a data-augmented boundary condition, a data-augmented PDE parameter function, and a data-augmented solution and is obtained based on the basic shape, the boundary conditions, the PDE parameter function, and the solution.

### Claim 11 (depends on 10)

The computer-implemented method according to claim 10, wherein performing data augmentation based on at least one of the basic shape, the value of the boundary condition, the PDE parameter function, and the solution comprises performing at least one of:
performing spatial translation, spatial scaling, and/or spatial rotation on the basic shape; and
performing value shifting and/or value scaling on at least one of the value of the boundary condition, the PDE parameter function, and the solution.

### Claim 12 (depends on 1)

The computer-implemented method according to claim 1, wherein the solution represents the physical state of an object having the basic shape over time.

### Claim 13 (depends on 1)

A computer-implemented method for training a neural network (NN) model for determining the physical state of an object having a shape, comprising:
predicting, by the NN model, a solution for a basic shape in the training data based on the training data generated by the method according to claim 1, wherein the solution represents the physical state of an object having the basic shape;
determining a loss based on a solution predicted by the NN model and a solution in the training data; and
updating a learnable parameter of the NN model based on the loss.

### Claim 14 (depends on 13)

A computer-implemented method for determining the physical state of an object having a shape, comprising:
partitioning the shape of the object into a plurality of sub-shapes, wherein a full set of a plurality of sub-regions corresponding to the plurality of sub-shapes covers the complete area of the shape;
obtaining, based on the global boundary conditions for the shape and the plurality of sub-shapes, a local solution for each of the plurality of sub-shapes using a neural network (NN) model trained by the computer-implemented method according to claim 13, the local solution for each sub-shape representing a local physical state of the object having the sub-shape; and
obtaining a global solution for the shape based on the local solution for each of the plurality of sub-shapes, the global solution for the shape representing the physical state of the object.

### Claim 15

An apparatus for generating training data, comprising:
a shape generation module that generates a basic shape;
a boundary condition module that configures the boundary conditions associated with a first partial differential equation (PDE) for the boundary of the basic shape;
a solution module that determines a solution of the first PDE for the basic shape based on the basic shape and the boundary conditions, wherein the solution represents the physical state of an object having the basic shape; and
training data obtained based on the basic shape, the boundary conditions, and the solution.

### Claim 16 (depends on 1)

An apparatus for training a neural network (NN) model for determining the physical state of an object having a shape, comprising:
a neutral network (NN) model that predicts a solution for a basic shape based on the basic shape and boundary conditions in the training data generated by the method according to claim 1, wherein the solution represents the physical state of an object having the basic shape;
a loss module that determines a loss based on a solution predicted by the NN model and a solution in the training data; and
an update module that updates a learnable parameter of the NN model based on the loss.

### Claim 17 (depends on 13)

An apparatus for determining the physical state of an object having a shape, comprising:
a partitioning module that partitions the shape of the object into a plurality of sub-shapes, wherein a full set of a plurality of sub-regions corresponding to the plurality of sub-shapes covers the complete area of the shape;
a local solution model that obtains, based on the global boundary conditions for the shape and the plurality of sub-shapes, a local solution for each of the plurality of sub-shapes using a neural network (NN) model trained by the computer-implemented method according to claim 13, the local solution for each sub-shape representing a local physical state of the object having the sub-shape; and
a global solution model that obtains a global solution for the shape based on the local solution for each of the plurality of sub-shapes, the global solution for the shape representing the physical state of the object.

### Claim 18 (depends on 1)

A processing apparatus, comprising:
one or more processors; and
one or more memories, the memories having computer-executable instructions stored thereon, and the instructions, when run by the one or more processors, perform the operations of claim 1.

### Claim 19 (depends on 1)

A machine-readable storage medium having executable instructions stored thereon, the instructions, when executed, causing one or more processors to perform the method according to claim 1.

### Claim 20 (depends on 1)

A computer program product comprising executable instructions that, when executed, cause one or more processors to perform the method according to claim 1.
