Method, apparatus and storage medium for processing information of objects to be sorted

Abstract

The application discloses a method, device and storage medium for processing information of blocks to be sorted. The method comprises the following steps: receiving information of a plurality of blocks to be sorted collected by a mining collection system; judging the validity of the information of the plurality of blocks to be sorted, and storing the information of valid blocks to a queue to be sorted; judging whether the information of the valid blocks in the queue to be sorted meets a predetermined time difference Ts; and performing a target operation on the information of the valid blocks according to the judgment result, so as to realize the processing of the information of the blocks to be sorted. According to the method, all the information of the blocks around the blocks to be sorted can be received in the queue to be sorted, which is beneficial to analyzing the information of the blocks around the blocks to be sorted in subsequent spraying processing, so as to avoid mis-spraying on the blocks around the blocks to be sorted, and improve the sorting precision.

Description

TECHNICAL FIELD

[0001] The present application generally relates to the technical field of mine spraying. More particularly, the present application relates to a method, device and computer readable storage medium for processing information of material blocks to be sorted. BACKGROUND

[0002] In the process of mining minerals, some waste rocks or ores with low target component are often mixed, resulting in low purity of the ores, and thus the mined materials need to be screened (sorted), for example, the ores and waste rocks can be separated to extract ores with higher purity. In addition, considering the industrial production needs, there are also cases of separating waste rocks, tailings and concentrates in the mined materials or separating tailings, middlings and concentrates in the mined materials.

[0003] In the process of sorting the mined materials, the material blocks are first collected, identified and processed by a mine collection system to generate material block information. Then, a sorting machine determines the spraying range based on the material block information, and then sprays and sorts the mined materials. Before spraying the mined materials, the spatial distribution of the position relationship of the materials needs to be analyzed to determine the position relationship between the material blocks and their surrounding material blocks before spraying, and spraying cannot be directly performed after receiving the material block information to avoid mis-spraying the surrounding material blocks and resulting in low sorting accuracy.

[0004] Therefore, there is an urgent need to provide a scheme for processing information of material blocks to be sorted, so that all the information of the surrounding material blocks that have an impact on the material blocks to be sorted in the sorting queue can be received, which is beneficial to analyzing the surrounding material block information in the subsequent spraying process to avoid mis-spraying the surrounding material blocks and improve the sorting accuracy. SUMMARY

[0005] In order to at least solve one or more technical problems as mentioned above, the present application provides a scheme for processing information of material blocks to be sorted in multiple aspects.

[0006] In a first aspect, the present application provides a method for processing information of material blocks to be sorted, comprising: receiving material block information of a plurality of material blocks to be sorted collected by a mine collection system; judging the validity of the material block information of the plurality of material blocks, and storing the material block information of valid material blocks into a sorting queue; judging whether the material block information of the valid material blocks in the sorting queue meets a predetermined time difference Ts; and performing target operations on the material block information of the valid material blocks according to the judgment result, so as to realize processing of the information of material blocks to be sorted.

[0007] In one embodiment, wherein the validity judgment on the piece information of the pieces includes: validity judgment on a data packet formed by the piece information of the pieces and a receiving time Tr of receiving the piece information of the pieces.

[0008] In another embodiment, wherein the validity judgment on the data packet formed by the piece information of the pieces and the receiving time Tr of receiving the piece information of the pieces includes: validity judgment on whether the transmission of the data packet is correct and whether the length of the data in the data packet is correct, to judge the validity of the data packet formed by the piece information of the pieces; and validity judgment on whether the receiving time Tr exceeds the blowing time Tj of the pieces, to judge the validity of the receiving time Tr of receiving the piece information of the pieces.

[0009] In yet another embodiment, wherein the piece information of each valid piece in the sorting queue is marked with a corresponding receiving time Tr, and the judgment on whether the piece information of the valid piece in the sorting queue meets the predetermined time difference Ts includes: judgment on whether the receiving time Tr corresponding to the piece information of the current valid piece in the sorting queue meets the predetermined time difference Ts with the corresponding current time Tc thereof.

[0010] In yet another embodiment, wherein the predetermined time difference Ts is determined at least according to the granularity information and the speed information of each of the valid pieces.

[0011] In yet another embodiment, wherein the predetermined time difference Ts is set to L / v*3~L / v*5, wherein L represents the granularity information of each of the valid pieces, and v represents the speed information of each of the valid pieces.

[0012] In yet another embodiment, wherein the target operation on the piece information of the valid pieces according to the judgment result includes: in response to the receiving time Tr corresponding to the piece information of the current valid piece meeting the predetermined time difference Ts with the corresponding current time Tc thereof, performing a blowing operation according to the piece information of the current valid piece and the piece information of the surrounding valid pieces thereof; or in response to the receiving time Tr corresponding to the piece information of the current valid piece not meeting the predetermined time difference Ts with the corresponding current time Tc thereof, performing a removal operation on the piece information of the current valid piece and the piece information of the surrounding valid pieces thereof.

[0013] In yet another embodiment, wherein the method further includes: judgment on whether the current valid piece meets a blowing type; and in response to meeting the blowing type, performing a blowing operation according to the piece information of the current valid piece and the piece information of the surrounding valid pieces thereof.

[0014] In a second aspect, the present application provides a device for processing information of blocks to be sorted, comprising: a processor; a memory storing program instructions for processing information of blocks to be sorted, which, when executed by the processor, cause the device to implement the embodiments according to the first aspect.

[0015] In a third aspect, the present application provides a computer-readable storage medium storing computer-readable instructions for processing information of blocks to be sorted, which, when executed by one or more processors, implement the embodiments according to the first aspect.

[0016] Through the above-mentioned scheme for processing information of blocks to be sorted, the embodiments of the present application first determine the validity of the information of the collected blocks to be sorted, store (cache) the information of the valid blocks to the queue to be sorted, and then determine whether the information of the valid blocks in the queue to be sorted meets the predetermined time difference Ts, so as to ensure that all the information of the blocks around the valid blocks to be sorted is received in the queue to be sorted, so that the information of the blocks around the block to be sprayed can be considered when the spraying process after the predetermined time difference is met, and the influence of the mis-spraying on the surrounding blocks to be sorted is avoided, thereby greatly improving the sorting accuracy of the mine spraying. Further, the embodiments of the present application remove the information of the blocks that do not meet the predetermined time difference, so as to improve the storage space of the queue to be sorted. In addition, the embodiments of the present application determine the predetermined time difference Ts through the granularity information and the speed information of the blocks, and set the predetermined time difference Ts to L / v*3~L / v*5, which can reduce the consumption of the processor and the memory space, and improve the processing efficiency. BRIEF DESCRIPTION OF DRAWINGS

[0017] The above and other objects, features and advantages of the exemplary embodiments of the present application will be readily understood through reading the following detailed description in conjunction with the accompanying drawings, in which several embodiments of the present application are illustrated in example, not limitation. In the drawings, the same or corresponding parts are denoted by the same or corresponding reference numerals, and:

[0018] Figure 1 is one exemplary schematic diagram illustrating the sorting of mine spraying;

[0019] Figure 2 is another exemplary schematic diagram illustrating the sorting of mine spraying;

[0020] Figure 3 is an exemplary flowchart illustrating a method for processing information of blocks to be sorted according to the embodiments of the present application;

[0021] Figure 4is an exemplary schematic diagram illustrating setting a predetermined time difference according to an embodiment of the present application;

[0022] Figure 5 is an exemplary flow chart illustrating extracting effective material block information according to an embodiment of the present application;

[0023] Figure 6 is an exemplary flow chart illustrating judging a predetermined time difference according to an embodiment of the present application;

[0024] Figure 7 is an exemplary flow chart illustrating performing a spraying operation according to an embodiment of the present application;

[0025] Figure 8 is an exemplary schematic diagram illustrating determining a first target spraying range according to an embodiment of the present application; and

[0026] Figure 9 is an exemplary structural block diagram of a device for processing material block information to be sorted according to an embodiment of the present application. DETAILED DESCRIPTION

[0027] The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings. It should be understood that the embodiments described in the specification are only some of the embodiments of the present application provided for the convenience of clearly understanding the solutions and meeting the legal requirements, and not all the embodiments of the present application can be implemented. Based on the embodiments disclosed in the specification, all other embodiments obtained by a person skilled in the art without creative labor are within the scope of protection of the present application.

[0028] As described in the background, in the process of mining minerals, some waste rocks or ores with low target component are often mixed, so that the purity of the ores is low, and therefore the mined materials need to be screened (sorted). For example, in some scenarios, the ores and waste rocks are separated to extract ores with high purity. In some scenarios, considering the industrial production needs, the concentrate with high target component and the tailings with low target component can also be sorted, so as to separate the waste rocks, tailings and concentrate in the mined materials or separate the tailings, middlings and concentrate in the mined materials to extract ores with high purity. It can be understood that although the foregoing only describes two types of sorting (ores and waste rocks) and three types of sorting (waste rocks, tailings and concentrate or tailings, middlings and concentrate), it does not exclude the existence of more than three types of sorting, such as four types of sorting (waste rocks, tailings, middlings and concentrate), which is not limited by the present application.

[0029] In an actual application scenario, when sorting the mined material, the mined material can be first transmitted to the mining collection system through a transmission structure such as a chute, a conveyor belt, etc., and then the material is collected, identified, etc. by the collection system to generate the material block information. Further, the material block information is transmitted to the upper computer through the collection system, and then the material block information is transmitted to the sorting system through the upper computer, and the sorting system sorts the mined material according to the aforementioned material block information. In one implementation scenario, the aforementioned collection system can at least include a radiation source (such as X-ray) and a detector. In addition, the aforementioned collection system can also include a device such as a camera, etc., that is, through multi-spectral fusion identification to solve the sorting of complex characteristic ores. In one implementation scenario, the sorting system can include a control board, an execution board and a blowing unit to realize the blowing and sorting of the mined material.

[0030] Figure 1 is one exemplary schematic diagram illustrating the mining blowing sorting. As shown in Figure 1 , the mined material 101 is first transmitted to the mining collection system through a transmission structure such as a chute 102. The collection system is exemplarily shown in the figure to include a radiation source 103 arranged above the chute 102 and a detector 104 arranged below the chute 102. In an implementation scenario, when the material 101 is transmitted to the collection system through the chute 102, the radiation source 103 emits light to the material 101, and the detector 104 receives the light reflected by the material to collect data related to the material. It can be understood that when collecting data related to the material, the collection system scans the material in a row in the longitudinal direction of the plane where the chute 102 is located, so that after scanning multiple rows of material, the data related to the material can be processed into a two-dimensional image, and then the two-dimensional image is analyzed and identified to obtain the material block information. Based on the obtained material block information, the blowing range can be determined according to the material block information and the blowing data is generated, and then the material block is blown by a blowing unit 105, so that the material block falls into the corresponding area to realize sorting. As an example, after the aforementioned sorting, the material is sorted into two categories.

[0031] Figure 2 is another exemplary schematic diagram illustrating the mining blowing sorting. As shown in Figure 2As shown, the mined material 101 is first transported to a mining acquisition system via a transport structure, such as a conveyor belt 201. The acquisition system, exemplarily shown in the figure, includes a radiation source 103 positioned above the conveyor belt 201, a camera 202, and a detector 104 positioned below the conveyor belt 201. In the implementation scenario, when the material 101 is transported to the acquisition system via the conveyor belt 201, the radiation source 103 emits light towards the material 101, the detector 104 receives the reflected light from the material, and the camera 202 acquires data related to the material. Similar to the above scenario, when acquiring data related to the material, the acquisition system scans a row of materials along the longitudinal direction of the plane containing the conveyor belt 201. After scanning multiple rows of materials, the data related to the material can be processed into a two-dimensional image. This two-dimensional image is then analyzed and identified to obtain block information. Based on the obtained block information, the blowing range can be determined and blowing data generated. Then, two blowing units 105 blow the blocks, causing them to fall into the corresponding areas for sorting. As an example, after the aforementioned sorting, the materials are sorted into three categories.

[0032] It is understandable that when materials are transported via conveyor belts or chutes, waste ore or other sorted ores (such as tailings or middlings) may be closely adjacent to the material block. Therefore, before purging, it is necessary to analyze the spatial distribution of the material block on the conveyor belt or chute to determine the positional relationship between the material block and its surrounding blocks, rather than directly performing the purging operation based on the material block information. Based on this, this application proposes a scheme for processing the information of the material blocks to be sorted. This involves extracting the material block information of valid material blocks and storing it in a queue to be analyzed. It is determined whether the material block information of the valid material block meets a predetermined time difference. If the predetermined time difference is met, it is considered that the material block information of the material block and its surrounding blocks has been cached in the sorting queue. Thus, during subsequent purging processing, the material block information of the material block to be purged can be considered, avoiding accidental purging of surrounding blocks and affecting the sorting, thereby greatly improving the sorting accuracy of mining purging.

[0033] Figure 3 This is an exemplary flowchart illustrating a method 300 for processing information of blocks to be sorted according to an embodiment of this application. Figure 3 As shown, in step 301, block information of multiple blocks to be sorted is received from the mining acquisition system. In one embodiment, the aforementioned block information may include, but is not limited to, the outer contour information, centroid information, and particle size of the block. For example, the block information may also include the block's position coordinates or index. Based on the received block information of multiple blocks, in step 302, the validity of the block information of multiple blocks is determined, and the block information of valid blocks is stored in the sorting queue.

[0034] In one implementation scenario, when judging the validity of the piece information of the plurality of pieces, the validity of the data packet formed by the piece information of the plurality of pieces and the validity of the receiving time Tr of receiving the piece information of the plurality of pieces can be judged. Specifically, the validity of the data packet formed by the piece information of the plurality of pieces can be judged by judging whether the transmission of the data packet is correct and whether the length of the data in the data packet is correct, and the validity of the receiving time Tr of receiving the piece information of the plurality of pieces can be judged by judging whether the receiving time Tr exceeds the blowing time Tj of the plurality of pieces. In the application scenario, the validity of the data packet formed by the piece information of the plurality of pieces can be judged by using, for example, cyclic redundancy check (Cyclic Redundancy Check, “CRC”).

[0035] When the data transmission is correct after the check and the length of the data is correct, the validity of the receiving time Tr of receiving the piece information of the plurality of pieces can be further judged. If it exceeds the blowing time Tj of the plurality of pieces, the corresponding piece is invalid; if it does not exceed the blowing time Tj of the plurality of pieces, the corresponding piece is valid, and the piece information of the valid piece is cached to the sorting queue. In one implementation scenario, at least three rows of valid piece information of the pieces (for example Figure 4 Based on the piece information of the valid pieces cached to the sorting queue, in some embodiments, the corresponding receiving time Tr of the piece information of each valid piece in the sorting queue can be marked.

[0036] Then, at step 303, it is judged whether the piece information of the valid pieces in the sorting queue satisfies the predetermined time difference Ts. In one embodiment, whether the piece information of the valid pieces in the sorting queue satisfies the predetermined time difference Ts can be judged by judging whether the receiving time Tr corresponding to the piece information of the current valid piece in the sorting queue and the current time Tc corresponding to the piece information of the current valid piece satisfy the predetermined time difference Ts. The aforementioned predetermined time difference Ts is determined at least according to the granularity information and the speed information of each valid piece. In some embodiments, the aforementioned predetermined time difference Ts can also be determined based on the granularity information, the speed information and the effective coverage radius of the blowing of each valid piece. Preferably, the aforementioned predetermined time difference Ts can be set to L / v*3~L / v*5, wherein L represents the granularity information of each valid piece, and v represents the speed information of each valid piece. It can be understood that the current time Tc corresponding to the piece information of the current valid piece refers to the time corresponding to the extraction of the piece information of the current valid piece from the sorting queue. Whether the receiving time and the current time satisfy the predetermined time difference, that is, whether the piece information of the valid piece and the piece information of the surrounding valid pieces have reached the sorting queue, is judged.

[0037] Further, at step 304, target operation is performed on the block information of the effective block according to the judgment result, so as to realize processing of the block information to be sorted. Specifically, in response to the fact that the receiving time Tr corresponding to the block information of the current effective block and the current time Tc corresponding thereto satisfy the predetermined time difference Ts, a blowing operation is performed according to the block information of the current effective block and the block information of the surrounding effective blocks thereof. Alternatively, in response to the fact that the receiving time Tr corresponding to the block information of the current effective block and the current time Tc corresponding thereto do not satisfy the predetermined time difference Ts, a removal operation is performed on the block information of the current effective block and the block information of the surrounding effective blocks thereof. In other words, when the time difference between the receiving time and the current time of the block information of the current effective block satisfies the predetermined time difference (i.e., a certain cache time) Ts, it can be considered that the block information of the current effective block and the block information of the surrounding effective blocks thereof have been completely cached, and the subsequent blowing operation can be performed. When the time difference between the receiving time and the current time of the block information of the current effective block does not satisfy the predetermined time difference Ts, it can be considered that the influence of the current block information on the subsequent sorting has been processed, and thus the block information of the corresponding block can be removed from the sorting queue. That is, the embodiment of the present application is to judge whether the block information of the current effective block satisfies the cache time and the removal time, and when the cache time is satisfied, the blowing operation is performed, and when the removal time is satisfied, the removal operation is performed.

[0038] For example, in one exemplary scenario, it is assumed that the receiving time is Tr, the current time Tc is Ts+Tr, indicating that the block information of the surrounding blocks is cached, and then the blowing processing can be performed. In another exemplary scenario, it is assumed that the receiving time is Tr, and the current time Tc is 2Ts+Tr, indicating that the influence of the block information of the block on the subsequent sorting has been processed, and the block information can be deleted from the sorting queue. As described above, Ts can be set to L / v*3~L / v*5, L representing the granularity information of each effective block, and v representing the speed information of each effective block.

[0039] According to the above description, the embodiment of the present application first judges the validity of the block information of the plurality of blocks, and caches the block information of the valid blocks into the to-be-analyzed queue. The target operation is performed on the block information of the valid blocks by judging whether the predetermined time difference is met (i.e., judging whether the caching time and the removing time are met), so as to process the block information to be sorted. When the predetermined time difference is met, it is considered that the block information of the blocks around the block has been cached into the to-be-sorted queue, and then the blowing operation can be performed, so that the block information of the blocks around the block to be blown can be considered in the subsequent blowing process, avoiding the misblowing of the surrounding blocks and affecting the sorting, thereby greatly improving the sorting precision of the mine blowing. When the predetermined time difference is not met, it is considered that the influence of the current block information on the subsequent sorting has been processed, and the removing operation can be performed on the block information of the corresponding block in the to-be-sorted queue to improve the storage space of the to-be-sorted queue.

[0040] Figure 4 is an exemplary schematic diagram illustrating setting of the predetermined time difference according to the embodiment of the present application. As shown in Figure 4 three rows of blocks (for example, shown by the circles in the figure) are exemplarily shown as being cached into the to-be-sorted queue, which are transmitted in the direction shown by the arrow on the transmission structure (for example, the conveying belt). According to the foregoing, when the block information of the valid blocks is stored into the to-be-sorted queue, at least three rows of block information of the valid blocks can be cached each time, and thus the height H of the whole figure in the figure represents the required caching time. Further, each circle shown in the figure represents the maximum granularity of each block. Taking one of the blocks n as an example, the rectangular frame A represents the maximum blowing range corresponding to the block n. As an example, it is assumed that the maximum granularity of the block n is L (unit: mm), the speed is v (unit: mm / s), and the effective coverage radius of the blowing is R (unit: mm). In this scenario, the predetermined time difference Ts=L / v*3+R / v*2. It needs to be understood that in the actual application scenario, since there are stones with granularity exceeding the upper limit, the larger the granularity, the larger the predetermined time difference should be, i.e., the larger the caching time should be. However, when the caching time is too large, the consumption of the memory space and the processor will be increased, and there are few continuous maximum particles. Therefore, the predetermined time difference Ts is set to L / v*3~L / v*5 in the embodiment of the present application, so as to reduce the consumption of the processor and the memory space and improve the processing efficiency.

[0041] Figure 5 is an exemplary flow block diagram illustrating extraction of the valid block information according to the embodiment of the present application. As shown in Figure 5As shown, in step 501, block information of multiple blocks is received. This block information may include, for example, the block's outer contour information, centroid information, particle size, and position coordinates. Next, in step 502, the validity of the data packet formed by the block information of multiple blocks is determined. In one implementation scenario, the validity of the data packet formed by the block information of multiple blocks can be determined by, for example, checking the data transmission and data length using a CRC check. If the data transmission or data length is incorrect after verification, the process can return to step 501 to re-receive the block information. If the data transmission and data length are correct after verification, in step 503, the validity of the reception time of the block information of multiple blocks is determined. That is, it is determined whether the reception time Tr of the block information of each block exceeds the corresponding blowing time Tj to determine the validity of the reception time of the block information of multiple blocks.

[0042] Specifically, if the blowing time Tj is exceeded, the receiving time of the corresponding block is invalid, and thus the block information of the corresponding block is invalid. In step 504, the block information of the corresponding block is discarded. If the blowing time is not exceeded, the receiving time of the corresponding block is valid, and thus the block information of the corresponding block is valid. The valid block information is extracted, and in step 505, the receiving time Tr is marked on the block information of the valid block. Further, in step 506, the block information of the valid block after the receiving time is marked can be cached in the sorting queue for subsequent blowing processing.

[0043] Figure 6 This is an exemplary flowchart illustrating the determination of a predetermined time difference according to an embodiment of this application. Figure 6 As shown, after caching the valid block information into the sorting queue, in step 601, the block information of the valid blocks in the sorting queue is scanned sequentially. Next, it is determined whether the reception time Tr and the current time Tc of the valid block information in the sorting queue meet a predetermined time difference, i.e., whether the caching time and removal time are met. First, in step 602, it is determined whether the block information of the valid block meets the caching time. As described above, the predetermined time difference Ts can be determined at least through the block's granularity information L and velocity information v, where the predetermined time difference Ts can be set to L / v*3 to L / v*5 to ensure that the block information of the current block and its surrounding blocks can be cached. When the block information of the valid block reaches the caching time (or meets the caching time), in step 603, a blowing operation is performed on the corresponding block. For example, in an exemplary scenario, assuming the reception time is Tr and the current time is Ts+Tr, indicating that the block information of the surrounding blocks has been cached, a blowing operation can be performed.

[0044] When the block information of the valid block does not satisfy the cache time, it is further determined whether the removal time is satisfied at step 604, that is, whether the influence of the block information on the subsequent sorting has been processed. When the removal time is satisfied, the block information of the corresponding block is deleted from the sorting queue at step 605. Otherwise, the foregoing step 601 is returned, and the foregoing steps 602 to 605 are repeated. For example, in another exemplary scenario, assuming that the receiving time is Tr, the current time is 2Ts+Tr, and it is indicated that the influence of the block information of the block on the subsequent sorting has been processed, the block information can be deleted from the sorting queue.

[0045] It needs to be understood that when it is determined that the block information of the valid block satisfies the predetermined time difference Ts, the blowing operation can be performed on the valid block in the sorting queue. In an embodiment, the blowing operation can be performed in a purity-first manner (that is, the blowing range is reduced) based on the actual application scenario. In addition, the blowing operation can also be performed in a manner of expanding the blowing range. In an implementation scenario, the embodiment of the present application further includes determining whether the current valid block satisfies the blowing type, and performing the blowing operation according to the block information of the current valid block and the block information of the surrounding valid blocks in response to satisfying the blowing type. Taking the purity-first manner as an example, the blowing operation process will be described in detail below. Figure 7 and Figure 8 The foregoing blowing operation process is described in detail.

[0046] Figure 7 is an exemplary flow block diagram illustrating the execution of the blowing operation according to the embodiment of the present application. As shown in Figure 7 At step 701, the block information of the valid block to be subjected to the first blowing in the sorting queue is read in sequence, and is recorded as i. Then, at step 702, it is determined whether the valid block i satisfies the blowing type, for example, whether the valid block i is waste rock or ore that needs to be blown. When the valid block i does not satisfy the blowing type, the step 701 is returned. When the valid block i satisfies the blowing type, the block information of the surrounding valid block to be subjected to the second blowing is scanned at step 703, and is recorded as j. Further, at step 704, the positional relationship between the initial blowing range of the valid block to be subjected to the first blowing and the outer contour of the surrounding valid block to be subjected to the second blowing is compared. Specifically, at step 705, the positional relationship between the initial blowing range of the valid block to be subjected to the first blowing and the outer contour of the surrounding valid block to be subjected to the second blowing is compared by calculating whether the boundary of the initial blowing range of the valid block to be subjected to the first blowing and the outer contour of the surrounding valid block to be subjected to the second blowing intersects. In an embodiment, the initial blowing range of the valid block to be subjected to the first blowing can be determined based on the outer contour information, or can be obtained by the blowing unit.

[0047] When the initial blowing range of the effective block i to be first blown does not intersect with the boundary of the outer contour of the surrounding effective block j to be blown, in step 706, the initial blowing range of the effective block i to be first blown is determined as the first target blowing range, and blowing data is generated directly based on the initial blowing range of the effective block i to be first blown. When the initial blowing range of the effective block i to be first blown intersects with the boundary of the outer contour of the surrounding effective block j to be blown, in step 707, the initial blowing range of the effective block i to be first blown is reduced, and the reduced blowing range is determined as the first target blowing range, and first blowing data is generated. Further, blowing processing can be performed on the effective block i to be first blown based on the first blowing data.

[0048] In one embodiment, the aforementioned reduction operation can be performed by shrinking the block by a certain size along its outer contour towards its centroid, or based on the distance between the two blocks. The following will combine... Figure 8 The following details further regarding the determination of the first target spray range by shrinking a certain size along the outer contour of the object towards its center of mass.

[0049] Figure 8 This is an exemplary schematic diagram illustrating the determination of the first target blowing range according to an embodiment of this application. Figure 8 As shown in the left-hand diagram, assume block i is the effective block to be sprayed for the first time, and block j is the effective block j surrounding the effective block to be sprayed for the first time, which is then sprayed for the second time. Further, the dashed line in the diagram represents the initial spray range corresponding to the effective block i to be sprayed for the first time. In one implementation scenario, the initial spray range corresponding to the effective block i to be sprayed for the first time can first be considered as a rectangle, and the outer contour boundaries of the effective block i to be sprayed for the first time and the effective block j to be sprayed for the second time can each be considered as a polygon. Next, it is calculated whether each side of the effective block j to be sprayed for the second time intersects with each side of the rectangle formed by the initial spray range.

[0050] For example, when each edge of the effective material block j of the second spraying does not cross any edge of the rectangle formed by the initial spraying range, it indicates that the effective material block i to be sprayed first will not affect the surrounding material blocks. In this scenario, the initial spraying range corresponding to the effective material block i to be sprayed first can be taken as the first target spraying range. When each edge of the effective material block j of the second spraying crosses at least one edge of the rectangle formed by the initial spraying range, it indicates that the effective material block i to be sprayed first will affect the surrounding material blocks and may also take the effective material block j of the second spraying out. In this scenario, the initial spraying range of the effective material block i to be sprayed first can be reduced to determine the first target spraying range. As described above, the first target spraying range can be determined by reducing a certain size along the outer contour boundary of the effective material block i to be sprayed first to the centroid or a distance reduction operation between the effective material block i to be sprayed first and the effective material block j of the second spraying.

[0051] Taking the reduction of a certain size to the centroid as an example, in an exemplary scenario, it is assumed that the outer contour boundary of the effective material block i to be sprayed first is a polygon abcdef, and after reducing each boundary point of the outer contour boundary of the effective material block i to be sprayed first to the centroid o by a certain size, a new polygon a′b′c′d′e′f′ is formed. Wherein, the reduced range a′b′c′d′e′f′ is taken as the first target spraying range. Further, the first spraying data can be determined according to the first target spraying range to spray the effective material block i to be sprayed first, so as to realize material sorting.

[0052] It is worth noting that although the technical solution of the present application exemplarily performs the spraying operation after processing the information of the material block to be sorted, those skilled in the art can understand that the technical solution of the present application is not limited thereto, but can be applied to any scenario which needs to analyze the positional relationship of the spatial distribution of the material and then process the corresponding material block.

[0053] Figure 9 is an exemplary structural block diagram of the device 900 for processing the information of the material block to be sorted according to the embodiment of the present application.

[0054] As Figure 9As shown in the above embodiments, the device 900 of the present application can include a processor 901 and a memory 902, wherein the processor 901 and the memory 902 communicate with each other through a bus. The memory 902 stores program instructions for processing the information of the blocks to be sorted, which, when executed by the processor 901, cause the implementation of the method steps described above in conjunction with the drawings: receiving the information of the blocks to be sorted collected by the mining collection system; judging the validity of the information of the blocks, and storing the information of the valid blocks into a queue to be sorted; judging whether the information of the valid blocks in the queue to be sorted meets the predetermined time difference Ts; and performing target operations on the information of the valid blocks according to the judgment result, so as to realize the processing of the information of the blocks to be sorted.

[0055] According to the above description in conjunction with the drawings, those skilled in the art can also understand that the embodiments of the present application can also be implemented by software programs. Therefore, the present application also provides a computer readable storage medium. The computer readable storage medium stores computer readable instructions for processing the information of the blocks to be sorted, which, when executed by one or more processors, implement the above-described method for processing the information of the blocks to be sorted. Figure 3 The method for processing the information of the blocks to be sorted is described.

[0056] From the above description of the embodiments, those skilled in the art can clearly understand that the embodiments can be implemented by means of software and the necessary general hardware platform, and of course, can also be implemented by hardware. Based on such understanding, the above technical solutions, essentially or in the sense of contribution to the prior art, can be embodied in the form of a software product, which can be stored in a computer readable storage medium, such as a ROM / RAM, a magnetic disk, an optical disk, etc., and includes a number of instructions for causing a computer device (which can be a personal computer, a server, or a network device, etc.) to execute the methods described in the embodiments or some parts of the embodiments.

[0057] It should be noted that although the operations of the method of the present application are described in a specific order in the drawings, this does not require or imply that the operations must be performed in that specific order, or that all of the shown operations must be performed to achieve the desired result. On the contrary, the steps depicted in the flowchart can change the order of execution. Additionally or alternatively, some steps can be omitted, a plurality of steps can be combined into one step, and / or one step can be divided into a plurality of steps.

[0058] It should be understood that the terms "first", "second", "third", and "fourth" and the like in the description and in the claims of the present application are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. The terms "including", "containing", and "comprising" and the like are used herein to indicate the inclusion as set out above, but do not preclude the addition or presence of one or more other features, integers, steps, operations, elements, components, and / or groups thereof.

[0059] It should also be understood that the terms used in the specification and the claims are not to be interpreted as specific language but are intended to be given their broadest interpretation. The use of the term "including" and "comprising" and variations thereof is meant to encompass the items listed thereafter and equivalents thereof as well as additional items and equivalents thereof. The use of the terms "first", "second", and "third" and the like does not indicate any ordering of one element over another but is used to distinguish one element from another.

[0060] Although the embodiments of the present application are as described above, the content is only for the purpose of understanding the embodiments of the present application, and is not intended to limit the scope and application of the present application. Any person skilled in the art of the technology described in the present application can make any modification and change in the form and details without departing from the spirit and scope of the present application. The patent protection scope of the present application shall be subject to the scope defined by the appended claims.

Claims

1. A method for processing information on blocks to be sorted, characterized in that, include: Receive block information from multiple blocks to be sorted, collected by the mining acquisition system; The validity of the block information of the multiple blocks is determined, and the block information of the valid blocks is stored in the sorting queue; Determine whether the block information of the valid blocks in the sorting queue meets the predetermined time difference Ts, wherein the predetermined time difference Ts is determined at least based on the granularity information and velocity information of each valid block; as well as Based on the judgment result, target operations are performed on the block information of the valid blocks to process the block information to be sorted. The validity judgment of the block information of the multiple blocks includes: The validity of the data packet formed by the block information of the multiple blocks and the reception time Tr of the block information received by the multiple blocks are determined; The receiving time Tr is marked for each valid block in the sorting queue, and determining whether the block information of the valid blocks in the sorting queue meets the predetermined time difference Ts includes: Determine whether the receiving time Tr corresponding to the block information of the currently valid block in the sorting queue and its corresponding current time Tc satisfy the predetermined time difference Ts; and wherein, Based on the judgment result, target operations are performed on the block information of the valid blocks, including: In response to the fact that the receiving time Tr corresponding to the block information of the currently valid block and its corresponding current time Tc satisfy the predetermined time difference Ts, a blowing operation is performed based on the block information of the currently valid block and the block information of the surrounding valid blocks; or In response to the fact that the receiving time Tr corresponding to the block information of the currently valid block and its corresponding current time Tc do not satisfy the predetermined time difference Ts, a removal operation is performed on the block information of the currently valid block and the block information of the surrounding valid blocks.

2. The method according to claim 1, characterized in that, The validity determination of the data packet formed from the block information of the multiple blocks and the reception time Tr of the block information received by the multiple blocks includes: The validity of the data packet formed by the block information of the multiple blocks is determined by judging whether the transmission of the data packet is correct and whether the length of the data in the data packet is correct; and Determine whether the receiving time Tr exceeds the blowing time Tj of the plurality of blocks, so as to make a validity judgment on the receiving time Tr for receiving the block information of the plurality of blocks.

3. The method according to claim 1, characterized in that, The predetermined time difference Ts is set as follows , where L represents the granularity information of each effective block, and v represents the velocity information of each effective block.

4. The method according to claim 1, characterized in that, Also includes: Determine whether the currently valid block meets the spray type requirement; as well as In response to satisfying the blowing type, a blowing operation is performed based on the block information of the currently active block and the block information of the surrounding active blocks.

5. A device for processing information on blocks to be sorted, characterized in that, include: processor; A memory storing program instructions for processing information about blocks to be sorted, wherein when the program instructions are executed by the processor, the device implements the method according to any one of claims 1-4.

6. A computer-readable storage medium, characterized in that, It stores computer-readable instructions for processing information about blocks to be sorted, which, when executed by one or more processors, implement the method as described in any one of claims 1-4.

Images