# US 2025/0220415 A1 · Method and apparatus for generating sub-trajectories for a trajectory

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

- Number: US 2025/0220415 A1
- Document ID: US20250220415A1
- Status: Published application
- Kind: A1
- Application number: 18/399,066
- Filed: 2023-12-28
- Published: 2025-07-03
- Earliest claimed: 2023-12-28
- Assignees: HERE Global B.V.
- Applicants: HERE Global B.V.
- Inventors: Elena VIDYAKINA; Elena MUMFORD; Johannes BRAESE
- Web page: https://patentgrep.com/patent/US20250220415A1

## CPC

- H04W 12/02: Protecting privacy or anonymity, e.g. protecting personally identifiable information [PII]
- B60R 25/32: of vehicle dynamic parameters, e.g. speed or acceleration
- H04W 4/02: Services making use of location information
- H04W 4/40: for vehicles, e.g. vehicle-to-pedestrians [V2P]
- H04W 12/122: Counter-measures against attacks; Protection against rogue devices
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)
- B60R: VEHICLES, VEHICLE FITTINGS, OR VEHICLE PARTS, NOT OTHERWISE PROVIDED FOR

## Abstract

An apparatus and a method for generating sub-trajectories for a trajectory are disclosed. The method includes retrieving trajectory data comprising a plurality of data points defining a trajectory and iteratively executing a set of operations until a termination condition is met. The set of operations include selecting an observation point associated with the plurality of data points and calculating a set of visible points comprising one or more data points from the plurality of data points associated with the observation point based on a predefined visibility context criterion. The method further includes identifying a changing point from the plurality of data points based on the iterative execution of the set of operations, and generating a sub-trajectory for the trajectory such that the changing point indicates a starting point of the sub-trajectory.

## Claims

### Claim 1

A method, comprising:
retrieving trajectory data comprising a plurality of data points defining a trajectory;
iteratively executing a set of operations until a termination condition is met, the set of operations comprising:
selecting an observation point associated with one of the plurality of data points, and
calculating a set of visible points comprising one or more data points from the plurality of data points, such that the set of visible points are associated with the observation point based on a predefined visibility context criterion;
identifying a changing point from the plurality of data points based on the iterative execution of the set of operations until the termination condition is met; and
generating a sub-trajectory for the trajectory such that the changing point indicates a starting point of the sub-trajectory.

### Claim 2 (depends on 1)

The method of claim 1, wherein the changing point is identified based on a comparison between location information of the changing point and location information of a corresponding previous data point from the plurality of data points.

### Claim 3 (depends on 1)

The method of claim 1, wherein the visibility context criterion is predefined based on map data associated with a location of the trajectory.

### Claim 4 (depends on 1)

The method of claim 1, further comprising:
processing the sub-trajectory to introduce a gap overlapping with the changing point; and
outputting the processed sub-trajectory in place of a part of the trajectory.

### Claim 5 (depends on 4)

The method of claim 4, further comprising:
estimating a data leak risk value for the sub-trajectory based on a length of the gap, a length of the processed sub-trajectory and a length of the sub-trajectory; and
outputting the processed sub-trajectory in place of the part of the trajectory when the estimated data leak risk value is less than a privacy threshold value.

### Claim 6 (depends on 4)

The method of claim 4, further comprising:
processing the sub-trajectory from the trajectory based on one or more anonymization parameters, wherein the one or more anonymization parameters include at least the changing point, and a gap length of the gap.

### Claim 7 (depends on 1)

The method of claim 1, further comprising:
identifying one or more changing points from the plurality of data points based on a set of visible points for each of the plurality of data points, wherein the set of visible points for each of the plurality of data points are determined based on the iterative execution of the set of operations until the termination condition is met; and
generating a plurality of sub-trajectories from the trajectory such that the one or more changing points indicate a starting point of a corresponding sub-trajectory.

### Claim 8 (depends on 7)

The method of claim 7, further comprising:
processing the plurality of sub-trajectories to introduce a gap overlapping with at least one changing point of the plurality of sub-trajectories; and
outputting the processed plurality of sub-trajectories in place of the trajectory.

### Claim 9 (depends on 8)

The method of claim 8, wherein when a minimum number of the plurality of sub-trajectories to generate and a minimum gap length for the gap are predefined, the method further comprises:
processing the plurality of sub-trajectories to introduce the gap overlapping with at least one changing point such that a number of changing points not replaced with the gap is minimized.

### Claim 10

An apparatus comprising at least one processor and at least one non-transitory memory including computer program code instructions, the computer program code instructions configured to, when executed, cause the apparatus to:
retrieve trajectory data comprising a plurality of data points defining a trajectory;
iteratively execute a set of operations until a termination condition is met, the set of operations comprising:
selecting an observation point associated with one of the plurality of data points, and
calculating a set of visible points comprising one or more data points from the plurality of data points, such that the set of visible points are associated with the observation point based on a predefined visibility context criterion;
identify a changing point from the plurality of data points based on the iterative execution of the set of operations until the termination condition is met; and
generate a sub-trajectory for the trajectory such that the changing point indicates a starting point of the sub-trajectory.

### Claim 11 (depends on 10)

The apparatus of claim 10, wherein the changing point is identified based on a comparison between location information of the changing point and location information of a corresponding previous data point from the plurality of data points.

### Claim 12 (depends on 10)

The apparatus of claim 10, wherein the visibility context criterion is predefined based on map data associated with a location of the trajectory.

### Claim 13 (depends on 10)

The apparatus of claim 10, wherein the computer program code instructions are further configured to cause the apparatus to:
process the sub-trajectory to introduce a gap overlapping with the changing point; and
output the processed sub-trajectory in place of a part of the trajectory.

### Claim 14 (depends on 13)

The apparatus of claim 13, wherein the computer program code instructions are further configured to cause the apparatus to:
estimate a data leak risk value for the sub-trajectory based on a length of the gap, a length of the processed sub-trajectory and a length of the sub-trajectory; and
output the processed sub-trajectory in place of the part of the trajectory when the estimated data leak risk value is less than a privacy threshold value.

### Claim 15 (depends on 13)

The apparatus of claim 13, wherein the computer program code instructions are further configured to cause the apparatus to:
process the sub-trajectory from the trajectory based on one or more anonymization parameters, wherein the one or more anonymization parameters include at least the changing point, and a gap length of the gap.

### Claim 16 (depends on 10)

The apparatus of claim 10, wherein the computer program code instructions are further configured to cause the apparatus to:
identify one or more changing points from the plurality of data points based on a set of visible points for each of the plurality of data points, wherein the set of visible points for each of the plurality of data points are calculated based on the iterative execution of the set of operations until the termination condition is met; and
generate a plurality of sub-trajectories from the trajectory such that the one or more changing points indicate a starting point of a corresponding sub-trajectory.

### Claim 17 (depends on 16)

The apparatus of claim 16, wherein the computer program code instructions are further configured to cause the apparatus to:
process the plurality of sub-trajectories to introduce a gap overlapping with the one or more changing points of the plurality of sub-trajectories; and
output the processed plurality of sub-trajectories in place of the trajectory.

### Claim 18 (depends on 16)

The apparatus of claim 16, wherein when a minimum number of the plurality of sub-trajectories to generate and a minimum gap length for the gap are predefined, the computer program code instructions are further configured to cause the apparatus to:
process the plurality of sub-trajectories to introduce the gap overlapping with at least one changing point such that a number of changing points not replaced with the gap is minimized.

### Claim 19

A non-transitory computer-readable storage medium having computer program code instructions stored therein, the computer program code instructions, when executed by at least one processor, cause the at least one processor to:
retrieve trajectory data comprising a plurality of data points defining a trajectory;
iteratively execute a set of operations until a termination condition is met, the set of operations comprising:
selecting an observation point associated with one of the plurality of data points, and
calculating a set of visible points comprising one or more data points from the plurality of data points, such that the set of visible points are associated with the observation point based on a predefined visibility context criterion;
identify a changing point from the plurality of data points based on the iterative execution of the set of operations until the termination condition is met; and
generate a sub-trajectory for the trajectory such that the changing point indicates a starting point of the sub-trajectory.

### Claim 20 (depends on 19)

The non-transitory computer-readable storage medium of claim 19, wherein the computer program code instructions, when executed by the at least one processor, cause the at least one processor to:
process the sub-trajectory to introduce a gap overlapping with the changing point; and
output the processed sub-trajectory in place of a part of the trajectory.
