CN117421844A - Photovoltaic module string method, device, equipment and medium - Google Patents

Photovoltaic module string method, device, equipment and medium Download PDF

Info

Publication number
CN117421844A
CN117421844A CN202311357822.0A CN202311357822A CN117421844A CN 117421844 A CN117421844 A CN 117421844A CN 202311357822 A CN202311357822 A CN 202311357822A CN 117421844 A CN117421844 A CN 117421844A
Authority
CN
China
Prior art keywords
string
adjacent
components
strings
group
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
Application number
CN202311357822.0A
Other languages
Chinese (zh)
Inventor
邹绍琨
李伟
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Sungrow Renewables Development Co Ltd
Original Assignee
Sungrow Renewables Development Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Sungrow Renewables Development Co Ltd filed Critical Sungrow Renewables Development Co Ltd
Priority to CN202311357822.0A priority Critical patent/CN117421844A/en
Publication of CN117421844A publication Critical patent/CN117421844A/en
Pending legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H02—GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
    • H02S—GENERATION OF ELECTRIC POWER BY CONVERSION OF INFRARED RADIATION, VISIBLE LIGHT OR ULTRAVIOLET LIGHT, e.g. USING PHOTOVOLTAIC [PV] MODULES
    • H02S40/00—Components or accessories in combination with PV modules, not provided for in groups H02S10/00 - H02S30/00
    • H02S40/30—Electrical components
    • H02S40/36—Electrical components characterised by special electrical interconnection means between two or more PV modules, e.g. electrical module-to-module connection
    • 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
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F30/00—Computer-aided design [CAD]
    • G06F30/20—Design optimisation, verification or simulation
    • 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/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06313—Resource planning in a project environment
    • 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/04—Power grid distribution networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Human Resources & Organizations (AREA)
  • General Physics & Mathematics (AREA)
  • Economics (AREA)
  • Geometry (AREA)
  • Strategic Management (AREA)
  • Evolutionary Computation (AREA)
  • Computer Hardware Design (AREA)
  • General Engineering & Computer Science (AREA)
  • General Business, Economics & Management (AREA)
  • Health & Medical Sciences (AREA)
  • Marketing (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Tourism & Hospitality (AREA)
  • Pure & Applied Mathematics (AREA)
  • Development Economics (AREA)
  • Educational Administration (AREA)
  • Biodiversity & Conservation Biology (AREA)
  • Game Theory and Decision Science (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Mathematical Optimization (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (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)
  • Photovoltaic Devices (AREA)

Abstract

The application discloses a photovoltaic module string method, device, equipment and medium, and belongs to the technical field of photovoltaic module string. In the application, firstly, acquiring a series of series-connected components and a non-series-connected component; and then dividing the non-string component into a plurality of non-string regions, determining adjacent string groups of each non-string region, determining the target group strings to be split corresponding to each non-string region in the adjacent string groups, and forming a plurality of splitting and recombination regions. And finally, splitting the target group strings in each splitting and recombining area to obtain target components, and carrying out string threading on the non-string components in the non-string area and the target components corresponding to the non-string area to obtain corresponding string threading results in each splitting and recombining area. Therefore, the serial wires of the non-serial wire components are realized, the number of the rest components without the serial wires is reduced, and the number of the serial wire components is increased.

Description

Photovoltaic module string method, device, equipment and medium
Technical Field
The application relates to the technical field of photovoltaic module string wires, in particular to a photovoltaic module string wire method, a photovoltaic module string wire device and a computer readable storage medium.
Background
The scene of the distributed photovoltaic project is different from the household photovoltaic project and the centralized power station project, and the scene of the distributed photovoltaic project is complex, and the single photovoltaic array is large and has more components. For the photovoltaic array of the large-scale component, the current photovoltaic component string method is difficult to be suitable for the application scene of the photovoltaic array of the large-scale component. Firstly, the current photovoltaic module string line method has a good string line effect in a regular large-scale square matrix, but for special scenes such as irregular arrangement areas, more barriers, more scattered arrangement areas and the like, a plurality of residual modules exist, and the current photovoltaic module string line method cannot process the residual modules in the special scenes.
Disclosure of Invention
The main object of the present application is to provide a photovoltaic module string method, a photovoltaic module string device and a computer readable storage medium, which aim to string the remaining modules.
In order to achieve the above object, the present application provides a photovoltaic module string method, the method comprising:
obtaining a preliminary string scheme of the photovoltaic module, wherein the preliminary string scheme comprises string groups and non-string modules;
Dividing the non-string component into a plurality of non-string regions, determining adjacent string groups of each non-string region, and determining that each non-string region corresponds to a target group string to be split in the adjacent string groups to form a plurality of split recombination regions;
splitting the target group string in the splitting and recombining area, and carrying out string threading again on all components in the splitting and recombining area to obtain a string threading result corresponding to each splitting and recombining area and an overall target string threading scheme.
Illustratively, the step of determining that each of the non-stringed regions corresponds to the target group string to be split in the adjacent stringed group strings includes:
determining whether there is a common adjacent series of strings between the non-series areas for adjacent series of strings of each of the non-series areas;
and determining that each non-series line area corresponds to a target group string to be split in the adjacent non-series line group strings based on a judging result of whether the adjacent series line group strings of each non-series line area exist or not.
The step of determining that each non-string region corresponds to the target group string to be split in the adjacent non-string region based on the determination result of whether the adjacent non-string region exists in the adjacent non-string region, includes:
If the adjacent series-connected line group strings of the non-series-connected line areas exist in the common adjacent series-connected line group strings among the non-series-connected line areas, determining the common adjacent series-connected line group strings as target group strings to be split, wherein the target group strings correspond to the two adjacent non-series-connected line areas;
and if the adjacent bunched group strings of the non-bunched region do not have the public adjacent bunched group strings among the non-bunched regions, acquiring the number of adjacent assemblies of the adjacent bunched group strings of the non-bunched region, the number of adjacent group strings and the number of non-bunched assemblies of the non-bunched region, and determining that the non-bunched region corresponds to the target group string to be split in the adjacent bunched group strings based on the number of adjacent assemblies, the number of adjacent group strings and the number of non-bunched assemblies.
Illustratively, the step of determining that the untangling area corresponds to the target group string to be split in the adjacent strung group string based on the adjacent component number, the adjacent group string number, and the untangling component number includes:
when the number of the adjacent strings is one, and the number of the adjacent components and the number of the non-string components meet the preset condition of re-string, determining that the adjacent string of the non-string region is the target string of the non-string region corresponding to the splitting;
Wherein, the preset conditions are as follows: when the number of the adjacent assemblies is equal to the maximum number of the preset string assemblies, the total number of the assemblies of the number of the adjacent assemblies and the number of the assemblies without string wires is larger than or equal to twice the minimum number of the preset string assemblies; and when the number of the adjacent assemblies is smaller than the maximum number of the assemblies in the preset group string, the total number of the assemblies is larger than or equal to the maximum number of the assemblies in the preset group string.
Illustratively, the step of determining that the untangling area corresponds to the target group string to be split in the adjacent strung group string based on the adjacent component number, the adjacent group string number, and the untangling component number includes:
when the number of the adjacent group strings is larger than one, determining that the adjacent group strings which form a word-shaped string with the non-string component in the non-string area are the target group strings to be split corresponding to the non-string area in the adjacent group strings which are in the adjacent component number and the non-string component number and meet the preset condition of re-string;
wherein, the preset conditions are as follows: when the number of the adjacent assemblies is equal to the maximum number of the preset string assemblies, the total number of the assemblies of the number of the adjacent assemblies and the number of the assemblies without string wires is larger than or equal to twice the minimum number of the preset string assemblies; and when the number of the adjacent assemblies is smaller than the maximum number of the assemblies in the preset group string, the total number of the assemblies is larger than or equal to the maximum number of the assemblies in the preset group string.
Illustratively, the step of forming a plurality of split-recombination regions comprises:
if the adjacent series-connected strings exist in the common adjacent series-connected strings between the non-series-connected areas, determining that the split recombination area comprises an area where the target series exists and two adjacent non-series-connected areas corresponding to the common adjacent series-connected strings;
if the adjacent strung string does not have the common adjacent strung string between the non-strung areas, determining that the split and reorganized area comprises the area where the target string is located and the non-strung area.
Exemplary, the step of re-stringing all the components in the split and reorganized area to obtain a stringing result corresponding to each split and reorganized area includes:
based on the number of the maximum components of the preset strings and the number of the minimum components of the preset strings, performing linear string connection on all the components in the splitting and recombining area to obtain a plurality of undetermined string connection results;
and determining the string result corresponding to each splitting recombination region in the plurality of the string results to be determined.
Exemplary, the step of performing a linear string on all components in the splitting and reorganizing area based on the preset maximum number of components and the preset minimum number of components to obtain a plurality of pending string results includes:
According to the number of the string components, carrying out in-line string on all the components in the splitting and recombining area to obtain at least one undetermined string result and non-string components; the initial string component number is the maximum component number of the preset string;
subtracting one from the number of the string components to obtain the new number of the string components;
and carrying out linear string on all the components in the splitting and recombining area according to the number of the new string components to obtain a new at least one undetermined string result and a new non-string component until the number of the new string components is smaller than the number of the preset string minimum components.
The step of determining the string result corresponding to each split recombination region in the plurality of the undetermined string results includes:
performing weight removal on the number of components of each string component in the undetermined string result, and determining the average number of the number of components after weight removal;
determining a difference between the average number and the number of components that are not cross-wired;
and determining the undetermined string result with the largest difference value as the string result corresponding to the splitting and recombining area in the undetermined string results.
The application also provides a photovoltaic module string device, the device includes:
the device comprises an acquisition module, a control module and a control module, wherein the acquisition module is used for acquiring a preliminary string scheme of the photovoltaic module, and the preliminary string scheme comprises a string of a string group and a string-free module;
the determining module is used for dividing the non-string assembly into a plurality of non-string areas, determining adjacent string groups of the non-string areas, and determining target group strings to be split corresponding to the non-string areas in the adjacent string groups to form a plurality of splitting and recombination areas;
and the string module is used for splitting the target group string in the splitting and recombining area, and carrying out string threading on all components in the splitting and recombining area again to obtain string results corresponding to the splitting and recombining areas and an overall target string scheme.
The application also provides a photovoltaic module string line equipment, photovoltaic module string line equipment includes: 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 photovoltaic module string method 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 photovoltaic module string method as described above.
The embodiment of the application provides a photovoltaic module string method, a photovoltaic module string device, photovoltaic module string equipment and a computer readable storage medium, and a preliminary string scheme of a photovoltaic module is obtained, wherein the preliminary string scheme comprises string groups and non-string modules; dividing the non-string component into a plurality of non-string regions, determining adjacent string groups of each non-string region, and determining that each non-string region corresponds to a target group string to be split in the adjacent string groups to form a plurality of split recombination regions; splitting the target group string in the splitting and recombining area, and carrying out string threading again on all components in the splitting and recombining area to obtain a string threading result corresponding to each splitting and recombining area and an overall target string threading scheme.
In the application, firstly, acquiring a series of series-connected components and a non-series-connected component; and then dividing the non-string component into a plurality of non-string regions, determining adjacent string groups of each non-string region, determining the target group strings to be split corresponding to each non-string region in the adjacent string groups, and forming a plurality of splitting and recombination regions. And finally, splitting the target group strings in each splitting and recombining area to obtain target components, and carrying out string threading on the non-string components in the non-string area and the target components corresponding to the non-string area to obtain corresponding string threading results in each splitting and recombining area. And splitting each non-string region corresponding to the target assembly to be split, and stringing the non-string assembly in the non-string region and the target assembly corresponding to the non-string region, so that the stringing of the non-string assembly is realized, the number of the rest assemblies without stringing is reduced, and the number of the string assemblies is increased.
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 schematic flow chart of an embodiment of a photovoltaic module string method according to an embodiment of the present application;
fig. 3 is a schematic diagram of an embodiment of a photovoltaic module string method according to an embodiment of the present disclosure;
fig. 4 is a schematic diagram of the remaining components of an embodiment of a photovoltaic module string method according to an embodiment of the present disclosure;
fig. 5 is a schematic diagram of a secondary coding mapping matrix of an embodiment of a photovoltaic module string method according to an embodiment of the present disclosure;
FIG. 6 is a schematic diagram of a common adjacent string of an embodiment of a photovoltaic module string method according to an embodiment of the present disclosure;
fig. 7 is a schematic diagram of a common adjacent string separation and string connection method according to an embodiment of the present disclosure;
fig. 8 is a schematic diagram of a target string of an embodiment of a photovoltaic module string method according to an embodiment of the present disclosure;
fig. 9 is a schematic diagram of a photovoltaic module string device according to an embodiment of the present application.
The realization, functional characteristics and advantages of the present application will be further described with reference to the embodiments, referring to the attached drawings.
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 present 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:
obtaining a preliminary string scheme of the photovoltaic module, wherein the preliminary string scheme comprises string groups and non-string modules;
dividing the non-string component into a plurality of non-string regions, determining adjacent string groups of each non-string region, and determining that each non-string region corresponds to a target group string to be split in the adjacent string groups to form a plurality of split recombination regions;
Splitting the target group string in the splitting and recombining area, and carrying out string threading again on all components in the splitting and recombining area to obtain a string threading result corresponding to each splitting and recombining area and an overall target string threading scheme.
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 that each non-string region corresponds to the target group string to be split in the adjacent string groups includes:
determining whether there is a common adjacent series of strings between the non-series areas for adjacent series of strings of each of the non-series areas;
and determining that each non-series line area corresponds to a target group string to be split in the adjacent non-series line group strings based on a judging result of whether the adjacent series line group strings of each non-series line area exist or not.
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 that each non-string region corresponds to a target group string to be split in the adjacent non-string region based on the determination result of whether the adjacent non-string region exists in the adjacent non-string region, includes:
If the adjacent series-connected line group strings of the non-series-connected line areas exist in the common adjacent series-connected line group strings among the non-series-connected line areas, determining the common adjacent series-connected line group strings as target group strings to be split, wherein the target group strings correspond to the two adjacent non-series-connected line areas;
and if the adjacent bunched group strings of the non-bunched region do not have the public adjacent bunched group strings among the non-bunched regions, acquiring the number of adjacent assemblies of the adjacent bunched group strings of the non-bunched region, the number of adjacent group strings and the number of non-bunched assemblies of the non-bunched region, and determining that the non-bunched region corresponds to the target group string to be split in the adjacent bunched group strings based on the number of adjacent assemblies, the number of adjacent group strings and the number of non-bunched assemblies.
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 that the non-string region corresponds to a target group string to be split in the adjacent already-string group string based on the number of adjacent components, the number of adjacent group strings, and the number of non-string components includes:
when the number of the adjacent strings is one, and the number of the adjacent components and the number of the non-string components meet the preset condition of re-string, determining that the adjacent string of the non-string region is the target string of the non-string region corresponding to the splitting;
Wherein, the preset conditions are as follows: when the number of the adjacent assemblies is equal to the maximum number of the preset string assemblies, the total number of the assemblies of the number of the adjacent assemblies and the number of the assemblies without string wires is larger than or equal to twice the minimum number of the preset string assemblies; and when the number of the adjacent assemblies is smaller than the maximum number of the assemblies in the preset group string, the total number of the assemblies is larger than or equal to the maximum number of the assemblies in the preset 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 that the non-string region corresponds to a target group string to be split in the adjacent already-string group string based on the number of adjacent components, the number of adjacent group strings, and the number of non-string components includes:
when the number of the adjacent group strings is larger than one, determining that the adjacent group strings which form a word-shaped string with the non-string component in the non-string area are the target group strings to be split corresponding to the non-string area in the adjacent group strings which are in the adjacent component number and the non-string component number and meet the preset condition of re-string;
wherein, the preset conditions are as follows: when the number of the adjacent assemblies is equal to the maximum number of the preset string assemblies, the total number of the assemblies of the number of the adjacent assemblies and the number of the assemblies without string wires is larger than or equal to twice the minimum number of the preset string assemblies; and when the number of the adjacent assemblies is smaller than the maximum number of the assemblies in the preset group string, the total number of the assemblies is larger than or equal to the maximum number of the assemblies in the preset 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 forming a plurality of split-recombination regions comprises:
if the adjacent series-connected strings exist in the common adjacent series-connected strings between the non-series-connected areas, determining that the split recombination area comprises an area where the target series exists and two adjacent non-series-connected areas corresponding to the common adjacent series-connected strings;
if the adjacent strung string does not have the common adjacent strung string between the non-strung areas, determining that the split and reorganized area comprises the area where the target string is located and the non-strung area.
In an embodiment, the processor 1001 may call a computer program stored in the memory 1005, and further perform the following operations:
and the step of carrying out the string again on all the components in the splitting and recombining areas to obtain a string result corresponding to each splitting and recombining area comprises the following steps:
based on the number of the maximum components of the preset strings and the number of the minimum components of the preset strings, performing linear string connection on all the components in the splitting and recombining area to obtain a plurality of undetermined string connection results;
And determining the string result corresponding to each splitting recombination region in the plurality of the string results to be determined.
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 performing a linear string on all components in the splitting and recombining area based on the preset maximum number of components and the preset minimum number of components to obtain a plurality of pending string results comprises the following steps:
according to the number of the string components, carrying out in-line string on all the components in the splitting and recombining area to obtain at least one undetermined string result and non-string components; the initial string component number is the maximum component number of the preset string;
subtracting one from the number of the string components to obtain the new number of the string components;
and carrying out linear string on all the components in the splitting and recombining area according to the number of the new string components to obtain a new at least one undetermined string result and a new non-string component until the number of the new string components is smaller than the number of the preset string minimum components.
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 string result corresponding to each splitting recombination region in the plurality of the undetermined string results comprises the following steps:
performing weight removal on the number of components of each string component in the undetermined string result, and determining the average number of the number of components after weight removal;
determining a difference between the average number and the number of components that are not cross-wired;
and determining the undetermined string result with the largest difference value as the string result corresponding to the splitting and recombining area in the undetermined string results.
An embodiment of the present application provides a photovoltaic module string method, referring to fig. 2, in an embodiment of the photovoltaic module string method, the method includes:
step S10, a preliminary string scheme of the photovoltaic module is obtained, wherein the preliminary string scheme comprises string groups and non-string modules;
in the scene of distributed photovoltaic, the area of single roofing is bigger generally, and actual scene is comparatively complicated, and the existence of barriers such as fan, light extraction area, dormer on the roofing often can make the result regularity that the subassembly was arranged worse, has scattered subassembly in a lot of small areas. These scattered components are difficult to bring together with other components in current cross-line algorithms.
Referring to fig. 3, a preliminary string is performed on the group string of the string region, wherein the preliminary string result is a string of a word type (string capable of one stroke) in fig. 3; it should be noted that, the preliminary string results are both lateral openings or vertical openings, and the special case of string results in which both lateral and vertical openings exist is not considered in the present application. In addition, in the present embodiment, the preliminary string method of performing preliminary string on the group string of the string region is not limited.
As can be seen from fig. 3, most of the modules are strung into C-shaped strings, and after the C-shaped strings are completed, the larger part of the remaining module area also completes the photovoltaic module string, but because of the influence of the roof fan, many small-area modules are not strung, the areas of the modules are independent and dispersed, and the modules in a single area do not meet the minimum number of strings. Referring to fig. 4, the remaining components that are not cross-wired outside the preliminary cross-wired result, such as components in the region of A, B, C, D, E five in fig. 4, are not cross-wired in a straight line.
Step S20, dividing the non-string component into a plurality of non-string regions, determining adjacent string groups of each non-string region, and determining that each non-string region corresponds to a target group string to be split in the adjacent string groups to form a plurality of split recombination regions;
In this embodiment, when determining the area where the remaining components are located, that is, when dividing the non-cross-hatched components into a plurality of non-cross-hatched areas, the area where the remaining components are located may be divided with reference to the secondary coding mapping matrix as shown in fig. 5. When dividing the areas where the rest components are located, dividing the connectable adjacent components into one area according to the row and column relation of the secondary coding mapping matrix. In the secondary code mapping matrix, subtracted components are mapped to 0, while components that have been cross-hatched are mapped to-1, so that only the codes of the remaining components are non-zero positive natural numbers. Referring to fig. 5, code-1 indicates that the current component has been cross-hatched, and code 0 indicates that the component of the area has been subtracted due to an obstacle or the like. The remaining components may be divided into different small areas according to codes 0 and-1 in the matrix, as shown by the dotted line box in fig. 5, and the remaining components may be divided into 3 small areas.
After the area where the remaining components are located is divided, the adjacent series-connected strings of the area where each remaining component is located can be determined according to the connection relation of the components and the position relation among the strings, and the number of the adjacent series-connected strings of the area where each remaining component is located can be 0, 1 or more.
Illustratively, the step of determining that each of the non-stringed regions corresponds to the target group string to be split in the adjacent stringed group strings includes:
determining whether there is a common adjacent series of strings between the non-series areas for adjacent series of strings of each of the non-series areas;
and determining that each non-series line area corresponds to a target group string to be split in the adjacent non-series line group strings based on a judging result of whether the adjacent series line group strings of each non-series line area exist or not.
Firstly, determining whether adjacent bunched line group strings of the non-bunched area exist common adjacent bunched line group strings among the non-bunched area, and then further determining that each non-bunched area corresponds to a target group string to be split according to a judging result of whether the adjacent bunched line group strings of the non-bunched area exist common adjacent bunched line group strings.
In addition, if the number of adjacent strings is zero, it is determined that the non-string region does not have a corresponding target string to be split, and the non-string region is an isolated region and cannot be string.
The step of determining that each non-string region corresponds to the target group string to be split in the adjacent non-string region based on the determination result of whether the adjacent non-string region exists in the adjacent non-string region, includes:
If the adjacent series-connected line group strings of the non-series-connected line areas exist in the common adjacent series-connected line group strings among the non-series-connected line areas, determining the common adjacent series-connected line group strings as target group strings to be split, wherein the target group strings correspond to the two adjacent non-series-connected line areas;
and if the adjacent bunched group strings of the non-bunched region do not have the public adjacent bunched group strings among the non-bunched regions, acquiring the number of adjacent assemblies of the adjacent bunched group strings of the non-bunched region, the number of adjacent group strings and the number of non-bunched assemblies of the non-bunched region, and determining that the non-bunched region corresponds to the target group string to be split in the adjacent bunched group strings based on the number of adjacent assemblies, the number of adjacent group strings and the number of non-bunched assemblies.
If the adjacent bunched group strings of the non-bunched area have the public adjacent bunched group strings, determining that the adjacent bunched group strings of the non-bunched area are the target group strings to be split corresponding to the non-bunched area, at the moment, determining the target group strings as two adjacent non-bunched areas corresponding to the public adjacent bunched group strings, and bunching the target group strings and the non-bunched group strings in the two adjacent non-bunched areas together, wherein when the three group strings are bunched, the requirement of the number of components of each group string obtained after the bunching can be not considered, and the bunching based on a preset bunching strategy can be directly carried out.
If the adjacent bunched group strings of the non-bunched area do not have the public adjacent bunched group strings, the adjacent component number, the adjacent group string number of the adjacent bunched group strings of the non-bunched area and the non-bunched component number of the non-bunched area are required to be obtained, and then the non-bunched area corresponding to the target group string to be split is determined in the adjacent bunched group strings according to the adjacent component number, the adjacent group string number and the non-bunched component number.
In an embodiment, referring to fig. 6, if there are two adjacent strings between the plurality of non-string regions, for example, the non-string region 1 and the non-string region 2 each have two adjacent strings, wherein the non-string region 1 has two adjacent strings on the right side thereof, and the non-string region 2 has two adjacent strings on the left side and the upper side thereof. However, there is a common adjacent string 3 in the two non-string regions, so that when selecting the target group string, this common adjacent string is selected as the target group string. In this way, after splitting, the components of the non-string regions 1 and 2 and the components of the common adjacent string 3 can be strung together, and two new strings can be formed after splitting.
In an embodiment, referring to fig. 7, according to the logic described above, assuming that the maximum number of components maxnum=20, the minimum number of components minnum=14, the number of components remaining in the 4 non-string regions in fig. 7 does not satisfy the minimum number of strings, and there is a common adjacent string in each of the two non-string regions, after splitting and re-string, most of the remaining non-string components will be strung.
Illustratively, the step of determining that the untangling area corresponds to the target group string to be split in the adjacent strung group string based on the adjacent component number, the adjacent group string number, and the untangling component number includes:
when the number of the adjacent strings is one, and the number of the adjacent components and the number of the non-string components meet the preset condition of re-string, determining that the adjacent string of the non-string region is the target string of the non-string region corresponding to the splitting;
wherein, the preset conditions are as follows: when the number of the adjacent assemblies is equal to the maximum number of the preset string assemblies, the total number of the assemblies of the number of the adjacent assemblies and the number of the assemblies without string wires is larger than or equal to twice the minimum number of the preset string assemblies; and when the number of the adjacent assemblies is smaller than the maximum number of the assemblies in the preset group string, the total number of the assemblies is larger than or equal to the maximum number of the assemblies in the preset group string.
And when the number of the adjacent group strings is one and the number of the adjacent components meets the preset condition of re-stringing, determining the adjacent strung group strings of the non-stringing area as target group strings to be split corresponding to the non-stringing area. In an embodiment, assuming that the number of non-string components in the non-string region is M, if the number of components in the adjacent string is equal to the maximum number of components in the preset string, maxNum, that is, the adjacent string is full, when maxnum+m > =2×minnum (the minimum number of components in the preset string) is satisfied, it is determined that the adjacent string is the non-string region corresponding to the target string to be split. That is, the components of the adjacent strings and the non-string components of the non-string region can be split into at least two minimum strings, and the number of components of the two minimum strings is the preset minimum number of components of the strings.
If the number of components of the adjacent string is smaller than the maximum number of components of the preset string, maxNum, that is, the adjacent string is determined to be the target string to be split corresponding to the non-string region when the number of adjacent components+m > =the maximum number of components of the preset string (maxNum). That is, the components of adjacent strings and the non-string components of the non-string region can be split into at least one maximum group of strings, and the number of components of the maximum group of strings is the preset maximum number of components of the group of strings.
Illustratively, the step of determining that the untangling area corresponds to the target group string to be split in the adjacent strung group string based on the adjacent component number, the adjacent group string number, and the untangling component number includes:
when the number of the adjacent group strings is larger than one, determining that the adjacent group strings which form a word-shaped string with the non-string component in the non-string area are the target group strings to be split corresponding to the non-string area in the adjacent group strings which are in the adjacent component number and the non-string component number and meet the preset condition of re-string;
wherein, the preset conditions are as follows: when the number of the adjacent assemblies is equal to the maximum number of the preset string assemblies, the total number of the assemblies of the number of the adjacent assemblies and the number of the assemblies without string wires is larger than or equal to twice the minimum number of the preset string assemblies; and when the number of the adjacent assemblies is smaller than the maximum number of the assemblies in the preset group string, the total number of the assemblies is larger than or equal to the maximum number of the assemblies in the preset group string.
And when the number of the adjacent group strings is larger than one, determining that the adjacent group strings forming a word-shaped string with the non-string component in the non-string region are the target group strings to be split corresponding to the non-string region in the adjacent group strings of which the number of the adjacent components meets the preset condition of re-string.
In one embodiment, referring to fig. 8, the upper left Fang Xuxian box shows the non-string region and its adjacent strings (respectively on the left and upper sides), and the C-string on the left side is because the adjacent strings on the upper side and the remaining non-string components cannot form a complete string, which eventually results in some components still not being string-wired, and the components in the C-string on the left side and the remaining non-string components can form a complete string, as shown in the following dotted line box. After re-stringing, the components in the C-shaped string at the left side and the remaining components without stringing can be divided into 2 strings, and the two strings meet the requirements of the maximum number of components in the preset string and the number of components in the minimum number of components in the preset string.
Illustratively, the step of forming a plurality of split-recombination regions comprises:
if the adjacent series-connected strings exist in the common adjacent series-connected strings between the non-series-connected areas, determining that the split recombination area comprises an area where the target series exists and two adjacent non-series-connected areas corresponding to the common adjacent series-connected strings;
If the adjacent strung string does not have the common adjacent strung string between the non-strung areas, determining that the split and reorganized area comprises the area where the target string is located and the non-strung area.
If the adjacent strung string is a common adjacent strung string between the non-strung regions, determining that the split and reorganized region includes the target string and two non-strung regions corresponding to the common adjacent strung string. If the adjacent strung string is not a common adjacent strung string between the non-strung regions, then it is determined that the split-reorganized region includes the target string and the non-strung regions.
And step S30, splitting the target group string in the splitting and recombining area, and carrying out string threading again on all components in the splitting and recombining area to obtain a string threading result corresponding to each splitting and recombining area and an overall target string threading scheme.
After determining that each non-string region corresponds to the target group string to be split in the adjacent string groups, a plurality of splitting and recombining regions are formed, so that the non-string components in the non-string region and the target components obtained by splitting the target group string can be considered as a whole, and the strings can be carried out again together, and the string results corresponding to the splitting and recombining regions are obtained. Thus, the string of almost all components in the string region, especially the string of most of the rest components, is realized. And finally determining the overall target string scheme of each photovoltaic module in the area to be string by reproducing string of the non-string module.
Exemplary, the step of re-stringing all the components in the split and reorganized area to obtain a stringing result corresponding to each split and reorganized area includes:
based on the number of the maximum components of the preset strings and the number of the minimum components of the preset strings, performing linear string connection on all the components in the splitting and recombining area to obtain a plurality of undetermined string connection results;
and determining the string result corresponding to each splitting recombination region in the plurality of the string results to be determined.
When the non-string components in the non-string region and the target components corresponding to the non-string region are in string, namely when all the components in the splitting and recombining region are in string again, the non-string components in the non-string region and the target components corresponding to the non-string region are in line type string based on the preset maximum component number and the preset minimum component number, and a plurality of undetermined string results are obtained, so that the residual components after string again are at least, and the component number of each group of strings is as large as possible. And then determining the string result corresponding to each splitting recombination region in the plurality of undetermined string results.
Exemplary, the step of performing a linear string on all components in the splitting and reorganizing area based on the preset maximum number of components and the preset minimum number of components to obtain a plurality of pending string results includes:
According to the number of the string components, carrying out in-line string on all the components in the splitting and recombining area to obtain at least one undetermined string result and non-string components; the initial string component number is the maximum component number of the preset string;
subtracting one from the number of the string components to obtain the new number of the string components;
and carrying out linear string on all the components in the splitting and recombining area according to the number of the new string components to obtain a new at least one undetermined string result and a new non-string component until the number of the new string components is smaller than the number of the preset string minimum components.
The maximum number of components that can be most strung by a word group is N in the non-strung components in the non-strung region and the target components corresponding to the non-strung region (there is a possibility that some components cannot be strung by a word group in the non-strung components in the non-strung region and the target components corresponding to the non-strung region).
Firstly, according to the preset maximum number of components maxNum, performing one-word string on the non-string components in the non-string region and the target components corresponding to the non-string region to obtain at least one undetermined string result and the non-string components, simultaneously calculating n=N% maxNum of the non-string components, if N > =minNum is met, taking the N last non-string components as the last string, setting N as 0, and re-performing one-word string segmentation of the next round.
Then, subtracting one from the maximum number of components maxNum of the preset string to obtain the new number maxNum-1 of string components;
and according to the number maxNum-1 of the new string components, performing one-word string on the non-string components in the non-string region and the target components corresponding to the non-string region to obtain at least one undetermined string result and a new non-string component, and similarly, calculating n=N (maxNum-1) of the new non-string component, if N > =minNum is met, taking the N last non-string components as the last string, setting N as 0, and re-performing one-word string segmentation of the next round.
And circulating until the number of the new string components is smaller than the minimum number of the components minNum of the preset string, thereby obtaining a plurality of undetermined string results.
In one embodiment, if maxnum=26, minnum=20, n=72, then all reasonable allocation schemes (multiple pending string results) are: [26,26,20], [25,25,22], [24,24,24], the non-strung components n of the three schemes are all 0.
In one embodiment, if maxnum=26, minnum=20, n=71, then all reasonable allocation schemes (multiple pending string results) are:
[26,26, 19], two strings of 26 components each, leaving 19 components untwisted;
[25, 25, 21], three strings, not strung with the string component n being 0;
[24, 24, 23], three strings, not strung with the string component n being 0;
[23, 23, 25], three strings, not strung with the string component n being 0;
[22, 22,5], three strings of 22 components each, with 5 components remaining untwisted;
[21, 21, 21,8], three strings of 21 components each, leaving 8 components untwisted;
[20, 20, 20, 11], three strings of 20 components each, the remaining 11 components not being strung.
The step of determining the string result corresponding to each split recombination region in the plurality of the undetermined string results includes:
performing weight removal on the number of components of each string component in the undetermined string result, and determining the average number of the number of components after weight removal;
determining a difference between the average number and the number of components that are not cross-wired;
and determining the undetermined string result with the largest difference value as the string result corresponding to the splitting and recombining area in the undetermined string results.
In one embodiment, if the plurality of pending string results are:
[26, 26, 19], two strings of 26 components each, leaving 19 components untwisted;
[25, 25, 21], three strings, not strung with the string component n being 0;
[24, 24, 23], three strings, not strung with the string component n being 0;
[23, 23, 25], three strings, not strung with the string component n being 0;
[22, 22,5], three strings of 22 components each, with 5 components remaining untwisted;
[21, 21, 21,8], three strings of 21 components each, leaving 8 components untwisted;
[20, 20, 20, 11], three strings of 20 components each, the remaining 11 components not being strung.
Referring to the above embodiment, when determining the string result corresponding to the splitting and reorganizing area in the plurality of pending string results, firstly, de-duplicating the component number of each string component in the pending string result, and determining the average number of the de-duplicated component numbers, where the average number is respectively:
the number of components after the duplicate removal is [26], the serial type after the duplicate removal is 1, the average number of the components after the duplicate removal is 26/1=26, and the difference between the average number and the number of the components without the serial components is 26-19=7;
[25, 25, 21], the number of components after de-duplication is [25, 21], the type of strings after de-duplication is 2, the average number of components after de-duplication is (25+21)/2=23, and the difference between the average number and the number of components without string components is 23-0=23;
The number of components after the duplicate removal is [24, 23], the serial type after the duplicate removal is 2, the average number of the components after the duplicate removal is (24+23)/2=23.5, and the difference between the average number and the number of the components without the serial components is 23.5-0=23.5;
[23, 23, 25], the number of components after de-duplication is [23, 25], the type of the string after de-duplication is 2, the average number of components after de-duplication is (23+25)/2=24, and the difference between the average number and the number of components without string components is 24-0=24;
[22, 22,5], the number of components after de-duplication is [22], the type of strings after de-duplication is 1, the average number of components after de-duplication is 22/1=22, and the difference between the average number and the number of components without string components is 22-5=17;
[21, 21, 21,8], the number of components after de-duplication is [21], the type of strings after de-duplication is 1, the average number of components after de-duplication is 21/1=21, and the difference between the average number and the number of components without string components is 21-8=13;
the number of components after the duplicate removal is [20], the group string type after the duplicate removal is 1, the average number of components after the duplicate removal is 20/1=20, and the difference between the average number and the number of components without the string components is 20-11=9.
Finally, among the above-mentioned plural undetermined string results, undetermined string results [23, 23, 25] of the maximum difference value (24) are determined as string results corresponding to the split recombination region.
Note that, in all reasonable allocation schemes (a plurality of pending string results) corresponding to maxnum=26, minnum=20, and n=71, if it is desired to satisfy the weak constraint that "the difference between the maximum component number and the minimum component number of each group of strings after re-string allocation is as small as possible", the allocation scheme of [24, 24, 23] should be selected as the final string result. However, the allocation scheme of [23, 23, 25] is selected as the final string result, because the difference between the maximum number of components and the minimum number of components is selected as the target although the weak constraint condition is not met (the scheme of [24, 24, 23] is 1 block of components and the scheme of [23, 23, 25] is 2 block of components), the difference between the total number of components of the non-string components in the non-string region and the target components corresponding to the non-string region in the distributed photovoltaic project scene is smaller, and is generally the difference between several blocks of components, and the final string result of the photovoltaic components is not seriously affected, while the consistency and the stability of the string result of the region selected based on the maximum difference can be replaced by the smaller difference of the number of components. Therefore, the difference between the maximum component number and the minimum component number of each group of strings after re-stringing distribution is as small as possible, and the group string types with different component numbers obtained by re-stringing are as small as possible.
In this embodiment, first, a series of series-connected components and a non-series-connected component are obtained; and then dividing the non-string component into a plurality of non-string regions, determining adjacent string groups of each non-string region, determining the target group strings to be split corresponding to each non-string region in the adjacent string groups, and forming a plurality of splitting and recombination regions. And finally, splitting the target group strings in each splitting and recombining area to obtain target components, and carrying out string threading on the non-string components in the non-string area and the target components corresponding to the non-string area to obtain corresponding string threading results in each splitting and recombining area. And splitting each non-string region corresponding to the target assembly to be split, and stringing the non-string assembly in the non-string region and the target assembly corresponding to the non-string region, so that the stringing of the non-string assembly is realized, the number of the rest assemblies without stringing is reduced, and the number of the string assemblies is increased.
Referring to fig. 9, in addition, the embodiment of the present application further provides a photovoltaic module string device, the photovoltaic module string device includes:
the device comprises an acquisition module M1, a control module and a control module, wherein the acquisition module M1 is used for acquiring a preliminary string scheme of a photovoltaic module, and the preliminary string scheme comprises a string of a string group and a string-free module;
The determining module M2 is configured to divide the non-string component into a plurality of non-string regions, determine adjacent string groups of the non-string regions, and determine that each non-string region corresponds to a target group string to be split in the adjacent string groups to form a plurality of split recombination regions;
and the string module M3 is used for splitting the target group string in the splitting and recombining area, and carrying out string again on all components in the splitting and recombining area to obtain a string result corresponding to each splitting and recombining area and an overall target string scheme.
Illustratively, the determining module is further configured to:
determining whether there is a common adjacent series of strings between the non-series areas for adjacent series of strings of each of the non-series areas;
and determining that each non-series line area corresponds to a target group string to be split in the adjacent non-series line group strings based on a judging result of whether the adjacent series line group strings of each non-series line area exist or not.
Illustratively, the determining module is further configured to:
if the adjacent series-connected line group strings of the non-series-connected line areas exist in the common adjacent series-connected line group strings among the non-series-connected line areas, determining the common adjacent series-connected line group strings as target group strings to be split, wherein the target group strings correspond to the two adjacent non-series-connected line areas;
And if the adjacent bunched group strings of the non-bunched region do not have the public adjacent bunched group strings among the non-bunched regions, acquiring the number of adjacent assemblies of the adjacent bunched group strings of the non-bunched region, the number of adjacent group strings and the number of non-bunched assemblies of the non-bunched region, and determining that the non-bunched region corresponds to the target group string to be split in the adjacent bunched group strings based on the number of adjacent assemblies, the number of adjacent group strings and the number of non-bunched assemblies.
Illustratively, the determining module is further configured to:
when the number of the adjacent strings is one, and the number of the adjacent components and the number of the non-string components meet the preset condition of re-string, determining that the adjacent string of the non-string region is the target string of the non-string region corresponding to the splitting;
wherein, the preset conditions are as follows: when the number of the adjacent assemblies is equal to the maximum number of the preset string assemblies, the total number of the assemblies of the number of the adjacent assemblies and the number of the assemblies without string wires is larger than or equal to twice the minimum number of the preset string assemblies; and when the number of the adjacent assemblies is smaller than the maximum number of the assemblies in the preset group string, the total number of the assemblies is larger than or equal to the maximum number of the assemblies in the preset group string.
Illustratively, the determining module is further configured to:
when the number of the adjacent group strings is larger than one, determining that the adjacent group strings which form a word-shaped string with the non-string component in the non-string area are the target group strings to be split corresponding to the non-string area in the adjacent group strings which are in the adjacent component number and the non-string component number and meet the preset condition of re-string;
wherein, the preset conditions are as follows: when the number of the adjacent assemblies is equal to the maximum number of the preset string assemblies, the total number of the assemblies of the number of the adjacent assemblies and the number of the assemblies without string wires is larger than or equal to twice the minimum number of the preset string assemblies; and when the number of the adjacent assemblies is smaller than the maximum number of the assemblies in the preset group string, the total number of the assemblies is larger than or equal to the maximum number of the assemblies in the preset group string.
Illustratively, the determining module is further configured to:
if the adjacent series-connected strings exist in the common adjacent series-connected strings between the non-series-connected areas, determining that the split recombination area comprises an area where the target series exists and two adjacent non-series-connected areas corresponding to the common adjacent series-connected strings;
If the adjacent strung string does not have the common adjacent strung string between the non-strung areas, determining that the split and reorganized area comprises the area where the target string is located and the non-strung area.
Illustratively, the string module is further configured to:
based on the number of the maximum components of the preset strings and the number of the minimum components of the preset strings, performing linear string connection on all the components in the splitting and recombining area to obtain a plurality of undetermined string connection results;
and determining the string result corresponding to each splitting recombination region in the plurality of the string results to be determined.
Illustratively, the string module is further configured to:
according to the number of the string components, carrying out in-line string on all the components in the splitting and recombining area to obtain at least one undetermined string result and non-string components; the initial string component number is the maximum component number of the preset string;
subtracting one from the number of the string components to obtain the new number of the string components;
and carrying out linear string on all the components in the splitting and recombining area according to the number of the new string components to obtain a new at least one undetermined string result and a new non-string component until the number of the new string components is smaller than the number of the preset string minimum components.
Illustratively, the string module is further configured to:
performing weight removal on the number of components of each string component in the undetermined string result, and determining the average number of the number of components after weight removal;
determining a difference between the average number and the number of components that are not cross-wired;
and determining the undetermined string result with the largest difference value as the string result corresponding to the splitting and recombining area in the undetermined string results.
The photovoltaic module string device provided by the application adopts the photovoltaic module string method in the embodiment, and aims at string the rest components. Compared with the conventional technology, the photovoltaic module string device provided by the embodiment of the application has the same beneficial effects as the photovoltaic module string method provided by the embodiment, and other technical features in the photovoltaic module string device are the same as the features disclosed by the embodiment method, and the description is omitted here.
In addition, the embodiment of the application also provides a photovoltaic module string line equipment, the photovoltaic module string line equipment includes: 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 photovoltaic module string method as described above.
In addition, the embodiment of the application further provides a computer readable storage medium, and a computer program is stored on the computer readable storage medium, and the computer program realizes the steps of the photovoltaic module string method when being executed by a processor.
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 described in 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 claims, and all equivalent structures or equivalent processes using the descriptions and drawings of the present application, or direct or indirect application in other related technical fields are included in the scope of the claims of the present application.

Claims (12)

1. A photovoltaic module string method, the method comprising:
obtaining a preliminary string scheme of the photovoltaic module, wherein the preliminary string scheme comprises string groups and non-string modules;
dividing the non-string component into a plurality of non-string regions, determining adjacent string groups of each non-string region, and determining that each non-string region corresponds to a target group string to be split in the adjacent string groups to form a plurality of split recombination regions;
splitting the target group string in the splitting and recombining area, and carrying out string threading again on all components in the splitting and recombining area to obtain a string threading result corresponding to each splitting and recombining area and an overall target string threading scheme.
2. The photovoltaic module string method according to claim 1, wherein the step of determining that each of the non-string regions corresponds to a target string to be split in the adjacent string group strings includes:
Determining whether there is a common adjacent series of strings between the non-series areas for adjacent series of strings of each of the non-series areas;
and determining that each non-series line area corresponds to a target group string to be split in the adjacent non-series line group strings based on a judging result of whether the adjacent series line group strings of each non-series line area exist or not.
3. The photovoltaic module string method according to claim 2, wherein the step of determining, in the adjacent strung-line group strings, that each of the non-strung-line regions corresponds to a target group string to be split, based on a result of determining whether there is a common adjacent strung-line group string between the non-strung-line regions of each of the adjacent strung-line group strings, includes:
if the adjacent series-connected line group strings of the non-series-connected line areas exist in the common adjacent series-connected line group strings among the non-series-connected line areas, determining the common adjacent series-connected line group strings as target group strings to be split, wherein the target group strings correspond to the two adjacent non-series-connected line areas;
and if the adjacent bunched group strings of the non-bunched region do not have the public adjacent bunched group strings among the non-bunched regions, acquiring the number of adjacent assemblies of the adjacent bunched group strings of the non-bunched region, the number of adjacent group strings and the number of non-bunched assemblies of the non-bunched region, and determining that the non-bunched region corresponds to the target group string to be split in the adjacent bunched group strings based on the number of adjacent assemblies, the number of adjacent group strings and the number of non-bunched assemblies.
4. The photovoltaic module string method according to claim 3, wherein the step of determining that the untangling region corresponds to a target group string to be split in the adjacent strung group string based on the adjacent module number, the adjacent group string number, and the untangling module number comprises:
when the number of the adjacent strings is one, and the number of the adjacent components and the number of the non-string components meet the preset condition of re-string, determining that the adjacent string of the non-string region is the target string of the non-string region corresponding to the splitting;
wherein, the preset conditions are as follows: when the number of the adjacent assemblies is equal to the maximum number of the preset string assemblies, the total number of the assemblies of the number of the adjacent assemblies and the number of the assemblies without string wires is larger than or equal to twice the minimum number of the preset string assemblies; and when the number of the adjacent assemblies is smaller than the maximum number of the assemblies in the preset group string, the total number of the assemblies is larger than or equal to the maximum number of the assemblies in the preset group string.
5. The photovoltaic module string method according to claim 3, wherein the step of determining that the untangling region corresponds to a target group string to be split in the adjacent strung group string based on the adjacent module number, the adjacent group string number, and the untangling module number comprises:
When the number of the adjacent group strings is larger than one, determining that the adjacent group strings which form a word-shaped string with the non-string component in the non-string area are the target group strings to be split corresponding to the non-string area in the adjacent group strings which are in the adjacent component number and the non-string component number and meet the preset condition of re-string;
wherein, the preset conditions are as follows: when the number of the adjacent assemblies is equal to the maximum number of the preset string assemblies, the total number of the assemblies of the number of the adjacent assemblies and the number of the assemblies without string wires is larger than or equal to twice the minimum number of the preset string assemblies; and when the number of the adjacent assemblies is smaller than the maximum number of the assemblies in the preset group string, the total number of the assemblies is larger than or equal to the maximum number of the assemblies in the preset group string.
6. The photovoltaic module string method of claim 3, wherein the step of forming a plurality of split recombination regions comprises:
if the adjacent series-connected strings exist in the common adjacent series-connected strings between the non-series-connected areas, determining that the split recombination area comprises an area where the target series exists and two adjacent non-series-connected areas corresponding to the common adjacent series-connected strings;
If the adjacent strung string does not have the common adjacent strung string between the non-strung areas, determining that the split and reorganized area comprises the area where the target string is located and the non-strung area.
7. The photovoltaic module string method according to claim 1, wherein the step of re-stringing all the modules in the split recombination region to obtain string results corresponding to the split recombination regions comprises:
based on the number of the maximum components of the preset strings and the number of the minimum components of the preset strings, performing linear string connection on all the components in the splitting and recombining area to obtain a plurality of undetermined string connection results;
and determining the string result corresponding to each splitting recombination region in the plurality of the string results to be determined.
8. The photovoltaic module string method according to claim 7, wherein the step of performing a in-line string on all the modules in the split recombination region based on the preset maximum number of modules and the preset minimum number of modules to obtain a plurality of pending string results comprises:
according to the number of the string components, carrying out in-line string on all the components in the splitting and recombining area to obtain at least one undetermined string result and non-string components; the initial string component number is the maximum component number of the preset string;
Subtracting one from the number of the string components to obtain the new number of the string components;
and carrying out linear string on all the components in the splitting and recombining area according to the number of the new string components to obtain a new at least one undetermined string result and a new non-string component until the number of the new string components is smaller than the number of the preset string minimum components.
9. The photovoltaic module string method according to claim 7, wherein the step of determining a string result corresponding to each split recombination region from among the plurality of pending string results comprises:
performing weight removal on the number of components of each string component in the undetermined string result, and determining the average number of the number of components after weight removal;
determining a difference between the average number and the number of components that are not cross-wired;
and determining the undetermined string result with the largest difference value as the string result corresponding to the splitting and recombining area in the undetermined string results.
10. A photovoltaic module string device, the device comprising:
the device comprises an acquisition module, a control module and a control module, wherein the acquisition module is used for acquiring a preliminary string scheme of the photovoltaic module, and the preliminary string scheme comprises a string of a string group and a string-free module;
The determining module is used for dividing the non-string assembly into a plurality of non-string areas, determining adjacent string groups of the non-string areas, and determining target group strings to be split corresponding to the non-string areas in the adjacent string groups to form a plurality of splitting and recombination areas;
and the string module is used for splitting the target group string in the splitting and recombining area, and carrying out string threading on all components in the splitting and recombining area again to obtain string results corresponding to the splitting and recombining areas and an overall target string scheme.
11. Photovoltaic module string equipment, its characterized in that, photovoltaic module string equipment includes: 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 photovoltaic module string method of any one of claims 1 to 9.
12. A computer-readable storage medium, characterized in that the computer-readable storage medium has stored thereon a computer program which, when executed by a processor, implements the steps of the photovoltaic module string method of any of claims 1 to 9.
CN202311357822.0A 2023-10-18 2023-10-18 Photovoltaic module string method, device, equipment and medium Pending CN117421844A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202311357822.0A CN117421844A (en) 2023-10-18 2023-10-18 Photovoltaic module string method, device, equipment and medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202311357822.0A CN117421844A (en) 2023-10-18 2023-10-18 Photovoltaic module string method, device, equipment and medium

Publications (1)

Publication Number Publication Date
CN117421844A true CN117421844A (en) 2024-01-19

Family

ID=89525868

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202311357822.0A Pending CN117421844A (en) 2023-10-18 2023-10-18 Photovoltaic module string method, device, equipment and medium

Country Status (1)

Country Link
CN (1) CN117421844A (en)

Similar Documents

Publication Publication Date Title
CN112241421A (en) Data blood margin determination method and device
CN109255514B (en) Method for evaluating independent power supply capacity of intelligent power distribution network partitions
CN111541628A (en) Power communication network service resource allocation method and related device
CN110298615A (en) For selecting method, apparatus, medium and the calculating equipment of the kinds of goods in warehouse
CN111626497B (en) People flow prediction method, device, equipment and storage medium
CN109586281B (en) Power distribution network reliability assessment method, device and medium based on node optimization number
CN117421844A (en) Photovoltaic module string method, device, equipment and medium
CN113850426A (en) Fire station site selection method and device, terminal equipment and storage medium
CN116680925B (en) Intelligent space emergency processing method, system and medium based on big data
CN115879544B (en) Neuron coding method and system for distributed brain-like simulation
CN111915091A (en) Parking space arrangement method, device, terminal and medium
CN116304091A (en) Construction and application method, device, equipment and medium of design selection type knowledge graph
EP0537356A1 (en) Blank layout method for glass plate cutting machine
CN116644544A (en) Method, device and medium for stringing residual components
CN115865099A (en) Multi-type data segmentation compression method and system based on Huffman coding
CN114938199A (en) Photovoltaic module serial line arrangement determining method and device, electronic equipment and storage medium
CN106599411B (en) Aircraft system redundancy configuration optimization method
CN113131476A (en) Power load prediction method
CN116644545A (en) String system and computer readable storage medium
CN117113698A (en) Photovoltaic module arrangement method, device, equipment and computer storage medium
CN116896113A (en) Converging dividing method, device, equipment and medium for photovoltaic module
Bin et al. A Genetic Clustering Method Based on Variable Length String
CN114880620B (en) Aggregation generation method of directed tree group
CN110941246B (en) HMI message shunting scheduling method, storage medium and device
CN109857776B (en) Method and device for sequencing service data in application

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