Directional Grid Point Routing Storage for PLC Efficiency
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The existing automatic routing systems for PLCs face efficiency issues due to the complexity of the block set, which increases storage space and traversal times, leading to a drop in routing speed and efficiency.
Innovation Solution
A routing storage structure based on directional grid points, utilizing a grid matrix with N×M grid points and modules for acquiring and setting grid identifiers, allows for efficient routing by determining whether grid points belong to blocks or routes, reducing the impact of block set complexity and storage space.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If the routing system uses a linked list storage structure to record all routed lines and blocks, then the routing information can be completely stored, but the traversal times increase rapidly with the complexity of the block set, leading to decreased routing speed
Solution Approach 1:
The patent segments the routing plane into a grid matrix where each grid point is independently addressed. Instead of traversing through linked lists of blocks and lines, the system divides the continuous space into discrete grid cells, allowing direct access to any location through coordinate indexing. This segmentation transforms the traversal problem from O(n×m×k) linked list operations to O(1) grid point access.
Solution Approach 2:
The patent introduces a grid identifier system as an intermediary layer between the routing algorithm and the actual routing data. Each grid point is assigned a unique identifier that mediates the access process, allowing the routing algorithm to quickly determine whether a grid point belongs to a block or a routed line without traversing the entire linked list structure. This intermediary grid system acts as an index that bridges the gap between coordinate-based routing and object-based storage.
2Reliability
If the routing system stores detailed information of all blocks and routed lines in linked lists, then complete routing data is maintained, but the storage space occupied increases rapidly with the complexity of the block set
Solution Approach 1:
The patent merges the storage of block information and routed line information into a unified grid matrix structure. Instead of maintaining separate linked lists for blocks and lines, the system uses a single grid matrix where each cell can represent different states (empty, block, routed line, intersection). This merging eliminates the need for multiple data structures and reduces the overall storage overhead by consolidating routing information into a compact two-dimensional array.
Solution Approach 2:
The patent changes the storage parameters from object-based attributes (linked list nodes with multiple fields for each block and line) to position-based indexing (grid matrix coordinates with state identifiers). By transforming the storage model from storing detailed object properties to storing positional information with categorical states, the system significantly reduces memory consumption while preserving all necessary routing information through the grid coordinate system.
3Reliability
If the routing algorithm traverses through all nodes in the linked list to determine block membership, then accurate routing decisions can be made, but the routing efficiency drops abruptly as the block set complexity increases
Solution Approach 1:
The patent performs preliminary action by pre-processing the routing plane into a grid matrix structure before the actual routing algorithm executes. During this preliminary phase, all blocks and existing routed lines are registered in the grid matrix with their respective grid point identifiers. This pre-processing creates an optimized data structure that eliminates the need for runtime traversal through linked lists, allowing the routing algorithm to make accurate decisions through direct grid point lookup rather than sequential searching.
Data Source
AI summary
The present invention provides a routing storage structure based on directional grid points and a routing method thereof. The routing storage structure includes a grid matrix having N×M grid points for storing a grid identifier corresponding to each grid point, where both N and M are natural numbers; a grid value acquisition module for acquiring the grid identifier corresponding to the current grid point from the grid matrix during a routing operation; and a grid value setting module for setting the grid points contained by the blocks in the routing plane and/or the grid points that the routing passes through as corresponding grid identifiers in accordance with a predetermined setting rule.