US 12,587,465 B2 · Method and system for submarine cable path planning

Abstract

A computer-implemented method for ultra-long distance path planning includes (a) decomposing a target area into two initial sub-domains, the target area covering a path from a starting point to an end point, at an initial resolution along a direction connecting the starting point to the end point, (b) executing a Fast Marching Method (FMM) in parallel in the two initial sub-domains to obtain an initial path connecting the starting point to the end point, (c) decomposing an area enclosing the initial path into a plurality of subsequent sub-domains at a resolution higher than the initial resolution, wherein the area enclosing the initial path is decomposed aligned with the direction connecting the starting point to the end point, and (d) executing the FMM in parallel in all the sub-domains to obtain an optimal path connecting the starting point and the end point.

Claims22

Dependent claims

A computer-implemented method for ultra-long distance path planning, comprising:

(a) decomposing a target area into two initial sub-domains, the target area covering a path from a starting point to an end point, at an initial resolution along a direction connecting the starting point to the end point;
(b) executing a Fast Marching Method (FMM) in parallel in the two initial sub-domains to obtain an initial path connecting the starting point to the end point;
(c) decomposing an area enclosing the initial path into a plurality of subsequent sub-domains at a resolution higher than the initial resolution, wherein the area enclosing the initial path is decomposed aligned with the direction connecting the starting point to the end point;
(d) executing the FMM in parallel in all the sub-domains to obtain an optimal path connecting the starting point and the end point.

1 more element

A computer-implemented method for submarine cable path planning, comprising:

(a) initializing decomposition index k=1 and assigning an initial resolution to a target area T covering a path from a starting point to an end point;
(b) decomposing the target area T into two initial sub-domains along a direction connecting the starting point to the end point;
(c) executing a Fast Marching Method (FMM) in parallel from the starting point for each sub-domain to obtain an initial cable path;
(d) increasing the decomposition index k=k+1, and identifying two decomposition lines
l
1
k
and
l
2
k
parallel to the direction connecting the starting point to the endpoint and enclosing the initial cable path, wherein the target area is divided into an area
T
l
1
k
⁢
l
2
k
between the two decomposition lines
l
1
k
and
l
2
k
,
and two sub-domains
T
l
1
k
and
T
l
2
k
outside the decomposition lines
l
1
k
and
l
2
k
;
(e) increasing the resolution for the area
T
l
1
k
⁢
l
2
k
between the two decomposition lines
l
1
k
and
l
2
k
,
and decomposing the area
T
l
1
k
⁢
l
2
k
into 2k-1 sub-domains
(
T
l
1
k
⁢
l
3
k
,
T
l
3
k
⁢
l
4
k
,
…
,
T
l
3
+
2
k
-
1
-
1
k
⁢
l
2
k
)
,
aligned with the direction connecting the starting point to the end point;
(f) assigning the 2k-1 sub-domains in the area
T
l
1
k
⁢
l
2
k
along with the two sub-domains
T
l
1
k
and
T
l
2
k
outside the decomposition lines
l
1
k
and
l
2
k
to 2k to 2k-1+2 threads to execute the FMM in parallel for all the sub-domains to obtain an optimal cable path;
(g) reiterating the steps (d) to (f) until the area
T
l
1
k
⁢
l
2
k
achieves the highest possible data resolution, or the total number of sub-domains for the next decomposition 2k+2 surpasses a predetermined maximum number of available threads.

150 more elements

Dependencies are inferred from the claim text.

Method and system for submarine cable path planning

Life of this patent

Method and system for submarine cable path planning

Life of this patent

Abstract

Claims22