Luggage stacking position determination method and device based on multiple iterations and storage medium

Abstract

The invention provides a luggage stacking position determination method and device based on multiple iterations and a storage medium, and relates to the technical field of luggage stacking position determination. The method comprises the following steps: traversing each to-be-confirmed point in a three-dimensional coordinate system corresponding to a current luggage barrow for the first time; if the stacking position corresponding to the to-be-stacked luggage is not determined from all the to-be-confirmed points, each optimized stacking condition and the priority corresponding to each optimized stacking condition are obtained; according to the priority of each optimized stacking condition, closing the optimized stacking conditions according to the sequence of the priorities from small to large, and traversing the middle to-be-confirmed point list corresponding to each optimized stacking condition every time when each optimized stacking condition is closed so as to determine the stacking position corresponding to the to-be-stacked luggage; according to the invention, the stacking position corresponding to the to-be-stacked luggage can be determined.

Description

Technical Field

[0001] The present invention relates to the technical field of determining the placement position of luggage, and particularly to a method, device, and storage medium for determining the placement position of luggage based on multiple iterations. Background Art

[0002] In the civil aviation field, luggage handling is a major challenge in the modern aviation industry. Due to the increasing passenger flow at airports, the number of passengers' luggage is also rising continuously. For luggage handling, in order to improve the handling efficiency of luggage, some airports use automated luggage handling equipment to transfer luggage from the conveyor belt to the luggage cart, and then transport it to the corresponding flight's aircraft for loading and consignment through the luggage cart. Before placing the luggage to be placed, it is necessary to determine the corresponding placement position of the luggage to be placed on the luggage cart, and the determination of the placement position is based on several preset placement conditions. However, due to the existence of placement conditions, there may still be no determined placement position for the luggage to be placed even when there is available placement space. In order to determine the placement position of the luggage to be placed, some placement conditions are usually downgraded, and then all the preset placement positions are traversed again. Since the time consumed for one traversal is relatively long, the efficiency of determining the placement position of the luggage to be placed is low. Summary of the Invention

[0003] For the above technical problems, the technical solution adopted by the present invention is as follows:

[0004] According to the first aspect of the present application, a method for determining the placement position of luggage based on multiple iterations is provided. The method includes the following steps:

[0005] R100, obtaining the three-dimensional coordinate system QR corresponding to the current luggage cart and the bounding box W of the luggage to be placed corresponding to the luggage to be placed; wherein, QR includes three-dimensional luggage grids corresponding to several pieces of already placed luggage.

[0006] R200, sequentially traversing each preset point to be confirmed in QR according to the size of W and the preset traversal rule.

[0007] R300, if the placement position corresponding to the luggage to be placed cannot be determined from all the points to be confirmed, then obtaining each optimized placement condition to obtain an optimized placement condition list B=(B1, B2,..., B j ,..., B m ), j = 1, 2,..., m; wherein, B j is the jth optimized placement condition, and m is the number of optimized placement conditions.

[0008] R400, determining the priority of each optimized placement condition according to B to obtain an optimized placement condition priority list YB=(YB1, YB2,..., YB j, …, YB m ); where, YB j is the priority corresponding to B j ; YB r > YB r+1 ; r = 1, 2, …, m - 1; B r preceded B r+1 to execute.

[0009] R500, obtain the fourth preset value NM = m.

[0010] R600, if NM > 0, then obtain the intermediate to-be-confirmed points corresponding to B NM to obtain the list D NM = (D NM，1 , D NM，2 , …, D NM，u , …, D NM，f(NM) ), u = 0, 1, …, f(NM); where, D NM，u is the u-th intermediate to-be-confirmed point corresponding to B NM , f(NM) is the number of intermediate to-be-confirmed points corresponding to B NM ; the intermediate to-be-confirmed points corresponding to B NM are the to-be-confirmed points that do not meet B NM .

[0011] R700, if f(NM) = 0, then update NM = NM - 1, enter R600; otherwise, set the execution status of B from B NM to B m to closed to obtain the updated optimized code placement condition list B' corresponding to B, and enter R800.

[0012] R800, according to the size of W and B', traverse D NM to obtain the placement positions corresponding to the luggage to be placed.

[0013] According to another aspect of the present application, there is also provided a non-transitory computer-readable storage medium, in which at least one instruction or at least one program segment is stored, and at least one instruction or at least one program segment is loaded and executed by a processor to implement the above-mentioned method for determining the luggage placement position based on multiple iterations.

[0014] According to another aspect of the present application, there is also provided an electronic device, including a processor and the above-mentioned non-transitory computer-readable storage medium.

[0015] The present invention has at least the following beneficial effects:

[0016] The method for determining the luggage stacking position based on multiple iterations of the present invention, after traversing each point to be confirmed in the three-dimensional coordinate system corresponding to the current luggage cart for the first time, if the stacking position corresponding to the luggage to be stacked cannot be determined from all the points to be confirmed, each optimized stacking condition and the priority corresponding to each optimized stacking condition are obtained; according to the priority of each optimized stacking condition, the optimized stacking conditions are closed in ascending order of priority. Each time an optimized stacking condition is closed, the list of intermediate points to be confirmed corresponding to the optimized stacking condition is traversed to determine the stacking position corresponding to the luggage to be stacked.

[0017] Further, in the present invention, the closing process is carried out according to the priority of the optimized stacking conditions. First, the optimized stacking condition with the smallest priority is closed. The stacking condition with the smallest priority has the least impact on the determined stacking position of the luggage to be stacked. Therefore, the present invention can determine the stacking position corresponding to the luggage to be stacked under the premise of less impact; at the same time, the subsequent traversal is not a full-scale traversal. Therefore, the present invention can also improve the efficiency of determining the stacking position corresponding to the luggage to be stacked. Brief Description of the Drawings

[0018] In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the following will briefly introduce the drawings required for the description of the embodiments. Obviously, the following drawings are only some embodiments of the present invention. For those of ordinary skill in the art, without creative efforts, other drawings can be obtained based on these drawings.

[0019] Figure 1 It is a flowchart of the method for determining the luggage stacking position based on multiple iterations provided by the embodiment of the present invention. Detailed Embodiments

[0020] The following will clearly and completely describe the technical solutions in the embodiments of the present invention with reference to the drawings in the embodiments of the present invention. Obviously, the described embodiments are only some embodiments of the present invention, rather than all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative efforts belong to the scope of protection of the present invention.

[0021] It should be noted that based on the present disclosure, those skilled in the art should understand that one aspect described herein can be implemented independently of any other aspect, and two or more of these aspects can be combined in various ways. For example, any number of aspects described herein can be used to implement the device and / or practice the method. In addition, this device and / or practice this method can be implemented using other structures and / or functions in addition to one or more of the aspects described herein.

[0022] Embodiment 1:

[0023] In this embodiment, a method for determining the stacking position of the luggage to be stacked is provided. The method may include the following steps:

[0024] S100. Obtain the three-dimensional coordinate system QR corresponding to the current luggage cart, the bounding box W of the luggage to be stacked corresponding to the luggage to be stacked, and the length L of the luggage cart in the Y-axis direction in QR Y , the width D in the X-axis direction X and the height H in the Z-axis direction Z ; where QR includes three-dimensional luggage grids corresponding to several stacked luggages, and each three-dimensional luggage grid corresponds to position coordinates and size information.

[0025] In this embodiment, before determining the stacking position of the luggage to be stacked, it is necessary to identify the stacked luggage on the current luggage cart; the stacked luggage can be identified by an image recognition method or a lidar scanning method. After identifying the stacked luggage, the stacked luggage can be segmented to generate several three-dimensional luggage grids containing the point clouds corresponding to the stacked luggage; it can be understood that each three-dimensional bounding box represents the stacked luggage in the corresponding space.

[0026] For the luggage to be stacked, the size information of the bounding box of the luggage to be stacked corresponding to the luggage to be stacked can be obtained by an image recognition method; at the same time, a three-dimensional coordinate system corresponding to the current luggage cart can be established to quantify the position of each space in the space of the current luggage cart.

[0027] Further, the luggage to be stacked is picked up by a preset manipulator; where when the preset manipulator places the luggage to be stacked, the orientation of the manipulator is perpendicular to the side wall of the luggage cart in the Y-axis direction in QR.

[0028] Based on the above setting of the manipulator orientation, in the subsequent process of determining the stacking position, first traverse along the Y-axis direction to facilitate the stacking of the luggage and avoid hitting the stacked luggage.

[0029] S200. Obtain the first preset value NUM1 = 0, and place W at the origin position corresponding to W in QR.

[0030] In this embodiment, since the position determination of the luggage to be stacked is based on the stack shape of the stacked luggage on the current luggage cart, after stacking each luggage to be stacked, it is necessary to re-obtain the three-dimensional coordinate system corresponding to the current luggage cart; then place W at the origin position corresponding to W in QR to determine the best stacking position applicable to the current luggage to be stacked based on the stack shape corresponding to the current luggage cart.

[0031] Further, the origin position QR corresponding to W in QR W =(W X , W Y , W Z ); where W X is the X-axis coordinate of the origin position corresponding to W in QR, W Y is the Y-axis coordinate of the origin position corresponding to W in QR, W Z is the Z-axis coordinate of the origin position corresponding to W in QR; W X =L W / 2; W Y =D W / 2; W Z =H W / 2; D W is the width of W in the X-axis direction, H W is the height of W in the Z-axis direction.

[0032] In this embodiment, when W is placed at the origin position QR corresponding to W in QR W , the center point of W coincides with QR W ; it can be understood that, with different sizes of W, the corresponding origin position QR of W in QR W is also different. When W is at the origin position, one vertex of W coincides with the origin of the coordinate system of QR. Thus, it is possible to make W traverse starting from a bottom vertex of the current luggage cart.

[0033] S300, if NUM1×ΔL Y <L Y -L W , then enter S400; where L W is the length of W in the Y-axis direction; ΔL Y is the first preset distance.

[0034] Further, if NUM1×ΔL Y ≥L Y -L W , then obtain the second preset value NUM2 = 0 and the third preset value NUM3 = 0, and enter S600.

[0035] S600, if NUM2×ΔH Z <H Z -H W , then enter S610; otherwise, enter S620; where ΔH Z is the second preset distance.

[0036] S610, update NUM1 = 0, update NUM2 = NUM2 + 1, and place W at the middle position QE W =(W X+NUM3×ΔD X , W Y , W Z +NUM2×ΔH Z ) to enter S300.

[0037] In S620, if NUM3×ΔD X <D X -D W , update NUM1 = 0, update NUM2 = 0, update NUM3 = NUM3 + 1, place W at the middle position QE W =(W X +NUM3×ΔD X , W Y , W Z +NUM2×ΔH Z ), then enter S300; otherwise, it is determined that the stacking position corresponding to the luggage to be stacked has not been determined; where ΔD X is the third preset distance.

[0038] Furthermore, ΔL Y =ΔH Z =ΔD X =20mm can be set; under this parameter setting, it can ensure that the luggage is stacked more closely on the premise of higher traversal efficiency, thereby improving the space utilization rate of the luggage cart.

[0039] In this embodiment, the traversal order is to first traverse along the Y-axis direction. When the coordinates corresponding to the Z-axis and Y-axis remain unchanged, if the traversal along the Y-axis direction is completed, the coordinate of the Z-axis is increased by ΔH Z , and then continue to traverse along the Y-axis again. If the Z-axis NUM2×ΔH Z ≥H Z -H W , it means that the traversal in the Z-axis direction is also completed. At this time, the coordinate of the X-axis needs to be changed and the traversal in the Y-axis direction continues; that is, first traverse along the Y-axis direction, then along the Z-axis direction, and finally along the X-axis direction; it can be understood as a three-layer loop to realize the traversal of the entire current luggage cart space; the effect of this traversal method is as follows:

[0040] Through the above traversal method, when stacking luggage, the luggage to be stacked will first be stacked against the farther side of the current luggage cart, presenting a shape like a grain stack with a larger bottom and a smaller top, so that when the manipulator stacks luggage, it will not collide with the stacked luggage and avoid damage to the luggage.

[0041] In S400, it is determined whether W coincides with at least one of several three-dimensional luggage grids and whether W meets all the preset stacking conditions.

[0042] In this embodiment, no matter where W is located, it is necessary to determine whether W will collide with other already stacked luggage and whether all other preset stacking conditions are met when W is at this position. It can be understood that if W coincides with at least one of several three-dimensional luggage grids, it means that W will collide with the already stacked luggage when it is in this position.

[0043] Further, determining whether W coincides with at least one of several three-dimensional luggage grids may include the following steps:

[0044] S410, obtain the minimum and maximum X-axis coordinates, minimum and maximum Y-axis coordinates, and minimum and maximum Z-axis coordinates of each three-dimensional luggage grid in QR to obtain a set A of minimum and maximum coordinate lists of the three-dimensional luggage grids A = (A1, A2,..., A i ,..., A n ), where i = 1, 2,..., n; among them, A i is the minimum and maximum coordinate list of the i-th three-dimensional luggage grid, and n is the number of three-dimensional luggage grids; A i = (A i，X _min, A i，X _max, A i，Y _min, A i，Y _max, A i，Z _min, A i，Z _max); A i，X _min and A i，X _max are respectively the minimum and maximum X-axis coordinates of the i-th three-dimensional luggage grid, A i，Y _min and A i，Y _max are respectively the minimum and maximum Y-axis coordinates of the i-th three-dimensional luggage grid, and A i，Z _min and A i，Z _max are respectively the minimum and maximum Z-axis coordinates of the i-th three-dimensional luggage grid.

[0045] In this embodiment, each three-dimensional luggage grid in QR corresponds to the coordinates of each vertex, and the minimum and maximum X-axis coordinates, minimum and maximum Y-axis coordinates, and minimum and maximum Z-axis coordinates of each three-dimensional luggage grid in QR can be obtained.

[0046] S420, obtain the minimum X-axis coordinate W min，X , maximum X-axis coordinate W max，X , minimum Y-axis coordinate W min，Y , maximum Y-axis coordinate W max，Y , minimum Z-axis coordinate W min，Z and maximum Z-axis coordinate W max，Z of W at the current time in QR.

[0047] Similarly, when W is at different positions in QR, the corresponding minimum X-axis coordinate W can also be obtained. min，X , the maximum X-axis coordinate W max，X , the minimum Y-axis coordinate W min，Y , the maximum Y-axis coordinate W max，Y , the minimum Z-axis coordinate W min，Z and the maximum Z-axis coordinate W max，Z .

[0048] S430, traverse A. If the X-axis coordinate interval of A i [A i，X _min, A i，X _max] overlaps with the X-axis coordinate interval of W [W min，X , W max，X , the Y-axis coordinate interval of A i [A i，Y _min, A i，Y _max] overlaps with the Y-axis coordinate interval of W [W min，Y , W max，Y and the Z-axis coordinate interval of A i [A i，Z _min, A i，Z _max] overlaps with the Z-axis coordinate interval of W [W min，Z , W max，Z , it is determined that W coincides with at least one of several three-dimensional luggage grids.

[0049] In this embodiment, through the above steps, it can be determined whether there will be a collision with the already stacked luggage when W is at a certain position in QR; if there is no collision with the already stacked luggage when W is at a certain position in QR, it is also necessary to determine whether all the preset stacking conditions are met when W is at this position; the preset stacking conditions are set according to relevant regulations of civil aviation. For example, the preset stacking conditions may include that the luggage with a smaller volume is placed above the luggage with a larger volume, and there will be no throwing situation for the currently to-be-stacked luggage, etc.

[0050] S500, if W coincides with at least one of several three-dimensional luggage grids or W does not meet at least one of all the preset stacking conditions, then move W along the Y-axis direction by ΔL Y , update NUM1 = NUM1 + 1, and enter S300; otherwise, determine the position where W is currently located as the stacking position corresponding to the to-be-stacked luggage.

[0051] In this embodiment, due to the setting of the preset stacking conditions, after traversing all positions in QR, it is possible that the stacking position corresponding to the to-be-stacked luggage has not been determined. In order to stack the to-be-stacked luggage into the luggage cart, a second traversal is required.

[0052] Further, the preset stacking conditions include a number of necessary stacking conditions and a number of optimized stacking conditions; among them, the execution status of the necessary stacking conditions is on, and the execution status of the optimized stacking conditions includes on and off.

[0053] In this embodiment, it can be understood that the necessary stacking conditions are stacking conditions set according to relevant regulations of civil aviation. For example, luggage with a small volume is placed on top of luggage with a large volume, and there will be no throwing situation for the currently to-be-stacked luggage; while the optimized stacking conditions are optimized stacking conditions set to improve the space utilization rate of the luggage cart or to make the luggage stacked neatly. The execution status of the optimized stacking conditions can be set to on or off. When the execution status of the optimized stacking conditions is on, the optimized stacking conditions need to be satisfied; otherwise, they do not need to be satisfied.

[0054] After step S620, the method may further include the following steps:

[0055] S700, if the stacking position corresponding to the to-be-stacked luggage is not determined, then set the execution status of all the optimized stacking conditions in the preset stacking conditions to off, and enter S200.

[0056] In this embodiment, after traversing all positions in QR, if the stacking position corresponding to the to-be-stacked luggage is not determined, then set the execution status of all the optimized stacking conditions in the preset stacking conditions to off; then enter S200, and traverse each position in QR again to determine the stacking position corresponding to the to-be-stacked luggage.

[0057] In this embodiment, obtain the three-dimensional coordinate system QR corresponding to the current luggage cart, the bounding box W corresponding to the to-be-stacked luggage, and the length L of the luggage cart in the Y-axis direction in QR Y and the width D in the X-axis direction X and the height H in the Z-axis direction Z , and then traverse the space in the Y-axis direction of the current luggage cart according to the size of W along the Y-axis direction with a step size of ΔL Y . If W does not coincide with all the three-dimensional luggage grids and W satisfies all the preset stacking conditions, then determine the position where W is currently located as the stacking position corresponding to the to-be-stacked luggage; traverse along the Y-axis, Z-axis, and X-axis directions in sequence, so as to achieve the purpose of determining the stacking position corresponding to W.

[0058] Further, when determining the stacking position corresponding to the luggage to be stacked, it is based on the remaining stacking space of the current luggage cart and the size of the luggage to be stacked, so that the determined stacking position of the luggage to be stacked is the optimal stacking position for the current luggage cart. Since the judgment condition for the luggage to be stacked to coincide with the three-dimensional grid is set, the stacking position corresponding to the luggage to be stacked fits closely with the already stacked luggage, thereby improving the utilization rate of the space of the luggage cart.

[0059] Embodiment 2:

[0060] Based on the method in Embodiment 1, if the stacking position corresponding to the luggage to be stacked cannot be determined, the stacking position corresponding to the luggage to be stacked can be further determined by the method in this embodiment. The method may include the following steps:

[0061] Q100, obtain the three-dimensional coordinate system QR corresponding to the current luggage cart and the luggage bounding box W corresponding to the luggage to be stacked; wherein, QR includes a plurality of three-dimensional luggage grids corresponding to the already stacked luggage.

[0062] In this embodiment, before determining the stacking position of the luggage to be stacked, it is necessary to identify the already stacked luggage on the current luggage cart; the already stacked luggage can be identified by means of image recognition or lidar scanning. After the already stacked luggage is identified, the already stacked luggage can be segmented to generate a plurality of three-dimensional luggage grids containing the point clouds corresponding to the already stacked luggage; it can be understood that each three-dimensional luggage bounding box represents the already stacked luggage in the corresponding space.

[0063] For the luggage to be stacked, the size information of the luggage bounding box corresponding to the luggage to be stacked can be obtained by means of image recognition; at the same time, a three-dimensional coordinate system corresponding to the current luggage cart can be established to quantify the position of each space in the space of the current luggage cart.

[0064] Q200, according to the size of W and the preset traversal rule, traverse each preset point to be confirmed in QR in turn.

[0065] Q300, when W is at the target point to be confirmed, if W does not coincide with any three-dimensional luggage grid, enter Q400; otherwise, traverse the next point to be confirmed; wherein, the target point to be confirmed is any preset point to be confirmed.

[0066] Q400, if W meets all the preset stacking conditions, then confirm the target point to be confirmed as the stacking position corresponding to the luggage to be stacked; otherwise, traverse the next point to be confirmed; wherein, the preset stacking conditions include a plurality of necessary stacking conditions and a plurality of optimized stacking conditions.

[0067] In this embodiment, the method in steps S200 - S620 of Embodiment 1 can be used to traverse each preset point to be confirmed in QR in sequence, which will not be elaborated here; the preset points to be confirmed can be the coordinate points corresponding to the center point of W every time W moves in Embodiment 1.

[0068] Q500, if after traversing all the preset points to be confirmed, the placement position corresponding to the luggage to be placed cannot be determined, then enter Q600.

[0069] In this embodiment, due to the setting of the preset placement conditions, after traversing all positions in QR, it is possible that the placement position corresponding to the luggage to be placed has not been determined; however, at this time, there is still placement space in the luggage cart. In order to be able to place the luggage to be placed in the luggage cart, a secondary traversal is required.

[0070] Q600, according to the preset downgrading rules for placement conditions, downgrade several optimized placement conditions, and enter Q200.

[0071] Furthermore, the execution status of the necessary placement conditions is enabled, and the execution status of the optimized placement conditions includes enabled and disabled.

[0072] In this embodiment, it can be understood that the necessary placement conditions are the placement conditions set according to relevant regulations of civil aviation. For example: luggage with a small volume is placed on top of luggage with a large volume, and there will be no throwing situation for the currently placed luggage; while the optimized placement conditions are the optimized placement conditions set to improve the space utilization rate of the luggage cart or to make the luggage placement neat. The execution status of the optimized placement conditions can be set to enabled or disabled. When the execution status of the optimized placement conditions is enabled, the optimized placement conditions need to be satisfied; otherwise, they do not need to be satisfied.

[0073] Step Q600 includes the following steps:

[0074] Q610, set the execution status of all optimized placement conditions in the preset placement conditions to disabled, and enter Q200.

[0075] In this embodiment, after traversing all positions in QR, if the placement position corresponding to the luggage to be placed cannot be determined, then set the execution status of all optimized placement conditions in the preset placement conditions to disabled; then enter S200 to traverse each position in QR again to determine the placement position corresponding to the luggage to be placed.

[0076] Furthermore, step Q600 can include the following steps:

[0077] Q620, obtain each optimized placement condition to obtain the optimized placement condition list B = (B1, B2,..., B j, …, B m ), j = 1, 2, …, m; where B j is the j-th optimized stacking condition, and m is the number of optimized stacking conditions.

[0078] Q630. According to B, determine the priority of each optimized stacking condition to obtain the optimized stacking condition priority list YB = (YB1, YB2, …, YB j , …, YB m ); where YB j is the corresponding priority of B j ; YB r > YB r+1 ; r = 1, 2, …, m - 1; B r is executed before B r+1 .

[0079] Q640. Obtain the fourth preset value NM = m.

[0080] Q650. If NM > 0 and the stacking position corresponding to the luggage to be stacked cannot be determined, then set the execution status of B NM in B to closed; update NM = NM - 1; enter Q200.

[0081] In this embodiment, the priority of any necessary stacking condition is greater than the priority of any optimized stacking condition, that is, the necessary stacking condition is executed before the optimized stacking condition; and the optimized stacking condition is also set with an execution priority, and the optimized stacking condition with a higher priority is executed before the stacking condition with a lower priority.

[0082] It can be understood that after the first traversal, there are various reasons why the stacking position of the luggage to be stacked cannot be determined. Some positions may not meet the necessary stacking conditions, and some positions do not meet the optimized stacking conditions; among those that do not meet the optimized stacking conditions, some do not meet the optimized stacking conditions with higher priorities, and some do not meet the stacking conditions with lower priorities. Therefore, in this embodiment, first close the optimized stacking condition with the lowest priority, then enter Q200, and re-traverse each position in QR. If the stacking position corresponding to the luggage to be stacked still cannot be determined, then close the optimized stacking condition with the second lowest priority until the stacking position corresponding to the luggage to be stacked is determined.

[0083] Further, after step Q650, the method further includes:

[0084] Q660. If NM ≤ 0 or the stacking position corresponding to the luggage to be stacked is determined, then jump out of the current process.

[0085] In this embodiment, if NM ≤ 0, it means that all optimized stacking conditions have been closed, then jump out of the current process.

[0086] Further, in Q650, for each optimized stowage condition closed, it is judged whether the closed optimized stowage condition is executed during the first traversal. If it is executed, enter Q200; otherwise, close the next optimized stowage condition and judge again whether the closed optimized stowage condition is executed during the first traversal.

[0087] Through the above method, it is possible to directly determine the stowage position corresponding to the luggage to be stowed during the second traversal, thereby avoiding excessive traversal times and improving the efficiency of determining the stowage position corresponding to the luggage to be stowed.

[0088] In this embodiment, the three-dimensional coordinate system QR corresponding to the current luggage cart and the stowage luggage bounding box W corresponding to the luggage to be stowed are obtained; according to the size of W and the preset traversal rule, each preset point to be confirmed in QR is traversed in sequence; when W is at the target point to be confirmed, if W does not coincide with any three-dimensional luggage grid and W meets all the preset stowage conditions, the target point to be confirmed is determined as the stowage position corresponding to the luggage to be stowed; otherwise, traverse the next point to be confirmed; wherein, the preset stowage conditions include a number of necessary stowage conditions and a number of optimized stowage conditions; if after traversing all the preset points to be confirmed, the stowage position corresponding to the luggage to be stowed cannot be determined, according to the preset stowage condition downgrading rule, the number of optimized stowage conditions is downgraded, and then according to the size of W and the preset traversal rule, each preset point to be confirmed in QR is traversed in sequence; in the present invention, since the preset stowage conditions are downgraded, the conditions for determining the stowage position corresponding to the luggage to be stowed are relaxed, and it is easier to determine the stowage position corresponding to the luggage to be stowed. In the case where there is stowage space, it is ensured that the stowage position of the luggage to be stowed can be determined.

[0089] Embodiment Three:

[0090] In Embodiment One, due to the limitations of the necessary stowage conditions and the optimized stowage conditions, it is possible that, on the premise that there is remaining stowage space in the luggage cart, the stowage position corresponding to the luggage to be stowed cannot be determined. Based on this, the following method is provided to further determine the stowage position corresponding to the luggage to be stowed:

[0091] H100, obtain the three-dimensional coordinate system QR corresponding to the current luggage cart and the stowage luggage bounding box W corresponding to the luggage to be stowed; wherein, QR includes three-dimensional luggage grids corresponding to a number of stowed luggage.

[0092] In this embodiment, before determining the stacking position of the to-be-stacked luggage, it is necessary to identify the luggage already stacked on the current luggage cart; the luggage already stacked can be identified by means of image recognition or lidar scanning. After identifying the luggage already stacked, the luggage already stacked can be segmented to generate a number of three-dimensional luggage grids containing the point clouds corresponding to the luggage already stacked; it can be understood that each three-dimensional luggage bounding box represents the luggage already stacked in the corresponding space.

[0093] For the to-be-stacked luggage, the size information of the to-be-stacked luggage bounding box corresponding to the to-be-stacked luggage can be obtained by means of image recognition; at the same time, a three-dimensional coordinate system corresponding to the current luggage cart can be established to quantify the position of each space in the space of the current luggage cart.

[0094] H200, according to the size of W and the preset traversal rule, sequentially traverse each preset point to be confirmed in QR.

[0095] In this embodiment, the method in steps S200-S620 in Embodiment 1 can be used to sequentially traverse each preset point to be confirmed in QR, which will not be elaborated here; the preset points to be confirmed can be the coordinate points corresponding to the center point of W each time W moves in Embodiment 1.

[0096] H300, if the stacking position corresponding to the to-be-stacked luggage is not determined from all the points to be confirmed, then obtain each optimized stacking condition to obtain an optimized stacking condition list B=(B1, B2,..., B j ,..., B m ), j = 1, 2,..., m; where B j is the jth optimized stacking condition, and m is the number of optimized stacking conditions.

[0097] In this embodiment, due to the setting of the preset stacking conditions, after traversing all the positions in QR, it is possible that the stacking position corresponding to the to-be-stacked luggage is not determined; however, at this time, there is still stacking space in the luggage cart. In order to stack the to-be-stacked luggage into the luggage cart, a second traversal is required.

[0098] H400, according to B, determine the priority of each optimized stacking condition to obtain an optimized stacking condition priority list YB=(YB1, YB2,..., YB j ,..., YB m ); where YB j is the priority corresponding to B j ; YB r > YB r+1 ; r = 1, 2,..., m - 1; B r is executed before B r+1 ;

[0099] H500, obtain the fourth preset value NM = m;

[0100] H600, if NM > 0 and the stacking position corresponding to the luggage to be stacked cannot be determined, then set the execution status of B in B NM to closed; update NM = NM - 1; enter H200.

[0101] In this embodiment, the priority of any necessary stacking condition is higher than that of any optimized stacking condition, that is, the necessary stacking condition is executed before the optimized stacking condition; and the optimized stacking condition is also set with an execution priority, and the optimized stacking condition with a higher priority is executed before the stacking condition with a lower priority.

[0102] It can be understood that after the first traversal, there are various reasons why the stacking position of the luggage to be stacked cannot be determined. Some positions may not meet the necessary stacking conditions, and some positions do not meet the optimized stacking conditions; among those that do not meet the optimized stacking conditions, some do not meet the optimized stacking conditions with a higher priority, and some do not meet the stacking conditions with a lower priority. Therefore, in this embodiment, first close the optimized stacking condition with the lowest priority, then enter H200, and re-traverse each position in QR. If the stacking position corresponding to the luggage to be stacked still cannot be determined, then close the optimized stacking condition with the next lowest priority until the stacking position corresponding to the luggage to be stacked is determined.

[0103] Further, after step H600, the method further includes:

[0104] H700, if NM ≤ 0 or the stacking position corresponding to the luggage to be stacked is determined, then jump out of the current process.

[0105] In this embodiment, if NM ≤ 0, it means that all optimized stacking conditions have been closed, then jump out of the current process.

[0106] Further, in H600, every time an optimized stacking condition is closed, it is judged whether the closed optimized stacking condition is executed during the first traversal. If it is executed, enter H200; otherwise, close the next optimized stacking condition and judge again whether the closed optimized stacking condition is executed during the first traversal.

[0107] Further, step H200 includes the following steps:

[0108] H210, when W is at the target point to be confirmed, if W does not coincide with any three-dimensional luggage grid, then enter H211; otherwise, traverse the next point to be confirmed; where the target point to be confirmed is any preset point to be confirmed.

[0109] H211. If W meets all the preset stacking conditions, then confirm the target point to be confirmed as the stacking position corresponding to the luggage to be stacked; otherwise, traverse the next point to be confirmed. Among them, the preset stacking conditions include several necessary stacking conditions and several optimized stacking conditions.

[0110] Further, step H200 includes the following steps:

[0111] H221. Obtain the first preset value NUM1 = 0, the second preset value NUM2 = 0, and the third preset value NUM3 = 0; and place W at the origin position corresponding to W in QR.

[0112] H222. If NUM1 × ΔL Y <L Y -L W , then enter H223. Among them, L Y is the length of the luggage cart in the Y-axis direction in QR, and L W is the length of W in the Y-axis direction; ΔL Y is the first preset distance.

[0113] H223. Determine whether W coincides with at least one of several three-dimensional luggage grids, and determine whether W meets all the preset stacking conditions.

[0114] H224. If W coincides with at least one of several three-dimensional luggage grids or W does not meet at least one of all the preset stacking conditions, then move W in the Y-axis direction by ΔL Y , update NUM1 = NUM1 + 1, and enter H222; otherwise, determine the position where W is currently located as the stacking position corresponding to the luggage to be stacked.

[0115] Further, step H222 also includes: If NUM1 × ΔL Y ≥L Y -L W , then enter H225.

[0116] H225. If NUM2 × ΔH Z <H Z -H W , then enter H226; otherwise, enter H227. Among them, ΔH Z is the second preset distance; H Z is the height of the luggage cart in the Z-axis direction in QR.

[0117] H226. Update NUM1 = 0, update NUM2 = NUM2 + 1, and place W at the middle position QE W =(W X +NUM3×ΔD X , W Y, W Z + NUM2 × ΔH Z ) and enter H222.

[0118] For H227, if NUM3 × ΔD X < D X - D W , update NUM1 = 0, update NUM2 = 0, update NUM3 = NUM3 + 1, and place W at the middle position QE W = (W X + NUM3 × ΔD X , W Y , W Z + NUM2 × ΔH Z ) and enter H222; otherwise, it is determined that the stacking position corresponding to the luggage to be stacked has not been determined; where ΔD X is the third preset distance; D X is the width of the luggage cart in the X-axis direction in QR.

[0119] Through the above method, it is possible to directly determine the stacking position corresponding to the luggage to be stacked during the secondary traversal process, thereby avoiding excessive traversal times and improving the efficiency of determining the stacking position corresponding to the luggage to be stacked.

[0120] In this embodiment, the three-dimensional coordinate system QR corresponding to the current luggage cart and the bounding box W of the luggage to be stacked corresponding to the luggage to be stacked are obtained; according to the size of W and the preset traversal rules, each preset point to be confirmed in QR is traversed in sequence; when W is at the target point to be confirmed, if W does not coincide with any three-dimensional luggage grid and W meets all the preset stacking conditions, then the target point to be confirmed is determined as the stacking position corresponding to the luggage to be stacked; otherwise, the next point to be confirmed is traversed; where the preset stacking conditions include several necessary stacking conditions and several optimized stacking conditions; if after traversing all the preset points to be confirmed, the stacking position corresponding to the luggage to be stacked cannot be determined, then according to the preset downgrading rule of the stacking conditions, the several optimized stacking conditions are downgraded, and then according to the size of W and the preset traversal rules, each preset point to be confirmed in QR is traversed in sequence; in the present invention, since the preset stacking conditions are downgraded, the conditions for determining the stacking position corresponding to the luggage to be stacked are relaxed, making it easier to determine the stacking position corresponding to the luggage to be stacked, and ensuring that the stacking position of the luggage to be stacked can be determined in the case of existing stacking space.

[0121] In this embodiment, a three-dimensional coordinate system QR corresponding to the current luggage cart and a luggage bounding box W corresponding to the luggage to be stacked are obtained. According to the size of W and a preset traversal rule, each preset point to be confirmed in QR is traversed in sequence. When W is at the target point to be confirmed, if W does not coincide with any three-dimensional luggage grid and W meets all the preset stacking conditions, the target point to be confirmed is determined as the stacking position corresponding to the luggage to be stacked; otherwise, the next point to be confirmed is traversed. Among them, the preset stacking conditions include several necessary stacking conditions and several optimized stacking conditions. If, after traversing all the preset points to be confirmed, the stacking position corresponding to the luggage to be stacked cannot be determined, according to the preset downgrading rule for the stacking conditions, the several optimized stacking conditions are downgraded, and then according to the size of W and the preset traversal rule, each preset point to be confirmed in QR is traversed in sequence. In the present invention, due to the downgrading of the preset stacking conditions, the conditions for determining the stacking position corresponding to the luggage to be stacked are relaxed, making it easier to determine the stacking position corresponding to the luggage to be stacked. In the case where there is a stacking space, it is ensured that the stacking position of the luggage to be stacked can be determined.

[0122] Embodiment 4:

[0123] In the above Embodiment 1, during the second traversal, a full traversal of all positions in QR is performed, and this traversal method has low efficiency. Based on this, the following method is provided to improve the traversal efficiency:

[0124] T100, obtain a three-dimensional coordinate system QR corresponding to the current luggage cart and a luggage bounding box W corresponding to the luggage to be stacked; among them, QR includes several three-dimensional luggage grids corresponding to the stacked luggage.

[0125] In this embodiment, before determining the stacking position of the luggage to be stacked, it is necessary to identify the stacked luggage on the current luggage cart; the stacked luggage can be identified by means of image recognition or lidar scanning. After identifying the stacked luggage, the stacked luggage can be segmented to generate several three-dimensional luggage grids containing the point clouds corresponding to the stacked luggage; it can be understood that each three-dimensional luggage bounding box represents the stacked luggage in the corresponding space.

[0126] For the luggage to be stacked, the size information of the luggage bounding box corresponding to the luggage to be stacked can be obtained by means of image recognition; at the same time, a three-dimensional coordinate system corresponding to the current luggage cart can be established to quantify the position of each space in the space of the current luggage cart.

[0127] T200, according to the size of the luggage bounding box corresponding to the luggage to be stacked and the preset traversal rule, traverse each preset point to be confirmed in QR in sequence.

[0128] Further, step T200 may include the following steps:

[0129] T210, obtain the first preset value NUM1 = 0, the second preset value NUM2 = 0, and the third preset value NUM3 = 0; and place W at the origin position corresponding to W in QR.

[0130] T220, if NUM1 × ΔL Y <L Y -L W , then enter T230; where L Y is the length of the luggage cart in the Y-axis direction in QR, and L W is the length of W in the Y-axis direction; ΔL Y is the first preset distance.

[0131] T230, determine whether W coincides with at least one of several three-dimensional luggage grids, and determine whether W meets all the preset stacking conditions; where the preset stacking conditions include necessary stacking conditions and optimized stacking conditions.

[0132] T240, if W coincides with at least one of several three-dimensional luggage grids or W does not meet at least one of all the preset stacking conditions, then move W in the Y-axis direction by ΔL Y , update NUM1 = NUM1 + 1, and enter T220; otherwise, determine the position where W is currently located as the stacking position corresponding to the luggage to be stacked.

[0133] Furthermore, step T230 may include the following steps:

[0134] T231, if W coincides with at least one of several three-dimensional luggage grids, then traverse the next point to be confirmed; otherwise, enter T232.

[0135] T232, if W meets all the necessary stacking conditions, then enter T233; otherwise, traverse the next point to be confirmed.

[0136] T233, if W meets all the optimized stacking conditions, then determine the current point to be confirmed as the stacking position corresponding to the luggage to be stacked; otherwise, determine the current point to be confirmed as the specified point to be confirmed.

[0137] Furthermore, step T200 may also include: if NUM1 × ΔL Y ≥L Y -L W , then enter T250.

[0138] T250, if NUM2 × ΔH Z <H Z -H W , then enter T260; otherwise, enter T270; where ΔH Zis the second preset distance; H Z is the height of the luggage cart in the Z-axis direction in QR.

[0139] T260, update NUM1 = 0, update NUM2 = NUM2 + 1, place W at the middle position QE W =(W X + NUM3 × ΔD X , W Y , W Z + NUM2 × ΔH Z ), enter T220.

[0140] T270, if NUM3 × ΔD X < D X - D W , update NUM1 = 0, update NUM2 = 0, update NUM3 = NUM3 + 1, place W at the middle position QE W =(W X + NUM3 × ΔD X , W Y , W Z + NUM2 × ΔH Z ), enter T220; otherwise, it is determined that the stacking position corresponding to the luggage to be stacked has not been determined; where, ΔD X is the third preset distance; D X is the width of the luggage cart in the X-axis direction in QR.

[0141] In this embodiment, the traversal order is to first traverse along the Y-axis direction. When the coordinates corresponding to the Z-axis and Y-axis remain unchanged, if the traversal along the Y-axis direction is completed, the coordinate of the Z-axis is increased by ΔH Z , and then continue to traverse along the Y-axis again. If the Z-axis NUM2 × ΔH Z ≥ H Z - H W , it means that the traversal in the Z-axis direction is also completed. At this time, the coordinate of the X-axis needs to be changed and the traversal along the Y-axis direction continues; that is, first traverse along the Y-axis direction, then along the Z-axis direction, and finally along the X-axis direction; it can be understood as a three-layer loop to achieve the traversal of the entire current luggage cart space; the effect of this traversal method is as follows:

[0142] Through the above traversal method, when stacking the luggage, the luggage to be stacked will first be stacked against the farther side of the current luggage cart, presenting a shape like a haystack with a larger bottom and a smaller top, so that when the manipulator stacks the luggage, it will not collide with the stacked luggage and avoid damage to the luggage.

[0143] T300, if all the preset points to be confirmed are traversed and the placement position corresponding to the luggage to be coded is not determined, obtain the specified points to be confirmed to obtain the list C of specified points to be confirmed = (C1, C2, …, C p , …, C q ), p = 1, 2, …, q; where C p is the p-th specified point to be confirmed obtained, and q is the number of specified points to be confirmed obtained; when W is at the specified point to be confirmed, it does not coincide with any three-dimensional luggage grid, meets the preset necessary placement conditions and does not meet the preset optimized placement conditions.

[0144] In this embodiment, when traversing each point to be confirmed in QR for the first time, at a certain point to be confirmed, it is necessary to first determine whether it coincides with the three-dimensional luggage grid, then determine whether it meets the necessary placement conditions, and finally determine whether it meets the optimized placement conditions; since there are multiple judgment conditions, therefore, after traversing each point to be confirmed, it is possible that the placement position corresponding to the luggage to be coded cannot be determined.

[0145] It should be noted that for each point to be confirmed traversed, the reason for the point to be confirmed being negated can be recorded. For example: this point to be confirmed does not meet the necessary placement conditions or does not meet the optimized placement conditions; therefore, each specified point to be confirmed can be obtained to obtain C; it can be understood that the number of points to be confirmed in C is less than the total number of points to be confirmed in QR; during the first traversal process, the traversal time of C e is earlier than that of C e+1 , e = 1, 2, …, q - 1.

[0146] T400, set the execution status of all optimized placement conditions to off.

[0147] In this embodiment, the execution status of the optimized placement conditions can be set to on or off. During the first traversal, the execution status of all optimized placement conditions is set to on; if the placement position corresponding to the luggage to be coded cannot be determined during the first traversal, then set the execution status of all optimized placement conditions to off. Then, during the second traversal of the specified points to be confirmed in C, the optimized placement conditions will not be executed, so that the placement position corresponding to the luggage to be coded can be quickly determined.

[0148] T500, according to the size of the bounding box of the luggage to be coded corresponding to the luggage to be coded, traverse each specified point to be confirmed in C in turn.

[0149] In this embodiment, it should be noted that the first traversal is to traverse each point to be confirmed in QR according to a preset traversal rule, that is, the traversal method of three-layer loop; while the second traversal is to traverse each designated point to be confirmed in C, and it is not necessary to execute the traversal method of three-layer loop. It only needs to traverse each designated point to be confirmed in C one by one, so as to greatly improve the traversal efficiency.

[0150] T600, if W is located in C p When it does not coincide with any three-dimensional luggage grid and meets the preset necessary stacking conditions, then C p is determined as the stacking position corresponding to the luggage to be stacked.

[0151] For the method for determining the stacking position of luggage based on secondary iteration in this embodiment, if after traversing each point to be confirmed in the three-dimensional coordinate system corresponding to the current luggage cart, the stacking position corresponding to the luggage to be stacked is not determined, then a designated point to be confirmed is obtained; where when W is located at the designated point to be confirmed, it does not coincide with any three-dimensional luggage grid, meets the preset necessary stacking conditions and does not meet the preset optimized stacking conditions; that is, the designated point to be confirmed is the point to be confirmed that is negated due to not meeting the optimized stacking conditions; then, before the second traversal, the execution status of all optimized stacking conditions is set to closed, and during the subsequent second traversal, only the designated points to be confirmed are traversed, so as to ensure that the stacking position corresponding to the luggage to be stacked can be determined while improving the efficiency of determining the stacking position corresponding to the luggage to be stacked.

[0152] Embodiment Five:

[0153] Next, a method for determining the stacking position of luggage based on multiple iterations will be introduced with reference to Figure 1 the flowchart of the method for determining the stacking position of luggage based on multiple iterations shown.

[0154] The method for determining the stacking position of luggage based on multiple iterations may include the following steps:

[0155] R100, obtain the three-dimensional coordinate system QR corresponding to the current luggage cart and the luggage bounding box W corresponding to the luggage to be stacked; where QR includes several three-dimensional luggage grids corresponding to the stacked luggage.

[0156] In this embodiment, before determining the stacking position of the luggage to be stacked, it is necessary to identify the stacked luggage on the current luggage cart; the stacked luggage can be identified by image recognition or lidar scanning. After identifying the stacked luggage, the stacked luggage can be segmented to generate several three-dimensional luggage grids containing the point clouds corresponding to the stacked luggage; it can be understood that each three-dimensional luggage bounding box represents the stacked luggage in the corresponding space.

[0157] For the luggage to be stacked, the size information of the bounding box of the luggage to be stacked corresponding to the luggage to be stacked can be obtained through image recognition; at the same time, a three-dimensional coordinate system corresponding to the current luggage cart can be established to quantify the position of each space in the space of the current luggage cart.

[0158] R200, according to the size of W and the preset traversal rule, sequentially traverse each preset point to be confirmed in QR.

[0159] Further, step R200 may include the following steps:

[0160] R210, when W is at the target point to be confirmed, if W does not coincide with any three-dimensional luggage grid, enter R220; otherwise, traverse the next point to be confirmed; where the target point to be confirmed is any preset point to be confirmed.

[0161] R220, if W meets all the preset stacking conditions, confirm the target point to be confirmed as the stacking position corresponding to the luggage to be stacked; otherwise, traverse the next point to be confirmed; where the preset stacking conditions include a number of necessary stacking conditions and a number of optimized stacking conditions.

[0162] Further, step R200 may include the following steps:

[0163] R221, obtain the first preset value NUM1 = 0, the second preset value NUM2 = 0, and the third preset value NUM3 = 0; and place W at the origin position corresponding to W in QR.

[0164] R222, if NUM1×ΔL Y <L Y -L W , then enter R223; where L Y is the length of the luggage cart in the Y-axis direction in QR, L W is the length of W in the Y-axis direction; ΔL Y is the first preset distance.

[0165] Further, step R222 may also include: if NUM1×ΔL Y ≥L Y -L W , then enter R225;

[0166] R225, if NUM2×ΔH Z <H Z -H W , then enter R226; otherwise, enter R227; where ΔH Z is the second preset distance; H Z is the height of the luggage cart in the Z-axis direction in QR.

[0167] R226, update NUM1 = 0, update NUM2 = NUM2 + 1, place W at the middle position QE W =(W X + NUM3 × ΔD X , W Y , W Z + NUM2 × ΔH Z ), enter R222.

[0168] R227, if NUM3 × ΔD X < D X - D W , update NUM1 = 0, update NUM2 = 0, update NUM3 = NUM3 + 1, place W at the middle position QE W =(W X + NUM3 × ΔD X , W Y , W Z + NUM2 × ΔH Z ), enter R222; otherwise, it is determined that the stacking position corresponding to the luggage to be stacked has not been determined; where, ΔD X is the third preset distance; D X is the width of the luggage cart in the X-axis direction in QR.

[0169] R223, determine whether W coincides with at least one of several three-dimensional luggage grids, and determine whether W meets all the preset stacking conditions.

[0170] R224, if W coincides with at least one of several three-dimensional luggage grids or W does not meet at least one of all the preset stacking conditions, then move W in the Y-axis direction by ΔL Y , update NUM1 = NUM1 + 1, enter R222; otherwise, determine the position where W is currently located as the stacking position corresponding to the luggage to be stacked.

[0171] In this embodiment, the method in steps S200 - S620 in Embodiment 1 can be used to sequentially traverse each preset point to be confirmed in QR, which will not be elaborated here; the preset point to be confirmed can be the coordinate point corresponding to the center point of W each time W moves in Embodiment 1.

[0172] R300, if the stacking position corresponding to the luggage to be stacked has not been determined from all the points to be confirmed, then obtain each optimized stacking condition to obtain the optimized stacking condition list B = (B1, B2,..., B j ,..., B m ), j = 1, 2,..., m; where, B j is the jth optimized stacking condition, and m is the number of optimized stacking conditions.

[0173] In this embodiment, due to the setting of the preset stacking conditions, after traversing all positions in the QR, it is possible that the stacking position corresponding to the luggage to be stacked has not been determined yet. However, at this time, there is still stacking space in the luggage cart. In order to stack the luggage to be stacked into the luggage cart, multiple iterative traversals are required to determine the stacking position corresponding to the luggage to be stacked.

[0174] It should be noted that the necessary stacking conditions are the stacking conditions set according to the relevant regulations of civil aviation. For example, luggage with a small volume is placed on top of luggage with a large volume, and there will be no situation where the current luggage to be stacked is thrown. The optimized stacking conditions are the optimized stacking conditions set to improve the space utilization rate of the luggage cart or to make the luggage stacked neatly. The execution status of the optimized stacking conditions can be set to on or off. When the execution status of the optimized stacking conditions is on, the optimized stacking conditions need to be satisfied; otherwise, they do not need to be satisfied.

[0175] R400. According to B, determine the priority of each optimized stacking condition to obtain the optimized stacking condition priority list YB = (YB1, YB2,..., YB j ,..., YB m ); where YB j is the priority corresponding to B j ; YB r > YB r+1 ; r = 1, 2,..., m - 1; B r is executed before B r+1 .

[0176] In this embodiment, the priority of any necessary stacking condition is greater than the priority of any optimized stacking condition, that is, the necessary stacking condition is executed before the optimized stacking condition; and the optimized stacking condition is also set with an execution priority, and the optimized stacking condition with a higher priority is executed before the optimized stacking condition with a lower priority.

[0177] R500. Obtain the fourth preset value NM = m.

[0178] R600. If NM > 0, then obtain the intermediate point to be confirmed corresponding to B NM to obtain the NMth intermediate point to be confirmed list D NM = (D NM，1 , D NM，2 ,..., D NM，u ,..., D NM，f(NM) ), u = 0, 1,..., f(NM); where D NM，u is the u-th intermediate point to be confirmed corresponding to B NM , f(NM) is the number of intermediate points to be confirmed corresponding to B NM ; B NMThe corresponding intermediate point to be confirmed is that it does not meet B NM among the points to be confirmed.

[0179] In this embodiment, during the first traversal, the stacking position corresponding to the luggage to be stacked is not determined, indicating that all the points to be confirmed are negated; among the negated points to be confirmed, some are negated because they do not meet the necessary stacking conditions, and some are negated because they do not meet the optimized stacking conditions; then, for any optimized stacking condition, this stacking condition may correspond to negating multiple points to be confirmed, or may not negate any point to be confirmed; taking the optimized stacking condition as a dimension, the intermediate points to be confirmed corresponding to each optimized stacking condition can be obtained.

[0180] Further, after step R600, the method further includes:

[0181] R610, if NM ≤ 0, then it is determined that the stacking position corresponding to the luggage to be stacked is not determined, and the current process is exited.

[0182] In this embodiment, if NM ≤ 0, it means that all the optimized stacking conditions are closed. At this time, the stacking position corresponding to the luggage to be stacked cannot be determined, and the current process is exited. Subsequently, the luggage to be stacked can be stacked manually.

[0183] R700, if f(NM) = 0, then update NM = NM - 1, and enter R600; otherwise, set the execution status of B from B NM to B m to closed, so as to obtain the updated optimized stacking condition list B' corresponding to B, and enter R800.

[0184] In this embodiment, first, it is judged whether f(NM) is equal to 0. If f(NM) = 0, it means that no point to be confirmed is negated due to B NM Then, after closing B NM and traversing the points to be confirmed again, the stacking position corresponding to the luggage to be stacked cannot be determined either; therefore, at this time, the next optimized stacking condition is closed; if f(NM) ≠ 0, then enter R800.

[0185] R800, according to the size of W and B', traverse D NM to obtain the stacking position corresponding to the luggage to be stacked.

[0186] In this embodiment, it can be understood that D NM is the list of the NM-th intermediate points to be confirmed obtained by obtaining the intermediate points to be confirmed corresponding to B NM There are only a small number of points to be confirmed in D NM Therefore, the time consumed during traversal is short, thereby improving the efficiency of determining the stacking position corresponding to the luggage to be stacked; in addition, DNM The intermediate points to be confirmed are arranged in the order from the first to the last during the first traversal.

[0187] In this embodiment, after traversing each point to be confirmed in the three-dimensional coordinate system corresponding to the current luggage cart for the first time, if the placement position corresponding to the luggage to be stacked cannot be determined from all the points to be confirmed, then each optimization stacking condition and the priority corresponding to each optimization stacking condition are obtained; according to the priority of each optimization stacking condition, the optimization stacking conditions are closed in ascending order of priority. For each closed optimization stacking condition, the list of intermediate points to be confirmed corresponding to the optimization stacking condition is traversed to determine the placement position corresponding to the luggage to be stacked.

[0188] Furthermore, in the present invention, the closing process is performed according to the priority of the optimization stacking conditions. First, the optimization stacking condition with the smallest priority is closed. The stacking condition with the smallest priority has the smallest impact on the determined placement position of the luggage to be stacked. Therefore, the present invention can determine the placement position corresponding to the luggage to be stacked under the premise of a small impact; at the same time, the subsequent traversal is not a full-scale traversal. Therefore, the present invention can also improve the efficiency of determining the placement position corresponding to the luggage to be stacked.

[0189] Embodiment Six:

[0190] Based on the method in Embodiment One, every time a position is moved, in order to make the determined placement position more appropriate, it is also necessary to determine whether there is a situation of throwing luggage when the luggage to be stacked is stacked at this position. Based on this, the following method is provided:

[0191] E100, obtain the three-dimensional coordinate system QR corresponding to the current luggage cart and the luggage bounding box W corresponding to the luggage to be stacked; wherein, QR includes a plurality of three-dimensional luggage grids corresponding to the stacked luggage.

[0192] In this embodiment, before determining the placement position of the luggage to be stacked, it is necessary to identify the stacked luggage on the current luggage cart; the stacked luggage can be identified by means of image recognition or lidar scanning. After identifying the stacked luggage, the stacked luggage can be segmented to generate a plurality of three-dimensional luggage grids containing the point clouds corresponding to the stacked luggage; it can be understood that each three-dimensional luggage bounding box represents the stacked luggage in the corresponding space.

[0193] For the luggage to be stacked, the size information of the luggage bounding box corresponding to the luggage to be stacked can be obtained by means of image recognition; at the same time, a three-dimensional coordinate system corresponding to the current luggage cart can be established to quantify the position of each space in the space of the current luggage cart.

[0194] E200, traverse each preset point to be confirmed in QR in sequence according to the size of W and the preset traversal rule.

[0195] Further, step E200 includes the following steps:

[0196] E221, obtain the first preset value NUM1 = 0, the second preset value NUM2 = 0, and the third preset value NUM3 = 0; and place W at the origin position corresponding to W in QR.

[0197] E222, if NUM1 × ΔL Y <L Y -L W , then enter E223; where L Y is the length of the luggage cart in the Y-axis direction in QR, and L W is the length of W in the Y-axis direction; ΔL Y is the first preset distance.

[0198] E223, determine whether W coincides with at least one of several three-dimensional luggage grids, and determine whether W meets all the preset stacking conditions.

[0199] E224, if W coincides with at least one of several three-dimensional luggage grids or W does not meet at least one of all the preset stacking conditions, then move W in the Y-axis direction by ΔL Y , update NUM1 = NUM1 + 1, and enter E222; otherwise, determine the position where W is currently located as the stacking position corresponding to the luggage to be stacked.

[0200] Further, step E222 may further include: if NUM1 × ΔL Y ≥L Y -L W , then enter E225.

[0201] E225, if NUM2 × ΔH Z <H Z -H W , then enter E226; otherwise, enter E227; where ΔH Z is the second preset distance; H Z is the height of the luggage cart in the Z-axis direction in QR.

[0202] E226, update NUM1 = 0, update NUM2 = NUM2 + 1, and place W at the middle position QE W =(W X +NUM3 × ΔD X , W Y , W Z +NUM2 × ΔH Z) Enter E222 at this point.

[0203] For E227, if NUM3 × ΔD X <D X -D W , update NUM1 = 0, update NUM2 = 0, update NUM3 = NUM3 + 1, and place W at the middle position QE W =(W X + NUM3 × ΔD X , W Y , W Z + NUM2 × ΔH Z ) Enter E222; otherwise, it is determined that the stacking position corresponding to the luggage to be stacked has not been determined; where ΔD X is the third preset distance; D X is the width of the luggage cart in the X-axis direction in QR.

[0204] In this embodiment, the method in steps S200 - S620 in Embodiment 1 can be used to sequentially traverse each preset point to be confirmed in QR, which will not be elaborated here; the preset points to be confirmed can be the coordinate points corresponding to the center point of W each time W moves in Embodiment 1.

[0205] For E300, when W is at the target point to be confirmed, if W does not coincide with any three-dimensional luggage grid and W meets all the preset stacking conditions, then enter E400; otherwise, traverse the next point to be confirmed; where the target point to be confirmed is any preset point to be confirmed.

[0206] In this embodiment, although when W is at the target point to be confirmed, W does not coincide with any three-dimensional luggage grid and W meets all the preset stacking conditions, at this time, the bottom surface of W is too high from the luggage stacked below, or the volume of the luggage stacked below is smaller than the volume of the luggage corresponding to W, then, due to the relevant regulations of civil aviation on luggage stacking, this target point to be confirmed cannot be determined as the stacking position corresponding to the luggage to be stacked either.

[0207] For E400, move W downward by the fourth preset distance ΔHA.

[0208] For E500, if W after moving downward by ΔHA does not coincide with any three-dimensional luggage grid, then it is determined that the target point to be confirmed is not the stacking position corresponding to the luggage to be stacked; otherwise, enter E600.

[0209] In this embodiment, if W is moved downward by a fourth preset distance ΔHA and does not coincide with any three-dimensional luggage grid, it means that there is no stacked luggage within the range of ΔHA downward from the bottom surface of W. The current luggage to be stacked is in a suspended state. At this time, if the manipulator stacks the current luggage to be stacked at the target point to be confirmed, the current luggage to be stacked will be dropped, which may damage the current luggage to be stacked.

[0210] E600. According to each three-dimensional luggage grid that coincides with W after being moved downward by ΔHA, determine whether the target point to be confirmed is the stacking position corresponding to the luggage to be stacked.

[0211] Further, step E600 may include the following steps:

[0212] E610. Obtain each three-dimensional luggage grid that coincides with W after being moved downward by ΔHA to obtain a first list of three-dimensional luggage grids G = (G1, G2,..., G a ,..., G b ), where a = 1, 2,..., b; among them, G a is the a-th three-dimensional luggage grid that coincides with W after being moved downward by ΔHA, and b is the number of three-dimensional luggage grids that coincide with W after being moved downward by ΔHA.

[0213] In this embodiment, if W coincides with several three-dimensional luggage grids after being moved downward by a fourth preset distance ΔHA, it means that there is stacked luggage within the range of ΔHA downward from the current luggage to be stacked. At this time, each three-dimensional luggage grid that coincides with W after being moved downward by ΔHA can be obtained.

[0214] E620. Obtain the projection area of each three-dimensional luggage grid in G on the bottom surface of W to obtain a projection area list TG corresponding to G = (TG1, TG2,..., TG a ,..., TG b ); among them, TG a is the projection area of G a on the bottom surface of W.

[0215] E630. According to TG, determine the total bottom projection area ZG corresponding to G = ∑ b a＝1 TG a .

[0216] E640. If ZG / ZW ≥ DE, enter E650; otherwise, determine that the target point to be confirmed is not the stacking position corresponding to the luggage to be stacked; ZW is the area of the bottom surface of W, and DE is a preset first area ratio threshold, and DE < 1.

[0217] In this embodiment, the value of DE can be set to 0.9, or other values that are relatively close to 1 and equal to 1; if ZG / ZW≥DE, it means that the area of the lower surface of the luggage to be stacked currently is basically the same as the area of the upper surface of the luggage that has been stacked below, and it can be considered that the size of the luggage to be stacked currently is not larger than the size of the luggage that has been stacked below, that is, the situation of large luggage pressing on small luggage will not occur, which complies with the relevant regulations of civil aviation.

[0218] Further, step E650 may include the following steps:

[0219] E651, when W is at the target point to be confirmed, move W along the preset direction of the Y-axis of QR by a fifth preset distance ΔHB.

[0220] E652, obtain each three-dimensional luggage grid that coincides with W after moving ΔHB along the preset direction of the Y-axis of QR, so as to obtain a second three-dimensional luggage grid list F=(F1, F2,..., F c ,..., F d ), c = 1, 2,..., d; where F c is the c-th three-dimensional luggage grid that coincides with W after moving ΔHB along the preset direction of the Y-axis of QR, and d is the number of three-dimensional luggage grids that coincide with W after moving ΔHB along the preset direction of the Y-axis of QR.

[0221] E653, obtain the projection area of each three-dimensional luggage grid in F on the side of W perpendicular to the Y-axis, so as to obtain a projection area list TF=(TF1, TF2,..., TF c ,..., TF d ); where TF c is the projection area of F c on the side of W perpendicular to the Y-axis.

[0222] E654, according to TF, determine the total side projection area ZF corresponding to F = ∑ d c＝1 TF c .

[0223] E655, if ZF / ZW’≥DE’, then determine the target point to be confirmed as the stacking position corresponding to the luggage to be stacked; otherwise, determine that the target point to be confirmed is not the stacking position corresponding to the luggage to be stacked; ZW’ is the area of the side of W perpendicular to the Y-axis, and DE’ is a preset second area ratio threshold, and DE’ < 1.

[0224] In this embodiment, during the process of stacking luggage, there will be a situation: two already stacked pieces of luggage each have a handle, and the handle part protrudes beyond the overall structure of the luggage. The handle part also corresponds to a three-dimensional luggage grid. Then, during the process of traversing the stacking position corresponding to the currently to-be-stacked luggage, it is possible to determine the stacking position corresponding to the current luggage between the handles of two already stacked pieces of luggage, which will result in a relatively large space left on both sides of the current luggage, causing a certain impact on the subsequent luggage stacking.

[0225] Based on this, through the methods in steps E651 - E655, it is possible to determine whether one side of the currently to-be-stacked luggage along the Y-axis direction is adjacent to one side of the already stacked luggage at the target to-be-confirmed point, rather than being adjacent to the handle of the already stacked luggage, thereby avoiding the problem that the stacking position corresponding to the current luggage is determined between the handles of two already stacked pieces of luggage, resulting in a relatively large space left on both sides of the current luggage and causing a certain impact on the subsequent luggage stacking, and also making the stacking of luggage more compact and improving the space utilization rate of the luggage cart.

[0226] In this embodiment, during the process of determining the stacking position corresponding to the currently to-be-stacked luggage, when W is at the target to-be-confirmed point, if W does not coincide with any three-dimensional luggage grid and W meets all the preset stacking conditions, then move W downward by a fourth preset distance ΔHA. If W after moving downward by ΔHA does not coincide with any three-dimensional luggage grid, it is determined that the target to-be-confirmed point is not the stacking position corresponding to the to-be-stacked luggage; otherwise, according to each three-dimensional luggage grid that coincides with W after moving downward by ΔHA, determine whether the target to-be-confirmed point is the stacking position corresponding to the to-be-stacked luggage; through the above method, it is possible to determine whether the currently to-be-stacked luggage is in a suspended state, thereby avoiding the situation where the currently to-be-stacked luggage is dropped and damaged.

[0227] Embodiment Seven:

[0228] In the above embodiments, during the process of stacking the to-be-stacked luggage, it is not considered whether the luggage is soft luggage or hard luggage. If hard luggage presses on soft luggage, it is possible to damage the soft luggage. To avoid this situation, based on the above embodiments, the following method is provided:

[0229] P100, obtain the three-dimensional coordinate system QR corresponding to the current luggage cart and the to-be-stacked luggage bounding box W corresponding to the to-be-stacked luggage; where QR includes several three-dimensional luggage grids corresponding to the already stacked luggage; the space of the luggage cart includes a lower layer space and an upper layer space, and the lower layer space includes a first sub-space for stacking the first type of luggage and a second sub-space for stacking the second type of luggage; the hardness of the first type of luggage is less than that of the second type of luggage.

[0230] In this embodiment, before determining the stacking position of the to-be-stacked luggage, it is necessary to identify the already-stacked luggage on the current luggage cart; the already-stacked luggage can be identified by means of image recognition or lidar scanning. After identifying the already-stacked luggage, the already-stacked luggage can be segmented to generate a number of three-dimensional luggage grids containing the point clouds corresponding to the already-stacked luggage; it can be understood that each three-dimensional luggage bounding box represents the already-stacked luggage in the corresponding space.

[0231] For the to-be-stacked luggage, the size information of the to-be-stacked luggage bounding box corresponding to the to-be-stacked luggage can be obtained by means of image recognition; at the same time, a three-dimensional coordinate system corresponding to the current luggage cart can be established to quantify the position of each space in the space of the current luggage cart; the first type of luggage can be understood as a relatively hard suitcase, and the second type of luggage can be understood as a relatively soft soft bag luggage; when the airport management personnel confirm the type of luggage, they can do so by manually tagging, and subsequently, the luggage type corresponding to each to-be-stacked luggage can be directly obtained.

[0232] P200, if the to-be-stacked luggage is the second type of luggage and the first type of luggage has been stacked in the first subspace, then according to the size of W and the preset traversal rule, each preset to-be-confirmed point in QR is traversed in sequence.

[0233] In this embodiment, the fact that the first type of luggage has been stacked in the first subspace means that relatively soft luggage has been stacked in the first subspace, and the second type of luggage, that is, relatively hard luggage, cannot be stacked above the first subspace to avoid damaging the first type of luggage.

[0234] Further, step P200 may include the following steps:

[0235] P221, obtain the first preset value NUM1 = 0, the second preset value NUM2 = 0, and the third preset value NUM3 = 0; and place W at the origin position corresponding to W in QR.

[0236] P222, if NUM1 × ΔL Y <L Y -L W , then enter P223; where L Y is the length of the luggage cart in the Y-axis direction in QR, L W is the length of W in the Y-axis direction; ΔL Y is the first preset distance.

[0237] P223, determine whether W coincides with at least one of the several three-dimensional luggage grids, and determine whether W meets all the preset stacking conditions.

[0238] P224, if W coincides with at least one of several three-dimensional luggage grids or W does not meet at least one of all the preset stacking conditions, move W in the Y-axis direction by ΔL Y , update NUM1 = NUM1 + 1, and enter P222; otherwise, determine the current position of W as the stacking position corresponding to the luggage to be stacked.

[0239] Further, step P222 may further include: if NUM1 × ΔL Y ≥L Y -L W , then enter P225.

[0240] P225, if NUM2 × ΔH Z <H Z -H W , then enter E226; otherwise, enter E227; where ΔH Z is the second preset distance; H Z is the height of the luggage cart in the Z-axis direction in QR.

[0241] P226, update NUM1 = 0, update NUM2 = NUM2 + 1, place W at the middle position QE W =(W X +NUM3 × ΔD X , W Y , W Z +NUM2 × ΔH Z ), and enter P222.

[0242] P227, if NUM3 × ΔD X <D X -D W , update NUM1 = 0, update NUM2 = 0, update NUM3 = NUM3 + 1, place W at the middle position QE W =(W X +NUM3 × ΔD X , W Y , W Z +NUM2 × ΔH Z ), and enter P222; otherwise, it is determined that the stacking position corresponding to the luggage to be stacked has not been determined; where ΔD X is the third preset distance; D X is the width of the luggage cart in the X-axis direction in QR.

[0243] In this embodiment, the method of sequentially traversing each preset point to be confirmed in QR according to the size of W and the preset traversal rule is the same as the method in steps S200 - S620 in Embodiment 1, and will not be elaborated here; the preset points to be confirmed can be the coordinate points corresponding to the center point of W each time W moves in Embodiment 1.

[0244] P300. When W is at the target point to be confirmed, if W does not coincide with any three - dimensional luggage grid and W meets all the preset stacking conditions, then proceed to P400; otherwise, traverse to the next point to be confirmed; where the target point to be confirmed is any preset point to be confirmed.

[0245] In this embodiment, when W is at the target point to be confirmed, if W does not coincide with any three - dimensional luggage grid and W meets all the preset stacking conditions, it means that the target point to be confirmed meets the preset stacking conditions and may be the stacking position corresponding to the current luggage to be stacked. However, it is still necessary to further determine whether there is a situation where hard luggage presses soft luggage.

[0246] P400. If the target point to be confirmed is not a point to be confirmed above the first subspace, then determine the target point to be confirmed as the stacking position corresponding to the luggage to be stacked; otherwise, traverse to the next point to be confirmed.

[0247] In this embodiment, the target point to be confirmed is not a point to be confirmed above the first subspace, and the current luggage to be stacked is the second - type luggage, and the first - type luggage has been stacked in the first subspace. At this time, stacking the luggage to be stacked at the target point to be confirmed will not press the first - type luggage.

[0248] Further, after step P400, the method further includes the following steps:

[0249] P500. If the luggage to be stacked is the second - type luggage and the first - type luggage has not been stacked in the first subspace, then sequentially traverse each preset point to be confirmed in QR according to the size of W and the preset traversal rule.

[0250] P510. When W is at the target point to be confirmed, if W does not coincide with any three - dimensional luggage grid and W meets all the preset stacking conditions, then determine the target point to be confirmed as the stacking position corresponding to the luggage to be stacked; otherwise, traverse to the next point to be confirmed; where the target point to be confirmed is any preset point to be confirmed.

[0251] In this embodiment, since the first - type luggage has not been stacked in the first subspace, that is, there is no soft luggage stacked in the first subspace, then the stacking position corresponding to the second - type luggage can be any position in the lower space and the upper space, and will not press the soft luggage.

[0252] Further, after step P400, the method may further include the following steps:

[0253] P600, if the luggage to be stacked is the first type of luggage, then according to the size of W and the preset traversal rule, each preset point to be confirmed in QR is traversed in sequence.

[0254] P610, when W is at the target point to be confirmed, if W does not coincide with any three-dimensional luggage grid and W meets all the preset stacking conditions, then the target point to be confirmed is determined as the stacking position corresponding to the luggage to be stacked; otherwise, the next point to be confirmed is traversed; where the target point to be confirmed is any preset point to be confirmed.

[0255] In this embodiment, when the luggage to be stacked is soft luggage, regardless of whether the first type of luggage is stacked in the first subspace, the luggage to be stacked can be stacked at any position in the luggage cart, and the situation where hard luggage presses soft luggage will not occur; it should be noted that in this embodiment, the first type of luggage can press the first type of luggage, that is, soft luggage can press soft luggage.

[0256] In this embodiment, the space of the luggage cart is divided into a lower layer space and an upper layer space. The lower layer space includes a first subspace for stacking the first type of luggage and a second subspace for stacking the second type of luggage; the hardness of the first type of luggage is less than the hardness of the second type of luggage; if the luggage to be stacked is the second type of luggage and the first type of luggage has been stacked in the first subspace, then according to the size of W and the preset traversal rule, each preset point to be confirmed in the three-dimensional coordinate system corresponding to the luggage cart is traversed in sequence; when W is at the target point to be confirmed, if W does not coincide with any three-dimensional luggage grid and W meets all the preset stacking conditions, and the target point to be confirmed is not a point to be confirmed above the first subspace, then the target point to be confirmed is determined as the stacking position corresponding to the luggage to be stacked; through the method in the present invention, it can be ensured that the luggage with a larger hardness will not be stacked above the luggage with a smaller hardness, thereby avoiding the situation where the softer luggage is crushed by the harder luggage.

[0257] Embodiment Eight:

[0258] In Embodiment One, the end condition of the three-layer loop traversal is a preset distance. However, the preset distance may not satisfy all luggage carts, resulting in the situation that when the luggage to be stacked is at the determined stacking position, it exceeds the stacking space range of the luggage cart. To avoid this situation, the following method is provided:

[0259] F100, obtain the three-dimensional coordinate system QR corresponding to the current luggage cart and the bounding box W of the luggage to be stacked corresponding to the luggage to be stacked; where QR includes a number of three-dimensional luggage grids corresponding to the stacked luggage.

[0260] In this embodiment, before determining the stacking position of the to-be-stacked luggage, it is necessary to identify the already-stacked luggage on the current luggage cart; the already-stacked luggage can be identified by means of image recognition or lidar scanning. After identifying the already-stacked luggage, the already-stacked luggage can be segmented to generate a number of three-dimensional luggage grids containing the point clouds corresponding to the already-stacked luggage; it can be understood that each three-dimensional luggage bounding box represents the already-stacked luggage in the corresponding space.

[0261] For the to-be-stacked luggage, the size information of the to-be-stacked luggage bounding box corresponding to the to-be-stacked luggage can be obtained through image recognition; at the same time, a three-dimensional coordinate system corresponding to the current luggage cart can be established to quantify the position of each space in the space of the current luggage cart.

[0262] F200, set a virtual bounding box for the virtual luggage in QR; wherein, the virtual bounding box is located outside the current luggage cart, and the virtual bounding box is adjacent to the four sides of the current luggage cart; the sides of adjacent virtual bounding boxes have the same size as the sides of the current luggage cart.

[0263] In this embodiment, after identifying the luggage, a virtual bounding box is set closely outside the periphery of the luggage cart. The virtual bounding box is a three-dimensional rectangular solid, and the virtual bounding box is used to represent the external area of the luggage cart.

[0264] F300, according to the size of W and the preset traversal rule, sequentially traverse each preset point to be confirmed in QR; wherein, when W is at the target point to be confirmed, if W does not coincide with any three-dimensional luggage grid, W does not coincide with the virtual bounding box and W meets all the preset stacking conditions, then the target point to be confirmed is determined as the stacking position corresponding to the to-be-stacked luggage.

[0265] Further, step F300 may include the following steps:

[0266] F310, obtain the first preset value NUM1 = 0, the second preset value NUM2 = 0, and the third preset value NUM3 = 0; and place W at the origin position corresponding to W in QR.

[0267] In this embodiment, the origin position corresponding to W in QR is the same as the origin position corresponding to W in Embodiment 1, which will not be elaborated here.

[0268] F320, determine whether W coincides with the virtual bounding box.

[0269] In this embodiment, the virtual bounding box is set with the maximum and minimum X, Y, and Z axis coordinates. The method for determining whether W coincides with the three-dimensional luggage grid in Embodiment 1 can be used to determine whether W coincides with the virtual bounding box, which will not be elaborated here.

[0270] F330, if W does not coincide with the virtual bounding box, then proceed to F340; otherwise, proceed to F350;

[0271] In this embodiment, if W does not coincide with the virtual bounding box, it means that when W is at its current position in QR, it does not exceed the stacking space range of the current luggage cart.

[0272] F340, if W does not coincide with any three-dimensional luggage grid and W meets all the preset stacking conditions, then determine the target point to be confirmed as the stacking position corresponding to the luggage to be stacked; otherwise, move W along the Y-axis direction by ΔL Y ; where ΔL Y is the first preset distance, and proceed to F320.

[0273] In this embodiment, the method in step F340 is the same as the method in step S500 in Embodiment 1, and will not be elaborated here.

[0274] Further, step F350 includes the following steps:

[0275] F351, if NUM2×ΔH Z <H Z -H W , then update NUM2 = NUM2 + 1.

[0276] In this embodiment, if NUM2×ΔH Z <H Z -H W , it means that the traversal in the Z-axis direction has not been completed.

[0277] F352, place W at the middle position QE W =(W X +NUM3×ΔD X , W Y , W Z +NUM2×ΔH Z ) and determine whether W coincides with the virtual bounding box; ΔH Z is the second preset distance; ΔD X is the third preset distance.

[0278] F353, if W does not coincide with the virtual bounding box, then proceed to F340; otherwise, update NUM2 = 0, update NUM3 = NUM3 + 1, place W at the middle position QE W =(W X +NUM3×ΔD X , W Y , W Z +NUM2×ΔH Z ) and determine whether W coincides with the virtual bounding box.

[0279] F354. If W does not coincide with the virtual bounding box, go to F340; otherwise, it is determined that the placement position corresponding to the luggage to be placed has not been determined.

[0280] In this embodiment, it should be noted that for each position movement, it is necessary to first determine whether W coincides with the virtual bounding box to determine whether W exceeds the placement space range of the current luggage cart when in the moved position. It can be understood that in this embodiment, the virtual bounding box is used as the condition for ending the traversal, while in the first embodiment, a preset traversal distance is used as the condition for ending the traversal. There are multiple luggage carts, and the sizes of each luggage cart are not absolutely the same, with slight differences. If a fixed traversal distance is used as the condition for ending the traversal, it may cause the luggage to be placed to exceed the placement space range of the luggage cart when the placement position is determined. In this embodiment, the placement space range of the current luggage cart is recognized visually, and then the corresponding virtual bounding box is set, which can avoid the occurrence of the above problems.

[0281] In this embodiment, obtain the three-dimensional coordinate system QR corresponding to the current luggage cart and the bounding box W of the luggage to be placed corresponding to the luggage to be placed; wherein, QR includes three-dimensional luggage grids corresponding to several pieces of placed luggage; set a virtual bounding box for the virtual luggage in QR; wherein, the virtual bounding box is located outside the current luggage cart, and the virtual bounding box is adjacent to the four sides of the current luggage cart; the side of the adjacent virtual bounding box has the same size as the side of the current luggage cart; according to the size of W and the preset traversal rule, sequentially traverse each preset point to be confirmed in QR; wherein, when W is at the target point to be confirmed, if W does not coincide with any three-dimensional luggage grid, W does not coincide with the virtual bounding box, and W meets all the preset placement conditions, then the target point to be confirmed is determined as the placement position corresponding to the luggage to be placed; thus, on the premise of ensuring that the space range of the luggage cart is not exceeded, the placement position corresponding to the luggage to be placed is determined.

[0282] Furthermore, the placement position corresponding to the luggage to be placed is determined based on the placed luggage corresponding to the current luggage cart and the size of the luggage to be placed. Therefore, the determined placement position corresponding to the luggage to be placed is more in line with the remaining placement space of the current luggage cart, making the placement of the luggage more compact and tidy, and improving the space utilization rate of the luggage cart.

[0283] In addition, although the steps of the method in the present disclosure are described in a specific order in the drawings, this does not require or imply that these steps must be executed in that specific order, or that all the shown steps must be executed to achieve the desired result. Additionally or alternatively, some steps may be omitted, multiple steps may be combined into one step for execution, and / or one step may be decomposed into multiple steps for execution, etc.

[0284] An embodiment of the present invention further provides a non-transitory computer-readable storage medium, which can be disposed in an electronic device to store at least one instruction or at least one segment of a program related to a method in the method embodiment. The at least one instruction or the at least one segment of the program is loaded and executed by the processor to implement the method provided in the above embodiment.

[0285] The program product may adopt any combination of one or more readable media. The readable media may be a readable signal medium or a readable storage medium. The readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the above. More specific examples of the readable storage medium (an exhaustive list) include: an electrical connection having one or more wires, a portable disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above.

[0286] The computer-readable signal medium may include a data signal propagated in a baseband or as a part of a carrier wave, in which the readable program code is carried. Such a propagated data signal may take various forms, including but not limited to an electromagnetic signal, an optical signal, or any suitable combination of the above. The readable signal medium may also be any readable medium other than the readable storage medium, which can send, propagate, or transmit a program used by or in combination with an instruction execution system, apparatus, or device.

[0287] The program code contained on the readable medium may be transmitted by any appropriate medium, including but not limited to wireless, wired, optical fiber cable, RF, etc., or any suitable combination of the above.

[0288] The program code for performing the operations of the present application may be written in any combination of one or more programming languages. The programming languages include object-oriented programming languages such as Java, C++, etc., and also include conventional procedural programming languages such as the "C" language or similar programming languages. The program code may be executed entirely on the user's computing device, partially on the user's device, executed as an independent software package, partially on the user's computing device and partially on a remote computing device, or entirely on a remote computing device or server. In the case of a remote computing device, the remote computing device may be connected to the user's computing device through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computing device (for example, by using an Internet service provider to connect through the Internet).

[0289] An embodiment of the present invention also provides an electronic device, including a processor and the aforementioned non-transitory computer-readable storage medium.

[0290] The electronic device is merely an example and should not impose any limitations on the functions and usage scope of the embodiments of the present application.

[0291] The electronic device is presented in the form of a general-purpose computing device. The components of the electronic device may include, but are not limited to: at least one of the aforementioned processors, at least one of the aforementioned memories, and a bus connecting different system components (including the memory and the processor).

[0292] Wherein, the memory stores program codes, and the program codes can be executed by the processor, so that the processor executes the steps in various embodiments described in this specification.

[0293] The memory may include a readable medium in the form of a volatile memory, such as a random access memory (RAM) and / or a cache memory, and may further include a read-only memory (ROM).

[0294] The memory may further include a program / utilities having a set (at least one) of program modules. Such program modules include, but are not limited to: an operating system, one or more application programs, other program modules, and program data. The implementation of a network environment may be included in each or some combination of these examples.

[0295] The bus may represent one or more of several types of bus structures, including a memory bus or a memory controller, a peripheral bus, a graphics acceleration port, a processor, or a local bus using any bus structure in a variety of bus structures.

[0296] The electronic device may also communicate with one or more external devices (such as a keyboard, a pointing device, a Bluetooth device, etc.), may also communicate with one or more devices that enable a user to interact with the electronic device, and / or communicate with any device that enables the electronic device to communicate with one or more other computing devices (such as a router, a modem, etc.). Such communication may be carried out through an input / output (I / O) interface. And, the electronic device may also communicate with one or more networks (such as a local area network (LAN), a wide area network (WAN), and / or a public network, such as the Internet) through a network adapter. The network adapter communicates with other modules of the electronic device through the bus. It should be understood that, although not shown in the figure, other hardware and / or software modules may be used in combination with the electronic device, including but not limited to: microcode, device drivers, redundant processors, external disk drive arrays, RAID systems, tape drives, and data backup storage systems, etc.

[0297] Through the description of the above embodiments, those skilled in the art can easily understand that the exemplary embodiments described herein can be implemented by software or by a combination of software and necessary hardware. Therefore, the technical solution according to the embodiments of the present disclosure can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (such as a CD-ROM, a USB flash drive, a mobile hard disk, etc.) or on a network, including several instructions to enable a computing device (such as a personal computer, a server, a terminal device, or a network device, etc.) to execute the method according to the embodiments of the present disclosure.

[0298] An embodiment of the present invention further provides a computer program product, which includes program code. When the program product runs on an electronic device, the program code is used to cause the electronic device to execute the steps in the methods according to various exemplary embodiments of the present invention described above in this specification.

[0299] Although some specific embodiments of the present invention have been described in detail by way of examples, those skilled in the art should understand that the above examples are only for illustration and not for limiting the scope of the present invention. Those skilled in the art should also understand that various modifications can be made to the embodiments without departing from the scope and spirit of the present invention.

Claims

1. A luggage stacking location determination method based on multiple iterations, characterized in that: The method comprises the following steps: R100, obtaining a three-dimensional coordinate system QR corresponding to the current luggage cart and a bounding box W of the luggage to be stacked corresponding to the luggage to be stacked; wherein QR includes a number of three-dimensional luggage grids corresponding to the stacked luggage; R200, according to the size of W and the preset traversal rules, traverse each preset point to be confirmed in QR in turn; R300, if the stacking position corresponding to the luggage to be stacked is not determined from all the points to be confirmed, then obtain each optimized stacking condition to obtain an optimized stacking condition list B = (B1, B2, ..., B j , …, B m ), j = 1, 2, ..., m; where B j is the jth optimized stacking condition, and m is the number of optimized stacking conditions; R400, according to B, determine the priority of each optimized stacking condition to obtain an optimized stacking condition priority list YB=(YB1, YB2, ..., YB j , …, YB m );YB j For B j Corresponding priority; YB r >YB r+1 ; r = 1, 2, ..., m-1; B r Before B r+1 implement; R500, obtaining a fourth preset value NM=m; R600, if NM>0, then get B NM The corresponding intermediate points to be confirmed are obtained to obtain the NMth intermediate points to be confirmed list D NM =(D NM，1 , D NM，2 , …, D NM，u , …, D NM，f(NM) ), u=0, 1, …, f(NM); where D NM，u For B NM The corresponding u-th intermediate point to be confirmed, f(NM) is B NM The number of corresponding intermediate points to be confirmed; B NM The corresponding intermediate point to be confirmed is not satisfied with B NM Points to be confirmed; R700, if f(NM) = 0, then update NM = NM-1 and enter R600; otherwise, replace B in B NM To B m The execution state of is set to closed to obtain the updated optimized stacking condition list B' corresponding to B, and enter R800; R800, according to the size of W and B', for D NM Traverse to obtain the stacking position corresponding to the luggage to be stacked.

2. The luggage stacking location determination method based on multiple iterations according to claim 1, characterized in that: After step R600, the method further includes: R610, if NM≤0, it is determined that the stacking position corresponding to the luggage to be stacked has not been determined, and the current processing is jumped out.

3. The luggage stacking location determination method based on multiple iterations according to claim 1, characterized in that: Step R200 includes the following steps: R210, when W is at the target point to be confirmed, if W does not overlap with any three-dimensional baggage grid, then enter R220; otherwise, traverse the next point to be confirmed; wherein the target point to be confirmed is any preset point to be confirmed; R220, if W satisfies all preset stacking conditions, the target to-be-confirmed point is confirmed as the stacking position corresponding to the to-be-confirmed luggage; otherwise, the next to-be-confirmed point is traversed; wherein the preset stacking conditions include a number of necessary stacking conditions and a number of optimized stacking conditions.

4. The luggage stacking location determination method based on multiple iterations according to claim 1, characterized in that: Step R200 includes the following steps: R221, obtain the first preset value NUM1=0, the second preset value NUM2=0 and the third preset value NUM3=0; and place W at the origin position corresponding to W in QR; R222, if NUM1×ΔL Y <L Y -L W , then enter R223; among them, L Y is the length of the luggage cart in the Y-axis direction in QR, L W is the length of W in the Y-axis direction; ΔL Y is a first preset distance; R223, determining whether W coincides with at least one of the three-dimensional luggage grids, and determining whether W satisfies all preset stacking conditions; R224: If W coincides with at least one of the three-dimensional luggage grids or W does not satisfy at least one of all the preset stacking conditions, move W along the Y axis by ΔL. Y , update NUM1=NUM1+1, and enter R222; otherwise, determine the current position of W as the stacking position corresponding to the luggage to be stacked.

5. The luggage stacking location determination method based on multiple iterations according to claim 4, characterized in that: W corresponds to the origin position QR in QR W =(W X , W Y , W Z ), where W X is the X-axis coordinate of the origin position corresponding to W in QR, W Y is the Y-axis coordinate of the origin position corresponding to W in QR, W Z is the Z-axis coordinate of the origin position corresponding to W in QR; W X =L W / 2;W Y =D W / 2;W Z =H W / 2;D W is the width of W in the X-axis direction, H W is the height of W in the Z-axis direction.

6. The luggage stacking location determination method based on multiple iterations according to claim 5, characterized in that: Step R222 also includes: if NUM1×ΔL Y ≥L Y -L W , then enter R225; R225, if NUM2×ΔH Z <H Z -H W , then enter R226; otherwise, enter R227; where ΔH Z is the second preset distance; H Z is the height of the luggage cart in the Z-axis direction of QR; R226, update NUM1 = 0, update NUM2 = NUM2 + 1, put W in the middle position QE W =(W X +NUM3×ΔD X , W Y , W Z +NUM2×ΔH Z ) and enter R222; R227, if NUM3×ΔD X <D X -D W , update NUM1 = 0, update NUM2 = 0, update NUM3 = NUM3 + 1, and place W in the middle position QE W =(W X +NUM3×ΔD X , W Y , W Z +NUM2×ΔH Z ), enter R222; otherwise, it is determined that the stacking position corresponding to the luggage to be stacked has not been determined; wherein, ΔD X The third preset distance; D X is the width of the luggage cart in the X-axis direction in QR.

7. The luggage stacking location determination method based on multiple iterations according to claim 6, characterized in that: ΔL Y =ΔH Z =ΔD X =20mm。 8. A non-transitory computer-readable storage medium, wherein at least one instruction or at least one program is stored in the storage medium, characterized in that: The at least one instruction or the at least one program is loaded and executed by the processor to implement the luggage stacking position determination method based on multiple iterations as described in any one of claims 1 to 7.

9. An electronic device, characterized in that: Includes a processor and the non-transitory computer-readable storage medium of claim 8.

Images