Unlock instant, AI-driven research and patent intelligence for your innovation.

Greedy stacking method and device and computer readable storage medium

A greedy and stacking technology, applied in the field of stacking processing, can solve problems such as difficulty in placing materials neatly, waste of container space, etc., to achieve the effect of improving storage rate and ensuring stability

Active Publication Date: 2022-01-07
合肥辰视机器人科技有限公司
View PDF13 Cites 1 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0003] In view of this, the object of the present invention is to provide a kind of greedy palletizing method, device and computer-readable storage medium, solve the problem that prior art materials are randomly placed in containers Any position, it is difficult for materials to be neatly placed in the container, and it is easy to cause waste of container space

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Greedy stacking method and device and computer readable storage medium
  • Greedy stacking method and device and computer readable storage medium
  • Greedy stacking method and device and computer readable storage medium

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0086] The invention of this application provides a greedy palletizing method, please refer to Figure 7 , the method includes the steps of:

[0087] S10. Record the number of feasible points where the cuboid material can be placed in the container under a certain state as N;

[0088] S12. At each feasible point, record six rotation states of the cuboid material, and count all rotation states whose number of feasible points is N;

[0089] Specifically, at each feasible point, record the six rotation states of the cuboid material, and count all the rotation states with N feasible points as 6N rotation states and combinations with feasible points.

[0090] S13. Eliminate illegal rotation state combinations according to the judging strategy.

[0091] When considering a combination of a rotation state and a feasible point, it is first necessary to determine whether there are the following two illegal states:

[0092] 1. The current material intersects with other cuboid material...

Embodiment 2

[0105] see Figure 8 , the specific implementation process of the greedy palletizing method described in the embodiment of the present application will be described below in conjunction with a specific case where the cuboid material-box is placed in the container:

[0106] S20. Input the container specification {X of the container that the cuboid material box is about to put into max , Y max ,Z max};

[0107] S21, input the type number N of cuboid material box, input N box specification (l i ,w i , h i ), i=1, 2, 3...N;

[0108] S22. Initialize the position P=(X, Y, Z)=(0,0,0), set the number of boxes M=0, and initialize the set of feasible points A={(0,0,0)};

[0109] S23, the numbering of the boxes that need to be loaded into the container is sequentially M++, and the number K of the box that needs to be loaded into the container is input; the M number box B is defined M ={l k ,w k , h k};

[0110] S24. Calculating box B of size M M The volume contribution rate ...

Embodiment 3

[0126] The embodiment of the present application also provides a greedy palletizing device, please refer to Figure 9 , the device includes a feasible point number recording module 20 , a rotation state statistics module 30 , an illegal elimination module 40 , a greedy index calculation module 50 and an optimal stacking placement output module 60 connected by mutual communication.

[0127] The number of feasible points recording module 20 is used to record the number of feasible points where cuboid materials can be placed in the container as N in a certain state;

[0128] The rotation state statistics module 30 is used to record six rotation states of the cuboid material at each feasible point, and count all the rotation states with N feasible points.

[0129] Specifically, at each feasible point, record the six rotation states of the cuboid material, and count all the rotation states with N feasible points as 6N rotation states and combinations with feasible points.

[0130]...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention provides a greedy stacking method and device and a computer readable storage medium, and belongs to the technical field of stacking treatment. According to the method in the embodiment, the number of feasible points where cuboid materials can be placed in a container in a certain state and the rotation state of the materials capable of being placed on each feasible point are recorded, illegal rotation state combinations are eliminated according to a judgment strategy, and greedy indexes of the feasible points under each legal condition are calculated according to an algorithm; the feasible point with the maximum greedy index and the rotation state are selected as the optimal material placing position output solution, so that the proportion of the materials occupying the volume of the container is high, the stability of the materials and the feasibility of placing the materials can be ensured, the storage rate of the materials placed in the container can be effectively improved, and the problems that materials on an industrial production line are randomly placed at any position in a container, the materials are difficult to place in order, and the space of the container is wasted easily are solved.

Description

technical field [0001] The invention relates to the technical field of palletizing, in particular to a greedy palletizing method, device and computer-readable storage medium. Background technique [0002] On the assembly line or in the shipping industry, there are often a series of cuboid materials arriving. When the materials are not used in time, the materials need to be placed in a cuboid container for storage. However, if the materials are randomly placed in any position in the container, it is difficult for the materials to be neatly placed in the container, and it is easy to cause a waste of container space. Contents of the invention [0003] In view of this, the purpose of the present invention is to provide a greedy palletizing method, device and computer-readable storage medium to solve the problem that materials in the prior art are randomly placed in any position in the container, and the materials are difficult to be neatly placed in the container, and it is ea...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
IPC IPC(8): B65B57/14B65B57/20
CPCB65B57/14B65B57/20
Inventor 陈龙灿邓亮李楚翘陈先开冯良炳
Owner 合肥辰视机器人科技有限公司
Features
  • R&D
  • Intellectual Property
  • Life Sciences
  • Materials
  • Tech Scout
Why Patsnap Eureka
  • Unparalleled Data Quality
  • Higher Quality Content
  • 60% Fewer Hallucinations
Social media
Patsnap Eureka Blog
Learn More

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2025 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com