# US 2026/0099640 A1 · Geospatial analysis of co-traveling moving entities using model

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

- Number: US 2026/0099640 A1
- Document ID: US20260099640A1
- Status: Published application
- Kind: A1
- Application number: 19/081,721
- Filed: 2025-03-17
- Published: 2026-04-09
- Earliest claimed: 2024-10-04
- Assignees: Lovelace AI Inc.
- Applicants: Lovelace AI Inc.
- Inventors: John Wong; Andrew W. Moore
- Web page: https://patentgrep.com/patent/US20260099640A1

## CPC

- G06F 30/20: Design optimisation, verification or simulation (optimisation, verification or simulation of circuit designs G06F30/30)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Various example embodiments described herein provide for geospatial analysis of co-traveling moving entities (or co-traveling moving objects) using one or more models. In particular, some embodiments provide a system that implements a non-probabilistic model approach for geospatial analysis of co-traveling moving entities, where the system uses an algorithm to search for trajectories of moving entities that go near a query (e.g., selected or targeted moving entity of interest), and then scores those trajectories with a scoring function that can reward co-occurrence over multiple sightings (e.g., observation points), which can favor co-occurrences where the moving entities seem to be moving together.

## Claims

### Claim 1

A system for analyzing geospatial moving entities, the system comprising:
a memory storing instructions; and
a hardware processor operatively coupled to the memory, the instructions when executed by the hardware processor causing the hardware processor to perform operations comprising:
accessing trajectory data for a plurality of moving entities;
selecting a query moving entity from the plurality of moving entities;
determining a set of trajectories for a set of moving entities in the plurality of moving entities where each single trajectory in the set of trajectories is near a trajectory of the query moving entity;
determining a set of trajectory scores for the set of trajectories, the determining of the set of trajectory scores comprising scoring each individual trajectory in the set of trajectories using a scoring function that evaluates, over multiple observations, co-occurrence of the query moving entity with an individual moving entity associated with the individual trajectory;
determining, from the set of moving entities, a set of co-traveling moving entities that co-travel with the query moving entity, the determining of the set of co-traveling moving entities being based on the set of trajectory scores; and
performing an intelligence analysis based on the set of co-traveling moving entities.

### Claim 2 (depends on 1)

The system of claim 1, wherein the query moving entity comprises a rogue ship, and wherein the intelligence analysis comprises identifying one or more other moving entities co-traveling with the rogue ship.

### Claim 3 (depends on 1)

The system of claim 1, wherein the determining of the set of trajectories for the set of moving entities comprises:
determining that a select trajectory of a select moving entity in the set of moving entities is near the query moving entity in response to at least one movement of the select trajectory being within a fixed radius from the query moving entity at a given time instance.

### Claim 4 (depends on 3)

The system of claim 3, wherein the fixed radius is adjustable based on a moving entity type of the query moving entity.

### Claim 5 (depends on 4)

The system of claim 4, wherein the fixed radius is set to 10 km when the query moving entity comprises a ship.

### Claim 6 (depends on 4)

The system of claim 4, wherein the fixed radius is set to 0.01° when the query moving entity comprises a transponder.

### Claim 7 (depends on 1)

The system of claim 1, wherein the scoring of the individual trajectory in the set of trajectories using the scoring function comprises:
using a non-probabilistic model that calculates a minimum weighted sum squared errors between positions of the query moving entity and the individual moving entity associated with the individual trajectory.

### Claim 8 (depends on 7)

The system of claim 7, wherein the non-probabilistic model is configured to apply a weighting factor based on a distance traveled by either the query moving entity or the individual moving entity during a sub-voyage, sub-voyage comprising a time-consecutive subsequence of proximities in a voyage.

### Claim 9 (depends on 1)

The system of claim 1, wherein the scoring of the individual trajectory in the set of trajectories using the scoring function comprises:
using a probabilistic model that captures a likelihood of observations about relative directions and speeds of moving entities.

### Claim 10 (depends on 9)

The system of claim 9, wherein the probabilistic model is configured to combine observations using an exponential model with one or more features, the one or more features comprising at least one of:
squared error between positions of moving entities;
cosine distance between movement lines of moving entities;
difference between speeds of moving entities; or
speed of moving entities.

### Claim 11 (depends on 10)

The system of claim 10, wherein at least one feature of the one or more features follows a Gaussian distribution.

### Claim 12 (depends on 9)

The system of claim 9, wherein the probabilistic model is configured to apply a weighting factor that assigns more weight to movements over long time intervals compared to movements over short time intervals.

### Claim 13 (depends on 1)

The system of claim 1, wherein the scoring of the individual trajectory in the set of trajectories using the scoring function comprises:
using a hidden semi-Markov model to identify discontiguous co-travels between the query moving entity and the individual moving entity associated with the individual trajectory.

### Claim 14 (depends on 13)

The system of claim 13, wherein the hidden semi-Markov model uses a scoring function based on a log-odds ratio of a probability of a most likely state sequence divided by a probability of non-co-travel.

### Claim 15 (depends on 1)

The system of claim 1, wherein the operations comprise:
prior to performing the intelligence analysis based on the set of co-traveling moving entities, applying a post-filter to the set of co-traveling moving entities based on one or more of:
rank of trajectories;
distance traveled;
time spent co-traveling; and
score normalized by co-travel time.

### Claim 16 (depends on 1)

The system of claim 1, wherein the query moving entity comprises one of a ship, an automotive vehicle, an aircraft, or a transponder.

### Claim 17

A machine-storage medium comprising instructions that, when executed by a hardware processor of a device, cause the device to perform operations comprising:
accessing trajectory data for a plurality of moving entities;
selecting a query moving entity from the plurality of moving entities;
determining a set of trajectories for a set of moving entities in the plurality of moving entities where each single trajectory in the set of trajectories is near a trajectory of the query moving entity;
determining a set of trajectory scores for the set of trajectories, the determining of the set of trajectory scores comprising scoring each individual trajectory in the set of trajectories using a scoring function that evaluates, over multiple observations, co-occurrence of the query moving entity with an individual moving entity associated with the individual trajectory;
determining, from the set of moving entities, a set of co-traveling moving entities that co-travel with the query moving entity, the determining of the set of co-traveling moving entities being based on the set of trajectory scores; and
performing an intelligence analysis based on the set of co-traveling moving entities.

### Claim 18 (depends on 17)

The machine-storage medium of claim 17, wherein the query moving entity comprises a rogue ship, and wherein the intelligence analysis comprises identifying one or more other moving entities co-traveling with the rogue ship.

### Claim 19 (depends on 17)

The machine-storage medium of claim 17, wherein the determining of the set of trajectories for the set of moving entities comprises:
determining that a select trajectory of a select moving entity in the set of moving entities is near the query moving entity in response to at least one movement of the select trajectory being within a fixed radius from the query moving entity at a given time instance.

### Claim 20

A method comprising:
accessing, by one or more hardware processors, trajectory data for a plurality of moving entities;
selecting, by the one or more hardware processors, a query moving entity from the plurality of moving entities;
determining, by the one or more hardware processors, a set of trajectories for a set of moving entities in the plurality of moving entities where each single trajectory in the set of trajectories is near a trajectory of the query moving entity;
determining, by the one or more hardware processors, a set of trajectory scores for the set of trajectories, the determining of the set of trajectory scores comprising scoring each individual trajectory in the set of trajectories using a scoring function that evaluates, over multiple observations, co-occurrence of the query moving entity with an individual moving entity associated with the individual trajectory;
determining, by the one or more hardware processors and from the set of moving entities, a set of co-traveling moving entities that co-travel with the query moving entity, the determining of the set of co-traveling moving entities being based on the set of trajectory scores; and
performing, by the one or more hardware processors, an intelligence analysis based on the set of co-traveling moving entities.
