Infrastructure Path Curvature Planning for Submarine Cable Laying
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing infrastructure path planning methods, particularly for submarine cables, fail to adequately address curvature constraints and maneuvering capabilities, leading to suboptimal paths that require manual adjustments and neglect crucial bending limitations.
Innovation Solution
A computer-implemented method that modifies path portions exceeding turning limits by replacing them with curved segments, such as circular arcs, while considering geographic and prohibited regions, ensuring compliance with bending stiffness and vessel maneuverability constraints.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Length of moving object
If a straight path is used for infrastructure arrangement, then the path length is minimized, but the turning radius constraint cannot be satisfied
Solution Approach 1:
The patent applies curvature by replacing sharp turns in the path with circular arc segments that have radii satisfying the turning radius constraint. The path planning algorithm generates paths composed of straight line segments and circular arcs, ensuring that all turns meet the minimum radius requirement while keeping the overall path length close to optimal.
2Ease of manufacture
If path planning considers turning limits, then the infrastructure can be properly arranged, but the path planning complexity increases
Solution Approach 1:
The patent segments the path into discrete components: straight line segments and circular arc segments. This segmentation allows the path planning algorithm to work with a finite set of path elements, making the planning process more manageable. The algorithm selects and sequences these segments to satisfy turning constraints while maintaining path efficiency.
Solution Approach 2:
By incorporating circular arc segments with predetermined radii into the path planning algorithm, the patent transforms the continuous path optimization problem into a discrete selection problem among predefined path elements, reducing computational complexity while ensuring constraint satisfaction.
3Reliability
If manual adjustments are made to paths exceeding turning limits, then the turning constraint can be satisfied, but the time and effort required increases
Solution Approach 1:
The patent performs preliminary path planning that automatically incorporates turning radius constraints, generating feasible paths before any manual intervention is needed. The algorithm pre-calculates paths using circular arc segments with appropriate radii, eliminating the need for subsequent manual adjustments and saving significant time and effort.
Solution Approach 2:
The path planning system is self-sufficient in satisfying turning constraints through its algorithmic generation of paths with appropriate curvature. The system automatically ensures constraint compliance without requiring external manual intervention, making the path planning process autonomous and efficient.
Data Source
AI summary
A computer-implemented method for determining an infrastructure arrangement path. The method includes obtaining a path for arranging an infrastructure from a first geographic location to a second geographic location in a geographic region, determining that the path comprises a first path portion that defines a turn exceeding a turning limit associated with the infrastructure, and modifying the first path portion based on the turning limit to obtain a modified first path portion. The modified first path portion defines a modified turn not exceeding the turning limit and less sharp than the turn. The method further includes obtaining, based on the modified first path portion, a modified path for arranging the infrastructure from the first geographic location to the second geographic location.