Optimal Path Arrangement for Infrastructure Link Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current path planning for submarine cables and other infrastructure link networks is inefficient as it primarily considers point-to-point connections and lateral or diagonal links, failing to account for complex terrain and multiple destination requirements, leading to high construction costs and inadequate risk assessment.
Innovation Solution
A method for determining an optimal path arrangement using a Steiner Minimal Tree (SMT) problem formulation on an irregular 2D manifold in 3D Euclidean space, incorporating laying cost and repair rate functions, with weighting to minimize total cost, and applying the fast marching method to solve for the optimal trunk-and-branch topology.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If point-to-point path planning with lateral or diagonal links is used, then the path selection process is simple, but the total construction cost is high and terrain complexity is not adequately considered
Solution Approach 1:
The patent segments the continuous terrain into discrete geographic locations and connects them through a graph structure. The terrain is divided into manageable nodes and edges, allowing complex path planning to be broken down into discrete optimization steps while considering terrain characteristics at each location.
Solution Approach 2:
The patent transitions from traditional 2D lateral/diagonal link planning to 3D Euclidean space modeling. By representing the terrain as an irregular 2D manifold embedded in 3D space, the system can account for elevation changes and terrain complexity that flat 2D approaches cannot capture, leading to more accurate cost optimization.
2Ease of manufacture
If traditional path planning considering only material and labor costs is used, then the planning process is straightforward, but the total cost including repair rates and risk factors is not minimized
Solution Approach 1:
The patent transforms the path planning problem by changing the cost parameters from simple material and labor costs to a comprehensive cost function that includes terrain-dependent laying costs and repair rates. The cost function C(γ) = ∫₀ᴸ [cₗ(γ(s)) + cᵣ(γ(s))] ds integrates multiple parameters including terrain elevation, slope, and location-specific repair risks, enabling true total cost minimization.
Solution Approach 2:
The patent introduces a Steiner Minimal Tree (SMT) formulation as an intermediary mathematical framework. This SMT approach acts as a mediator between the simple graph representation and the complex cost optimization, providing a structured method to find optimal connection points and paths that minimize total cost while considering all risk factors.
3Device complexity
If conventional path planning not accounting for multiple destination requirements is used, then the path selection is simple, but the network topology optimization is inadequate
Solution Approach 1:
The patent creates a universal graph-based framework that can handle multiple destination requirements simultaneously. The infrastructure link network is designed to accommodate various topology types (point-to-point, hub-and-spoke, mesh) within a single unified model, making the system adaptable to different network design requirements and destination configurations.
Solution Approach 2:
The patent extracts the core optimization problem from the complex multi-destination routing challenge by formulating it as a Steiner Minimal Tree problem. This extraction isolates the essential elements (connection points, paths, costs) from the complexity of multiple destinations, allowing the system to focus on optimizing the fundamental network structure before adding routing complexity.
Data Source
AI summary
A method for determining an optimal path arrangement of an infrastructure link network, and a related system for performing the method. The method includes modelling a geographic terrain having a plurality of geographic locations to be connected with each other via an infrastructure link network; modelling each of a laying cost and a repair rate as a respective function affecting the optimal path arrangement of the infrastructure link network; applying a respective weighting to each of the functions to determine a minimized cost function; and determining, based on the determined minimized cost function, the optimal path arrangement connecting the plurality of geographical locations. The determined optimal path arrangement of the infrastructure link network includes a trunk-and-branch topology with a plurality of infrastructure links and one or more connection points connecting the infrastructure links.