# US 11,215,458 B2 · 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 11,215,458 B2
- Document ID: US11215458B2
- Status: Granted
- Kind: B2
- Application number: 16/213,977
- Filed: 2018-12-07
- Published: 2019-06-13
- Granted: 2022-01-04
- 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/US11215458B2

## 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 current vessel traffic data, the first vessel being of a first type and/or having first characteristics, the method comprising:
electronically receiving current vessel traffic data relating to a movement of each of a plurality of vessels in a geographical region;
electronically defining sub-regions within the geographical region in which the current vessel traffic data has similar characteristics, 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;
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, wherein at least a first node and a second node are joined by a plurality of edges, each edge of the plurality of edges being created using a different group of vessel journeys identified using the current vessel traffic data, each group of vessel journeys being associated with a different vessel type or vessel characteristic; and
electronically determining the optimal route for the first vessel between two geographical points using the representation of the geographical region and the first type and/or the first characteristics of the first vessel.

### Claim 2 (depends on 1)

The computer-implemented method of claim 1, further comprising electronically assigning nodes to the representation.

### Claim 3 (depends on 1)

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

### Claim 4 (depends on 1)

The computer-implemented 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 5 (depends on 4)

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

### Claim 6 (depends on 4)

The computer-implemented method of claim 4, 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 7 (depends on 1)

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

### Claim 8 (depends on 1)

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

### Claim 9 (depends on 8)

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

### Claim 10 (depends on 1)

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

### Claim 11

A computer-implemented method of producing a representation of a geographical region for use in determining, based on current vessel traffic data, an optimal route for a first vessel between two geographical points, the first vessel being of a first type and/or having first characteristics, the method comprising:
electronically receiving the current vessel traffic data relating to movement of each of a plurality of vessels in the geographical region;
electronically defining sub-regions within the geographical region in which the current vessel traffic data has similar characteristics, 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; 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, wherein at least a first node and a second node are joined by a plurality of edges, each edge of the plurality of edges being created using a different group of vessel journeys identified using the current vessel traffic data, each group of vessel journeys being associated with a different vessel type or vessel characteristic.

### Claim 12

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 current vessel traffic data, an optimal route for a first vessel between two geographical points, the first vessel being of a first type and/or having first characteristics, the method comprising:
electronically receiving the current vessel traffic data relating to movement of each of a plurality of vessels in the geographical region;
electronically defining sub-regions within the geographical region in which the current vessel traffic data has similar characteristics, 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; 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, wherein at least a first node and a second node are joined by a plurality of edges, each edge of the plurality of edges being created using a different group of vessel journeys identified using the current vessel traffic data, each group of vessel journeys being associated with a different vessel type or vessel characteristic.

### Claim 13 (depends on 12)

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