Square power battery combination method and terminal

Abstract

The application discloses a square power battery combination method and a terminal, relates to the technical field of combination algorithms, and obtains the numbers and thicknesses of all battery cells; a preset battery cell number of each battery module and a total battery cell number are obtained, the remainder of the battery cell number divided by the battery cell number of each battery module is calculated, and the battery cells with the remainder number are removed; the battery cell number of each battery module is greater than or equal to 2, and the total battery cell number is greater than the battery cell number of each battery module; through sorting combination, the battery cell combination with the minimum tolerance of the battery module number is obtained, and the battery cell combination is output. The battery cell thickness is measured, the battery cells are numbered, the battery cells are combined according to a specific mechanism, and then the combined battery cells are output, so that the total thickness of the battery pack after combination is optimized, and the problem of high waste rate caused by excessive tolerance of the battery pack is solved.

Description

Technical Field

[0001] This invention relates to the field of combination algorithm technology, and in particular to a method and terminal for combining square power batteries. Background Technology

[0002] After a power battery cell is produced, it needs to be assembled into a battery pack, along with front and rear end plates and filler materials, to form a battery module, so as to give full play to the advantages of battery combination and at the same time ensure that heat dissipation meets functional requirements.

[0003] In current technology, most manufacturers adopt an arbitrary combination method regardless of the thickness and height of the produced battery cells, ignoring the length or thickness error of the battery pack. For battery packs exceeding the module width, a pressing machine is used to press the entire module. However, this direct pressing method may cause irreversible damage to the power cells. Therefore, some manufacturers only perform post-processing inspections, scrapping the endplate and inspecting the cell only when it cannot be welded to the cell endplate, resulting in a significant waste of labor and materials. Summary of the Invention

[0004] The technical problem to be solved by the present invention is to provide a method for assembling a square power battery and a terminal.

[0005] To solve the above-mentioned technical problems, the technical solution adopted by the present invention is as follows:

[0006] A method for assembling a square power battery includes the following steps:

[0007] S1. Obtain the number and thickness of each battery cell;

[0008] S2. Obtain the preset number of cells in each battery module and the total number of cells, calculate the remainder when the total number of cells is divided by the number of cells in each battery module, and remove the cells with the remainder. The number of cells in each battery module is ≥2, and the total number of cells is > the number of cells in each battery module.

[0009] S3. By sorting and combining, obtain the cell combination with the smallest number of battery modules and output the cell combination. The number of battery modules is the quotient of the number of cells divided by the number of cells in each battery module.

[0010] To solve the above-mentioned technical problems, another technical solution adopted by the present invention is as follows:

[0011] A square power battery pack terminal includes a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the computer program, it performs the following steps:

[0012] S1. Obtain the number and thickness of each battery cell;

[0013] S2. Obtain the preset number of cells in each battery module and the total number of cells, calculate the remainder when the total number of cells is divided by the number of cells in each battery module, and remove the cells with the remainder. The number of cells in each battery module is ≥2, and the total number of cells is > the number of cells in each battery module.

[0014] S3. By sorting and combining, obtain the cell combination with the smallest number of battery modules and output the cell combination. The number of battery modules is the quotient of the number of cells divided by the number of cells in each battery module.

[0015] The beneficial effects of the present invention are as follows: a method and terminal for assembling a square power battery, which obtains the measured thickness of the battery cells, numbers each battery cell, and then combines the battery cells using a specific mechanism to output the result, thereby optimizing the total thickness of the battery pack assembly and solving the long-standing problem of excessive tolerance and high scrap rate that has plagued battery manufacturers. Attached Figure Description

[0016] Figure 1 This is a schematic flowchart of a square power battery assembly method according to an embodiment of the present invention;

[0017] Figure 2 This is a schematic diagram of a square power battery combination terminal according to an embodiment of the present invention.

[0018] Label Explanation:

[0019] 1. A square power battery assembly terminal; 2. A processor; 3. A memory. Detailed Implementation

[0020] To explain in detail the technical content, objectives, and effects of the present invention, the following description is provided in conjunction with the embodiments and accompanying drawings.

[0021] Please refer to Figure 1 A method for assembling a square power battery includes the following steps:

[0022] S1. Obtain the number and thickness of each battery cell;

[0023] S2. Obtain the preset number of cells in each battery module and the total number of cells, calculate the remainder when the total number of cells is divided by the number of cells in each battery module, and remove the cells with the remainder. The number of cells in each battery module is ≥2, and the total number of cells is > the number of cells in each battery module.

[0024] S3. By sorting and combining, obtain the cell combination with the smallest number of battery modules and output the cell combination. The number of battery modules is the quotient of the number of cells divided by the number of cells in each battery module.

[0025] As can be seen from the above description, the beneficial effects of the present invention are as follows: a square power battery assembly method and terminal, which obtains the measured cell thickness, numbers each cell, and then combines the cells using a specific mechanism to output the result, thereby optimizing the total thickness of the battery pack assembly and solving the long-standing problem of excessive tolerance and high scrap rate that has plagued battery manufacturers.

[0026] Furthermore, step S3 specifically includes:

[0027] S31. Determine whether the number of battery modules to be merged is odd or even. If it is even, sort the cell data by thickness from smallest to largest and divide them into combinations of the quotient of the number of cells divided by the number of battery modules, then merge them to obtain a cell combination. If it is odd, sort the cells by thickness from smallest to largest and divide them into combinations of the quotient of the number of cells divided by the number of battery modules, extract the cell data of the middle group in the combination, and merge the remaining cell data to obtain a cell combination.

[0028] S32. Determine if the number of each cell combination is equal to the number of battery modules. If not, merge the cell combinations into a single cell and repeat steps S31-S32. If so, and there is an intermediate group, merge the cell combinations and then merge them with each intermediate group as cells to obtain a cell combination. Output the cell combination. If there is no intermediate group, output the cell combination.

[0029] As can be seen from the above description, this method is entirely based on CPU, with low computing power overhead, making it more suitable for cost-sensitive industrial scenarios, and has the advantages of high accuracy and high utilization.

[0030] Furthermore, the process of merging to obtain the cell assembly specifically involves:

[0031] Repeatedly extract the thickness of the thickest and thinnest cells, sum them up, and retain their numbers as cell combinations until all cell combinations are completed.

[0032] As described above, a novel algorithm for combining wide and thick cells is adopted. This scheme combines cells that are prone to large tolerances together to cancel each other out, thereby reducing the occurrence of battery packs with cells exceeding the tolerance threshold.

[0033] Furthermore, the intermediate part is specifically the (n+1) / 2th group, where n is the number of cells in the cell module.

[0034] As can be seen from the above description, a scheme for extracting intermediate groups has been given.

[0035] Furthermore, the step of outputting the battery cell assembly specifically involves outputting the cell numbers, which represent the combined number of batteries in the battery module, to the robotic arm.

[0036] As described above, by outputting the cell number to the robotic arm, the automatic assembly of the battery module can be achieved through the positioning of the robotic arm.

[0037] Please refer to Figure 2 A square power battery terminal includes a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the computer program, it performs the following steps:

[0038] S1. Obtain the number and thickness of each battery cell;

[0039] S2. Obtain the preset number of cells in each battery module and the total number of cells. Calculate the remainder when the total number of cells is divided by the number of cells in each battery module. Remove the cells with the remainder. The number of cells in each battery module is ≥2, and the total number of cells is > the number of cells in each battery module.

[0040] S3. By sorting and combining, obtain the cell combination with the smallest number of battery modules and output the cell combination.

[0041] As can be seen from the above description, the beneficial effects of the present invention are as follows: a square power battery assembly method and terminal, which obtains the measured cell thickness, numbers each cell, and then combines the cells using a specific mechanism to output the result, optimizes the total thickness of the battery pack assembly, and solves the long-standing problem of excessive tolerance and high scrap rate that has plagued battery manufacturers.

[0042] Furthermore, step S3 specifically includes:

[0043] S31. Determine whether the number of battery modules to be merged is odd or even. If it is even, sort the cell data by thickness from smallest to largest and divide them into combinations of the quotient of the number of cells divided by the number of battery modules. Then merge them to obtain the cell combination. If it is odd, sort the cells by thickness from smallest to largest and divide them into combinations of the quotient of the number of cells divided by the number of battery modules. Extract the cell data of the middle group in the combination and merge the remaining cell data to obtain the cell combination.

[0044] S32. Determine if the number of each cell combination is equal to the number of battery modules. If not, merge the cell combinations into a single cell and repeat steps S31-S32. If so, and there is an intermediate group, merge the cell combinations and then merge them with each intermediate group as cells to obtain a cell combination. Output the cell combination. If there is no intermediate group, output the cell combination and the number of cells in each battery module.

[0045] As can be seen from the above description, this method is entirely based on CPU, with low computing power overhead, making it more suitable for cost-sensitive industrial scenarios, and has the advantages of high accuracy and high utilization.

[0046] Furthermore, the process of merging to obtain the cell assembly specifically involves:

[0047] Repeatedly extract the thickness of the thickest and thinnest cells, sum them up, and retain their numbers as cell combinations until all cell combinations are completed.

[0048] As described above, a novel algorithm for combining wide and thick cells is adopted. This scheme combines cells that are prone to large tolerances together to cancel each other out, thereby reducing the occurrence of battery packs with cells exceeding the tolerance threshold.

[0049] Furthermore, the intermediate part is specifically the (n+1) / 2th group, where n is the number of cells in each battery module.

[0050] As can be seen from the above description, a scheme for extracting intermediate groups has been given.

[0051] Furthermore, the step of outputting the battery cell combination specifically involves outputting the cell number, which represents the combined number of battery cells in the battery module, to the robotic arm.

[0052] As described above, by outputting the cell number to the robotic arm, the automatic assembly of the battery module can be achieved through the positioning of the robotic arm.

[0053] This invention is used to combine the individual cells of a battery module before the actual assembly of the battery to eliminate tolerances.

[0054] Please refer to Figure 1 Embodiment 1 of the present invention is as follows:

[0055] A method for assembling a square power battery includes the following steps:

[0056] S1. Obtain the number and thickness of each battery cell.

[0057] First, for a single input battery cell, the thickness of the cell is measured using a through-beam laser. The thickness of the cell is obtained by subtracting the closest distance measured by the two lasers from the fixed distance between them. Assuming there are M power battery cells in total, after completing the laser measurement process, the cell number and thickness are recorded, i.e., the thickness h of the i-th cell is recorded. i .

[0058] S2. Obtain the preset number of cells in each battery module and the total number of cells. Calculate the remainder when the total number of cells is divided by the number of cells in each battery module. Remove the cells with the remainder. The number of cells in each battery module is ≥2, and the total number of cells is > the number of cells in each battery module.

[0059] Next, we need to combine the total number of M cells into a battery module with n cells (for any n>=2 and M>n). Divide M by n and take the remainder b. For the M cells, delete the b cells that are furthest from the cell average, leaving Mb cells.

[0060] S3. By sorting and combining, obtain the battery cell combination with the smallest tolerance number of battery modules and output it. The number of battery modules is the quotient of the number of cells divided by the number of cells in each battery module.

[0061] S31. Determine whether the number of battery modules to be merged is odd or even. If it is even, sort the cell data by thickness from smallest to largest and divide them into equal groups of the quotient of the number of cells divided by the number of battery modules. Then merge them to obtain the cell combination. If it is odd, sort the cells by thickness from smallest to largest and divide them into equal groups of the quotient of the number of cells divided by the number of battery modules. Extract the cells from the middle group of the combination and merge the remaining cell data to obtain the cell combination.

[0062] For any n (n>=2, and n is a natural number), there are two cases:

[0063] If n is even, then n must be 2 raised to the power of q times x (where x is any natural number greater than 0), that is:

[0064] n=2 q *X;

[0065] First, sort the battery cells to be merged in ascending order of thickness. Then merge the cells with the smallest and largest thicknesses (the thicknesses are accumulated into a new thickness value, and the merge sequence number is placed in an array within this combination), and perform the merging step q times. If x is 1, the final combination is obtained; otherwise, assign x to n and continue to the next step.

[0066] If n is odd, then n must be 2. q The power of x multiplied by 1, that is:

[0067] n=2 q *X+1;

[0068] Sort the cells to be merged in ascending order of thickness. (n-1) must be a multiple of 2 raised to the power of q (q>0). Divide the cells into n groups, and extract and retain the middle group (n+1) / 2. Combine the remaining n-1 groups into new data and continue the merging operation following the even-numbered steps. If the remaining data after merging is odd, recursively execute the odd-numbered steps. Continue until a single group of data is merged. Merge the merged group and the middle group (n+1) / 2 one-to-one. Accumulate the cell thicknesses to obtain a new thickness value, and store the merging sequence numbers in an array.

[0069] The specific process of merging the battery cells to obtain a battery cell assembly is as follows:

[0070] Repeatedly extract the thickness of the thickest and thinnest cells, sum them up, and retain their numbers as cell combinations until all cell combinations are completed.

[0071] S32. Determine if the number of each cell combination is equal to the number of battery modules. If not, merge the cell combinations into a single cell and repeat steps S31-S32. If so, and there is an intermediate group, merge the cell combinations and then merge them with each intermediate group as cells to obtain a cell combination. Output the cell combination. If there is no intermediate group, output the cell combination and the number of cells in each battery module.

[0072] Finally, by merging, a single set of data is obtained, ultimately yielding the required (Mb) / n sets, which are battery packs composed of n cells. Multiple combinations and sorting processes reduce the spacing between cells and decrease tolerances.

[0073] Based on (Mb) / n, the cell number of each of the n cells is recorded. By using a robotic arm to combine the cells with the corresponding numbers, the assembly of 768 battery cells can be completed in 1 second, which meets the cycle time and assembly tolerance requirements in actual production.

[0074] Please refer to Table 1. The advantages of the combined system proposed in this invention are high cell utilization, small tolerance, and high speed. This invention combined 1,000,000 simulated sample data and 768 real sample data, taking groups of 13, 14, 15, 16, 17, and 18 cells respectively. Maximum tolerance measurements were performed, and tests showed that all were below 0.012mm, meeting customer requirements. Except for the number of cells remaining in each group due to divisibility, there were no cells left over. For 1 million cells, this invention achieved a runtime of 14.13s (Intel i7-6800k), requiring only CPU time, resulting in low memory and computing power consumption.

[0075] Table 1 Simulation and Measurement Data

[0076]

[0077]

[0078] Please refer to Figure 2 Embodiment two of the present invention is as follows:

[0079] A square power battery combination terminal 1 includes a memory 3, a processor 2, and a computer program stored in the memory 3 and executable on the processor 2. When the processor 2 executes the computer program, it implements the steps of the above embodiment 1.

[0080] In summary, the present invention provides a method and terminal for assembling square power batteries, which obtains the measured cell thickness, numbers each cell, and then combines the cells using a specific mechanism to output the result, thereby optimizing the total thickness of the battery pack and solving the long-standing problem of excessive tolerances and high scrap rates that has plagued battery manufacturers.

[0081] The above description is merely an embodiment of the present invention and does not limit the patent scope of the present invention. Any equivalent modifications made based on the content of the present invention specification and drawings, or direct or indirect applications in related technical fields, are similarly included within the patent protection scope of the present invention.

Claims

1. A method for assembling a square power battery, characterized in that, Including the following steps: S1. Obtain the number and thickness of each battery cell; S2. Obtain the preset number of cells in each battery module and the total number of cells, calculate the remainder when the total number of cells is divided by the number of cells in each battery module, and remove the cells with the remainder. The number of cells in each battery module is ≥2, and the total number of cells is > the number of cells in each battery module. S3. After sorting the cells from smallest to largest, divide them into combinations of the number of cells divided by the number of battery modules, merge them to obtain the sorted combinations of cells, obtain the cell combination with the smallest tolerance of the number of battery modules, and output the cell combination. The number of battery modules is the quotient of the number of cells divided by the number of cells in each battery module. Step S3 specifically includes: S31. Determine whether the number of cells in each battery module is odd or even. If it is even, sort the cells by thickness from smallest to largest and divide them into combinations whose cell count is the quotient of the number of battery modules. Then merge these combinations to obtain a cell combination. If it is odd, sort the cells by thickness from smallest to largest and divide them into combinations whose cell count is the quotient of the number of battery modules. Extract the cells from the middle group of the combinations and merge the remaining cell data to obtain a cell combination. S32. Determine if the number of each cell combination is equal to the number of battery modules. If not, merge the cell combinations into cells and repeat steps S31-S32. If yes and there are intermediate groups, merge the cell combinations and then merge them with each intermediate group as cells to obtain a cell combination. Output the cell combination. If no intermediate groups exist, output the number of cells in each battery module. The specific process of merging to obtain the battery cell assembly is as follows: Repeatedly extract the thickness of the thickest and thinnest cells, sum them up, and retain their numbers as cell combinations until all cell combinations are completed.

2. The method for assembling a square power battery according to claim 1, characterized in that, The intermediate group is specifically the (n+1) / 2th group, where n is the number of cells in each battery module.

3. The method for assembling a square power battery according to claim 1, characterized in that, Specifically, outputting the combined battery cells involves outputting the cell number, which represents the number of battery cells in the battery module, to the robotic arm.

4. A square power battery pack terminal, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that, When the processor executes the computer program, it performs the following steps: S1. Obtain the number and thickness of each battery cell; S2. Obtain the preset number of cells in each battery module and the total number of cells, calculate the remainder when the total number of cells is divided by the number of cells in each battery module, and remove the cells with the remainder. The number of cells in each battery module is ≥2, and the total number of cells is > the number of cells in each battery module. S3. After sorting the cells from smallest to largest, divide them into combinations of the number of cells divided by the number of battery modules, merge them to obtain the sorted combinations of cells, obtain the cell combination with the smallest tolerance of the number of battery modules, and output the cell combination. The number of battery modules is the quotient of the number of cells divided by the number of cells in each battery module. Step S3 specifically includes: S31. Determine whether the number of cells in each battery module is odd or even. If it is even, sort the cells by thickness from smallest to largest and divide them into combinations whose cell count is the quotient of the number of battery modules. Then merge these combinations to obtain a cell combination. If it is odd, sort the cells by thickness from smallest to largest and divide them into combinations whose cell count is the quotient of the number of battery modules. Extract the cells from the middle group of the combinations and merge the remaining cell data to obtain a cell combination. S32. Determine whether the number of each cell combination is equal to the number of battery modules. If not, merge the cell combinations into a single cell and repeat steps S31-S32. If so, and there is an intermediate group, merge the cell combinations and then merge them with each intermediate group as cells to obtain a cell combination. Output the cell combination. If not, and there is no intermediate group, output the cell combination. The specific process of merging to obtain the battery cell assembly is as follows: Repeatedly extract the thickness of the thickest and thinnest cells, sum them up, and retain their numbers as cell combinations until all cell combinations are completed.

5. A square power battery pack terminal according to claim 4, characterized in that, The intermediate group is specifically the (n+1) / 2th group, where n is the number of battery modules.

6. A square power battery pack terminal according to claim 4, characterized in that, Specifically, outputting the combined battery cells involves outputting the cell number, which represents the number of battery cells in the battery module, to the robotic arm.

Images