Systems and methods for predictive connection selection in a network of moving things, for example including autonomous vehicles
US-2018124631-A1 · May 3, 2018 · US
US10425280B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-10425280-B2 |
| Application number | US-201715785793-A |
| Country | US |
| Kind code | B2 |
| Filing date | Oct 17, 2017 |
| Priority date | Oct 17, 2017 |
| Publication date | Sep 24, 2019 |
| Grant date | Sep 24, 2019 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
A method for determining an optimal laying arrangement of a new infrastructure link for connection from a new site to an existing infrastructure network includes modeling a terrain of a region around and at the new site and the existing infrastructure network near the new site; modeling each factor affecting the laying arrangement as a respective cost function; applying a respective weighting to each of the cost function to determine a life-cycle cost function; and determining, based on the determined life-cycle cost function, an optimized laying arrangement with minimal life-cycle cost from the new site to a connection point in the existing infrastructure network.
Opening claim text (preview).
The invention claimed is: 1. A method for determining an optimal laying arrangement of a new infrastructure link for connection from a new site to an existing infrastructure network, comprising: modeling a terrain of a region around and at the new site and the existing infrastructure network near the new site; modeling each factor affecting the laying arrangement as a respective cost function; applying a respective weighting to each of the cost function to determine a life-cycle cost function; and determining, based on the determined life-cycle cost function, an optimized laying arrangement with minimal life-cycle cost from the new site to a connection point in the existing infrastructure network, wherein the determination of the optimized laying arrangement comprises solving the following optimization equation: min γ ( γ ) = min γ ∫ 0 l ( γ ) h ( X ( s ) ) ds such that γ(A)=X A ; and γ(B)=X B ; where H(γ) is a total life-cycle cost for an infrastructure link, A and B denote two end points of the new infrastructure link, with B being an existing infrastructure link γ i , i=1, 2, . . . , n, given γ 1 , γ 2 , . . . , γ n . 2. The method of claim 1 , wherein the modeling of the terrain comprises modeling the terrain as a closed 2D triangulated manifold. 3. The method of claim 1 , wherein the new infrastructure link comprises a new cable and the existing infrastructure network comprises an existing cable network. 4. The method of claim 3 , wherein the connection point is a branching unit of an existing cable or a cable landing station of the existing cable network. 5. The method of claim 3 , wherein the new cable comprises a telecommunication cable and the existing cable network comprises an existing telecommunication cable network. 6. The method of claim 3 , wherein the new cable comprises a submarine cable and the existing cable network comprises a submarine cable network. 7. The method of claim 1 , wherein the plurality of factor includes environmental factors and human factors. 8. The method of claim 1 , wherein the optimized laying arrangement comprises the optimized laying route. 9. The method of claim 1 , further comprising displaying the optimized laying arrangement on a model of the terrain. 10. The method of claim 1 , further comprising: transforming the optimization equation using Eikonal equation; and applying fast marching method to solve the transformed equation for determination of the optimized laying arrangement. 11. A non-transitory computer readable medium for storing computer instructions that, when executed by one or more processors, causes the one or more processors to perform a method for determining an optimal laying arrangement of a new infrastructure link for connection from a new site to an existing infrastructure network, comprising: modeling a terrain of a region around and at the new site and the existing infrastructure network near the new site; modeling each factor affecting the laying arrangement as a respective cost function; applying a respective weighting to each of the cost function to determine a life-cycle cost function; and determining, based on the determined life-cycle cost function, an optimized laying arrangement with minimal life-cycle cost from the new site to a connection point in the existing infrastructure network, wherein the determination of the optimized laying arrangement comprises solving the following optimization equation: min γ ( γ ) = min γ ∫ 0 l ( γ ) h ( X ( s ) ) ds such that γ(A)=X A ; and γ(B)=X B ; where H(γ) is a total life-cycle cost for an infrastructure link, A and B denote two end points of the new infrastructure link, with B being an existing infrastructure link γ i =1, 2, . . . , n, given γ 1 , γ 2 , . . . , γ n . 12. The non-transitory computer readable medium of claim 11 , wherein the modeling of the terrain comprises modeling the terrain as a closed 2D triangulated manifold. 13. The non-transitory computer readable medium of claim 11 , wherein the new infrastructure link comprises a new cable and the existing infrastructure network comprises an existing cable network. 14. The non-transitory computer readable medium of claim 13 , wherein the connection point is a branching unit of an existing cable or a cable landing station of the existing cable network. 15. The non-transitory computer readable medium of claim 13 , wherein the new cable comprises a telecommunication cable and the existing cable network comprises an existing telecommunication cable network. 16. The non-transitory computer readable medium of claim 13 , wherein the new cable comprises a submarine cable and the existing cable network comprises a submarine cable network. 17. The non-transitory computer readable medium o
Resource planning in a project environment · CPC title
for reduction of network costs (H04L41/0833 takes precedence) · CPC title
involving simulating, designing, planning or modelling of a network · CPC title
Construction · CPC title
using a combination of metrics · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.