Path Routing in Multilayer Structures
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional algorithms for calculating optimal paths in multilayer structures become complex and time-consuming as the number of layers, start points, and end points increase, necessitating an efficient method for path routing in complex multilayer structures.
Innovation Solution
A method involving a computing device that selects start and end points within a circular frame, generates a connectivity graph by dividing the frame into regions, and connects these points based on calculated costs using edge point connection lines, avoiding intersections and optimizing path calculation.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If conventional algorithms (e.g., Dijkstra) are used to calculate optimal paths in multilayer structures, then path routing can be performed, but computational complexity and calculation time increase significantly as the number of layers, start points, and end points increase
Solution Approach 1:
The patent divides the circular frame into multiple regions and creates a connectivity graph where nodes represent regions and edges represent possible connections. This segmentation transforms the complex multilayer path problem into a simplified graph traversal problem, reducing computational complexity while maintaining routing accuracy
Solution Approach 2:
The patent transforms the three-dimensional multilayer structure into a two-dimensional circular frame representation. By mapping layers and connections onto a circular geometry with radial and angular coordinates, the problem becomes more tractable and enables efficient graph-based pathfinding algorithms
2Adaptability or versatility
If the number of start points and end points increases in multilayer structures, then more comprehensive path routing is achieved, but the time required to derive optimal paths increases
Solution Approach 1:
The patent pre-generates the connectivity graph representing all possible connections between regions in the circular frame before performing pathfinding. This preliminary structuring of the search space enables rapid query processing when multiple start and end points need to be routed, as the graph topology is already established and optimized
Data Source
AI summary
A method for path routing according to an embodiment of the present disclosure may include selecting a first start point and a first end point with which path routing is performed in a circular frame generated by connecting all points included in one or more start point sets included in a layer, one or more end point sets paired with the start point set, and one or more edge point pair sets to one closed curve, generating a connectivity graph by connecting edge points included in one or more nodes corresponding to segments obtained by dividing the circular frame into one or more regions, and connecting the first start point and the first end point based on a cost for connecting the first start point and the first end point calculated using the connectivity graph.