A plate distribution method and device, electronic equipment and storage medium

Abstract

This invention discloses a board allocation method, apparatus, electronic device, and storage medium. The method includes: determining all sorting channels connected to the location of the board to be allocated based on its position information; obtaining the sorting rack configuration set and task quantity corresponding to each sorting channel; filtering target cells contained in all sorting channels based on storage space information based on the size information of the board to be allocated; determining the idle rate of the target cells in all sorting channels and the number of idle cells in each sorting channel based on the status information of the target cells; when the idle rate is less than or equal to a preset threshold, determining the target sorting channel based on the number of idle cells combined with the channel priority of each sorting channel; otherwise, determining the target sorting channel based on the number of tasks combined with the channel priority of each sorting channel. This invention can improve sorting efficiency and accuracy and can be widely applied in the field of data processing technology.

Description

Technical Field

[0001] This invention relates to the field of data processing technology, and in particular to a board allocation method, apparatus, electronic device, and storage medium. Background Technology

[0002] In the furniture manufacturing industry, board sorting is a crucial step that directly impacts production efficiency and cost control. While traditional manual sorting methods are simple and easy to implement, they are prone to inefficiency and human error, especially when facing large-scale, high-efficiency sorting demands, where the limitations of manual sorting become increasingly apparent. With the development of automation and intelligent manufacturing, achieving efficient and accurate board sorting has become a pressing issue for the industry.

[0003] Traditional sorting methods typically rely on workers' experience and judgment, which not only increases the possibility of human error but also makes it difficult to cope with complex production environments and diverse sorting needs. Furthermore, the efficiency of manual sorting is limited by workers' physical strength and attention span, making it difficult to achieve efficient, uninterrupted sorting over extended periods. Summary of the Invention

[0004] The main objective of this invention is to provide a board allocation method, apparatus, electronic device, and storage medium to solve at least one problem in the prior art. This invention can efficiently achieve board allocation.

[0005] To achieve the above objectives, one aspect of the present invention provides a board allocation method, the method comprising:

[0006] In response to the location information of the board to be assigned, determine all sorting channels connected to the location of the board to be assigned.

[0007] Obtain the sorting rack configuration set and task quantity corresponding to each sorting channel; the sorting rack configuration set includes the storage space information and status information of each cell on the relevant sorting rack;

[0008] In response to the size information of the board to be assigned, the target cells contained in all sorting channels are filtered based on the storage space information; according to the status information of the target cells, the idle rate of the target cells in all sorting channels and the number of idle cells in each sorting channel are determined.

[0009] When the idle rate is less than or equal to a preset threshold, the target sorting channel is determined based on the number of idle cells and the channel priority of each sorting channel; the channel priority level is negatively correlated with the distance of the sorting channel from the location of the board to be assigned.

[0010] When the idle rate is greater than the preset threshold, the target sorting channel is determined based on the number of tasks and the channel priority of each sorting channel.

[0011] In some embodiments, obtaining the sorting rack configuration set corresponding to each sorting channel includes the following steps:

[0012] Obtain the pre-set sorting robot for each sorting channel;

[0013] The sorting rack configuration set for a given sorting channel is obtained by organizing the sorting rack configurations corresponding to all sorting robots in a single sorting channel.

[0014] The sorting rack configuration includes the storage space information and status information of each grid on the sorting rack corresponding to the sorting robot.

[0015] In some embodiments, the storage space information includes a length range and a width range; the size information includes the board length and the board width; in response to the size information of the board to be assigned, the target cells contained in all sorting channels are filtered based on the storage space information, including the following steps:

[0016] Iterate through the storage space information of each cell on the relevant sorting rack corresponding to the sorting rack configuration set, and compare it with the size information of the board to be assigned;

[0017] When the length of the board is within the length range and the width of the board is within the width range, the traversed cell is determined as the target cell.

[0018] In some embodiments, the status information includes an enabled status and an applied status; based on the status information of the target cells, determining the idle rate of the target cells in all sorting channels and the number of idle cells in each sorting channel includes the following steps:

[0019] The number of cells corresponding to each sorting channel is obtained by counting the target cells that are in the activated state in each sorting channel;

[0020] The number of idle cells for each sorting channel is calculated based on the number of target cells in each sorting channel that are in an activated state and an idle state.

[0021] The vacancy rate of the target cell is obtained by comparing the sum of the total number of all vacant cells with the sum of the total number of all counted cells.

[0022] In some embodiments, the target sorting channel is determined based on the number of free cells and the channel priority of each sorting channel, including the following steps:

[0023] Sort all sorting channels in descending order of channel priority to obtain the channel sequence;

[0024] The first sorting channel in the channel sequence is designated as the first channel;

[0025] The next sorting channel in the channel sequence after the first channel is designated as the second channel;

[0026] The number of empty cells is determined based on the difference between the number of empty cells in the second channel and the number of empty cells in the first channel;

[0027] When the number of empty cells is less than or equal to the preset first priority coefficient, the first channel is determined as the target sorting channel; otherwise, the second channel is used as the first channel, and the process returns to the step of using the next sorting channel in the channel sequence as the second channel, until the number of empty cells is less than or equal to the first priority coefficient, or the second channel is the last sorting channel in the channel sequence.

[0028] If the second channel is the last sorting channel in the channel sequence and the corresponding number of empty cells is greater than the first priority coefficient, then the second channel is determined as the target sorting channel.

[0029] In some embodiments, the target sorting channel is determined based on the number of tasks and the channel priority of each sorting channel, including the following steps:

[0030] Sort all sorting channels in descending order of channel priority to obtain the channel sequence;

[0031] The first sorting channel in the channel sequence is designated as the third channel;

[0032] The next sorting channel in the channel sequence after the third channel is designated as the fourth channel;

[0033] The task difference is determined based on the difference between the number of tasks in the third channel and the number of tasks in the fourth channel;

[0034] If the task difference is less than or equal to the preset second priority coefficient, the third channel is determined as the target sorting channel; otherwise, the fourth channel is used as the third channel, and the process returns to the step of using the next sorting channel in the channel sequence as the fourth channel, until the task difference is less than or equal to the second priority coefficient, or the fourth channel is the last sorting channel in the channel sequence.

[0035] If the fourth channel is the last sorting channel in the channel sequence and the corresponding task difference is greater than the second priority coefficient, then the fourth channel is determined as the target sorting channel.

[0036] In some embodiments, each sorting channel is pre-configured with a sorting robot, and the sorting rack configuration set is obtained by organizing the sorting rack configurations corresponding to all sorting robots in the sorting channel. The sorting rack configuration includes the storage space information and status information of each grid on the sorting rack corresponding to the sorting robot. The method further includes the following steps:

[0037] When a sorting robot malfunctions, the sorting rack configuration corresponding to the malfunctioning sorting robot is removed from the sorting rack configuration set, and then all target cells contained in the sorting channels are re-selected.

[0038] Based on the status information of the target grid, determine the number of grids occupied in each sorting channel;

[0039] The target sorting channel is determined based on the number of occupied cells and the channel priority of each sorting channel.

[0040] In some embodiments, the method further includes the following steps:

[0041] Before the board to be assigned is transferred to the target sorting channel, if the time the board to be assigned stays on the target line reaches a preset time threshold, the board to be assigned will be reassigned to other sorting channels connected to the target line.

[0042] In some embodiments, the method further includes the following steps:

[0043] If there are unsorted boards that have been assigned to a target sorting channel but have not yet been assigned, and the boards to be assigned have already been assigned, the assignment task for the unsorted boards is cleared.

[0044] To achieve the above objectives, another aspect of the present invention provides a board distribution device, the device comprising:

[0045] The first module is used to determine all sorting channels connected to the location of the board to be assigned in response to the location information of the board to be assigned.

[0046] The second module is used to obtain the sorting rack configuration set and task quantity corresponding to each sorting channel; the sorting rack configuration set includes the storage space information and status information of each cell on the relevant sorting rack;

[0047] The third module is used to filter the target cells contained in all sorting channels based on the storage space information in response to the size information of the board to be assigned; and to determine the idle rate of the target cells in all sorting channels and the number of idle cells in each sorting channel according to the status information of the target cells.

[0048] The fourth module is used to determine the target sorting channel based on the number of idle cells and the channel priority of each sorting channel when the idle rate is less than or equal to a preset threshold. The channel priority level is negatively correlated with the distance of the sorting channel from the location of the board to be assigned.

[0049] The fifth module is used to determine the target sorting channel based on the number of tasks and the channel priority of each sorting channel when the idle rate is greater than a preset threshold.

[0050] In some embodiments, the apparatus further includes:

[0051] The sixth module is used to remove the sorting rack configuration corresponding to the faulty sorting robot from the sorting rack configuration set when a sorting robot malfunctions, and then re-filter to obtain the target grid contained in all sorting channels.

[0052] The seventh module is used to determine the number of cells occupied in each sorting channel based on the status information of the target cell;

[0053] The eighth module is used to determine the target sorting channel based on the number of occupied cells and the channel priority of each sorting channel.

[0054] In some embodiments, the apparatus further includes:

[0055] The ninth module is used to redistribute the board to be assigned to other sorting channels connected to the target line when the board to be assigned has stayed on the target line for a preset time threshold before it is transferred to the target sorting channel.

[0056] In some embodiments, the apparatus further includes:

[0057] The tenth module is used to clear the assignment task of unsorted boards when there are unsorted boards that have been assigned to a target sorting channel but have not been assigned, and the boards to be assigned have been assigned.

[0058] To achieve the above objectives, another aspect of the present invention provides an electronic device, which includes a memory and a processor. The memory stores a computer program, and the processor executes the computer program to implement the above-described method.

[0059] To achieve the above objectives, another aspect of the present invention provides a computer-readable storage medium storing a computer program that, when executed by a processor, implements the above-described method.

[0060] The embodiments of the present invention include at least the following beneficial effects: The present invention provides a board allocation method, apparatus, electronic device, and storage medium. This scheme determines all sorting channels connected to the location of the board to be allocated in response to the location information of the board to be allocated; obtains the sorting rack configuration set and task quantity corresponding to each sorting channel; the sorting rack configuration set includes storage space information and status information of each cell on the relevant sorting rack; in response to the size information of the board to be allocated, the target cells contained in all sorting channels are filtered based on the storage space information; according to the status information of the target cells, the idle rate of the target cells in all sorting channels and the number of idle cells in each sorting channel are determined; when the idle rate is less than or equal to a preset threshold, the target sorting channel is determined based on the number of idle cells combined with the channel priority of each sorting channel; the channel priority level is negatively correlated with the distance of the sorting channel from the location of the board to be allocated; when the idle rate is greater than the preset threshold, the target sorting channel is determined based on the task quantity combined with the channel priority of each sorting channel. The present invention includes the following beneficial effects:

[0061] 1. Improved sorting efficiency: By responding to the location information of the boards to be assigned, all connected sorting channels can be quickly identified, and the target grid can be intelligently selected based on the sorting rack configuration set and task quantity. This method significantly shortens sorting time and improves overall production efficiency.

[0062] 2. Reduce human error: Automated sorting reduces human intervention, avoids sorting errors caused by human judgment mistakes, and ensures the accuracy and consistency of sorting.

[0063] 3. Optimize resource utilization: By analyzing the idle rate and number of idle cells in the sorting channels, resources can be allocated reasonably to avoid overcrowding or idleness in some sorting channels, thereby achieving optimal resource allocation.

[0064] 4. Dynamic priority adjustment: The priority of the sorting channel is dynamically adjusted according to the distance between the sorting channel and the location of the board to be assigned, so as to ensure that the sorting channel with a closer distance is used first, which further improves sorting efficiency.

[0065] In summary, the embodiments of the present invention improve sorting efficiency and accuracy through intelligent and scenario-based sorting methods, and also optimize the sorting process, providing strong technical support for the automation development of the furniture manufacturing industry. Attached Figure Description

[0066] Figure 1 This is a flowchart of the board allocation method provided in the embodiments of the present invention;

[0067] Figure 2 This is a schematic diagram of the workflow for allocating sorting channels for board parts according to an embodiment of the present invention;

[0068] Figure 3 This is a schematic diagram illustrating the principle of the interactive points for allocating sorting channels for board parts, provided in an embodiment of the present invention.

[0069] Figure 4 This is a schematic diagram of the structure of the plate distribution device provided in an embodiment of the present invention;

[0070] Figure 5 This is a schematic diagram of the hardware structure of the electronic device provided in an embodiment of the present invention. Detailed Implementation

[0071] To make the objectives, technical solutions, and advantages of this invention clearer, the invention will be further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention. In the following description, when referring to the accompanying drawings, unless otherwise indicated, the same numbers in different drawings represent the same or similar elements. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the embodiments of this invention; they are merely examples of apparatuses and methods consistent with some aspects of the embodiments of this invention as detailed in the appended claims.

[0072] It is understood that the terms "first," "second," etc., used in this invention may be used to describe various concepts, but unless specifically stated otherwise, these concepts are not limited by these terms. These terms are only used to distinguish one concept from another. For example, without departing from the scope of embodiments of this invention, first information may also be referred to as second information, and similarly, second information may also be referred to as first information. Depending on the context, the words "if" or "when" as used herein may be interpreted as "when," "in response to determination," or "in the event of a determination."

[0073] The terms “at least one,” “multiple,” “each,” “any,” etc., used in this invention, “at least one” includes one, two, or more than two; “multiple” includes two or more than two; “each” refers to each of the corresponding multiple; and “any” refers to any one of the multiple.

[0074] Unless otherwise defined, all technical and scientific terms used in this invention have the same meaning as commonly understood by one of ordinary skill in the art to which this invention pertains. The terminology used in this invention is for descriptive purposes only and is not intended to limit the invention.

[0075] The board allocation method provided in this invention relates to the field of data processing technology. This board allocation method can be applied to terminals, servers, or software running on either a terminal or a server. In some embodiments, the terminal can be a smartphone, tablet, laptop, desktop computer, smart speaker, smartwatch, or in-vehicle terminal, but is not limited to these. The server can be configured as an independent physical server, a server cluster or distributed system composed of multiple physical servers, or a cloud server providing basic cloud computing services such as cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communication, middleware services, domain name services, security services, CDN, and big data and artificial intelligence platforms. The server can also be a node server in a blockchain network. The software can be an application implementing the board allocation method, but is not limited to the above forms.

[0076] This invention can be used in a wide variety of general-purpose or special-purpose computer system environments or configurations. Examples include: personal computers, server computers, handheld or portable devices, tablet devices, multiprocessor systems, microprocessor-based systems, set-top boxes, programmable consumer electronics, network PCs, minicomputers, mainframe computers, and distributed computing environments including any of the above systems or devices. This invention can be described in the general context of computer-executable instructions, such as program modules, that are executed by a computer. Generally, program modules include routines, programs, objects, components, data structures, etc., that perform specific tasks or implement specific abstract data types. This invention can also be practiced in distributed computing environments where tasks are performed by remote processing devices connected via a communication network. In distributed computing environments, program modules can reside in local and remote computer storage media, including storage devices.

[0077] Figure 1 This is an optional flowchart of the board allocation method provided in the embodiments of the present invention. Figure 1 The method may include, but is not limited to, steps S100 to S500.

[0078] S100: In response to the location information of the board to be assigned, determine all sorting channels connected to the location of the board to be assigned.

[0079] For example, in some specific implementations, after the board comes out of the punching machine, the routing configuration table can determine all sorting channels that the current location can go to. Specifically, the routing configuration table can configure the set of next locations that the current location can go to, and the assigned channel (i.e., the sorting channel) is selected from all the locations that can go to.

[0080] S200: Obtain the sorting rack configuration set and task quantity corresponding to each sorting channel;

[0081] The sorting rack configuration set includes the storage space information and status information of each cell on the relevant sorting rack;

[0082] It should be noted that, in some embodiments, obtaining the sorting rack configuration set corresponding to each sorting channel may include the following steps: obtaining the sorting robot pre-set for each sorting channel; organizing the sorting rack configuration set of the corresponding sorting channel according to the sorting rack configurations of all sorting robots in a single sorting channel; wherein, the sorting rack configuration includes the storage space information and status information of each grid on the sorting rack corresponding to the sorting robot.

[0083] For example, in some specific implementations, software device management can determine which sorting robots are in each aisle. The sorting rack configuration corresponding to each sorting robot can determine the sorting rack associated with each robot. Sorting rack management can determine the number of layers in the sorting rack, the maximum and minimum length, maximum and minimum width of each cell, and the cell status information, including enabled (disabled, enabled) and applied (idle, occupied).

[0084] S300: In response to the size information of the board to be assigned, the target cells contained in all sorting channels are filtered based on the storage space information; according to the status information of the target cells, the idle rate of the target cells in all sorting channels and the number of idle cells in each sorting channel are determined.

[0085] It should be noted that the storage space information includes a length range and a width range; the size information includes the board length and the board width; in some embodiments, in response to the size information of the board to be assigned, the target cells contained in all sorting channels are filtered based on the storage space information, which may include the following steps: traversing the storage space information of each cell on the relevant sorting rack corresponding to the sorting rack configuration set, and comparing it with the size information of the board to be assigned; when the board length is within the length range and the board width is within the width range, the traversed cell is determined to be the target cell.

[0086] For example, in some specific implementations, the lattice G imt It has a maximum length and minimum length (i.e., length range), maximum width and minimum width (i.e., width range) Since the sheet metal thickness is usually small, the height of the grid can be standardized. Assume sheet metal P has a length of L. p Width is W p The determination of panel grid can be:

[0087] In some embodiments, the status information includes an enabled status and an applied status. Determining the idle rate of target cells in all sorting channels and the number of idle cells in each sorting channel based on the target cell status information may include the following steps: 1) Counting the number of target cells in each sorting channel whose enabled status is "activated"; 2) Counting the number of idle cells in each sorting channel whose enabled status is "activated" and whose applied status is "idle"; 3) Obtaining the idle rate of the target cells by the ratio of the sum of all idle cell counts to the sum of all counted cell counts.

[0088] For example, in some specific implementations, suppose there are N sorting channels, denoted as C. i Let i = {1, 2, ..., N}, and each channel have m robots, denoted as C. i ={R i1 ,R i2 ,…R im Each robot has t cells, i.e., C i ={G i1 G i2 ,…,G imt The sheet metal part P has a length of L. p Width is W p Grid G imt It has a maximum length minimum length Maximum width Minimum width Enabled status To enable, Disabled. For occupation, The cell is empty. A cell that meets the criteria for a valid panel grid (i.e., an empty cell, also called a qualified cell) is judged as follows:

[0089]

[0090] For each channel C i The number of cells that meet the requirements (i.e., the number of empty cells):

[0091] The criteria for determining whether a panel occupies a grid (i.e., occupies a grid) are as follows:

[0092] For each channel C i The number of grids occupied is:

[0093] Specifically, the idle rate is... Where, N i+V i You can directly pass The number of cells that meet the size requirements is determined.

[0094] S400. When the idle rate is less than or equal to a preset threshold, the target sorting channel is determined based on the number of idle cells and the channel priority of each sorting channel.

[0095] Among them, the priority level of the channel is negatively correlated with the distance between the sorting channel and the location of the board to be assigned;

[0096] It should be noted that in some embodiments, determining the target sorting channel based on the number of idle cells and the channel priority of each sorting channel may include the following steps: sorting all sorting channels in descending order of channel priority to obtain a channel sequence; designating the first sorting channel in the channel sequence as the first channel; designating the next sorting channel in the channel sequence as the second channel; determining the idle cell difference based on the difference between the number of idle cells in the second channel and the number of idle cells in the first channel; if the idle cell difference is less than or equal to a preset first priority coefficient, determining the first channel as the target sorting channel; otherwise, designating the second channel as the first channel and returning to the step of designating the next sorting channel in the channel sequence as the second channel, until the idle cell difference is less than or equal to the first priority coefficient, or the second channel is the last sorting channel in the channel sequence; if the second channel is the last sorting channel in the channel sequence and the corresponding idle cell difference is greater than the first priority coefficient, determining the second channel as the target sorting channel.

[0097] In some preferred embodiments, the first priority coefficient includes priority sub-coefficients for each sorting channel in the channel sequence. For example, the sorting channel with the first priority in the channel sequence has a preset first priority sub-coefficient, the sorting channel with the second priority has a preset second priority sub-coefficient, the sorting channel with the third priority has a preset third priority sub-coefficient, and so on. Specifically, when comparing the difference in the number of idle cells, the corresponding priority sub-coefficient is also adaptively selected according to the priority of the sorting channel being compared. For example, when comparing the difference in the number of idle cells between the sorting channel with the second priority and the sorting channel with the first priority, the first priority sub-coefficient preset by the sorting channel with the first priority is used for the determination. When comparing the difference in the number of idle cells between the sorting channel with the third priority and the sorting channel with the second priority, the second priority sub-coefficient preset by the sorting channel with the second priority is used for the determination, and so on.

[0098] For example, in some specific implementations, a threshold b (i.e., a preset threshold) is set for each size of grid cell, when Switch to sorting by the number of empty slots, set a priority for each channel, with closer sorting channels having higher priority, and set a priority coefficient x. Specifically, take the simplest two sorting channels as an example:

[0099] Assume channel C i Priority is 1, C i+1 Priority is 2. If the current allocation is based on empty cells, C i The number of matching cells is N i C i+1 The number of cells that fit is N i+1 Then N i+1 -N i >x, divided into C i+1 Otherwise, divide into C. i .

[0100] S500 When the idle rate is greater than the preset threshold, the target sorting channel is determined based on the number of tasks and the channel priority of each sorting channel.

[0101] It should be noted that in some embodiments, determining the target sorting channel based on the number of tasks and the channel priority of each sorting channel may include the following steps: sorting all sorting channels in descending order of channel priority to obtain a channel sequence; designating the first sorting channel in the channel sequence as the third channel; designating the next sorting channel in the channel sequence as the fourth channel; determining the task difference based on the difference between the number of tasks in the third channel and the number of tasks in the fourth channel; if the task difference is less than or equal to a preset second priority coefficient, determining the third channel as the target sorting channel; otherwise, designating the fourth channel as the third channel and returning to the step of designating the next sorting channel in the channel sequence as the fourth channel, until the task difference is less than or equal to the second priority coefficient, or the fourth channel is the last sorting channel in the channel sequence; if the fourth channel is the last sorting channel in the channel sequence and the corresponding task difference is greater than the second priority coefficient, determining the fourth channel as the target sorting channel.

[0102] In some preferred embodiments, the second priority coefficient includes priority sub-coefficients for each sorting channel in the channel sequence. For example, the sorting channel with the first priority in the channel sequence has a preset first priority sub-coefficient, the sorting channel with the second priority has a preset second priority sub-coefficient, the sorting channel with the third priority has a preset third priority sub-coefficient, and so on. Specifically, when comparing the task difference, the corresponding priority sub-coefficient is also adaptively selected according to the priority of the sorting channel being compared. For example, when comparing the task difference between the sorting channel with the second priority and the sorting channel with the first priority, the first priority sub-coefficient preset by the sorting channel with the first priority is used for the determination. When comparing the task difference between the sorting channel with the third priority and the sorting channel with the second priority, the second priority sub-coefficient preset by the sorting channel with the second priority is used for the determination, and so on.

[0103] For example, in some specific implementations, a threshold b (i.e., a preset threshold) is set for each size of grid cell, when Switch to sorting by the fewest channels, set a priority for each channel, with closer sorting channels having higher priority, and set a priority coefficient x. Specifically, take the simplest two sorting channels as an example:

[0104] Assume channel C i Priority is 1, C i+1 Priority is 2. If the current allocation is based on tasks, C i The number of tasks is S i C i+1 The number of tasks is S i+1 So S i -S i+1 >x, divided into C i+1 Otherwise, assign C. i .

[0105] In some embodiments, each sorting channel is pre-configured with a sorting robot, and the sorting rack configuration set is obtained by organizing the sorting rack configurations corresponding to all sorting robots in the sorting channel. The sorting rack configuration includes the storage space information and status information of each grid on the sorting rack corresponding to the sorting robot. The method may also include the following steps: when a sorting robot malfunctions, the sorting rack configuration corresponding to the malfunctioning sorting robot is removed from the sorting rack configuration set, and then the target grids contained in all sorting channels are re-selected; the number of grids occupied in each sorting channel is determined according to the status information of the target grids; and the target sorting channel is determined based on the number of occupied grids and the channel priority of each sorting channel.

[0106] Specifically, the status information includes the enabled status and the applied status. Determining the number of occupied cells for each sorting channel can include the following steps: Counting the number of occupied cells for each sorting channel based on the number of target cells in each sorting channel that are both enabled and applied. The principle for determining the allocation of target sorting channels based on the number of occupied cells and the channel priority of each sorting channel is the same as the aforementioned principle for determining target sorting channels based on the number of tasks and the channel priority of each sorting channel, using higher channel priority and smaller occupied cell counts as the benchmark. The specific process logic will not be repeated here.

[0107] For example, in some specific implementations, when a sudden stop of the robot is detected, the components are sorted according to the occupied grid, ensuring that the idle grids do not become unbalanced due to a short pause, preventing the boards from moving in one direction. Specifically, let's take the two simplest sorting channels as examples:

[0108] Assume channel C i Priority is 1, C i+1 The priority is 2. At that time, it was allocated based on the number of cells occupied, C. i The number of cells occupied is N i C i+1 The number of cells occupied is N i+1 Then N i -N i+1 >x, only then can we divide into C i+1 Otherwise, divide into C. i .

[0109] In some embodiments, the method may further include the following steps: before the board to be assigned is transferred to the target sorting channel, when the dwell time of the board to be assigned on the target line reaches a preset time threshold, the board to be assigned is reassigned to other sorting channels connected to the target line.

[0110] For example, in some specific implementations, the system aggregates line information, focusing on monitoring lines that can go in multiple directions. If the dwell time of the same board exceeds a set value x, a channel reallocation is triggered. Assume board P is assigned to C. i When you reach line Y, this line segment can move forward to line C. i Go right, C i+1 When board P stays on the online body Y for a time t, the congestion judgment time is set to x. When t >= x, a reallocation is triggered, and the scheduling algorithm will allocate the board to C. i+1 This will reduce congestion.

[0111] In some embodiments, the method may further include the following steps: when there are unsorted boards that have been assigned to a target sorting channel but have not been assigned before the boards to be assigned, and the boards to be assigned have been assigned, the assignment task of the unsorted boards is cleared.

[0112] For example, in some specific implementations, if the same channel is assigned from the same point Y, and the rear panel arrives first, it can be determined that the front panel was manually removed or lost. It is then automatically removed from the task queue. For instance, if P1 is assigned to channel C at time X1... i P2 at time X 1+1 Time allocation to channel C i When X1 <X 1+1 And P2 reached C i If P1 has not yet arrived, it is determined that board P1 is missing or has been manually removed, and the system will automatically switch to channel C. i Clean it up in the board entry task.

[0113] To explain in detail the principle of the technical solution of the present invention, the overall process of the present invention will be described below with reference to some specific embodiments. It is easy to understand that the following is an explanation of the technical principle of the present invention and should not be regarded as a limitation of the present invention.

[0114] First, it's important to note that board sorting is crucial in furniture manufacturing, directly impacting production efficiency and costs. Traditional manual sorting methods are inefficient and prone to human error, making them unsuitable for large-scale, high-efficiency sorting demands. With the increasing demand for customized furniture, existing sorting methods are no longer adequate for the high-efficiency and flexible requirements of modern furniture manufacturing. Therefore, there is an urgent need to design an efficient, flexible, and intelligent sorting scheduling algorithm to improve production line efficiency, reduce manual intervention, and optimize resource utilization. Thus, designing an efficient and flexible channel allocation algorithm to optimize task allocation, reduce sorting time, and improve resource utilization is currently a key focus.

[0115] In view of this, embodiments of the present invention provide a board allocation method, specifically, as follows: Figure 2 As shown, the workflow for allocating sorting channels for sheet metal can be implemented as follows:

[0116] 1) After the board comes out of the punching machine, the routing configuration table shows all the sorting channels that the current location can go to. The routing configuration table allows you to configure the set of next locations that the current location can go to. Assigning a channel means selecting one of all the possible locations.

[0117] 2) Through software equipment management, it is possible to determine which sorting robots are available in each channel.

[0118] 3) By configuring the sorting racks corresponding to each sorting robot, the sorting racks corresponding to each sorting robot can be determined.

[0119] 4) Through the sorting rack management, we can find out which layers the sorting rack has, the maximum length, minimum length, maximum width, and minimum width that each layer of the grid can store, and the status of the grid as (disabled, enabled), (idle, occupied).

[0120] 5) Based on the size of the board, match the corresponding book shelf grid for each sorting channel robot, and count the grids that can store boards of this specification and the total number of grids that can match the board.

[0121] 6) Calculate the idle rate by dividing the number of matching cells by (matching cells + occupied cells). (Matching cells refer to cells whose size and specifications match the board dimensions and are not occupied, i.e., idle cells / channel idle matching cells; occupied cells refer to cells whose size and specifications match the board dimensions and are occupied, i.e., channel occupied matching cells).

[0122] 7) Compare the idle rate with the preset threshold. If the idle rate is greater than the threshold, it is divided according to channel priority and task; if it is less than the threshold, it is divided according to channel priority and idle grid.

[0123] 8) When using idle grids, if the robot alarms or malfunctions, the priority of the channel and the occupied grids will be used.

[0124] 9) Once the alarm fault is cleared, continue dividing by empty cells.

[0125] 10) When congestion is detected, the original route is abandoned and the route is reallocated to other routes.

[0126] like Figure 3 As shown, in some specific application scenarios, the principle of implementing the interaction points for the sorting channel allocation of board parts can be achieved as follows:

[0127] 1) 201-208 indicates the discharge port after drilling is completed, and the channel is allocated here.

[0128] 2) 301 is the manual feeding port for sorting.

[0129] 3) 300 is the NG port. If there is no channel to the board or an abnormality occurs, it will exit from the NG port.

[0130] 4) 401-401 are congestion detection points. The red arrows indicate the direction of board flow. For example, when a board reaches 402, if congestion is detected in the channel originally assigned to 62, it can be reassigned to 63, 64, or 300NG.

[0131] 5) 61-64 represent each sorting channel.

[0132] For example, in some specific embodiments, the logical principle of allocating sorting channels for boards in the embodiments of the present invention can be implemented as follows:

[0133] Based on the size information of the workpieces, the available slots in the aisle, and their priorities, appropriate sorting channels are dynamically allocated. Multiple allocation rules are used, including by the number of available slots, by the number of occupied slots, by the number of tasks, and by the channel priority coefficient, ensuring flexible handling for various scenarios. Specifically:

[0134] Based on available slots: Available slots that match the size of the board are allocated to the aisles with the most optimal slots. This allocation ensures optimal slot utilization. While simply allocating slots by task can ensure a balanced workload for the robot and maintain efficient shelving, it's not optimal for slot utilization. Larger slots can store smaller boards, but smaller slots cannot store boards larger than their size. The robot might have the fewest tasks and available slots for boards of that size, but if all slots are for larger boards, small boards will excessively occupy medium or large board slots. At certain times, when large boards arrive in large quantities, there's a risk of overstocking.

[0135] By occupied grid: If there are available grids matching the board size, the boards are assigned to the aisles with fewer occupied grids. When assigning by available grids, if a robot suddenly malfunctions and alarms, the corresponding sorting rack cannot proceed. During aisle allocation, when counting the number of grids matching the board size in that aisle, an imbalance occurs, causing a large number of boards to be assigned to other aisles. When the robot recovers, because there are fewer available grids in other aisles, a large number of boards will flow back to the aisle the robot recovered. By assigning by occupied grids, when a robot malfunctions and alarms, the number of grids occupied by each board size remains constant, so there is no sudden imbalance. When the robot recovers, because the number of grids occupied by each board size is approximately equal, the number of available grids will also be approximately equal.

[0136] Assigning by task: If there is an available empty slot to store the component, allocate it to a channel with fewer ongoing tasks. If you simply assign by available slots and occupied slots, in some scenarios, some channel robots will be very idle and the conveyor line will be sparsely populated, while other channel robots will be very busy and the conveyor line will be densely populated.

[0137] Channel priority: Because some channels are closer to the boards to which the channel needs to be assigned, and some are farther away. The closer the board, the higher its priority, to prevent the board from taking a longer route and exacerbating line congestion.

[0138] Congestion prevention measures: At some intersections of the conveyor line, congestion is detected, and if congestion is found, the passengers can be reassigned to other channels.

[0139] Automatic detection of residual waste data: During the operation of the automatic line, due to various emergencies, manual handling is required. The board is removed, but because the workers on site forget to process the data in the system, waste data remains, which in turn affects the channel allocation.

[0140] The specific implementation logic of the algorithm can be as follows:

[0141] If there are N sorting channels, denoted as C i Let i = {1, 2, ..., N}, and each channel have m robots, denoted as C. i ={R i1 ,R i2 ,…R im Each robot has t cells, i.e., C i ={G i1 G i2 ,…,G imt The sheet metal part P has a length of L. p Width is W p Grid G imt It has a maximum length minimum length Maximum width Minimum width Enabled status To enable, Disabled. For occupation, The slot is empty. The criteria for determining a panel grid are:

[0142]

[0143] For each channel C i The number of cells that meet the requirements is:

[0144] The accessible passage is: S = {C} i |N i >0, i=1,2,…n};

[0145] Channel C with the most empty slots k :

[0146] The criteria for determining whether a panel occupies a grid are:

[0147] For each channel C i The number of grids occupied is:

[0148] The channel C that occupies the least grid space k :

[0149] Assume that the number of tasks per channel is R. i Channel C with the fewest tasks k :

[0150] The following is the channel C with the most empty cells mentioned above. k The channel C that occupies the least grid spacek Channel C with the fewest tasks k Dynamic switching:

[0151] 1) Set the threshold value b for each grid size, when Switch to sorting by the number of empty slots, if Then switch to assigning tasks by the fewest channels.

[0152] 2) When a robot stops abruptly, it will be divided according to the occupied grid to ensure that the empty grids will not become unbalanced due to a short pause, and the pieces will not move in one direction.

[0153] 3) Set priority for each channel. Channels closer to each other have higher priority. Each priority channel has a priority coefficient x. If sorting is currently based on task, the priority and task score are combined (ensuring that the number of tasks in a high-priority channel - x = the number of tasks in a low-priority channel). If sorting is currently based on available slots, the priority and available slots are combined (ensuring that the number of available slots in a high-priority channel = the number of available slots in a low-priority channel - x). If sorting is currently based on occupied slots, the priority and occupied slots are combined (ensuring that the number of occupied slots in a high-priority channel - x = the number of occupied slots in a low-priority channel). The specific algorithm is as follows:

[0154] Assume channel C i Priority is 1, C i+1 Priority is 2. Current allocation is based on task, C. i The number of tasks is S i C i+1 The number of tasks is S i+1 So S i -S i+1 >x, divided into C i+1 Otherwise, assign C. i Similarly, the current division is based on empty cells, C i The number of cells that fit is N i C i+1 The number of cells that fit is N i+1 Then N i+1 -N i >x, divided into C i+1 Otherwise, divide into C. i If it was divided according to the number of cells occupied, C i The number of cells occupied is N i C i+1 The number of cells occupied is N i+1 Then N i -N i+1 >x, only then can we divide into C i+1 Otherwise, divide into C. i .

[0155] 4) Collect line information, focusing on lines that can go in multiple directions. If the dwell time of the same board exceeds the set value x, the channel will be reassigned.

[0156] Assume board P is assigned to C i When you reach line Y, this line segment can move forward to line C. i Go right, C i+1 When board P stays on the online body Y for a time t, the congestion judgment time is set to x. When t >= x, a reallocation is triggered, and the scheduling algorithm will allocate the board to C. i+1 This will reduce congestion.

[0157] 5) If the same channel is assigned from the same point Y, and the rear panel arrives first, it can be determined that the front panel was manually taken away or lost. Automatically remove it from the task queue.

[0158] If P1 is allocated to channel C at time X1 i P2 at time X 1+1 Time allocation to channel C i When X1 <X 1+1 And P2 reached C i If P1 has not yet arrived, it is determined that board P1 is missing or has been manually removed, and the system will automatically switch to channel C. i Clean it up in the board entry task.

[0159] In summary, the purpose of this invention is to solve the problem of sorting channel allocation in automated sorting sections, aiming to improve sorting efficiency, reduce system bottlenecks, reduce line congestion, and enhance resource utilization. Specifically, this invention intelligently selects the optimal sorting channel by comprehensively considering factors such as idle cells, occupied cells, task status, and priority coefficients, thereby reducing plate congestion, improving sorting rack utilization, increasing sorting efficiency, and mitigating the impact of unforeseen circumstances on allocation.

[0160] The beneficial effects of this invention include:

[0161] 1. High adaptability: Through parameter configuration, it can adapt to various business needs.

[0162] 2. High efficiency: The speed of sorting and boarding is increased to meet the needs of large-scale production.

[0163] 3. Intelligent: It can intelligently switch between multiple allocation methods.

[0164] like Figure 4 As shown, this embodiment of the invention also provides a board distribution device 900, which may include:

[0165] The first module 901 is used to determine all sorting channels connected to the location of the board to be assigned in response to the location information of the board to be assigned.

[0166] The second module 902 is used to obtain the sorting rack configuration set and the number of tasks corresponding to each sorting channel; the sorting rack configuration set includes the storage space information and status information of each cell on the relevant sorting rack;

[0167] The third module 903 is used to respond to the size information of the board to be assigned, filter the target cells contained in all sorting channels based on the storage space information, and determine the idle rate of the target cells in all sorting channels and the number of idle cells in each sorting channel according to the status information of the target cells.

[0168] The fourth module 904 is used to determine the target sorting channel based on the number of idle cells and the channel priority of each sorting channel when the idle rate is less than or equal to a preset threshold. The channel priority level is negatively correlated with the distance of the sorting channel from the location of the board to be assigned.

[0169] The fifth module 905 is used to determine the target sorting channel based on the number of tasks and the channel priority of each sorting channel when the idle rate is greater than a preset threshold.

[0170] In some embodiments, the apparatus may further include:

[0171] The sixth module is used to remove the sorting rack configuration corresponding to the faulty sorting robot from the sorting rack configuration set when a sorting robot malfunctions, and then re-filter to obtain the target grid contained in all sorting channels.

[0172] The seventh module is used to determine the number of cells occupied in each sorting channel based on the status information of the target cell;

[0173] The eighth module is used to determine the target sorting channel based on the number of occupied cells and the channel priority of each sorting channel.

[0174] In some embodiments, the apparatus may further include:

[0175] The ninth module is used to redistribute the board to be assigned to other sorting channels connected to the target line when the board to be assigned has stayed on the target line for a preset time threshold before it is transferred to the target sorting channel.

[0176] In some embodiments, the apparatus may further include:

[0177] The tenth module is used to clear the assignment task of unsorted boards when there are unsorted boards that have been assigned to a target sorting channel but have not been assigned, and the boards to be assigned have been assigned.

[0178] The content of the method embodiments of the present invention is applicable to the device embodiments. The specific functions implemented by the device embodiments are the same as those of the above method embodiments, and the beneficial effects achieved are also the same as those achieved by the above methods.

[0179] This invention also provides an electronic device, which includes a memory and a processor. The memory stores a computer program, and the processor executes the computer program to implement the aforementioned board allocation method. This electronic device can be any smart terminal, including tablet computers, in-vehicle computers, etc.

[0180] It is understood that the content of the above method embodiments is applicable to this device embodiment. The specific functions implemented by this device embodiment are the same as those of the above method embodiments, and the beneficial effects achieved are also the same as those achieved by the above method embodiments.

[0181] Please see Figure 5 , Figure 5 The hardware structure of an electronic device 1000 according to another embodiment is illustrated. The electronic device 1000 includes:

[0182] The processor 1001 can be implemented using a general-purpose CPU (Central Processing Unit), microprocessor, application-specific integrated circuit (ASIC), or one or more integrated circuits, and is used to execute relevant programs to implement the technical solutions provided in the embodiments of the present invention.

[0183] The memory 1002 can be implemented as a read-only memory (ROM), static storage device, dynamic storage device, or random access memory (RAM). The memory 1002 can store the operating system and other application programs. When the technical solutions provided in the embodiments of this specification are implemented through software or firmware, the relevant program code is stored in the memory 1002 and is called and executed by the processor 1001 using the board allocation method of the embodiments of this invention.

[0184] Input / output interface 1003 is used to implement information input and output;

[0185] The communication interface 1004 is used to enable communication and interaction between this device and other devices. Communication can be achieved through wired means (such as USB, network cable, etc.) or wireless means (such as mobile network, WIFI, Bluetooth, etc.).

[0186] Bus 1005 transmits information between various components of the device (e.g., processor 1001, memory 1002, input / output interface 1003, and communication interface 1004);

[0187] The processor 1001, memory 1002, input / output interface 1003 and communication interface 1004 are connected to each other within the device via bus 1005.

[0188] This invention also provides a computer-readable storage medium storing a computer program that, when executed by a processor, implements the above-described board allocation method.

[0189] It is understood that the content of the above method embodiments is applicable to this storage medium embodiment. The specific functions implemented in this storage medium embodiment are the same as those in the above method embodiments, and the beneficial effects achieved are also the same as those achieved in the above method embodiments.

[0190] Memory, as a non-transitory computer-readable storage medium, can be used to store non-transitory software programs and non-transitory computer-executable programs. Furthermore, memory may include high-speed random access memory, and may also include non-transitory memory, such as at least one disk storage device, flash memory device, or other non-transitory solid-state storage device. In some embodiments, memory may optionally include memory remotely located relative to the processor, and these remote memories can be connected to the processor via a network. Examples of such networks include, but are not limited to, the Internet, intranets, local area networks, mobile communication networks, and combinations thereof.

[0191] The board allocation method, board allocation device, electronic device, and storage medium provided in this invention embodiment determine all sorting channels connected to the location of the board to be allocated in response to the location information of the board to be allocated; obtain the sorting rack configuration set and task quantity corresponding to each sorting channel; the sorting rack configuration set includes the storage space information and status information of each cell on the relevant sorting rack; in response to the size information of the board to be allocated, filter the target cells contained in all sorting channels based on the storage space information; determine the idle rate of the target cells of all sorting channels and the number of idle cells in each sorting channel according to the status information of the target cells; when the idle rate is less than or equal to a preset threshold, determine the target sorting channel based on the number of idle cells and the channel priority of each sorting channel; the channel priority level is negatively correlated with the distance of the sorting channel from the location of the board to be allocated; when the idle rate is greater than the preset threshold, determine the target sorting channel based on the task quantity and the channel priority of each sorting channel. The embodiments of the present invention improve sorting efficiency and accuracy through intelligent and scenario-based sorting methods, and also optimize the sorting process, providing strong technical support for the automation development of the furniture manufacturing industry.

[0192] The embodiments described in this invention are for the purpose of more clearly illustrating the technical solutions of the embodiments of this invention, and do not constitute a limitation on the technical solutions provided by the embodiments of this invention. As those skilled in the art will know, with the evolution of technology and the emergence of new application scenarios, the technical solutions provided by the embodiments of this invention are also applicable to similar technical problems.

[0193] Those skilled in the art will understand that the technical solutions shown in the figures do not constitute a limitation on the embodiments of the present invention, and may include more or fewer steps than shown, or combine certain steps, or different steps.

[0194] The system embodiments described above are merely illustrative. The units described as separate components may or may not be physically separate; that is, they may be located in one place or distributed across multiple network units. Some or all of the modules can be selected to achieve the purpose of this embodiment according to actual needs.

[0195] Those skilled in the art will understand that all or some of the steps in the methods disclosed above, as well as the functional modules / units in the systems and devices, can be implemented as software, firmware, hardware, or appropriate combinations thereof.

[0196] The terms "first," "second," "third," "fourth," etc. (if present) in the specification and accompanying drawings of this invention are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. It should be understood that such data can be interchanged where appropriate so that embodiments of the invention described herein can be implemented in orders other than those illustrated or described herein. Furthermore, the terms "comprising" and "having," and any variations thereof, are intended to cover a non-exclusive inclusion; for example, a process, method, system, product, or apparatus that comprises a series of steps or units is not necessarily limited to those steps or units explicitly listed, but may include other steps or units not explicitly listed or inherent to such processes, methods, products, or apparatus.

[0197] It should be understood that in this invention, "at least one (item)" refers to one or more, and "more than one" refers to two or more. "And / or" describes the relationship between related objects, indicating that three relationships can exist. For example, "A and / or B" can represent three cases: only A exists, only B exists, and both A and B exist simultaneously, where A and B can be singular or plural. The character " / " generally indicates that the preceding and following related objects are in an "or" relationship. "At least one (item) of the following" or similar expressions refer to any combination of these items, including any combination of single or plural items. For example, at least one (item) of a, b, or c can represent: a, b, c, "a and b", "a and c", "b and c", or "a and b and c", where a, b, and c can be single or multiple.

[0198] In the embodiments provided by this invention, it should be understood that the disclosed systems and methods can be implemented in other ways. For example, the system embodiments described above are merely illustrative; for instance, the division of the units described above is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the coupling or direct coupling or communication connection shown or discussed may be through some interfaces; the indirect coupling or communication connection between systems or units may be electrical, mechanical, or other forms.

[0199] The units described above as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.

[0200] Furthermore, the functional units in the various embodiments of the present invention can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit. The integrated unit can be implemented in hardware or as a software functional unit.

[0201] If the integrated unit is implemented as a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present invention, in essence, or the part that contributes to the prior art, or all or part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes multiple instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods of the various embodiments of the present invention. The aforementioned storage medium includes various media capable of storing programs, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

[0202] The preferred embodiments of the present invention have been described above with reference to the accompanying drawings, but this does not limit the scope of the claims of the present invention. Any modifications, equivalent substitutions, and improvements made by those skilled in the art without departing from the scope and spirit of the present invention should be within the scope of the claims of the present invention.

Claims

1. A method for distributing sheet metal parts, characterized in that, The method includes the following steps: In response to the location information of the board to be assigned, determine all sorting channels connected to the location of the board to be assigned. Obtain the sorting rack configuration set and task quantity corresponding to each sorting channel; the sorting rack configuration set includes the storage space information and status information of each cell on the relevant sorting rack; In response to the size information of the board to be assigned, the target cells contained in all the sorting channels are obtained by filtering based on the storage space information; according to the status information of the target cells, the idle rate of the target cells in all the sorting channels and the number of idle cells in each sorting channel are determined. When the idle rate is less than or equal to a preset threshold, the target sorting channel is determined based on the number of idle cells and the channel priority of each sorting channel; the channel priority level is negatively correlated with the distance of the sorting channel from the location of the board to be assigned; When the idle rate is greater than a preset threshold, the target sorting channel is determined based on the number of tasks and the channel priority of each sorting channel; The step of determining the target sorting channel based on the number of free cells and the channel priority of each sorting channel includes the following steps: Sort all the sorting channels in descending order of channel priority to obtain a channel sequence; The first sorting channel in the channel sequence is designated as the first channel; The next sorting channel in the channel sequence following the first channel is designated as the second channel; The number of empty cells is determined based on the difference between the number of empty cells in the second channel and the number of empty cells in the first channel; When the number of empty cells is less than or equal to a preset first priority coefficient, the first channel is determined as the target sorting channel; otherwise, the second channel is used as the first channel, and the process returns to the step of using the next sorting channel in the channel sequence as the second channel, until the number of empty cells is less than or equal to the first priority coefficient, or the second channel is the last sorting channel in the channel sequence. If the second channel is the last sorting channel in the channel sequence and the corresponding idle cell difference is greater than the first priority coefficient, then the second channel is determined to be the target sorting channel; The first priority coefficient includes priority sub-coefficients for each sorting channel in the channel sequence. When comparing the difference of idle cells, the corresponding priority sub-coefficient is adaptively selected according to the priority of the sorting channel being compared.

2. The plate allocation method according to claim 1, characterized in that, The process of obtaining the sorting rack configuration set corresponding to each sorting channel includes the following steps: Obtain the pre-set sorting robot for each of the sorting channels; The sorting rack configuration set corresponding to the sorting channel is obtained by organizing the sorting rack configurations of all sorting robots in a single sorting channel; The sorting rack configuration includes the storage space information and status information of each grid on the sorting rack corresponding to the sorting robot.

3. The plate allocation method according to claim 1, characterized in that, The storage space information includes a length range and a width range; the size information includes the board length and the board width; the step of filtering all target cells contained in the sorting channels based on the storage space information in response to the size information of the board to be assigned includes the following steps: The storage space information of each cell on the relevant sorting rack corresponding to the sorting rack configuration set is traversed, and compared with the size information of the board to be allocated; When the length of the plate is within the specified length range and the width of the plate is within the specified width range, the traversed cell is determined to be the target cell.

4. The plate allocation method according to claim 1, characterized in that, The status information includes an enabled status and an applied status; determining the idle rate of the target cells in all sorting channels and the number of idle cells in each sorting channel based on the status information of the target cells includes the following steps: The number of cells corresponding to each sorting channel is obtained by counting the target cells whose activation status is activated in each sorting channel; The number of idle cells corresponding to each sorting channel is calculated based on the target cells in each sorting channel whose activation status is activated and whose application status is idle. The vacancy rate of the target cell is obtained by the ratio of the sum of the number of all said vacant cells to the sum of the number of all said statistical cells.

5. The plate allocation method according to claim 1, characterized in that, Determining the target sorting channel based on the number of tasks and the channel priority of each sorting channel includes the following steps: Sort all the sorting channels in descending order of channel priority to obtain a channel sequence; The first sorting channel in the channel sequence is designated as the third channel; The next sorting channel in the channel sequence after the third channel is designated as the fourth channel; The task difference is determined based on the difference between the number of tasks in the third channel and the number of tasks in the fourth channel; If the task difference is less than or equal to the preset second priority coefficient, the third channel is determined as the target sorting channel; otherwise, the fourth channel is used as the third channel, and the process returns to the step of using the next sorting channel in the channel sequence as the fourth channel, until the task difference is less than or equal to the second priority coefficient, or the fourth channel is the last sorting channel in the channel sequence. If the fourth channel is the last sorting channel in the channel sequence and the corresponding task difference is greater than the second priority coefficient, then the fourth channel is determined to be the target sorting channel.

6. The plate allocation method according to claim 1, characterized in that, Each sorting channel is pre-configured with a sorting robot. The sorting rack configuration set is obtained by organizing the sorting rack configurations corresponding to all the sorting robots in the sorting channel. The sorting rack configuration includes the storage space information and status information of each cell on the sorting rack corresponding to the sorting robot. The method further includes the following steps: When a sorting robot malfunctions, the sorting rack configuration corresponding to the malfunctioning sorting robot is removed from the sorting rack configuration set, and then all the target grids contained in the sorting channels are re-selected. Based on the status information of the target cell, determine the number of cells occupied by each sorting channel; The target sorting channel is determined based on the number of occupied grids and the channel priority of each sorting channel.

7. The plate allocation method according to claim 1, characterized in that, The method further includes the following steps: Before the board to be assigned is transferred to the target sorting channel, if the dwell time of the board to be assigned on the target line reaches a preset time threshold, the board to be assigned is reassigned to other sorting channels connected to the target line.

8. The plate allocation method according to claim 1, characterized in that, The method further includes the following steps: If there are unsorted boards that have been assigned to the target sorting channel but have not yet been sorted, and the unsorted boards have already been sorted, the sorting task of the unsorted boards is cleared.

9. A plate dispensing device, characterized in that, The device includes: The first module is used to determine all sorting channels connected to the location of the board to be assigned in response to the location information of the board to be assigned. The second module is used to obtain the sorting rack configuration set and the number of tasks corresponding to each sorting channel; the sorting rack configuration set includes the storage space information and status information of each grid on the relevant sorting rack; The third module is used to, in response to the size information of the board to be assigned, filter and obtain the target cells contained in all the sorting channels based on the storage space information; and determine the idle rate of the target cells in all the sorting channels and the number of idle cells in each sorting channel according to the status information of the target cells. The fourth module is used to determine the target sorting channel based on the number of idle cells and the channel priority of each sorting channel when the idle rate is less than or equal to a preset threshold; the channel priority level is negatively correlated with the distance of the sorting channel from the location of the board to be assigned. The fifth module is used to determine the target sorting channel based on the number of tasks and the channel priority of each sorting channel when the idle rate is greater than a preset threshold. The step of determining the target sorting channel based on the number of free cells and the channel priority of each sorting channel includes the following steps: Sort all the sorting channels in descending order of channel priority to obtain a channel sequence; The first sorting channel in the channel sequence is designated as the first channel; The next sorting channel in the channel sequence following the first channel is designated as the second channel; The number of empty cells is determined based on the difference between the number of empty cells in the second channel and the number of empty cells in the first channel; When the number of empty cells is less than or equal to a preset first priority coefficient, the first channel is determined as the target sorting channel; otherwise, the second channel is used as the first channel, and the process returns to the step of using the next sorting channel in the channel sequence as the second channel, until the number of empty cells is less than or equal to the first priority coefficient, or the second channel is the last sorting channel in the channel sequence. If the second channel is the last sorting channel in the channel sequence and the corresponding idle cell difference is greater than the first priority coefficient, then the second channel is determined to be the target sorting channel; The first priority coefficient includes priority sub-coefficients for each sorting channel in the channel sequence. When comparing the difference of idle cells, the corresponding priority sub-coefficient is adaptively selected according to the priority of the sorting channel being compared.

10. An electronic device, characterized in that, The electronic device includes a memory and a processor, the memory storing a computer program, and the processor executing the computer program to implement the method according to any one of claims 1 to 8.

11. A computer-readable storage medium storing a computer program, characterized in that, When the computer program is executed by a processor, it implements the method of any one of claims 1 to 8.

Images