CN111882270A - Online boxing method, terminal and storage medium - Google Patents
Online boxing method, terminal and storage medium Download PDFInfo
- Publication number
- CN111882270A CN111882270A CN202010685898.6A CN202010685898A CN111882270A CN 111882270 A CN111882270 A CN 111882270A CN 202010685898 A CN202010685898 A CN 202010685898A CN 111882270 A CN111882270 A CN 111882270A
- Authority
- CN
- China
- Prior art keywords
- space
- placeable
- vertex
- boxed
- placing
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 36
- 230000036544 posture Effects 0.000 claims description 54
- 238000012216 screening Methods 0.000 claims description 3
- 239000013598 vector Substances 0.000 description 6
- 238000010586 diagram Methods 0.000 description 5
- 238000012856 packing Methods 0.000 description 3
- 238000012545 processing Methods 0.000 description 2
- 239000011159 matrix material Substances 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- Human Resources & Organizations (AREA)
- Strategic Management (AREA)
- Physics & Mathematics (AREA)
- Entrepreneurship & Innovation (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Development Economics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Game Theory and Decision Science (AREA)
- Container Filling Or Packaging Operations (AREA)
Abstract
The application relates to an online boxing method, a terminal and a storage medium. The method comprises the following steps: acquiring a first size of a box for executing a boxing task, an occupied space of an article to be boxed and an occupied space of the article in the box, and acquiring a placeable space of the article to be boxed according to the first size, the occupied space and the occupied space; determining a target placing space of the articles to be boxed in at least one placeable space according to the vertex position of the placeable space; acquiring a target placing posture corresponding to the target placing space so that the articles to be boxed are placed in the target placing space in the target placing posture; wherein the placeable space is the same as the occupied space. The number of the boxes can be saved as far as possible, and the article transportation cost is saved.
Description
Technical Field
The application belongs to the technical field of boxing, and particularly relates to an online boxing method, a terminal and a storage medium.
Background
In the logistics industry, the problem of cargo packing often exists, in some logistics scenarios, for example, shipping for transportation by using containers, there is a case that only one size of cargo is stored in one cargo tank, and when each cargo is packed, the size of the cargo to be packed is known, so that advance calculation can be performed, so that one container can contain as many cargoes as possible. The placing position of the goods in the box directly influences the quantity of the goods which can be loaded by the box. At present, a boxing method for automatically calculating the placing positions of the cargos under the scene of different cargo sizes does not exist.
Therefore, there is a need to provide a new solution to calculate the proper placement position of the article to be packed in the box in real time at the time of arrival of the article, so as to save the number of boxes used and the cost of cargo transportation as much as possible.
Disclosure of Invention
The application provides an online boxing method, a terminal and a storage medium, and aims to solve at least one of the technical problems in the prior art to a certain extent.
In order to solve the above problems, the present application provides the following technical solutions:
an online boxing method comprises the following steps:
acquiring a first size of a box for executing a boxing task, an occupied space of an article to be boxed and an occupied space of the article in the box, and acquiring a placeable space of the article to be boxed according to the first size, the occupied space and the occupied space;
determining a target placing space of the articles to be boxed in at least one placeable space according to the vertex position of the placeable space;
acquiring a target placing posture corresponding to the target placing space so that the articles to be boxed are placed in the target placing space in the target placing posture;
wherein the placeable space is the same as the occupied space.
The technical scheme adopted by the embodiment of the application further comprises the following steps: the method for acquiring the placeable space of the to-be-boxed article according to the first size, the occupied space and the occupied space comprises the following steps:
acquiring a second size of the article to be boxed, and acquiring the occupied space corresponding to the article to be boxed according to the second size;
the occupied space is a minimum cuboid space which does not interfere with the articles to be boxed when the articles to be boxed are contained.
The technical scheme adopted by the embodiment of the application further comprises the following steps: the acquiring the placeable space of the to-be-boxed article according to the first size, the occupied space and the occupied space comprises:
when the placing space consistent with the occupied space meets a first preset condition and a second preset condition, determining that the placing space is a placeable space;
wherein the first preset condition is as follows:
any vertex of the placing space is positioned in the box, and any vertex of the placing space is not positioned in the occupied space;
the second preset condition is as follows:
the bottom surface of the placing space is parallel to the bottom surface of the box; and the number of the first and second electrodes,
four vertexes of the bottom surface of the placing space are all arranged on the bottom surface of the box or four vertexes of the bottom surface of the placing space are all arranged on one plane of the occupied space.
The technical scheme adopted by the embodiment of the application further comprises the following steps: the acquiring the placeable space of the to-be-boxed article according to the first size, the occupied space and the occupied space comprises:
when the placing space consistent with the occupied space simultaneously meets the first preset condition, the second preset condition and the third preset condition, determining that the placing space is a placeable space;
wherein the third preset condition is:
the first vertex position of the placing space is a preset target point, the first vertex is a vertex of the placing space closest to a preset vertex of the box, and the preset target point is a point which has the largest distance from the occupied space to the preset vertex in the X direction but has the smallest distance from the occupied space to the preset vertex in the Y direction and the Z direction, or a point which has the largest distance from the occupied space to the preset vertex in the Y direction but has the smallest distance from the occupied space to the preset vertex in the X direction and the Z direction, or a point which has the largest distance from the preset vertex in the Z direction but has the smallest distance from the preset vertex in the X direction and the Y direction.
The technical scheme adopted by the embodiment of the application further comprises the following steps: the determining the target placing space of the to-be-boxed article in at least one placeable space according to the vertex position of the placeable space comprises:
acquiring the distance between the target vertex of each placeable space and a preset vertex of the box;
taking the placeable space with the minimum distance between the target vertex and the preset vertex as the target placement space;
and the target vertex is the vertex with the largest distance from the preset vertex in all vertexes among the swingable air.
The technical scheme adopted by the embodiment of the application further comprises the following steps: the determining the target placing space of the to-be-boxed article in at least one placeable space according to the vertex position of each placeable space comprises:
acquiring the current posture of the article to be boxed, and acquiring the placeable posture of the article to be boxed according to the current posture;
and screening each placeable space according to the placeable postures, and reserving at least one placeable space matched with the placeable postures.
The technical scheme adopted by the embodiment of the application further comprises the following steps: the acquiring of the target placing posture corresponding to the target placing space includes:
and taking the corresponding object posture when the occupied space is superposed with the target placing space as the target placing posture.
The technical scheme adopted by the embodiment of the application further comprises the following steps: the method further comprises the following steps of after the target placing posture corresponding to the target placing space is obtained: updating the occupied space.
The embodiment of the application adopts another technical scheme that: a terminal comprising a processor, a memory coupled to the processor, wherein,
the memory stores program instructions for implementing the online binning method;
the processor is configured to execute the program instructions stored by the memory to control online binning.
The embodiment of the application adopts another technical scheme that: a storage medium storing program instructions executable by a processor for performing the online binning method.
Compared with the prior art, the embodiment of the application has the advantages that: according to the online boxing method, the terminal and the storage medium, the target placing space and the corresponding target placing posture of the object to be boxed are calculated through the occupied space of the object to be boxed, and the proper placing position can be obtained in real time when the object arrives, so that the number of boxes is saved as much as possible, and the object transportation cost is saved.
Drawings
FIG. 1 is a flow chart of an online binning method according to an embodiment of the present application;
FIG. 2 is a schematic diagram of 3 newly added three-dimensional row vectors during the Cand update;
fig. 3 is a schematic structural diagram of a terminal provided in an embodiment of the present application;
fig. 4 is a schematic structural diagram of a storage medium provided in an embodiment of the present application.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the present application is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the present application and are not intended to limit the present application.
Please refer to fig. 1, which is a flowchart illustrating an online boxing method according to an embodiment of the present application. The online boxing method comprises the following steps:
step 100: acquiring a first size of a box for executing a boxing task, an occupied space of an article to be boxed and an occupied space of the article to be boxed in the box, and acquiring a placeable space of the article to be boxed according to the first size, the occupied space and the occupied space;
in particular, the first dimension comprises the length, width, height of the box. Specifically, for ease of illustration, the embodiments of the present application use a six-dimensional array (hereafter referred to as items) to indicate the occupied space of the loaded items in the box. The six-dimensional array items is a matrix with n rows and six columns, wherein n represents the number of articles placed in the current box, and each row represents a placement space corresponding to one placed article; one vertex of the bottom surface of the box is arbitrarily selected as an origin (namely a point with a coordinate of [ 000 ]), a horizontal axis, a vertical axis and a vertical axis of a Cartesian coordinate system are established from the origin along the sides of the box, the format of each line of the six-dimensional array is [ the initial value of the horizontal axis of a placing space, the size of the horizontal axis of the placing space, the initial value of the vertical axis of the placing space, the size of the vertical axis of the placing space, the initial value of the vertical axis of the placing space ], and the recording sequence of each value in the six-dimensional line vector can be arbitrarily adjusted. When a new box is opened, the initial items is [ 000000 ]. If items is [ 010203; 120101 ], two articles are placed in the box, and the placing spaces respectively correspond to: a space with [ 000 ] as a vertex and with the horizontal axis dimension, the vertical axis dimension, and the vertical axis dimension being 1, 2, and 3, respectively, and a space with [ 100 ] as a vertex and with the horizontal axis dimension, the vertical axis dimension, and the vertical axis dimension being 2, 1, and 1, respectively. The occupied space is formed by the placing spaces of all placed articles. Of course, as will be understood by those skilled in the art, as other implementations of the present invention, other ways to record the occupied space may be adopted, for example, obtaining the size of each loaded article, constructing a corresponding three-dimensional model, and the like.
Specifically, the method for acquiring the swingable empty space of the article to be boxed according to the first size, the occupied space and the occupied space further comprises the following steps:
and acquiring a second size of the article to be boxed, and acquiring the occupied space corresponding to the article to be boxed according to the second size.
Specifically, the second size of the article to be boxed includes, but is not limited to, the length of each side of the article to be boxed, and the like, and according to the second size of the article to be boxed, a minimum rectangular space which does not interfere with the article when the article to be boxed is contained can be obtained.
The acquiring the swingable empty space of the to-be-boxed article according to the first size, the occupied space and the occupied space further comprises:
the size of the placeable space is consistent with that of the occupied space; when the placing space consistent with the occupied space meets a first preset condition and a second preset condition, determining that the placing space is a placeable space;
wherein the first preset condition is as follows:
any vertex of the placing space is located inside the box, and any vertex of the placing space is not located inside the occupied space.
Specifically, the length, width and height of a box for performing a packing task, i.e., a first dimension of the box, may be represented by a, B and C, respectively, a vertex of a bottom surface of the box is selected as an origin (i.e., a point having a coordinate of [ 000 ]), and a horizontal axis, a vertical axis and a vertical axis of a cartesian coordinate system are established along sides of the box from the origin.
When judging whether the placing space consistent with the size of the occupied space is the placeable emptying time, the placing space consistent with the size of the occupied space can be identified by using an array item, and the item has the following pattern: for example, assuming that a, b, and c respectively represent the length, width, and height of the article to be boxed, i.e., the second dimension parameter of the article to be boxed, and [ x a, y, z ] represents the placing space with (x, y, z) as the vertex, a dimension of the horizontal axis, a dimension of the vertical axis, and a dimension of the vertical axis, as b, and a dimension of the vertical axis, as c.
When determining whether the placing space [ x a y B z C ] is a placeable space, determining whether x + a < (A, y + B) < ═ B and z + C < (C) are both true, and if true, determining that any vertex of the placing space is inside the box.
Judging whether the placing space is a placeable space or not according to the array items representing the occupied space, for example: executing items ═ 010101; 021302 ] (where items indicate that two items are currently placed in the box, the placing spaces respectively correspond to a space with [ 000 ] as the vertex and with the dimensions of the horizontal axis, the vertical axis and the vertical axis being 1, 1 and a space with the dimensions of the horizontal axis, the vertical axis and the vertical axis being 2,3 and 2 respectively with [ 010 ] as the vertex, and item of the placing space is [ 130202 ]), then it is determined that both the two vertices [ 020 ] and [ 022 ] of the placing space are located inside the occupied space of the second item in the items, indicating that the placing space conflicts with the occupied space, and the first preset condition is not satisfied.
The second preset condition is as follows:
the bottom surface of the placing space is parallel to the bottom surface of the box; and the number of the first and second electrodes,
four vertexes of the bottom surface of the placing space are all arranged on the bottom surface of the box or four vertexes of the bottom surface of the placing space are all arranged on one plane of the occupied space.
When the placing space meets the second preset condition, the object to be boxed can be kept balanced after being placed in the placing space.
As can be seen from the foregoing description, in the case where the occupied space occupies only a small portion of the box, there are a plurality of placement spaces that satisfy the first preset condition and the second preset condition and are consistent with the size of the occupied space of the article to be boxed, and in one possible implementation, for convenience of subsequent calculation, the number of alternative placeable spaces for determining the final placement position of the article to be boxed is reduced, and a third preset condition is further set.
When the placing space consistent with the occupied space simultaneously meets the first preset condition, the second preset condition and the third preset condition, determining that the placing space is a placeable space;
wherein the third preset condition is:
the first vertex position of the placing space is a preset target point, and the preset target point is a point which has the largest distance from each vertex of the occupied space to the preset vertex of the box in the X direction but has the smallest distance from the preset vertex to the Y direction and the Z direction, or a point which has the largest distance from the preset vertex to the Y direction but has the smallest distance from the preset vertex to the X direction and the Z direction, or a point which has the largest distance from the preset vertex to the Z direction but has the smallest distance from the preset vertex to the X direction and the Y direction.
The first vertex is the vertex of the placing space closest to the preset vertex of the box, and the preset vertex of the box is the origin of a coordinate system; that is, when the vertex of the placement space closest to the point [ 000 ] is the point with the largest distance in the X direction but the smallest distance in the Y direction and the Z direction from the preset vertex of the box, or the point with the largest distance in the Y direction but the smallest distance in the X direction and the Z direction from the preset vertex, or the point with the largest distance in the Z direction but the smallest distance in the X direction and the Y direction from the preset vertex, among the vertices of the occupied space, the placement space is determined to be the placeable space. Specifically, the preset target point is denoted by cand, if cand ═ 100; 020; 003 ], said first vertex representing placeable space is only one of [ 100 ], [ 020 ] or [ 003 ], and when a new box is opened, i.e. said occupied space in said box is 0, the initial cand is [ 000 ], which means that said article to be boxed can only be placed at the origin of said box.
It can be seen that when the placeable space corresponding to the article to be boxed meets the third preset condition, the placeable space is defined to be adjacent to the article already loaded in the box, so that the number of the placeable space is limited, and the calculation amount for determining the target placement space in the placeable space subsequently is reduced. Referring again to fig. 1, the online boxing method further includes:
step 110: and determining a target placing space of the articles to be boxed in at least one placeable space according to the vertex position of the placeable space.
In practical applications, a mechanical arm may be used to place the to-be-boxed article, and a rotatable mechanical arm may be used to rotate the to-be-boxed article, for example, a three-axis rotatable mechanical arm may be used to rotate the to-be-boxed article in three directions of XYZ, so that the to-be-boxed article may be supported to be converted into three postures, and a partially-rotated mechanical arm, for example, a horizontal rotating mechanical arm, may only achieve the length and width interchange of the article, but may not invert or lay down the article (may not change the vertical axis length of the article), in which case, the placing posture of the to-be-boxed article is limited, so that, in one possible implementation, before determining the target placing space of the to-be-boxed article in at least one placeable space according to the vertex position of the placeable space, the method further includes:
acquiring the current posture of the article to be boxed, and acquiring the placeable posture of the article to be boxed according to the current posture;
screening each placeable space according to the placeable postures, and reserving at least one placeable space matched with the placeable postures; wherein, the size of the placeable space is consistent with that of the occupied space.
The length, the width and the height of the article to be boxed are respectively represented by a, b and c, namely the second size parameter of the article, the posture of the article to be boxed can be identified by a three-dimensional array, and the format of the three-dimensional array representing the posture is as follows: for example, the posture of the article to be boxed is [ a b c ], and then the article to be boxed occupies the [ x, x + a ] interval of the horizontal axis, the [ y, y + b ] interval of the vertical axis, and the [ z, z + c ] interval of the vertical axis after being placed in the box in the current posture. It can be understood that the gesture [ a b c ] may also be high, long, wide, etc. since the robotic arm needs to rotate the item accordingly as the case may be when placing it. For example, the current posture of the article to be boxed is [ 324 ], and the mechanical arm for boxing the article to be boxed only supports horizontal rotation, that is, only the length and width of the article can be exchanged, but the article cannot be turned upside down or laid down (the vertical axis length of the article cannot be changed), so that the placeable postures of the article to be boxed are [ 324 ], [ 234 ].
After the placeable postures are obtained, the placeable space corresponding to the placeable postures may be obtained, for example, when the placeable postures are [ 324 ], [ 234 ], the corresponding placeable spaces between the placeable spaces have a length of 3, a width of 2, and a height of 4, and the placeable spaces have a length of 2, a width of 3, and a height of 4.
The determining the target placing space of the to-be-boxed article in at least one placeable space according to the vertex position of the placeable space comprises:
acquiring the distance between the target vertex of each placeable space and a preset vertex of the box;
taking the placeable space with the minimum distance between the target vertex and the preset vertex as the target placement space;
and the target vertex is the vertex with the largest distance from the preset vertex in all vertexes among the swingable air.
After each placeable space is determined, determining a target placement space of the articles to be boxed in at least one placeable space, specifically, taking an origin of the box as a preset vertex (i.e., a point with a coordinate of [ 000 ]), for each placeable space, obtaining distances between each vertex of the placeable space and the preset vertex, respectively, selecting the vertex with the largest distance as the target vertex, comparing the distances between the target vertex corresponding to each placeable space and the preset vertex, and selecting the smallest placeable space as the target placement space. As can be seen from the above description, for each placeable space having the same vertex, the distance between the target vertex and the preset vertex is directly related to the placement posture of the article corresponding to the placeable space, and the placement posture of the article corresponding to the placeable space is the posture corresponding to the occupied space of the article to be boxed when the placeable space coincides with the occupied space of the article to be boxed. In one example, the corresponding relationship between the corresponding pose of each of the posable air having the same vertex and the distance from the target vertex to the preset vertex is shown in table 1.
TABLE 1
| Posture of placement | Distance of target vertex from preset vertex |
| [2 3 4] | 7.07 |
| [2 4 3] | 7.35 |
| [3 2 4] | 6.93 |
| [3 4 2] | 7.48 |
| [4 3 2] | 7.35 |
| [4 2 3] | 7.07 |
As shown in table 1, for an article to be packed, which has a length of 2, a width of 3, and a height of 4, among a plurality of placeable spaces having the same vertex, a placeable space with a placement posture of [2,3,4] or [4,2,3] is selected as the target placement space.
Step 120: and acquiring a target placing posture corresponding to a target placing space, so that the articles to be boxed are placed in the target placing space in the target placing posture.
Specifically, the obtaining of the target placement posture corresponding to the target placement space further includes:
and taking the corresponding object posture when the occupied space is superposed with the target placing space as the target placing posture.
Further, the target placing posture is an article posture corresponding to the occupied space and the target placing space when the occupied space and the target placing space are overlapped.
Specifically, the obtaining of the target placement posture corresponding to the target placement space further includes:
updating the occupied space.
After the target placing posture corresponding to the target placing space is obtained, the mechanical arm can be controlled to place the object to be boxed in the target placing posture to the target placing space and update the occupied space, wherein the occupied space updating process comprises the following steps: and newly adding six-dimensional row vectors in a uniform format in the six-dimensional array items to record the target placing space, namely, newly adding one row in the items according to the format of [ the initial value of the horizontal axis of the placing space, the size of the horizontal axis of the placing space, the initial value of the vertical axis of the placing space, the size of the vertical axis of the placing space, the initial value of the vertical axis of the placing space, and the size of the vertical axis of the placing space ].
Further, when an implementation manner is adopted in which whether a placing space is a placeable space is determined while the first preset condition, the second preset condition and the third preset condition are simultaneously satisfied, after the to-be-boxed articles are placed in the target placing space in the target placing posture, 3 three-dimensional row vectors can be newly added in a three-dimensional array cand, and all placing spaces where new articles can be placed are updated; the 3 three-dimensional row vectors are coordinates of 3 of 8 vertexes of the newly added article, and are respectively as follows: the point with the largest horizontal axis coordinate but the smallest vertical axis coordinate, the point with the largest vertical axis coordinate but the smallest horizontal axis coordinate and the smallest vertical axis coordinate, and the point with the largest vertical axis coordinate but the smallest horizontal axis coordinate and the smallest vertical axis coordinate. The 3 three-dimensional row vectors newly added during the Cand update are specifically shown as 3 points in fig. 2.
Based on the above, the target placing space and the corresponding target placing posture of the to-be-packed article are calculated according to the occupied space of the to-be-packed article in the online packing method, and the appropriate placing position can be obtained in real time when the article arrives, so that the number of the used boxes is reduced as much as possible, and the article transportation cost is reduced.
Please refer to fig. 3, which is a schematic diagram of a terminal structure according to an embodiment of the present application. The terminal 50 comprises a processor 51, a memory 52 coupled to the processor 51.
The memory 52 stores program instructions for implementing the online binning method described above.
The processor 51 is operative to execute program instructions stored in the memory 52 to control online binning.
The processor 51 may also be referred to as a CPU (Central Processing Unit). The processor 51 may be an integrated circuit chip having signal processing capabilities. The processor 51 may also be a general purpose processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), an off-the-shelf programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
Please refer to fig. 4, which is a schematic structural diagram of a storage medium according to an embodiment of the present application. The storage medium of the embodiment of the present application stores a program file 61 capable of implementing all the methods described above, where the program file 61 may be stored in the storage medium in the form of a software product, and includes several instructions to enable a computer device (which may be a personal computer, a server, or a network device) or a processor (processor) to execute all or part of the steps of the methods of the embodiments of the present invention. And the aforementioned storage medium includes: various media capable of storing program codes, such as a usb disk, a mobile hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, or terminal devices, such as a computer, a server, a mobile phone, and a tablet.
The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present application. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the application. Thus, the present application is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
Claims (10)
1. An online boxing method, characterized in that the method comprises:
acquiring a first size of a box for executing a boxing task, an occupied space of an article to be boxed and an occupied space of the article in the box, and acquiring a placeable space of the article to be boxed according to the first size, the occupied space and the occupied space;
determining a target placing space of the articles to be boxed in at least one placeable space according to the vertex position of the placeable space;
acquiring a target placing posture corresponding to the target placing space so that the articles to be boxed are placed in the target placing space in the target placing posture;
wherein the placeable space is the same as the occupied space.
2. The on-line boxing method as recited in claim 1, wherein the obtaining of the placeable space of the to-be-boxed item according to the first size, the occupied space and the occupied space comprises:
acquiring a second size of the article to be boxed, and acquiring the occupied space corresponding to the article to be boxed according to the second size;
the occupied space is a minimum cuboid space which does not interfere with the articles to be boxed when the articles to be boxed are contained.
3. The on-line boxing method as recited in claim 1, wherein the obtaining of the placeable space of the to-be-boxed item according to the first size, the occupied space and the occupied space comprises:
when the placing space consistent with the occupied space meets a first preset condition and a second preset condition, determining that the placing space is a placeable space;
wherein the first preset condition is as follows:
any vertex of the placing space is positioned in the box, and any vertex of the placing space is not positioned in the occupied space;
the second preset condition is as follows:
the bottom surface of the placing space is parallel to the bottom surface of the box; and the number of the first and second electrodes,
four vertexes of the bottom surface of the placing space are all arranged on the bottom surface of the box or four vertexes of the bottom surface of the placing space are all arranged on one plane of the occupied space.
4. The on-line boxing method as recited in claim 3, wherein the obtaining of the placeable space of the to-be-boxed item according to the first size, the occupied space and the occupied space comprises:
when the placing space consistent with the occupied space simultaneously meets the first preset condition, the second preset condition and the third preset condition, determining that the placing space is a placeable space;
wherein the third preset condition is:
the first vertex position of the placing space is a preset target point, the first vertex is a vertex of the placing space closest to a preset vertex of the box, and the preset target point is a point which has the largest distance from the occupied space to the preset vertex in the X direction but has the smallest distance from the occupied space to the preset vertex in the Y direction and the Z direction, or a point which has the largest distance from the occupied space to the preset vertex in the Y direction but has the smallest distance from the occupied space to the preset vertex in the X direction and the Z direction, or a point which has the largest distance from the preset vertex in the Z direction but has the smallest distance from the preset vertex in the X direction and the Y direction.
5. The on-line boxing method as claimed in claim 1, wherein the determining the target placing space of the to-be-boxed items in at least one of the placeable spaces according to the vertex positions of the placeable spaces comprises:
acquiring the distance between the target vertex of each placeable space and a preset vertex of the box;
taking the placeable space with the minimum distance between the target vertex and the preset vertex as the target placement space;
and the target vertex is the vertex with the largest distance from the preset vertex in all vertexes among the swingable air.
6. The on-line boxing method as claimed in claim 4, wherein the determining the target placing space of the to-be-boxed items in at least one of the placeable spaces according to the vertex positions of the placeable spaces comprises:
acquiring the current posture of the article to be boxed, and acquiring the placeable posture of the article to be boxed according to the current posture;
and screening each placeable space according to the placeable postures, and reserving at least one placeable space matched with the placeable postures.
7. The on-line boxing method of claim 1, wherein the obtaining of the target pose corresponding to the target pose space comprises:
and taking the corresponding object posture when the occupied space is superposed with the target placing space as the target placing posture.
8. The on-line boxing method as claimed in any one of claims 1 to 6, wherein after obtaining the target pose corresponding to the target pose space, the method further comprises: updating the occupied space.
9. A terminal, comprising a processor, a memory coupled to the processor, wherein,
the memory stores program instructions for implementing the online binning method of any of claims 1-8;
the processor is configured to execute the program instructions stored by the memory to control online binning.
10. A storage medium storing program instructions executable by a processor to perform the online binning method of any of claims 1 to 8.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010685898.6A CN111882270B (en) | 2020-07-16 | 2020-07-16 | Online boxing method, terminal and storage medium |
| PCT/CN2020/139668 WO2022011979A1 (en) | 2020-07-16 | 2020-12-25 | Online boxing method, and terminal and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010685898.6A CN111882270B (en) | 2020-07-16 | 2020-07-16 | Online boxing method, terminal and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111882270A true CN111882270A (en) | 2020-11-03 |
| CN111882270B CN111882270B (en) | 2024-01-05 |
Family
ID=73155499
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010685898.6A Active CN111882270B (en) | 2020-07-16 | 2020-07-16 | Online boxing method, terminal and storage medium |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN111882270B (en) |
| WO (1) | WO2022011979A1 (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113487810A (en) * | 2021-08-17 | 2021-10-08 | 上海蜜罐科技有限公司 | Self-service sending cabinet full early warning system and method |
| CN113947295A (en) * | 2021-09-30 | 2022-01-18 | 杭州容大智造科技有限公司 | System, method, terminal and storage medium for recording inversion and side-placing times of cargo transport box |
| WO2022011981A1 (en) * | 2020-07-16 | 2022-01-20 | 中国科学院深圳先进技术研究院 | Online boxing method, terminal, and storage medium |
| WO2022011979A1 (en) * | 2020-07-16 | 2022-01-20 | 中国科学院深圳先进技术研究院 | Online boxing method, and terminal and storage medium |
| CN114229135A (en) * | 2021-12-29 | 2022-03-25 | 杭州海康机器人技术有限公司 | Method and device for determining goods packaging mode, storage medium and electronic equipment |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2017067737A (en) * | 2015-10-02 | 2017-04-06 | 株式会社リコー | Dimension measurement device, dimension measurement method, and program |
| CN108491177A (en) * | 2018-03-21 | 2018-09-04 | 北京小米移动软件有限公司 | Space appraisal procedure and device |
| CN109409244A (en) * | 2018-09-29 | 2019-03-01 | 维沃移动通信有限公司 | A kind of object puts the output method and mobile terminal of scheme |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101957945A (en) * | 2010-08-20 | 2011-01-26 | 上海电机学院 | Method and device for optimizing goods loading of container |
| US10029857B2 (en) * | 2014-08-04 | 2018-07-24 | Panasonic Intellectual Property Management Co., Ltd. | Package loading instruction method and loading instruction system |
| CN109685278A (en) * | 2018-12-28 | 2019-04-26 | 深圳蓝胖子机器人有限公司 | Packing method, equipment and computer readable storage medium |
| CN111882270B (en) * | 2020-07-16 | 2024-01-05 | 中国科学院深圳先进技术研究院 | Online boxing method, terminal and storage medium |
-
2020
- 2020-07-16 CN CN202010685898.6A patent/CN111882270B/en active Active
- 2020-12-25 WO PCT/CN2020/139668 patent/WO2022011979A1/en active Application Filing
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2017067737A (en) * | 2015-10-02 | 2017-04-06 | 株式会社リコー | Dimension measurement device, dimension measurement method, and program |
| CN108491177A (en) * | 2018-03-21 | 2018-09-04 | 北京小米移动软件有限公司 | Space appraisal procedure and device |
| CN109409244A (en) * | 2018-09-29 | 2019-03-01 | 维沃移动通信有限公司 | A kind of object puts the output method and mobile terminal of scheme |
Non-Patent Citations (1)
| Title |
|---|
| 黄江燕 等: "基于空间性质的三维装箱问题的算法及分析", 《江西理工大学学报》, vol. 28, no. 3, pages 54 - 57 * |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2022011981A1 (en) * | 2020-07-16 | 2022-01-20 | 中国科学院深圳先进技术研究院 | Online boxing method, terminal, and storage medium |
| WO2022011979A1 (en) * | 2020-07-16 | 2022-01-20 | 中国科学院深圳先进技术研究院 | Online boxing method, and terminal and storage medium |
| CN113487810A (en) * | 2021-08-17 | 2021-10-08 | 上海蜜罐科技有限公司 | Self-service sending cabinet full early warning system and method |
| CN113947295A (en) * | 2021-09-30 | 2022-01-18 | 杭州容大智造科技有限公司 | System, method, terminal and storage medium for recording inversion and side-placing times of cargo transport box |
| CN114229135A (en) * | 2021-12-29 | 2022-03-25 | 杭州海康机器人技术有限公司 | Method and device for determining goods packaging mode, storage medium and electronic equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111882270B (en) | 2024-01-05 |
| WO2022011979A1 (en) | 2022-01-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111882270A (en) | Online boxing method, terminal and storage medium | |
| JP7429384B2 (en) | Robotic system for palletizing packages using real-time placement simulation | |
| JP7454148B2 (en) | Robot system with packing mechanism | |
| CN111862350B (en) | Online boxing method, terminal and storage medium | |
| JP6683333B1 (en) | Robot system for handling out-of-order arriving packages | |
| CN110097315B (en) | Container determination method, container determination device, medium, and computing apparatus | |
| CN109919424A (en) | Container determines method and device, medium and calculates equipment | |
| CN107839947B (en) | Robot boxing method based on three-dimensional boxing positioning | |
| CN111605938A (en) | Robotic system for palletizing packages using real-time placement simulation | |
| CN111498212B (en) | Robotic system for handling out-of-order arriving packages | |
| Pan et al. | SDF-Pack: Towards Compact Bin Packing with Signed-Distance-Field Minimization | |
| KR20200055344A (en) | Method for packaging items and boxes | |
| CN112069641B (en) | Container space distribution method, container space distribution device and terminal equipment | |
| US11861506B2 (en) | Method and system for packing products with increased efficiency across packaging levels | |
| CN105654519B (en) | Spatial position determines the method and device thereof of geometric object | |
| KR102720481B1 (en) | A robotic system with packing mechanism | |
| CN111498214B (en) | Robot system with packaging mechanism | |
| CN117733833A (en) | Method, apparatus and computer readable storage medium for determining placement scheme of object | |
| CN117371689A (en) | Cargo boxing method and system | |
| CN118470084A (en) | Method, apparatus, and computer-readable storage medium for determining object placement information within a container |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |