Plate distribution method and device, electronic equipment and storage medium

Abstract

The invention discloses a plate distribution method and device, electronic equipment and a storage medium, and the method comprises the steps: responding to the position information of a to-be-distributed plate, and determining all sorting channels communicated with a point location where the to-be-distributed plate is located; obtaining a sorting frame configuration set and a task number corresponding to each sorting channel; in response to the size information of the to-be-distributed plate, target grids contained in all the sorting channels are obtained through screening based on the storage space information; according to the state information of the target lattices, the vacancy rate of the target lattices of all the sorting channels and the number of the vacant lattices of each sorting channel are determined; when the vacancy rate is smaller than or equal to a preset threshold value, a target sorting channel is determined based on the number of the vacant grids in combination with the channel priority of each sorting channel; otherwise, the target sorting channel is determined based on the task number in combination with the channel priority of each sorting channel. The embodiment of the invention can improve the sorting efficiency and accuracy, and can be widely applied to the technical field of data processing.

Description

Technical Field

[0001] The present invention relates to the field of data processing technology, and in particular to a board allocation method, device, electronic equipment and storage medium. Background Art

[0002] In the furniture manufacturing industry, panel sorting is a critical process, directly impacting production efficiency and cost control. While traditional manual sorting methods are simple and easy to implement, they are subject to inefficiency and the risk of human error. The limitations of manual sorting become increasingly apparent when faced with large-scale, high-efficiency sorting requirements. With the advancement of automation and intelligent manufacturing, achieving efficient and accurate panel sorting has become a pressing issue for the industry.

[0003] Traditional sorting methods often rely on workers' experience and judgment, which increases the likelihood of human error and makes it difficult to cope with complex production environments and diverse sorting needs. Furthermore, manual sorting efficiency is limited by workers' physical strength and attention span, making it difficult to achieve efficient sorting over long periods of time without interruption. Summary of the Invention

[0004] The main purpose of the embodiments of the present invention is to provide a board allocation method, device, electronic device and storage medium in order to solve at least one problem of the prior art. The present invention can achieve efficient board allocation.

[0005] To achieve the above objectives, an embodiment of the present invention provides a method for allocating panels, the method comprising:

[0006] In response to the position information of the to-be-distributed panel, determine all sorting channels connected to the position where the to-be-distributed panel is located;

[0007] Get 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 grid on the relevant sorting rack;

[0008] In response to the size information of the to-be-allocated panels, the target grids included in all sorting channels are obtained by screening based on the storage space information; based on the status information of the target grids, the idle rate of the target grids of all sorting channels and the number of idle grids in each sorting channel are determined;

[0009] When the idle rate is less than or equal to the preset threshold, the target sorting channel is determined based on the number of idle grids and the channel priority of each sorting channel. The level of channel priority is negatively correlated with the distance between the sorting channel and the point where the plate to be distributed is located.

[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 a sorting rack configuration set corresponding to each sorting channel includes the following steps:

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

[0013] According to the sorting rack configurations corresponding to all sorting robots of a single sorting channel, a sorting rack configuration set of the corresponding sorting channel is obtained;

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

[0015] In some embodiments, the storage space information includes a length range and a width range; the size information includes a board length and a board width; and in response to the size information of the board to be distributed, filtering and obtaining target grids included in all sorting channels based on the storage space information includes the following steps:

[0016] Traverse the storage space information of each grid on the relevant sorting rack corresponding to the sorting rack configuration set, and compare it with the size information of the plate to be allocated;

[0017] When the length of the plate is within the length range and the width of the plate is within the width range, the traversed grid is determined to be the target grid.

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

[0019] The number of statistical grids corresponding to each sorting channel is obtained according to the target grids in each sorting channel whose activation state is started;

[0020] The number of free grids corresponding to each sorting channel is obtained based on the target grids in each sorting channel whose activation state is start and application state is idle;

[0021] The idle rate of the target grid is obtained according to the ratio of the sum of the number of all idle grids to the sum of the number of all statistical grids.

[0022] In some embodiments, determining a target sorting channel based on the number of free grids combined with the channel priority of each sorting channel includes the following steps:

[0023] Sort all sorting channels from high to low according to channel priority to obtain a channel sequence;

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

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

[0026] Determine the free grid difference according to the difference between the number of free grids in the second channel and the number of free grids in the first channel;

[0027] When the difference in the number of free grids is less than or equal to the preset first priority coefficient, the first channel is determined to be the target sorting channel; otherwise, the second channel is used as the first channel, and the process returns to the step of using the sorting channel next to the first channel in the channel sequence as the second channel until the difference in the number of free grids 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 free grid difference is greater than the first priority coefficient, the second channel is determined to be the target sorting channel.

[0029] In some embodiments, determining a target sorting channel based on the number of tasks combined with the channel priority of each sorting channel includes the following steps:

[0030] Sort all sorting channels from high to low according to channel priority to obtain a channel sequence;

[0031] Use the first sorting channel of the channel sequence as the third channel;

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

[0033] determining a task difference according to a difference between the number of tasks of the third channel and the number of tasks of the fourth channel;

[0034] When 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 sorting channel next to the third 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, the fourth channel is determined to be the target sorting channel.

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

[0037] When a sorting robot fails, the sorting rack configuration corresponding to the failed sorting robot is removed from the sorting rack configuration set, and then the target grids included in all sorting channels are re-screened;

[0038] Determine the number of occupied grids in each sorting channel based on the status information of the target grid;

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

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

[0041] Before the to-be-allocated panels are transferred to the target sorting channel, when the residence time of the to-be-allocated panels on the target line reaches a preset time threshold, the to-be-allocated panels are reallocated to other sorting channels connected to the target line.

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

[0043] When there is an unsorted panel that has been assigned to a target sorting channel but has not yet been assigned before the panel to be assigned, and the panel to be assigned has been assigned, the assignment task of the unsorted panel is cleared.

[0044] To achieve the above objectives, another aspect of an embodiment of the present invention provides a panel distributing device, comprising:

[0045] The first module is configured to determine all sorting channels connected to the position of the to-be-allocated panel in response to the position information of the to-be-allocated panel;

[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 grid on the relevant sorting rack;

[0047] The third module is configured to, in response to the size information of the to-be-allocated panels, filter and obtain target grids included in all sorting channels based on the storage space information; and determine the idle rate of the target grids of all sorting channels and the number of idle grids in each sorting channel based on the status information of the target grids;

[0048] The fourth module is used to determine the target sorting channel based on the number of free grids and the channel priority of each sorting channel when the idle rate is less than or equal to the preset threshold. The level of channel priority is negatively correlated with the distance between the sorting channel and the point where the to-be-allocated plate is located.

[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 comprises:

[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 fails, and then re-screen to obtain the target grids included in all sorting channels;

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

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

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

[0055] The ninth module is used to reallocate the to-be-allocated panels to other sorting channels connected to the target line when the to-be-allocated panels' residence time on the target line reaches a preset time threshold before being transferred to the target sorting channel.

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

[0057] The tenth module is used to clear the allocation task of the unsorted panels when there are unsorted panels that have been allocated to the target sorting channel but have not completed allocation before the panels to be allocated, and the panels to be allocated have completed allocation.

[0058] To achieve the above object, another aspect of an embodiment of the present invention provides an electronic device, which includes a memory and a processor. The memory stores a computer program, and the processor implements the above method when executing the computer program.

[0059] To achieve the above object, another aspect of an embodiment of the present invention provides a computer-readable storage medium, which stores a computer program. When the computer program is executed by a processor, the above method is implemented.

[0060] The embodiments of the present invention include at least the following beneficial effects: the present invention provides a plate allocation method, device, electronic device and storage medium, which determines all sorting channels connected to the point where the plate to be allocated is located in response to the position information of the plate to be allocated; obtains 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; in response to the size information of the plate to be allocated, the target grids contained in all sorting channels are obtained based on the storage space information; according to the status information of the target grid, the idle rate of the target grids of all sorting channels and the number of idle grids of each sorting channel are determined; when the idle rate is less than or equal to the preset threshold, the target sorting channel is determined based on the number of idle grids combined with the channel priority of each sorting channel; the level of the channel priority is negatively correlated with the distance of the sorting channel from the point where the plate to be allocated is located; when the idle rate is greater than the preset threshold, the target sorting channel is determined based on the number of tasks combined with the channel priority of each sorting channel. The present invention includes the following beneficial effects:

[0061] 1. Improve sorting efficiency: By responding to the location information of the plate to be distributed, it can quickly determine all connected sorting channels and intelligently select the target grid based on the sorting rack configuration set and the number of tasks. This method greatly shortens sorting time and improves overall production efficiency.

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

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

[0064] 4. Dynamic priority adjustment: Dynamically adjust the channel priority based on the distance between the sorting channel and the point where the plate to be distributed is located, ensuring that the sorting channel with a closer distance is used first, further improving the sorting efficiency.

[0065] In summary, the embodiments of the present invention improve sorting efficiency and accuracy through intelligent and scenario-based sorting methods, optimize the sorting process, and provide strong technical support for the automated development of the furniture manufacturing industry. BRIEF DESCRIPTION OF THE DRAWINGS

[0066] Figure 1 is a flow chart of a panel allocation method provided by an embodiment of the present invention;

[0067] Figure 2 Schematic diagram of a workflow for allocating sorting channels for panels provided by an embodiment of the present invention;

[0068] Figure 3 This is a schematic diagram of the principles of interaction points for implementing sorting channel allocation for panels provided by an embodiment of the present invention;

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

[0070] Figure 5 It is a schematic diagram of the hardware structure of the electronic device provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0071] In order to make the objects, technical solutions and advantages of the present invention more clearly understood, the present invention is further described in detail below with reference to the accompanying drawings and examples. It should be understood that the specific embodiments described herein are only used to explain the present invention and are not intended to limit the present invention. When the following description refers to the 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 the present invention. They are merely examples of devices and methods consistent with some aspects of the embodiments of the present invention as detailed in the appended claims.

[0072] It will be understood that the terms "first," "second," and the like used in the present invention may be used to describe various concepts in the present invention, but unless otherwise specified, these concepts are not limited by these terms. These terms are merely used to distinguish one concept from another. For example, without departing from the scope of the embodiments of the present 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 terms "if" and "if" as used herein may be interpreted as "at the time of," "when," or "in response to a determination."

[0073] The terms "at least one", "plurality", "each", "any", etc. used in the present invention include at least one, two or more, multiple, two or more, 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 the present invention have the same meaning as those commonly understood by those skilled in the art to which the present invention pertains. The terms used in the present invention are for the purpose of describing the embodiments of the present invention only and are not intended to limit the present invention.

[0075] The board allocation method provided in the embodiment of the present invention relates to the field of data processing technology. The board allocation method provided in the embodiment of the present invention can be applied to a terminal, can be applied to a server, and can also be software running in a terminal or a server. In some embodiments, the terminal can be a smart phone, a tablet computer, a laptop computer, a desktop computer, a smart speaker, a smart watch, and a car terminal, etc., but is not limited to this; the server side can be configured as an independent physical server, or can be configured as a server cluster or distributed system composed of multiple physical servers, and can also be configured as a cloud server that provides basic cloud computing services such as cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communications, 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 that implements the board allocation method, etc., but is not limited to the above forms.

[0076] The present invention can be used in a wide variety of general or special computer system environments or configurations. For example: 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, distributed computing environments including any of the above systems or devices, and the like. The present invention can be described in the general context of computer-executable instructions executed by a computer, such as program modules. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform specific tasks or implement specific abstract data types. The present invention can also be practiced in distributed computing environments in which tasks are performed by remote processing devices connected via a communications network. In a distributed computing environment, program modules can be located in local and remote computer storage media, including storage devices.

[0077] Figure 1 This is an optional flow chart of the panel allocation method provided by an embodiment 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 position information of the to-be-distributed panel, determining all sorting channels connected to the position where the to-be-distributed panel is located;

[0079] For example, in some specific embodiments, when a panel exits a punching machine, a routing configuration table can be used to determine all possible sorting channels for the current location. Specifically, the routing configuration table can configure the current location and the set of possible next locations to be moved to. The allocation channel (i.e., the sorting channel) is selected from all possible locations.

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

[0081] The sorting rack configuration set includes storage space information and status information of each grid 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; arranging the sorting rack configurations corresponding to all the sorting robots of a single sorting channel to obtain the sorting rack configuration set of the corresponding 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 corresponding sorting robot.

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

[0084] S300: In response to the size information of the to-be-allocated panels, the target grids included in all sorting channels are screened based on the storage space information; and according to the status information of the target grids, the idle rates of the target grids of all sorting channels and the number of idle grids 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 a board length and a board width; in some embodiments, in response to the size information of the board to be allocated, the target grids contained in all sorting channels are obtained by screening based on the storage space information, which may include the following steps: traversing the storage space information of each grid on the relevant sorting rack corresponding to the sorting rack configuration set, and comparing it with the size information of the board to be allocated; when the board length is within the length range and the board width is within the width range, determining that the traversed grid is the target grid.

[0086] For example, in some embodiments, the grid G imt Has maximum length and minimum length (i.e. length range), maximum width and minimum width (i.e. width range), since the thickness of the plate is usually small, the height of the grid can be standardized. Assume that the length of the plate P is L p , width is W p , the plate grid judgment can be:

[0087] In some embodiments, the status information includes an enabled state and an applied state; determining the idle rate of the target grids of all sorting channels and the number of idle grids of each sorting channel based on the status information of the target grids may include the following steps: obtaining the number of statistical grids corresponding to each sorting channel based on the statistics of the target grids with an enabled state of enabled in each sorting channel; obtaining the number of idle grids corresponding to each sorting channel based on the statistics of the target grids with an enabled state of enabled and an applied state of idle in each sorting channel; and obtaining the idle rate of the target grid based on the ratio of the sum of all idle grid numbers to the sum of all statistical grid numbers.

[0088] For example, in some specific implementations, if there are N sorting channels, denoted as C i , i={1,2,…,N}, each channel has m robots, denoted as C i ={R i1 ,R i2 ,…R im}, each robot has t grids, namely C i ={G i1 ,G i2 ,…,G imt}. Plate P has a length of L p , width is W p , Grid G imt Has maximum length Minimum length Maximum width Minimum width Enabled status is To enable, is disabled. To occupy, The grid that meets the requirements of the plate (i.e., the idle grid, also known as the qualified grid) is judged as follows:

[0089]

[0090] For each channel C i , in line with the number of grids (i.e. the number of free grids):

[0091] Among them, the grid occupied by the plate (i.e., the grid occupied) is judged as follows:

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

[0093] Specifically, the idle rate is Among them, N i +V i Can be directly passed The number of grids that meet the size requirements is determined.

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

[0095] Among them, the level of channel priority is negatively correlated with the distance between the sorting channel and the point where the plate to be distributed is located;

[0096] It should be noted that, in some embodiments, determining the target sorting channel based on the number of free grids combined with the channel priority of each sorting channel may include the following steps: sorting all sorting channels from high to low according to the channel priority to obtain a channel sequence; taking the first sorting channel in the channel sequence as the first channel; taking the sorting channel next to the first channel in the channel sequence as the second channel; determining the free grid difference based on the difference between the number of free grids of the second channel and the number of free grids of the first channel; when the free grid difference is less than or equal to a preset first priority coefficient, determining the first channel as the target sorting channel; otherwise, taking the second channel as the first channel, returning to the step of taking the sorting channel next to the first channel in the channel sequence as the second channel, until the free grid 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 free grid 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 a priority sub-coefficient for each sorting channel in the channel sequence. For example, a first priority sub-coefficient is preset for a sorting channel of the first priority in the channel sequence, a second priority sub-coefficient is preset for a sorting channel of the second priority, a third priority sub-coefficient is preset for a sorting channel of the third priority, and so on. Specifically, when comparing the difference in the number of free grids, the corresponding priority sub-coefficient is also adaptively selected according to the priority of the compared sorting channels. For example, when comparing the difference in the number of free grids between a sorting channel of the second priority and a sorting channel of the first priority, the first priority sub-coefficient preset for the sorting channel of the first priority is used for determination. When comparing the difference in the number of free grids between a sorting channel of the third priority and a sorting channel of the second priority, the second priority sub-coefficient preset for the sorting channel of the second priority is used for determination, and so on.

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

[0099] Assume channel C i Priority is 1, C i+1 The priority is 2. If the current grid is divided by free grid, C i The number of grids that meet the requirements is N i , C i+1 The number of grids that meet the requirements is N i+1 , then N i+1 -N i >x, points C i+1 Otherwise, C i .

[0100] S500: When the idle rate is greater than a preset threshold, a 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 combined with the channel priority of each sorting channel may include the following steps: sorting all sorting channels from high to low according to the channel priority to obtain a channel sequence; taking the first sorting channel in the channel sequence as the third channel; taking the sorting channel next to the third channel in the channel sequence as the fourth channel; determining the task difference based on the difference between the number of tasks of the third channel and the number of tasks of the fourth channel; when the task difference is less than or equal to a preset second priority coefficient, determining the third channel as the target sorting channel; otherwise, taking the fourth channel as the third channel, returning to the step of taking the sorting channel next to the third 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 a priority sub-coefficient for each sorting channel in the channel sequence. For example, a first priority sub-coefficient is preset for a sorting channel of the first priority in the channel sequence, a second priority sub-coefficient is preset for a sorting channel of the second priority, a third priority sub-coefficient is preset for a sorting channel of the third priority, and so on. Specifically, when comparing task differences, corresponding priority sub-coefficients are also adaptively selected according to the priorities of the compared sorting channels. For example, when comparing task differences between a sorting channel of the second priority and a sorting channel of the first priority, the first priority sub-coefficient preset for the sorting channel of the first priority is used for determination; when comparing task differences between a sorting channel of the third priority and a sorting channel of the second priority, the second priority sub-coefficient preset for the sorting channel of the second priority is used for determination, and so on.

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

[0104] Assume channel C i Priority is 1, C i+1 The 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 , then S i -S i+1 >x, points C i+1 Otherwise, C is allocated i .

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

[0106] Specifically, the status information includes an activation state and an application state. Determining the number of occupied grids for each sorting channel may include the following steps: deriving the number of occupied grids corresponding to each sorting channel based on the target grids in each sorting channel whose activation state is "Started" and whose application state is "Occupied." The principle for determining the target sorting channel allocation based on the number of occupied grids combined with the channel priority of each sorting channel is the same as the principle logic for determining the target sorting channel based on the number of tasks combined with the channel priority of each sorting channel. The higher the channel priority and the smaller the number of occupied grids, the more accurate the process logic will be. The specific process logic will not be further described.

[0107] For example, in some specific implementations, when an emergency stop is detected, the robot is sorted according to the occupied grids to ensure that the idle grids are not unbalanced due to a brief pause, causing the panels to move in one direction. Specifically, take the simplest two sorting channels as an example:

[0108] Assume channel C i Priority is 1, C i+1 The priority is 2. At that time, it was divided according to the occupied grid, C i The number of occupied grids is N i , C i+1 The number of occupied grids is N i+1 , then N i -N i+1 >x, only C i+1 Otherwise, C i .

[0109] In some embodiments, the method may further include the following steps: before the to-be-allocated panels are transferred to the target sorting channel, when the residence time of the to-be-allocated panels on the target line reaches a preset time threshold, the to-be-allocated panels are reallocated to other sorting channels connected to the target line.

[0110] For example, in some specific implementations, the line body information is collected, and the line bodies that can go to multiple directions are monitored. If the same plate stays for more than the set value x, the channel is reassigned. Assume that plate P is assigned to C i When you reach line Y, this line can go forward to C i , go right to C i+1 When the board P stays on the line Y for t, the congestion judgment time is set to x. When t>=x, redistribution is triggered. At this time, the scheduling algorithm will allocate to C i+1 . Thereby reducing congestion.

[0111] In some embodiments, the method may further include the following steps: when there is an unsorted panel that has been assigned to a target sorting channel but has not yet been assigned, and the panel to be assigned has been assigned, clearing the assignment task of the unsorted panel.

[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 taken away manually or lost. It is automatically cleared from the shelf task queue. If P1 is assigned to channel C at time X1 i , P2 at time X 1+1 When assigned to channel C i ,. When X1 <X 1+1 And P2 reaches C i , P1 has not arrived. Then it is judged that the plate P1 has been lost or taken away manually, and it is automatically taken from channel C. i Cleaned up during the board entry task.

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

[0114] First of all, it should be noted that board sorting is crucial in the furniture manufacturing process and directly affects production efficiency and costs. Traditional manual sorting methods are inefficient and risky, making it difficult to meet the needs of large-scale, high-efficiency sorting. With the increasing demand for customized furniture, existing sorting methods can no longer meet the efficiency and flexibility 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. Therefore, designing an efficient and flexible channel allocation algorithm to optimize task allocation, reduce sorting time, and improve resource utilization is the current focus.

[0115] In view of this, an embodiment of the present invention provides a plate allocation method, specifically, as follows Figure 2 As shown, the workflow for sorting channel allocation for panels can be implemented as follows:

[0116] 1) When a panel exits the punching machine, the routing table lists all possible sorting channels for the current location. The routing table configures the current location and the next possible locations. The assigned channel is selected from these possible locations.

[0117] 2) Through software equipment management, it can be found out which sorting robots are in each channel.

[0118] 3) Through the configuration of the sorting rack corresponding to each sorting robot, the sorting rack corresponding to each sorting robot can be obtained.

[0119] 4) Through the sorting rack management, you can find out which layers the sorting rack has, the maximum length, minimum length, maximum width, and minimum width information that can be stored in each layer of the grid, as well as the grid's (disabled, enabled), (idle, occupied) status.

[0120] 5) According to the size of the panels, match the bookshelf grid corresponding to each sorting channel robot, and count the grids that can store panels of this specification and the total grids that can match the panel.

[0121] 6) Use the formula "Conforming grids" / (Conforming grids + Occupied grids) to calculate the idle rate. (Conforming grids refer to grids whose sizes and specifications match the board dimensions and are not occupied, i.e., idle grids / channel idle conforming grids; occupied grids refer to grids whose sizes and specifications match the board dimensions and are occupied, i.e., channel occupied conforming grids).

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

[0123] 8) When using free grids, if the robot alarm fails, it will be divided according to channel priority and occupied grids.

[0124] 9) When the alarm fault is cleared, continue to divide according to the free grid.

[0125] 10) When congestion is detected, the original channel is abandoned and redistributed to other channels.

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

[0127] 1) 201-208 indicates that the drilling is completed and the material outlet is distributed here.

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

[0129] 3) 300 is the NG port. If there is no passage to go to the panel or an abnormality occurs, exit from the NG port.

[0130] 4) 401-401 is the congestion detection point, and the red arrow represents the direction of the plate flow. For example: when the plate reaches 402, when the detection is originally assigned to channel 62, it can be reassigned to 63, 64, or 300NG

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

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

[0133] Dynamically allocate appropriate sorting channels based on the size of the panels, the number of free grids in the channel, and their priority. Multiple allocation rules, including by the number of free grids, by the number of occupied grids, by the number of tasks, by the channel priority coefficient, etc., ensure flexible response to various scenarios. Specifically:

[0134] By free grid: Free grids that are most suitable for the panel size are allocated to the channel with the most optimal grids. This division ensures optimal grid occupancy. If divided simply by task, while this can ensure balanced tasks for the robots and efficient shelving, grid utilization is suboptimal. This is because large grids can store small panels, but small grids cannot store panels larger than their size. If the robot has the fewest tasks and has grids that can store panels of that size, but all of them are larger, small grids will occupy too many grids for medium or large panels. At a certain time, when large grids are concentrated, there is a risk of a warehouse explosion.

[0135] By occupied grids: If there are free grids that match the size of the panel in advance, the panels will be allocated to the channel with fewer occupied grids. When allocating by free grids, a robot may suddenly give an alarm due to a fault. Then the robot cannot go to the corresponding sorting rack. When allocating channels and counting the grids that meet the panel specifications in the channel, there will be a sudden imbalance, causing a large number of panels to be allocated to other channels. When the robot recovers, due to the small number of free grids in other channels, the panels will run to the channel where the robot has recovered in large numbers. By occupied grids, when the robot fails and gives an alarm, the number of grids of each specification occupied by the robot remains unchanged, so there will be no sudden imbalance. When it recovers, the number of free grids will be roughly equal because the grids of each specification are occupied.

[0136] By task: If there are free slots available for the panel, the robot is assigned to the channel with fewer tasks in transit. If the robot is assigned based solely on free and occupied slots, in some scenarios, some channels may be idle, resulting in sparse conveyor belts, while other channels may be busy, resulting in dense conveyor belts.

[0137] Channel priority: Some channels are closer to the board being assigned, while others are farther away. Channels closer to the board have higher priorities, preventing the board from taking a longer route and exacerbating line congestion.

[0138] Anti-congestion processing: Congestion is detected at some intersections of the conveyor line. If congestion occurs, it can be reallocated to other channels.

[0139] Automatic detection of residual garbage data: During the operation of the automatic line, due to various emergencies, manual processing is required and the panels are removed. However, because the on-site workers forget to go to the system to process the data, garbage data remains, which affects the channel allocation.

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

[0141] If there are N sorting channels, denoted as C i , i={1,2,…,N}, each channel has m robots, denoted as C i ={R i1 ,R i2 ,…R im}, each robot has t grids, namely C i ={G i1 ,G i2 ,…,G imt}. Plate P has a length of L p , width is W p , Grid G imt Has maximum length Minimum length Maximum width Minimum width Enabled status is To enable, is disabled. To occupy, Is idle. The board grid is judged as follows:

[0142]

[0143] For each channel C i , which matches the number of grids:

[0144] The available channels are: S = {C i |N i >0,i=1,2,…n};

[0145] Channel C with the most free grids k :

[0146] The grid occupied by the plate is judged as follows:

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

[0148] Channel C with the smallest grid space k :

[0149] Assume that the number of tasks per channel is R i , channel C with the least tasks k :

[0150] The following is the channel C with the most free grids above k , the channel C with the smallest gridk , Channel C with the least tasks k Dynamic Switching:

[0151] 1) Set the threshold b for each grid size. Switch to dividing by the number of free grids, if Just switch to dividing by the channel with the least tasks.

[0152] 2) When an emergency stop of the robot is detected, it is divided according to the occupied grids to ensure that the free grids are not unbalanced due to a brief pause, causing the panels to move in one direction.

[0153] 3) Set the priority of each channel. The closer the sorting channel is, the higher its priority is. Set the priority coefficient x for each priority. If the current classification is by task, it is a combination of priority and task (ensuring that the high-priority channel task - x = the low-priority channel task). If the current classification is by free grid, it is a combination of priority and free grid (ensuring that the free grid of the high-priority channel = the free grid of the low-priority channel - x). If the current classification is by occupied grid, it is a combination of priority and occupied grid (ensuring that the occupied grid of the high-priority channel - x = the occupied grid of the low-priority channel). The specific algorithm is as follows:

[0154] Assume channel C i Priority is 1, C i+1 The priority is 2. 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 , then S i -S i+1 >x, points C i+1 Otherwise, C is allocated i Similarly, the current grid is divided according to the free grid, C i The number of grids that meet the requirements is N i , C i+1 The number of grids that meet the requirements is N i+1 , then N i+1 -N i >x, points C i+1 Otherwise, C i If it was divided by occupied grid, C i The number of occupied grids is N i , C i+1 The number of occupied grids is N i+1 , then N i -N i+1 >x, only C i+1 Otherwise, C i .

[0155] 4) Collect line information, focusing on monitoring lines that can go in multiple directions. If the same panel stays for more than the set value x, it triggers the reallocation of channels.

[0156] Assume that plate P is assigned to C i When you reach line Y, this line can go forward to C i , go right to C i+1 When the board P stays on the line Y for t, the congestion judgment time is set to x. When t>=x, redistribution is triggered. At this time, the scheduling algorithm will allocate to C i+1 . Thereby reducing congestion.

[0157] 5) If the rear panel arrives first when assigned to the same channel from the same point Y, it can be determined that the front panel was manually removed or lost. It will be automatically cleared from the shelf task queue.

[0158] If P1 is assigned to channel C at time X1 i , P2 at time X 1+1 When assigned to channel C i ,. When X1 <X 1+1 And P2 reaches C i , P1 has not arrived. Then it is judged that the plate P1 has been lost or taken away manually, and it is automatically taken from channel C. i Cleaned up during the board entry task.

[0159] In summary, the present invention aims to address the issue of sorting channel allocation in automated sorting processes, improving sorting efficiency, reducing system bottlenecks, reducing line congestion, and enhancing resource utilization. Specifically, by comprehensively considering factors such as free grids, occupied grids, task status, and priority coefficients, the present invention intelligently selects the optimal sorting channel, reducing panel congestion, improving sorting rack utilization, and boosting sorting efficiency, while mitigating the impact of unexpected situations on sorting.

[0160] The beneficial effects of the present invention include:

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

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

[0163] 3. Intelligence: It can intelligently switch between multiple distribution methods.

[0164] like Figure 4 As shown, an embodiment of the present invention further provides a plate distribution device 900, which may include:

[0165] The first module 901 is configured to determine all sorting channels connected to the position of the to-be-allocated panel in response to the position information of the to-be-allocated panel;

[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 grid on the relevant sorting rack;

[0167] The third module 903 is configured to, in response to the size information of the to-be-allocated panels, filter and obtain target cells included in all sorting channels based on the storage space information; and determine the idle rates of the target cells of all sorting channels and the number of idle cells in each sorting channel based on the status information of the target cells.

[0168] The fourth module 904 is configured to determine the target sorting channel based on the number of free grids 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 between the sorting channel and the point where the to-be-allocated panel is located;

[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 fails, and then re-screen to obtain the target grids included in all sorting channels;

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

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

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

[0175] The ninth module is used to reallocate the to-be-allocated panels to other sorting channels connected to the target line when the to-be-allocated panels' residence time on the target line reaches a preset time threshold before being transferred to the target sorting channel.

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

[0177] The tenth module is used to clear the allocation task of the unsorted panels when there are unsorted panels that have been allocated to the target sorting channel but have not completed allocation before the panels to be allocated, and the panels to be allocated have completed allocation.

[0178] The contents of the method embodiments of the present invention are all applicable to the device embodiments. The functions specifically 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 method embodiments.

[0179] An embodiment of the present invention further provides an electronic device comprising a memory and a processor, wherein the memory stores a computer program, and the processor implements the above-mentioned board allocation method when executing the computer program. The electronic device can be any intelligent terminal including a tablet computer, an in-vehicle computer, or the like.

[0180] It can be understood that the contents of the above method embodiments are applicable to the present device embodiments, the functions specifically implemented by the present 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 method embodiments.

[0181] See also Figure 5 , Figure 5 The hardware structure of an electronic device 1000 according to another embodiment is shown. The electronic device 1000 includes:

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

[0183] The memory 1002 can be implemented in the form of a read-only memory (ROM), a static storage device, a dynamic storage device, or a random access memory (RAM). The memory 1002 can store an 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 by the processor 1001 to execute the board allocation method of the embodiments of the present invention.

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

[0185] Communication interface 1004, used to implement communication interaction between this device and other devices, which 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 , which 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 , the memory 1002 , the input / output interface 1003 and the communication interface 1004 are connected to each other in communication within the device via the bus 1005 .

[0188] An embodiment of the present invention further provides a computer-readable storage medium storing a computer program. When the computer program is executed by a processor, the above-mentioned board allocation method is implemented.

[0189] It can be understood that the contents of the above method embodiments are all applicable to the present storage medium embodiment, the functions specifically implemented by the present storage medium 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.

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

[0191] The plate distribution method, plate distribution device, electronic device and storage medium provided by the embodiments of the present invention determine all sorting channels connected to the point where the plate to be distributed is located in response to the position information of the plate to be distributed; obtain 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 grid on the relevant sorting rack; in response to the size information of the plate to be distributed, the target grids included in all sorting channels are screened based on the storage space information; according to the status information of the target grids, the idle rate of the target grids of all sorting channels and the number of idle grids of 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 grids combined with the channel priority of each sorting channel; the level of the channel priority is negatively correlated with the distance of the sorting channel from the point where the plate to be distributed is located; when the idle rate is greater than the preset threshold, the target sorting channel is determined based on the number of tasks combined with 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, optimize the sorting process, and provide strong technical support for the automated development of the furniture manufacturing industry.

[0192] The embodiments described in the embodiments of the present invention are intended to more clearly illustrate the technical solutions of the embodiments of the present invention and do not constitute a limitation on the technical solutions provided by the embodiments of the present invention. Those skilled in the art will appreciate that with the evolution of technology and the emergence of new application scenarios, the technical solutions provided by the embodiments of the present 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 in the figures, or a combination of certain steps, or different steps.

[0194] The system embodiment described above is merely illustrative. The units described as separate components may or may not be physically separate, i.e., they may be located in one place or distributed across multiple network units. Some or all of the modules may be selected based on actual needs to achieve the objectives of this embodiment.

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

[0196] The terms "first," "second," "third," "fourth," and the like (if any) in the description of the present invention and the accompanying drawings are used to distinguish similar objects and are not necessarily used to describe a particular order or precedence. It should be understood that the terms used in this manner are interchangeable where appropriate so that the embodiments of the present invention described herein can be implemented in orders other than those illustrated or described herein. In addition, the terms "including" and "having," as well as any variations thereof, are intended to cover non-exclusive inclusions. For example, a process, method, system, product, or apparatus that includes a series of steps or units is not necessarily limited to those steps or units explicitly listed, but may include other steps or units that are not explicitly listed or that are inherent to such processes, methods, products, or apparatus.

[0197] It should be understood that in the present invention, "at least one (item)" refers to one or more, and "plurality" refers to two or more. "And / or" is used to describe the association relationship of associated objects, indicating that three relationships may exist. For example, "A and / or B" can represent: only A exists, only B exists, and A and B exist at the same time, where A and B can be singular or plural. The character " / " generally indicates that the previous and next associated objects are in an "or" relationship. "At least one of the following items" or similar expressions refers to any combination of these items, including any combination of single items or plural items. For example, at least one 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, c can be single or multiple.

[0198] In the several embodiments provided by the present 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 example, the division of the above units is merely a logical function division. In actual implementation, there may be other division methods, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. In addition, the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of systems or units, and can be electrical, mechanical or other forms.

[0199] The units described above as separate components may or may not be physically separate, and 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 these units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.

[0200] In addition, the functional units in the various embodiments of the present invention may be integrated into a single processing unit, each unit may exist physically separately, or two or more units may be integrated into a single unit. The aforementioned integrated units may be implemented in the form of hardware or software functional units.

[0201] If the integrated unit is implemented in the form of 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, 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. The computer software product is stored in a storage medium and includes multiple instructions for enabling a computer device (which can be a personal computer, server, or network device, etc.) to execute all or part of the steps of the method of each embodiment of the present invention. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM), random access memory (RAM), magnetic disk or optical disk, and other media that can store programs.

[0202] The preferred embodiments of the present invention are described above with reference to the accompanying drawings, but the scope of the invention is not limited thereby. Any modifications, equivalent substitutions, and improvements made by those skilled in the art without departing from the scope and essence of the invention should be within the scope of the invention.

Claims

1. A plate distribution method, characterized in that: The method comprises the following steps: In response to the position information of the to-be-distributed panel, determining all sorting channels connected to the position where the to-be-distributed panel is located; Obtaining a sorting rack configuration set and a task quantity corresponding to each of the sorting channels; the sorting rack configuration set includes storage space information and status information of each grid on the relevant sorting rack; In response to the size information of the to-be-allocated panels, target grids included in all the sorting channels are screened based on the storage space information; and according to the status information of the target grids, the idle rates of the target grids of all the sorting channels and the number of idle grids of 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 grids and the channel priority of each sorting channel; the level of the channel priority is negatively correlated with the distance between the sorting channel and the point where the to-be-allocated plate is located; 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 of the sorting channels.

2. The plate distribution method according to claim 1, characterized in that: The step of obtaining a sorting rack configuration set corresponding to each sorting channel includes the following steps: Obtaining a pre-set sorting robot for each of the sorting channels; Arranging the sorting rack configurations corresponding to all the sorting robots of a single sorting channel to obtain the sorting rack configuration set corresponding to the sorting channel; The sorting rack configuration includes the storage space information and the status information of each grid on the sorting rack corresponding to the sorting robot.

3. The plate distribution method according to claim 1, characterized in that: The storage space information includes a length range and a width range; the size information includes a board length and a board width; and in response to the size information of the to-be-allocated board, the target grids included in all the sorting channels are screened based on the storage space information, comprising the following steps: Traversing the storage space information of each grid on the relevant sorting rack corresponding to the sorting rack configuration set, and comparing it with the size information of the to-be-allocated panels; When the length of the plate is within the length range and the width of the plate is within the width range, the traversed grid is determined to be the target grid.

4. The plate distribution method according to claim 1, characterized in that: The state information includes an enabled state and an applied state; and determining the idle rate of the target grids of all the sorting channels and the number of idle grids of each sorting channel according to the state information of the target grid comprises the following steps: Obtaining the number of statistical grids corresponding to each sorting channel according to the target grids in which the activation state is activated in each sorting channel; Obtaining the number of free grids corresponding to each sorting channel according to the target grids whose activation state is startup and whose application state is idle in each sorting channel; The idle rate of the target grid is obtained according to the ratio of the sum of the numbers of all the idle grids to the sum of the numbers of all the statistical grids.

5. The plate distribution method according to claim 1, characterized in that: The step of determining a target sorting channel based on the number of free grids and the channel priority of each sorting channel comprises the following steps: Sort all the sorting channels from high to low according to the channel priority to obtain a channel sequence; The first sorting channel of the channel sequence is used as the first channel; Using the sorting channel next to the first channel in the channel sequence as the second channel; Determine a free grid difference according to a difference between the number of free grids of the second channel and the number of free grids of the first channel; When the difference in the number of free grids is less than or equal to a preset first priority coefficient, the first channel is determined to be the target sorting channel; otherwise, the second channel is used as the first channel, and the process returns to the step of using the sorting channel next to the first channel in the channel sequence as the second channel until the difference in the number of free grids 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 free grid difference is greater than the first priority coefficient, the second channel is determined to be the target sorting channel.

6. The plate distribution 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 from high to low according to the channel priority to obtain a channel sequence; The first sorting channel of the channel sequence is used as the third channel; Using the sorting channel next to the third channel in the channel sequence as the fourth channel; Determine a task difference according to a difference between the number of tasks of the third channel and the number of tasks of the fourth channel; When the task difference is less than or equal to a preset second priority coefficient, the third channel is determined to be the target sorting channel; otherwise, the fourth channel is used as the third channel, and the process returns to the step of using the sorting channel next to the third 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, the fourth channel is determined to be the target sorting channel.

7. The plate distribution method according to claim 1, characterized in that: Each sorting channel is pre-installed with a sorting robot, and the sorting rack configuration set is obtained by sorting the sorting rack configurations corresponding to all the sorting robots in the sorting channel, and the sorting rack configuration includes the storage space information and the status information of each grid on the sorting rack corresponding to the corresponding sorting robot; the method further includes the following steps: When a sorting robot fails, the sorting rack configuration corresponding to the failed sorting robot is removed from the sorting rack configuration set, and then the target grids included in all the sorting channels are obtained by re-screening; Determining the number of occupied grids of each sorting channel according to the status information of the target grid; The target sorting channel is determined based on the number of occupied grids and the channel priority of each of the sorting channels.

8. The plate distribution method according to claim 1, characterized in that: The method further comprises the following steps: Before the to-be-allocated plate pieces are transferred to the target sorting channels, when the residence time of the to-be-allocated plate pieces in the target line reaches a preset time threshold, the to-be-allocated plate pieces are reallocated to other sorting channels connected to the target line.

9. The panel distribution method according to claim 1, characterized in that: The method further comprises the following steps: When there is an unsorted panel that has been allocated to the target sorting channel but has not yet been allocated before the panel to be allocated, and the panel to be allocated has been allocated, the allocation task of the unsorted panel is cleared.

10. A plate distribution device, characterized in that: The device comprises: The first module is configured to determine all sorting channels connected to the position of the to-be-allocated panel in response to the position information of the to-be-allocated panel; The second module is used to obtain a sorting rack configuration set and a task quantity corresponding to each of the sorting channels; the sorting rack configuration set includes storage space information and status information of each grid on the relevant sorting rack; A third module is configured to, in response to the size information of the to-be-allocated panels, filter and obtain target grids included in all the sorting channels based on the storage space information; and determine, based on the status information of the target grids, the idle rates of the target grids of all the sorting channels and the number of idle grids in each of the sorting channels; A fourth module is configured to determine a target sorting channel based on the number of free grids and the channel priority of each sorting channel when the idle rate is less than or equal to a preset threshold; the level of the channel priority is negatively correlated with the distance between the sorting channel and the point where the to-be-allocated plate is located; The fifth module is configured 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.

11. An electronic device, characterized in that: The electronic device includes a memory and a processor, the memory stores a computer program, and the processor implements the method according to any one of claims 1 to 9 when executing the computer program.

12. A computer-readable storage medium storing a computer program, characterized in that: When the computer program is executed by a processor, the method according to any one of claims 1 to 9 is implemented.

Images