• Title/Summary/Keyword: Palletizer

Search Result 4, Processing Time 0.018 seconds

Algorithmic Proposal of Optimal Loading Pattern and Obstacle-Avoidance Trajectory Generation for Robot Palletizing Simulator (로봇 팔레타이징 시뮬레이터를 위한 적재 패턴 생성 및 시변 장애물 회피 알고리즘의 제안)

  • Yu, Seung-Nam;Lim, Sung-Jin;Kim, Sung-Rak;Han, Chang-Soo
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.13 no.11
    • /
    • pp.1137-1145
    • /
    • 2007
  • Palletizing tasks are necessary to promote efficient storage and shipping of boxed products. These tasks, however, involve some of the most monotonous and physically demanding labor in the factory. Thus, many types of robot palletizing systems have been developed, although many robot motion commands still depend on the teach pendant. That is, the operator inputs the motion command lines one by one. This is very troublesome and, most importantly, the user must know how to type the code. We propose a new GUI(Graphic User Interface) for the palletizing system that is more convenient. To do this, we used the PLP "Fast Algorithm" and 3-D auto-patterning visualization. The 3-D patterning process includes the following steps. First, an operator can identify the results of the task and edit them. Second, the operator passes the position values of objects to a robot simulator. Using those positions, a palletizing operation can be simulated. We chose a widely used industrial model and analyzed the kinematics and dynamics to create a robot simulator. In this paper we propose a 3-D patterning algorithm, 3-D robot-palletizing simulator, and modified trajectory generation algorithm, an "overlapped method" to reduce the computing load.

The Development of Trajectory Generation Algorithm of Palletizing Robot Considered to Time-variable Obstacles (변형 장애물을 고려한 최적 로봇 팔레타이징 경로 생성 알고리즘의 개발)

  • Yu, Seung-Nam;Lim, Sung-Jin;Kang, Maing-Kyu;Han, Chang-Soo;Kim, Sung-Rak
    • Proceedings of the KSME Conference
    • /
    • 2007.05a
    • /
    • pp.814-819
    • /
    • 2007
  • Palletizing task is well-known time consuming and laborious process in factory, hence automation is seriously required. To do this, artificial robot is generally used. These systems however, mostly user teaches the robot point to point and to avoid time-variable obstacle, robot is required to attach the vision camera. These system structures bring about inefficiency and additional cost. In this paper we propose task-oriented trajectory generation algorithm for palletizing. This algorithm based on $A^{*}$ algorithm and slice plane theory, and modify the object dealing method. As a result, we show the elapsed simulation time and compare with old method. This simulation algorithm can be used directly to the off-line palletizing simulator and raise the performance of robot palletizing simulator not using excessive motion area of robot to avoid adjacent components or vision system. Most of all, this algorithm can be used to low-level PC or portable teach pendent

  • PDF

Three-Dimensional Container Packing Problem (컨테이너 3차원 적재문제)

  • 배민주;최세경;김환성
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • 2003.05a
    • /
    • pp.242-248
    • /
    • 2003
  • In this paper, we propose a new heuristic solution for 3D container packing problem for the variable size and the variable kind of freights. First we consider the total cost of container charges, i.e., loading, transportation and handling charges, where the priority of each frights are dealt. By minimizing the total cost of container charges, the kinds of container and its number can be decided automatically. From these factors, we con determine the position in the container and the loading sequence into the container. Finally, by equivalence of freight's weight in container, we can prevent the freight's damage on the handling.

  • PDF

Three-Dimensional Container Packing Problem with Freight Priority (우선순위를 고려한 컨테이너 3차원 적재문제)

  • Bae, Min-Ju;Choi, Se-Kyoung;Kim, Hwan-Seong
    • Journal of Navigation and Port Research
    • /
    • v.28 no.6
    • /
    • pp.531-539
    • /
    • 2004
  • In this paper, we propose a new heuristic solution for 3D container packing problem for the variable sizes and types of freight. Frist of all, we consider the total cost of container charge i.e., handling, loading and transportation, where each freight will be specifically identified The types of containers and its number to be loaded am be selected automatically by minimizing the total cost of container charge. Maximization of loading space am be achieved efficiently by operating the palletizing and/or depalletizing of freight. By considering these factors we can determine the position of freight in the container and the loading sequence to be packing into the container. In container packing simulation, we can verify that the proposed heuristic algorithm indicates more efficiency space utilization and shows the possibility of using on commercial business.