Method and apparatus for filling containers with piece goods

• US 6,826,444 B2
• Filed: 08/08/2002
• Issued: 11/30/2004
• Est. Priority Date: 08/22/2001
• Status: Expired due to Term

• Current Assignee: Bosch Packaging Systems AG (Syntegon Technology GmbH)
• Original Assignee: Robert Bosch GmbH
• Inventors: Herzog, Florian
• Primary Examiner(s): Tran, Khoi H.
• Application Number:
  US10/215,515
• Publication Number:
  US 20030037515A1
• Time in Patent Office: 845 Days
• Field of Search: 700/213, 700/228, 700/230, 700/245, 700/248, 700/259, 198/395
• US Class Current: 700/213
• CPC Class Codes: B65B 5/105 by grippers B65B5/12 and B65B5/108 take precedence
• CPC Class Codes: B65B 57/16 and operating to stop, or to control the speed of, the machine as a whole
• CPC Class Codes: G05B 2219/40007 Optimize sequence of pick and place operations upon arrival of workpiece on conveyor

Abstract

In a method of filling containers with piece goods, the piece goods are fed on a feed conveyer to at least two robots arranged in the conveying direction, in order by means of these robots to be put into empty spaces in the containers conveyed on a container conveyer. In the process, the robots are controlled in accordance with the arrangement of the piece goods on the feed conveyer, in such a way that they are utilized at least approximately uniformly. As a result, the lifetime of the robots may be increased.

Claims

1. A method of filling containers with piece goods, the method comprising the steps of:

a) feeding the piece goods on a feed conveyor to at least two robots arranged in the conveying direction, the piece goods laying in an arrangement on the feed conveyor;

b) conveying containers on a container conveyor to said two robots, the containers having empty spaces;

c) in a filling operation, putting the piece goods with said robots into said empty spaces, thereby controlling said robots in accordance with said arrangement of the piece goods on the feed conveyor and driving said robots in such a way that they are utilized at least approximately uniformly over time when putting the piece goods into said empty spaces;

d) subdividing said filling operation into time units;

e) determining state variables for each time unit;

f) representing a maintenance of the number of piece goods during filling in a first system of equations;

g) representing a dynamic behavior of said empty spaces and of said piece goods during a time unit in a second system of equations;

h) introducing complete filling of said containers and utilization of all of said robots uniformly over time as boundary conditions;

i) setting up a time-discrete dynamic system of equations; and

j) determining best parameters for controlling said robots, said determination being made using optimization algorithms and taking into account said boundary conditions and said state variables.

2. The method as claimed in claim 1, further comprising the step of controlling a speed of said container conveyor in order to control the loading of the robots when putting the piece goods into said empty spaces.

3. The method as claimed in claim 1, further comprising quadratic programming for performing said optimization.

4. The method as claimed in claim 1, wherein state variables are used which comprise said arrangement, number and alignment of said piece goods on said feed conveyor and a maximum output of each of said robots.

5. A method of filling containers with piece goods, the method comprising the steps of:

a) feeding the piece goods on a feed conveyor to at least two robots arranged in the conveying direction, the piece goods laying in an arrangement on the feed conveyor;

b) conveying containers on a container conveyor to said two robots, the containers having empty spaces;

c) in a filling operation, putting the piece goods with said robots into said empty spaces, thereby controlling said robots in accordance with said arrangement of the piece goods on the feed conveyor, said arrangement being a first condition, and driving said robots in such a way that they are utilized at least approximately uniformly over time when putting the piece goods into said empty spaces;

d) subdividing the method into time units;

e) determining state variables for each of said time unit;

f) generating at least approximately all physically possible solutions for each of said units;

g) checking secondary conditions;

h) evaluating solutions by using an objective;

i) comparing said solutions with one another;

j) determining a best solution from the group of said solutions for each time unit; and

k) using said best solution of a time unit as a control variable for controlling said robots in this time unit.