CN116644544A - Method, device and medium for stringing residual components - Google Patents
Method, device and medium for stringing residual components Download PDFInfo
- Publication number
- CN116644544A CN116644544A CN202310619993.XA CN202310619993A CN116644544A CN 116644544 A CN116644544 A CN 116644544A CN 202310619993 A CN202310619993 A CN 202310619993A CN 116644544 A CN116644544 A CN 116644544A
- Authority
- CN
- China
- Prior art keywords
- components
- component
- remaining
- string
- determining
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 61
- 238000013507 mapping Methods 0.000 claims abstract description 101
- 239000011159 matrix material Substances 0.000 claims abstract description 91
- 238000003491 array Methods 0.000 claims description 18
- 238000004590 computer program Methods 0.000 claims description 17
- 238000000638 solvent extraction Methods 0.000 claims description 8
- 230000000873 masking effect Effects 0.000 claims description 3
- 238000010586 diagram Methods 0.000 description 10
- 230000011218 segmentation Effects 0.000 description 8
- 238000004891 communication Methods 0.000 description 5
- 238000005192 partition Methods 0.000 description 3
- 102100029469 WD repeat and HMG-box DNA-binding protein 1 Human genes 0.000 description 2
- 101710097421 WD repeat and HMG-box DNA-binding protein 1 Proteins 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000002955 isolation Methods 0.000 description 2
- 230000000712 assembly Effects 0.000 description 1
- 238000000429 assembly Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/10—Geometric CAD
- G06F30/18—Network design, e.g. design based on topological or interconnect aspects of utility systems, piping, heating ventilation air conditioning [HVAC] or cabling
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/06—Energy or water supply
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2113/00—Details relating to the application field
- G06F2113/16—Cables, cable trees or wire harnesses
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Human Resources & Organizations (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- General Business, Economics & Management (AREA)
- Marketing (AREA)
- Tourism & Hospitality (AREA)
- Geometry (AREA)
- Health & Medical Sciences (AREA)
- Mathematical Optimization (AREA)
- Quality & Reliability (AREA)
- Development Economics (AREA)
- Evolutionary Computation (AREA)
- Game Theory and Decision Science (AREA)
- Computer Hardware Design (AREA)
- Entrepreneurship & Innovation (AREA)
- Pure & Applied Mathematics (AREA)
- Operations Research (AREA)
- General Engineering & Computer Science (AREA)
- Mathematical Analysis (AREA)
- Computational Mathematics (AREA)
- Computer Networks & Wireless Communication (AREA)
- Public Health (AREA)
- Water Supply & Treatment (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Compression, Expansion, Code Conversion, And Decoders (AREA)
Abstract
The application discloses a method, equipment and medium for stringing residual components, and belongs to the technical field of stringing. Shielding and hiding the strung components after C-shaped group string in the component code mapping matrix to obtain a target code mapping matrix, thereby eliminating the influence of the strung components after C-shaped group string on the string of the rest components, and realizing the string of the rest components in the target code mapping matrix; and determining a residual component subarray of the residual component after the C-shaped group string is in the target coding mapping matrix, and determining the target group string of the residual component based on the residual component subarray, so that the residual component is divided into a plurality of independent areas, and each independent area, namely each residual component subarray, is independently processed, thereby not only ensuring the high string rate of the component, but also not influencing the result of the existing C-shaped group string, and meanwhile, not generating the component string among the areas, and efficiently realizing the string of the residual component.
Description
Technical Field
The present application relates to the field of serial connection, and more particularly, to a method for connecting a plurality of components together, a serial connection device for connecting the plurality of components together, and a computer readable storage medium.
Background
At present, in the scene of distributed photovoltaic projects, the general area of the arrangeable area is larger, such as a roof, a roof and the like, the scale of the photovoltaic array after the components are arranged is also larger, and the number of the components of the photovoltaic array is thousands when one larger roof is in full row. In this scenario, the requirement for component string is mainly based on the priority of C-type string, and the C-type string not only can reduce the consumption of the direct current cable, so that the string result is regular, but also greatly reduces the construction difficulty, so that the component C-type string of the large-scale photovoltaic array is extremely important.
However, in the actual string scene of the matrix of large-scale components, due to the influence of complex obstacles, shadows and the like, after the number of components in each string is specified and the string result of the C-type string is output, some components which are not string remain, and the existing component string algorithm cannot process the remaining components. In addition, the existing component string method is only aimed at independent smaller square matrixes, and can not process more scattered component strings in larger square matrixes.
Disclosure of Invention
The application mainly aims to provide a method for stringing residual components, stringing equipment of residual components and a computer readable storage medium, and aims to solve the technical problem that the stringing of residual components is difficult to realize.
To achieve the above object, the present application provides a method for stringing remaining components, the method comprising:
determining a crossed component and the rest components after C-shaped group crossed wires;
shielding and hiding the series-wound components in a component coding mapping matrix to obtain a target coding mapping matrix;
and determining a residual component subarray of the residual component in the target coding mapping matrix, and determining a target group string of the residual component based on the residual component subarray.
Illustratively, the step of masking the hidden concatenated component in the component code mapping matrix comprises:
and determining the component codes of the strung components in a component code mapping matrix, and mapping the component codes of the strung components into preset shielding hiding codes.
Illustratively, the step of determining the remaining component sub-arrays of the remaining components in the target code mapping matrix includes:
determining a target area where the residual component is located based on the position of the residual component in the target coding mapping matrix, the component code of a first preset value and a preset shielding hiding code; the subtracted photovoltaic module is mapped into a first preset value in the module coding mapping matrix;
And determining the subarray where the target area is located as a residual component subarray of the residual component.
The step of determining the target area where the remaining component is located based on the position of the remaining component in the target coding mapping matrix, the component coding of the first preset value, and the preset mask hiding coding includes:
determining a row location and a column location of the remaining components in the target code mapping matrix;
determining whether the row position and the column position are component codes or preset shielding hidden codes of a first preset value except for the rest components;
if the component codes are the first preset value or the preset shielding hiding codes, determining the row positions and the column positions as region dividing positions;
dividing the component coding mapping matrix based on the region dividing position to obtain a target region where the residual component is located.
Illustratively, the determining the target group string of the remaining component based on the remaining component sub-array includes:
determining first and last remaining component encodings of the first and last rows of the remaining component sub-arrays;
A target group string for the remaining components is determined based on first and last remaining component encodings of the first and last rows of the remaining component sub-arrays.
Illustratively, the determining the target group string of the remaining components based on the first and last remaining component encodings of the first and last rows of the remaining component sub-array comprises:
determining a possible starting point based on the first and last remaining component encodings of the first and last rows of the remaining component sub-arrays;
a target set string of the remaining components is determined based on the possible starting points.
Illustratively, the step of determining the target group string of the remaining components based on the possible starting points includes:
the possible starting points are used as starting points of the linear group strings to connect the residual components in series, so as to obtain pending group strings;
a target group string of the remaining components is determined based on the pending group string.
Illustratively, the determining the target group string of the remaining components based on the pending group string includes:
determining the number of components of the remaining components in the pending group string;
and determining the undetermined group string with the maximum component number as a target group string of the rest components.
Illustratively, after the step of determining the target group string of the remaining components based on the remaining component sub-array, the method includes:
when the number of components of the residual components in the target group string is larger than a preset number, determining the maximum partitionable number and the number of residual components to be processed after partitioning based on the number of components of the residual components and the maximum number of components of the C-type group string;
dividing the target group string based on the maximum partitionable number and the number of components to be processed.
Illustratively, the step of partitioning the target group string based on the maximum partitionable number and the number of components to be processed includes:
if the number of the components to be processed is 0, the target group strings are divided on average based on the maximum partitionable number;
if the number of the components to be processed is not 0, when the sum of the maximum number of components of the C-shaped group string and the number of the components to be processed is greater than or equal to 2 times of the minimum number of components of the C-shaped group string, the target group string is divided from one end of the target group string on the basis of the dividing number of the maximum divisible number minus 1, and the rest of the target group strings are divided on the basis of the minimum number of components of the C-shaped group string on the basis of the average division.
The application also provides a device for stringing of remaining components, the device comprising:
the first determining module is used for determining the strung components and the rest components after the C-shaped group string wires;
the shielding hiding module is used for shielding and hiding the series-wound components in the component coding mapping matrix to obtain a target coding mapping matrix;
and the second determining module is used for determining a residual component subarray of the residual component in the target coding mapping matrix and determining a target group string of the residual component based on the residual component subarray.
The application also provides a string device of the remaining components, comprising: a memory, a processor, and a computer program stored on the memory and executable on the processor, which when executed by the processor, performs the steps of the method of stringing of remaining components as described above.
The present application also provides a computer readable storage medium having stored thereon a computer program which, when executed by a processor, implements the steps of the method of stringing of remaining components as described above.
The embodiment of the application provides a method for stringing residual components, equipment for stringing residual components and a computer-readable storage medium, which are used for determining the stringed components and residual components after C-shaped group string stringing; shielding and hiding the series-wound components in a component coding mapping matrix to obtain a target coding mapping matrix; and determining a residual component subarray of the residual component in the target coding mapping matrix, and determining a target group string of the residual component based on the residual component subarray.
In the application, the component code mapping matrix is shielded and hidden with the already-strung component after C-shaped group string to obtain the target code mapping matrix, thereby eliminating the influence of the already-strung component after C-shaped group string on the string of the rest component, and realizing the string of the rest component in the target code mapping matrix; and determining a residual component subarray of the residual component after the C-shaped group string is in the target coding mapping matrix, and determining the target group string of the residual component based on the residual component subarray, so that the residual component is divided into a plurality of independent areas, and each independent area, namely each residual component subarray, is independently processed, thereby not only ensuring the high string rate of the component, but also not influencing the result of the existing C-shaped group string, and meanwhile, not generating the component string among the areas, and efficiently realizing the string of the residual component.
Drawings
FIG. 1 is a schematic diagram of an operating device of a hardware operating environment according to an embodiment of the present application;
FIG. 2 is a flow chart of an embodiment of a method for cross-wiring remaining components according to an embodiment of the present application;
FIG. 3 is a schematic diagram of a portion of a remaining component according to an embodiment of a method for cross-wiring the remaining component according to the present application;
FIG. 4 is a schematic diagram illustrating a secondary mapping of an embodiment of a cross-line method for remaining components according to an embodiment of the present application;
FIG. 5 is a schematic diagram of a target area of an embodiment of a cross-line method of remaining components according to an embodiment of the present application;
FIG. 6 is a schematic diagram of an exemplary embodiment of a method for cross-threading remaining components according to an exemplary embodiment of the present application;
FIG. 7 is a schematic diagram of a cross-threading method for remaining components according to an embodiment of the present application;
FIG. 8 is a schematic diagram of a string segmentation result of an embodiment of a string method for remaining components according to an embodiment of the present application;
fig. 9 is a schematic diagram of a string device of remaining components according to an embodiment of the present application.
The achievement of the objects, functional features and advantages of the present application will be further described with reference to the accompanying drawings, in conjunction with the embodiments.
Detailed Description
It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the scope of the application.
Referring to fig. 1, fig. 1 is a schematic diagram of an operating device of a hardware operating environment according to an embodiment of the present application.
As shown in fig. 1, the operation device may include: a processor 1001, such as a central processing unit (Central Processing Unit, CPU), a communication bus 1002, a user interface 1003, a network interface 1004, a memory 1005. Wherein the communication bus 1002 is used to enable connected communication between these components. The user interface 1003 may include a Display, an input unit such as a Keyboard (Keyboard), and the optional user interface 1003 may further include a standard wired interface, a wireless interface. The network interface 1004 may optionally include a standard wired interface, a WIreless interface (e.g., a WIreless-FIdelity (WI-FI) interface). The Memory 1005 may be a high-speed random access Memory (Random Access Memory, RAM) Memory or a stable nonvolatile Memory (NVM), such as a disk Memory. The memory 1005 may also optionally be a storage device separate from the processor 1001 described above.
It will be appreciated by those skilled in the art that the structure shown in fig. 1 is not limiting of the operating device and may include more or fewer components than shown, or certain components may be combined, or a different arrangement of components.
As shown in fig. 1, an operating system, a data storage module, a network communication module, a user interface module, and a computer program may be included in the memory 1005 as one type of storage medium.
In the operating device shown in fig. 1, the network interface 1004 is mainly used for data communication with other devices; the user interface 1003 is mainly used for data interaction with a user; the processor 1001, the memory 1005 in the operation device of the present application may be provided in an operation device that calls a computer program stored in the memory 1005 through the processor 1001 and performs the following operations:
determining a crossed component and the rest components after C-shaped group crossed wires;
shielding and hiding the series-wound components in a component coding mapping matrix to obtain a target coding mapping matrix;
and determining a residual component subarray of the residual component in the target coding mapping matrix, and determining a target group string of the residual component based on the residual component subarray.
In an embodiment, the processor 1001 may call a computer program stored in the memory 1005, and further perform the following operations:
the step of shielding and hiding the strung component in the component code mapping matrix comprises the following steps:
and determining the component codes of the strung components in a component code mapping matrix, and mapping the component codes of the strung components into preset shielding hiding codes.
In an embodiment, the processor 1001 may call a computer program stored in the memory 1005, and further perform the following operations:
the step of determining the remaining component sub-arrays of the remaining components in the target code mapping matrix comprises:
determining a target area where the residual component is located based on the position of the residual component in the target coding mapping matrix, the component code of a first preset value and a preset shielding hiding code; the subtracted photovoltaic module is mapped into a first preset value in the module coding mapping matrix;
and determining the subarray where the target area is located as a residual component subarray of the residual component.
In an embodiment, the processor 1001 may call a computer program stored in the memory 1005, and further perform the following operations:
The step of determining the target area where the remaining components are located based on the positions of the remaining components in the target coding mapping matrix, the component codes of the first preset value and the preset shielding hiding codes includes:
determining a row location and a column location of the remaining components in the target code mapping matrix;
determining whether the row position and the column position are component codes or preset shielding hidden codes of a first preset value except for the rest components;
if the component codes are the first preset value or the preset shielding hiding codes, determining the row positions and the column positions as region dividing positions;
dividing the component coding mapping matrix based on the region dividing position to obtain a target region where the residual component is located.
In an embodiment, the processor 1001 may call a computer program stored in the memory 1005, and further perform the following operations:
the step of determining a target group string of the remaining components based on the remaining component sub-array includes:
determining first and last remaining component encodings of the first and last rows of the remaining component sub-arrays;
A target group string for the remaining components is determined based on first and last remaining component encodings of the first and last rows of the remaining component sub-arrays.
In an embodiment, the processor 1001 may call a computer program stored in the memory 1005, and further perform the following operations:
the step of determining a target group string of the remaining components based on first and last remaining component encodings of the top and bottom rows in the remaining component sub-array, comprises:
determining a possible starting point based on the first and last remaining component encodings of the first and last rows of the remaining component sub-arrays;
a target set string of the remaining components is determined based on the possible starting points.
In an embodiment, the processor 1001 may call a computer program stored in the memory 1005, and further perform the following operations:
the step of determining a target set string of the remaining components based on the possible starting points comprises:
the possible starting points are used as starting points of the linear group strings to connect the residual components in series, so as to obtain pending group strings;
a target group string of the remaining components is determined based on the pending group string.
In an embodiment, the processor 1001 may call a computer program stored in the memory 1005, and further perform the following operations:
The step of determining the target group string of the remaining components based on the pending group string comprises:
determining the number of components of the remaining components in the pending group string;
and determining the undetermined group string with the maximum component number as a target group string of the rest components.
In an embodiment, the processor 1001 may call a computer program stored in the memory 1005, and further perform the following operations:
after the step of determining the target group string of the remaining components based on the remaining component sub-array, it includes:
when the number of components of the residual components in the target group string is larger than a preset number, determining the maximum partitionable number and the number of residual components to be processed after partitioning based on the number of components of the residual components and the maximum number of components of the C-type group string;
dividing the target group string based on the maximum partitionable number and the number of components to be processed.
In an embodiment, the processor 1001 may call a computer program stored in the memory 1005, and further perform the following operations:
the step of dividing the target group string based on the maximum divisible number and the number of components to be processed includes:
If the number of the components to be processed is 0, the target group strings are divided on average based on the maximum partitionable number;
if the number of the components to be processed is not 0, when the sum of the maximum number of components of the C-shaped group string and the number of the components to be processed is greater than or equal to 2 times of the minimum number of components of the C-shaped group string, the target group string is divided from one end of the target group string on the basis of the dividing number of the maximum divisible number minus 1, and the rest of the target group strings are divided on the basis of the minimum number of components of the C-shaped group string on the basis of the average division.
An embodiment of the present application provides a method for stringing remaining components, referring to fig. 2, in an embodiment of the method for stringing remaining components, the method includes:
step S10, determining the crossed components and the rest components after the C-type group of crossed lines.
For the distributed photovoltaic array of large-scale components, after the C-shaped string wires are completed, part of the residual components exist, even under certain special scenes, the C-shaped group strings cannot be strung out after the components are arranged due to the small space between the light collecting belt and the isolation belt, and all the components can not be strung by the string wires after passing through the modules of the C-shaped string under the special scenes.
As shown in the left side of fig. 3, the left side is a scene with denser lighting bands (isolation bands), after the string wires of the C-shaped strings are finished, no effective C-shaped strings are output, all components are not string wires, as shown in the right side of fig. 3, and the right side is the condition of the remaining components after the C-shaped strings are output.
That is, after the C-type group string is performed, each component in the photovoltaic array may be classified into a string component that has been string as a C-type string and a remaining component that has not been string, and in this embodiment, the remaining component is further string-processed.
In the present embodiment, the string method of the C-type string is not limited.
And S20, shielding and hiding the series-wound components in the component coding mapping matrix to obtain a target coding mapping matrix.
And storing component codes of each component arrangement position in a component code mapping matrix, and shielding and hiding the series-wound components in the component code mapping matrix to obtain a target code mapping matrix.
Illustratively, the step of masking the hidden concatenated component in the component code mapping matrix comprises:
and determining the component codes of the strung components in a component code mapping matrix, and mapping the component codes of the strung components into preset shielding hiding codes.
In the component code mapping matrix, there are only 0 codes and unique component codes other than 0. After the component code mapping matrix is sampled, all C-shaped strings can be quickly strung out according to the method, and when the string wires of the rest components are processed, the C-shaped strings with the completed string wires do not need to be strung again, so that all C-shaped string component codes in the component code mapping matrix are required to be shielded or hidden, and the string wires of the rest components are not affected.
In this embodiment, the secondary mapping mode is adopted to remap the component codes of the component code mapping matrix, from which the C-shaped string is strung, into a specific code, where the specific code is invalid when the remaining component strings are strung, and does not affect the position of the C-shaped string in the component code mapping matrix and the attribution relation of the components, in principle, the specific code may be any code other than the existing code in the component code mapping matrix, but for simplicity of post-mapping marking, the secondary mapping code may be directly taken as-1.
In one embodiment, the secondarily mapped component code mapping matrix is shown in FIG. 4, with the upper dashed box representing several complete C-strings, and with all component codes set to-1 after the secondary mapping, as shown in the lower dashed box.
Step S30, determining a remaining component sub-array of the remaining component in the target coding mapping matrix, and determining a target group string of the remaining component based on the remaining component sub-array.
The method of determining the target group string of the remaining components in the remaining component sub-array is not limited in this embodiment, but the remaining component sub-array of the remaining components is determined based on the arrangement positions of the remaining components in the target code mapping matrix, and then the target group string of the remaining components is determined based on the remaining component sub-array.
In order to solve the problem of string of large-scale component square matrix in the actual distributed project, make the surplus assembly after the C-type string finishes can continue to be strung, have proposed a string method suitable for surplus assembly of the scene of large-scale assembly, in this embodiment, confirm C-type group string after string already string assembly and surplus assembly; shielding and hiding the series-wound components in a component coding mapping matrix to obtain a target coding mapping matrix; and determining a residual component subarray of the residual component in the target coding mapping matrix, and determining a target group string of the residual component based on the residual component subarray.
In this embodiment, the device code mapping matrix is used to mask and hide the C-type group string after the string to obtain the target code mapping matrix, so as to eliminate the influence of the C-type group string after the string on the remaining device string, and implement the string of the remaining device in the target code mapping matrix; and determining a residual component subarray of the residual component after the C-shaped group string is in the target coding mapping matrix, and determining the target group string of the residual component based on the residual component subarray, so that the residual component is divided into a plurality of independent areas, and each independent area, namely each residual component subarray, is independently processed, thereby not only ensuring the high string rate of the component, but also not influencing the result of the existing C-shaped group string, and meanwhile, not generating the component string among the areas, and efficiently realizing the string of the residual component.
In another embodiment of the present application, the step of determining a remaining component sub-array of the remaining component in the target coding mapping matrix includes:
determining a target area where the residual component is located based on the position of the residual component in the target coding mapping matrix, the component code of a first preset value and a preset shielding hiding code; the subtracted photovoltaic module is mapped into a first preset value in the module coding mapping matrix;
and determining the subarray where the target area is located as a residual component subarray of the residual component.
Referring to fig. 4, it can be seen from the matrix diagram after the secondary mapping that the remaining components in fig. 4 are obviously divided into several regions by codes 0 and-1, so that the remaining components can be region-divided by the secondary mapping matrix.
Firstly, determining a target area where the residual assembly is located according to the position of the residual assembly in the target encoding mapping matrix, the assembly encoding of a first preset value and the preset shielding hiding encoding, and then determining a subarray where the target area is located as a residual assembly subarray of the residual assembly.
The step of determining the target area where the remaining component is located based on the position of the remaining component in the target coding mapping matrix, the component coding of the first preset value, and the preset mask hiding coding includes:
determining a row location and a column location of the remaining components in the target code mapping matrix;
determining whether the row position and the column position are component codes or preset shielding hidden codes of a first preset value except for the rest components;
if the component codes are the first preset value or the preset shielding hiding codes, determining the row positions and the column positions as region dividing positions;
dividing the component coding mapping matrix based on the region dividing position to obtain a target region where the residual component is located.
Firstly, determining the row positions and column positions of the rest components in a target coding mapping matrix; then judging whether the component codes at the row position and the column position are all component codes 0 or preset shielding hidden codes-1 with a first preset value except the rest components, if yes, the row/column is the region segmentation position of the target region; and finally, dividing the component coding mapping matrix according to the region segmentation positions corresponding to all the rows and the columns to obtain a target region where the residual components are located. In this way, all the remaining components are divided into different regions, and a remaining component sub-array is generated.
In one embodiment, referring to FIG. 5, the remaining components are divided into 3 target areas, resulting in three remaining component sub-arrays, as indicated by the dashed boxes.
In another embodiment of the remaining assembly stringing method, the step of determining the target group string of the remaining assembly based on the remaining assembly subarray includes:
determining first and last remaining component encodings of the first and last rows of the remaining component sub-arrays;
a target group string for the remaining components is determined based on first and last remaining component encodings of the first and last rows of the remaining component sub-arrays.
After secondary mapping and target region division, subarrays of residual components in different regions are generated, and in each subarray, the connection relation of each residual component in the region is constructed according to the four-adjacent-domain relation of component codes, and the connection relation does not contain codes 0 and-1. After the connection relation of the rest components is constructed, the codes of each subarray are connected in series according to the existing business string rule to form a string path, namely a character-shaped group string.
In this embodiment, the target set string of remaining components is determined based on the first and last remaining component encodings of the first and last rows of the remaining component sub-array.
In this embodiment, a method for maximizing a word line string is provided, so that the number of components remaining after each individual partition string is minimized.
Illustratively, the determining the target group string of the remaining components based on the first and last remaining component encodings of the first and last rows of the remaining component sub-array comprises:
determining a possible starting point based on the first and last remaining component encodings of the first and last rows of the remaining component sub-arrays;
a target set string of the remaining components is determined based on the possible starting points.
The first and last codes of the first and last rows of the sub-array of the remaining components in the target area are determined to be non-0 and non-1 remaining component codes, and the remaining component codes are used as possible starting points of the linear string, and the target group string of the remaining components is determined based on the possible starting points.
In one embodiment, referring to fig. 6, the possible starting points for the three target areas are respectively:
region 1: [ 341, 344, 501, 504 ]
Region 2: [ 390, 507, 510 ]
Region 3: [ 457, 460, 559, 560 ]
Illustratively, the step of determining the target group string of the remaining components based on the possible starting points includes:
the possible starting points are used as starting points of the linear group strings to connect the residual components in series, so as to obtain pending group strings;
a target group string of the remaining components is determined based on the pending group string.
And (3) taking each possible starting point as the starting point of the linear group string, connecting the rest components in series to obtain all possible linear group strings, namely obtaining all pending group strings, and determining the target group strings of the rest components based on the pending group strings.
In one embodiment, the valid one-word string results are shown in FIG. 6.
Illustratively, the determining the target group string of the remaining components based on the pending group string includes:
determining the number of components of the remaining components in the pending group string;
and determining the undetermined group string with the maximum component number as a target group string of the rest components.
And determining the undetermined group string with the largest number of components of the residual components connected in series as a target group string of the residual components. The one-word string with the largest number of the remaining components is selected as the final result output, and referring to fig. 6, the leftmost one-word string is the output result.
The remaining components with component numbers 510 in the leftmost target area may be ignored, or may be used as input of the string splitting processing module. In the group string splitting processing module: determining a second residual assembly and the number of the second residual assemblies after being processed by the C-type string processing module and the residual assembly processing module, and determining a complete C-type string adjacent to the second residual assembly; and splitting and recombining the second residual components and the adjacent complete C-shaped group strings to obtain a plurality of second target group strings, wherein the number of components in the second target group strings is greater than the minimum number of components of the C-shaped group strings.
In another embodiment of the present application, after the step of determining the target group string of the remaining assembly based on the remaining assembly subarray, the method includes:
when the number of components of the residual components in the target group string is larger than a preset number, determining the maximum partitionable number and the number of residual components to be processed after partitioning based on the number of components of the residual components and the maximum number of components of the C-type group string;
dividing the target group string based on the maximum partitionable number and the number of components to be processed.
In the outputted linear group string, the largest linear group string can contain all the rest components in the partition, and when the number of components in a certain area is large, it is obvious that the linear group string does not meet the access requirement of the MPPT (Maximum Power Point Tracking ). At this time, the outputted linear string is required to be divided, and a plurality of individual strings which finally meet the requirement are outputted, and the dividing principle is as follows: 1, the maximum string number (the maximum number of components) maxNum takes precedence; 2. the number of components of the 2-path access strings of the MPPT is the same; 3. the number of components per string is not less than the minimum number of components (minimum number of components) minNum of the minimum string.
In this embodiment, according to the segmentation principle, if the number of components of the string is N, that is, the number of components of the remaining components in the target string is N, the number of strings of the largest segmentable string, that is, the maximum segmentable number is: a=n/maxNum, the number of remaining components after segmentation, i.e. the number of remaining components to be processed after segmentation is: b=n% maxNum.
Then, the target group string is segmented based on the maximum partitionable number a and the number b of components to be processed.
Illustratively, the step of partitioning the target group string based on the maximum partitionable number and the number of components to be processed includes:
If the number of the components to be processed is 0, the target group strings are divided on average based on the maximum partitionable number;
if the number of the components to be processed is not 0, when the sum of the maximum number of components of the C-shaped group string and the number of the components to be processed is greater than or equal to 2 times of the minimum number of components of the C-shaped group string, the target group string is divided from one end of the target group string on the basis of the dividing number of the maximum divisible number minus 1, and the rest of the target group strings are divided on the basis of the minimum number of components of the C-shaped group string on the basis of the average division.
Referring to fig. 7, in one embodiment, if the number of components to be processed b is 0, the target group string is divided on average based on the maximum partitionable number a. If the number b of the components to be processed meets the following conditions: b+maxnum > =2minnum, the last string and the remaining components are subjected to halving, where the number of components of the last two strings obtained after halving is: avrnum=b+maxnum/2.
Referring to fig. 5, in an embodiment, if maxnum=18 and minnum=8, by the above-mentioned segmentation method, the last output string case of the target area of each remaining component in fig. 5 is:
region 1:2 strings of 18 components each;
region 2: a string of 16 components each;
Region 3:2 strings of 11 components each.
The component cross-line result after the division of the region 1 and the region 3 is shown in fig. 8.
In this embodiment, a method for secondary mapping partition is provided, the remaining components are divided into regions, and the divided regions are strung according to the maximum number of components and the minimum number of components in each string. The segmentation method based on the maximum number of components and the minimum number of components ensures that each group string result meets the access requirement of MPPT.
Referring to fig. 9, in addition, the embodiment of the present application further provides a string device of the remaining components, where the string device of the remaining components includes:
a first determining module M1, configured to determine a strung component and the remaining components after the string of the C-group string;
a shielding hiding module M2, configured to shield and hide the strung component in the component encoding mapping matrix, so as to obtain a target encoding mapping matrix;
a second determining module M3, configured to determine a remaining component sub-array of the remaining component in the target coding mapping matrix, and determine a target group string of the remaining component based on the remaining component sub-array.
Illustratively, the mask hiding module is further configured to:
And determining the component codes of the strung components in a component code mapping matrix, and mapping the component codes of the strung components into preset shielding hiding codes.
Illustratively, the second determining module is further configured to:
determining a target area where the residual component is located based on the position of the residual component in the target coding mapping matrix, the component code of a first preset value and a preset shielding hiding code; the subtracted photovoltaic module is mapped into a first preset value in the module coding mapping matrix;
and determining the subarray where the target area is located as a residual component subarray of the residual component.
Illustratively, the second determining module is further configured to:
determining a row location and a column location of the remaining components in the target code mapping matrix;
determining whether the row position and the column position are component codes or preset shielding hidden codes of a first preset value except for the rest components;
if the component codes are the first preset value or the preset shielding hiding codes, determining the row positions and the column positions as region dividing positions;
Dividing the component coding mapping matrix based on the region dividing position to obtain a target region where the residual component is located.
Illustratively, the second determining module is further configured to:
determining first and last remaining component encodings of the first and last rows of the remaining component sub-arrays;
a target group string for the remaining components is determined based on first and last remaining component encodings of the first and last rows of the remaining component sub-arrays.
Illustratively, the second determining module is further configured to:
determining a possible starting point based on the first and last remaining component encodings of the first and last rows of the remaining component sub-arrays;
a target set string of the remaining components is determined based on the possible starting points.
Illustratively, the second determining module is further configured to:
the possible starting points are used as starting points of the linear group strings to connect the residual components in series, so as to obtain pending group strings;
a target group string of the remaining components is determined based on the pending group string.
Illustratively, the second determining module is further configured to:
determining the number of components of the remaining components in the pending group string;
and determining the undetermined group string with the maximum component number as a target group string of the rest components.
Illustratively, the string device of the remaining assembly further includes a splitting module for:
after the step of determining the target set string of the remaining components based on the remaining component sub-array:
when the number of components of the residual components in the target group string is larger than a preset number, determining the maximum partitionable number and the number of residual components to be processed after partitioning based on the number of components of the residual components and the maximum number of components of the C-type group string;
dividing the target group string based on the maximum partitionable number and the number of components to be processed.
Illustratively, the partitioning module is further configured to:
if the number of the components to be processed is 0, the target group strings are divided on average based on the maximum partitionable number;
if the number of the components to be processed is not 0, when the sum of the maximum number of components of the C-shaped group string and the number of the components to be processed is greater than or equal to 2 times of the minimum number of components of the C-shaped group string, the target group string is divided from one end of the target group string on the basis of the dividing number of the maximum divisible number minus 1, and the rest of the target group strings are divided on the basis of the minimum number of components of the C-shaped group string on the basis of the average division.
The device for stringing the residual components solves the technical problem that the stringing of the residual components is difficult to realize by adopting the method for stringing the residual components in the embodiment. Compared with the conventional technology, the beneficial effects of the string device of the residual assembly provided by the embodiment of the application are the same as those of the string method of the residual assembly provided by the embodiment, and other technical features of the string device of the residual assembly are the same as those disclosed by the method of the embodiment, so that the description is omitted.
In addition, the embodiment of the application also provides a string device of the residual assembly, which comprises: a memory, a processor, and a computer program stored on the memory and executable on the processor, which when executed by the processor, performs the steps of the method of stringing of remaining components as described above.
Furthermore, the embodiment of the present application also provides a computer readable storage medium, on which a computer program is stored, which when executed by a processor, implements the steps of the method for stringing of remaining components as described above.
It should be noted that, in this document, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or system that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or system. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method, article, or system that comprises the element.
From the above description of the embodiments, it will be clear to those skilled in the art that the above-described embodiment method may be implemented by means of software plus a necessary general hardware platform, but of course may also be implemented by means of hardware, but in many cases the former is a preferred embodiment. Based on such understanding, the technical solution of the present application may be embodied essentially or in a part contributing to the conventional technology in the form of a software product stored in a storage medium (such as ROM/RAM, magnetic disk, optical disk) as described above, including several instructions for causing a terminal device (which may be a mobile phone, a computer, a server, or a network device, etc.) to perform the method according to the embodiments of the present application.
The foregoing description is only of the preferred embodiments of the present application, and is not intended to limit the scope of the application, but rather is intended to cover any equivalents of the structures or equivalent processes disclosed herein or in the alternative, which may be employed directly or indirectly in other related arts.
Claims (12)
1. A method of stringing remaining components, the method comprising:
determining a crossed component and the rest components after C-shaped group crossed wires;
shielding and hiding the series-wound components in a component coding mapping matrix to obtain a target coding mapping matrix;
and determining a residual component subarray of the residual component in the target coding mapping matrix, and determining a target group string of the residual component based on the residual component subarray.
2. The method of component-by-component cross-threading of claim 1, wherein the step of masking the hidden component cross-threaded in a component code mapping matrix comprises:
and determining the component codes of the strung components in a component code mapping matrix, and mapping the component codes of the strung components into preset shielding hiding codes.
3. The method of cross-threading of remaining components of claim 1, wherein the step of determining a remaining component sub-array of the remaining components in the target code mapping matrix comprises:
Determining a target area where the residual component is located based on the position of the residual component in the target coding mapping matrix, the component code of a first preset value and a preset shielding hiding code; the subtracted photovoltaic module is mapped into a first preset value in the module coding mapping matrix;
and determining the subarray where the target area is located as a residual component subarray of the residual component.
4. The method for cross-threading the remaining components of claim 3, wherein the step of determining the target area in which the remaining components are located based on the location of the remaining components in the target code mapping matrix, the component code of the first preset value, and a preset mask hiding code comprises:
determining a row location and a column location of the remaining components in the target code mapping matrix;
determining whether the row position and the column position are component codes or preset shielding hidden codes of a first preset value except for the rest components;
if the component codes are the first preset value or the preset shielding hiding codes, determining the row positions and the column positions as region dividing positions;
Dividing the component coding mapping matrix based on the region dividing position to obtain a target region where the residual component is located.
5. The method of stringing remaining components of claim 1, wherein the step of determining a target set string for the remaining components based on the remaining component sub-array comprises:
determining first and last remaining component encodings of the first and last rows of the remaining component sub-arrays;
a target group string for the remaining components is determined based on first and last remaining component encodings of the first and last rows of the remaining component sub-arrays.
6. The method of claim 5, wherein determining the target group string of the remaining components based on the first and last remaining component encodings of the top and bottom rows in the remaining component sub-array comprises:
determining a possible starting point based on the first and last remaining component encodings of the first and last rows of the remaining component sub-arrays;
a target set string of the remaining components is determined based on the possible starting points.
7. The method of stringing remaining components of claim 6, wherein the step of determining a target set string for the remaining components based on the possible starting points comprises:
The possible starting points are used as starting points of the linear group strings to connect the residual components in series, so as to obtain pending group strings;
a target group string of the remaining components is determined based on the pending group string.
8. The method of stringing remaining components of claim 7, wherein the step of determining a target group string for the remaining components based on the pending group string comprises:
determining the number of components of the remaining components in the pending group string;
and determining the undetermined group string with the maximum component number as a target group string of the rest components.
9. The method of stringing remaining components of claim 1, wherein after the step of determining a target set string for the remaining components based on the remaining component sub-array, comprising:
when the number of components of the residual components in the target group string is larger than a preset number, determining the maximum partitionable number and the number of residual components to be processed after partitioning based on the number of components of the residual components and the maximum number of components of the C-type group string;
dividing the target group string based on the maximum partitionable number and the number of components to be processed.
10. The method of stringing remaining components of claim 9, wherein the step of splitting the target set of strings based on the maximum number of splittable components and the number of components to be processed comprises:
If the number of the components to be processed is 0, the target group strings are divided on average based on the maximum partitionable number;
if the number of the components to be processed is not 0, when the sum of the maximum number of components of the C-shaped group string and the number of the components to be processed is greater than or equal to 2 times of the minimum number of components of the C-shaped group string, the target group string is divided from one end of the target group string on the basis of the dividing number of the maximum divisible number minus 1, and the rest of the target group strings are divided on the basis of the minimum number of components of the C-shaped group string on the basis of the average division.
11. A string device of remaining components, the string device of remaining components comprising: memory, a processor, and a computer program stored on the memory and executable on the processor, which when executed by the processor, performs the steps of the method of stringing of remaining components of any of claims 1 to 10.
12. A computer readable storage medium, characterized in that it has stored thereon a computer program which, when executed by a processor, implements the steps of the method of stringing of remaining components according to any of claims 1 to 10.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310619993.XA CN116644544A (en) | 2023-05-25 | 2023-05-25 | Method, device and medium for stringing residual components |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310619993.XA CN116644544A (en) | 2023-05-25 | 2023-05-25 | Method, device and medium for stringing residual components |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN116644544A true CN116644544A (en) | 2023-08-25 |
Family
ID=87639412
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310619993.XA Pending CN116644544A (en) | 2023-05-25 | 2023-05-25 | Method, device and medium for stringing residual components |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116644544A (en) |
-
2023
- 2023-05-25 CN CN202310619993.XA patent/CN116644544A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20190130265A1 (en) | Method and apparatus for performing operations in convolutional neural network | |
| CN107273917A (en) | A kind of Method of Data with Adding Windows based on parallelization Principal Component Analysis Algorithm | |
| EP2377948B1 (en) | Error correcting method of test sequence, corresponding system and gene assembly equipment | |
| CN112241421A (en) | Data blood margin determination method and device | |
| EP4213097A1 (en) | Image generation method and apparatus | |
| CN112926845A (en) | Big data based outbound method, electronic device and computer readable storage medium | |
| CN111028884A (en) | Filling method and device for genotype data deletion and server | |
| CN110263291B (en) | Industrial data trend identification method and system | |
| CN102915344A (en) | SQL (structured query language) statement processing method and device | |
| CN114255187A (en) | Multi-level and multi-level image optimization method and system based on big data platform | |
| CN116644544A (en) | Method, device and medium for stringing residual components | |
| CN110222816B (en) | Deep learning model establishing method, image processing method and device | |
| CN108959571B (en) | SQL statement operation method and device, terminal equipment and storage medium | |
| CN113806601A (en) | Peripheral interest point retrieval method and storage medium | |
| JP4516940B2 (en) | Iris recognition method using cumulative sum-based change point analysis and apparatus thereof | |
| CN117421844A (en) | Photovoltaic module string method, device, equipment and medium | |
| CN116644545A (en) | String system and computer readable storage medium | |
| US10922498B2 (en) | Method for simultaneously translating language of smart in-vehicle system and related products | |
| US11321832B2 (en) | Image analysis device | |
| CN110909018A (en) | SQL statement generation method, device, equipment and storage medium | |
| CN111563646A (en) | Lightning protection scheme evaluation method, device, equipment and storage medium | |
| CN112528027A (en) | Text classification method, device, equipment, storage medium and program product | |
| CN111028101A (en) | Method and system for generating expected fault set of icing disaster of swarm intelligent power grids | |
| CN116628908A (en) | String method, equipment and medium for C-type string | |
| CN117540516A (en) | Method, device, equipment and medium for generating lightning protection grounding grid |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |