# US 2022/0082388 A1 · Method of determining an optimal route

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

- Number: US 2022/0082388 A1
- Document ID: US20220082388A1
- Status: Published application
- Kind: A1
- Application number: 17/534,183
- Filed: 2021-11-23
- Published: 2022-03-17
- Earliest claimed: 2017-12-07
- Assignees: Maritech Development Limited
- Applicants: Maritech Development Limited
- Inventors: Craig Lucas; Richard White; Eliad Perpinyal; Roy Michael Cockram
- Web page: https://patentgrep.com/patent/US20220082388A1

## CPC

- G01C 21/203: {specially adapted for water-borne vessels}
- G01C 21/005: {with correlation of navigation data from several sources, e.g. map or contour matching (G01C21/30 takes precedence)}
- G01C 21/14: by recording the course traversed by the object (G01C21/16 takes precedence)
- G08G 3/00: Traffic control systems for marine craft (marking of navigational route B63B22/16, B63B51/00)
- G08G 3/02: Anti-collision systems
- G01C: MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY (measuring liquid level G01F; radio navigation, determining distance or velocity by use of propagation effects, e.g. Doppler effects, propagation time, of radio waves, analogous arrangements using other waves G01S)
- G08G: TRAFFIC CONTROL SYSTEMS (guiding railway traffic, ensuring the safety of railway traffic B61L; arrangement of road signs or traffic signals E01F9/00; radar or analogous systems, sonar systems, lidar systems specially adapted for traffic control G01S13/91, G01S15/88, G01S17/88; {radar or analogous systems, sonar systems, lidar systems specially adapted for anti-collision purposes G01S13/93, G01S15/93, G01S17/93})

## Abstract

Disclosed herein is a method of determining an optimal route for a vessel based on vessel traffic data. The method comprises receiving vessel traffic data relating to the movement of each of a plurality of vessels in a geographical region and defining sub-regions within the geographical region in which the vessel traffic data has similar characteristics. The method also comprises determining an optimal route for a vessel between two geographical points using a representation of the geographical region. The representation comprises nodes, and each node is associated with a respective defined sub-region.

## Claims

### Claim 1

A computer-implemented method of determining an optimal route for a first vessel based on vessel traffic data, the first vessel being of a first type and/or having first characteristics, the method comprising:
electronically receiving vessel traffic data relating to the movement of each of a plurality of vessels in a geographical region;
electronically defining sub-regions within the geographical region in which the vessel traffic data has similar characteristics;
electronically producing a representation of the geographical region, the representation comprising nodes joined by edges, each node being associated with a respective defined sub-region, and wherein each edge has a weight calculated based on characteristics of vessel journeys identified using the vessel traffic data; and
electronically determining an optimal route for a vessel between two geographical points using the representation of the geographical region, the representation comprising nodes and the first type and/or the first characteristics of the first vessel.

### Claim 2 (depends on 1)

The method of claim 1, wherein the weights of each edge are blended weights, wherein each blended weight is calculated based on the characteristics of vessel journeys identified using the vessel traffic data and based on live meteorological and/or tidal information.

### Claim 3 (depends on 1)

The method of claim 1, wherein the weights of each edge are blended weights, and wherein each blended weight is calculated based on the characteristics of vessel journeys identified using the vessel traffic data and based on the amount of fuel required to travel along the edge.

### Claim 4 (depends on 1)

The method of claim 1, further comprising joining neighbouring nodes in the representation with edges based on vessel journeys identified using the vessel traffic data.

### Claim 5 (depends on 1)

The method of claim 1, further comprising joining a first and a second node with a plurality of edges, each respective edge of the plurality of edges being created using different respective vessel journeys identified using the vessel traffic data, the different respective vessel journeys being associated with vessels having different characteristics.

### Claim 6 (depends on 1)

The method of claim 1, wherein the nodes are connected by edges each having at least one associated weight, the weights being based on characteristics of vessel journeys identified using the vessel traffic data.

### Claim 7 (depends on 6)

The method of claim 6, the at least one weight being representative of at least one of: the average time taken to travel along the edge; the average amount of fuel required to travel along the edge; the average amount of monetary cost required to travel along the edge; and the number of journeys identified along the edge in the vessel traffic data.

### Claim 8 (depends on 6)

The method of any of claim 6, wherein the weights are blended weights, wherein each blended weight is based on at least two respective types of vessel journey identified in the vessel traffic data, the types of vessel journey being associated with different vessel characteristics.

### Claim 9 (depends on 1)

The method of claim 1, wherein the optimal route is determined using a shortest-path routing algorithm.

### Claim 10 (depends on 1)

The method of claim 1, wherein defining sub-regions within the geographical region in which the vessel traffic data has similar characteristics comprises identifying geographical regions in which variation within the vessel traffic data is below a variation threshold value.

### Claim 11 (depends on 10)

The method of claim 10, further comprising iteratively considering each of a number of proposed sub-regions and, for each proposed sub-region:
determining whether the variation of vessel traffic data associated with the proposed sub-region is above a threshold variation value and, if it is, splitting the proposed sub-region into a plurality of smaller proposed sub-regions.

### Claim 12 (depends on 11)

The method of claim 11, wherein the sub-regions in which the vessel traffic data has similar characteristics are defined as those proposed sub-regions in which variation of vessel traffic data is not above the threshold variation value.

### Claim 13 (depends on 1)

The method of claim 1, wherein the vessel traffic data comprises data relating to the speeds of each of the plurality of vessels.

### Claim 14 (depends on 1)

The method of claim 1, wherein defining sub-regions within the geographical region in which the current vessel traffic data has similar characteristics comprises identifying regions in which variation within vessel speed data is below a threshold value.

### Claim 15

A computer-implemented method of producing a representation of a geographical region for use in determining, based on vessel traffic data, an optimal route for a vessel between two geographical points, the first vessel being of a first type and/or having first characteristics, the method comprising:
electronically receiving vessel traffic data relating to the movement of each of a plurality of vessels in a geographical region;
electronically defining sub-regions within the geographical region in which the vessel traffic data has similar characteristics; and
electronically producing the representation of the geographical region, the representation comprising nodes joined by edges, each node being associated with a respective defined sub-region, each edge having a weight, and wherein each weight is calculated based on characteristics of vessel journeys identified using the vessel traffic data.

### Claim 16

A non-transitory computer readable medium comprising computer-executable instructions which, when executed by a processor, cause the processor to perform a method of producing a representation of a geographical region for use in determining, based on vessel traffic data, an optimal route for a vessel between two geographical points, the first vessel being of a first type and/or having first characteristics, the method comprising:
electronically receiving vessel traffic data relating to the movement of each of a plurality of vessels in a geographical region;
electronically defining sub-regions within the geographical region in which the vessel traffic data has similar characteristics;
electronically producing the representation of the geographical region, the representation comprising nodes joined by edges, each node being associated with a respective defined sub-region, each edge having a weight, and wherein each weight is calculated based on characteristics of vessel journeys identified using the vessel traffic data.

### Claim 17 (depends on 15)

The non-transitory computer readable medium of claim 15, wherein the computer readable medium further comprises computer executable instructions which, when executed by the processor, cause the processor to determine an optimal route for the vessel between the two geographical points using the representation of the geographical region.
