• 제목/요약/키워드: assembly algorithm

검색결과 377건 처리시간 0.027초

지식베이스를 이용한 로보틱 조립셀의 모델링과 운영관리를 위한 프레임 워크 (A framework for modelling and operation management of robotic assembly cells via knowledge base)

  • 김대원;고명삼;이범희
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1988년도 한국자동제어학술회의논문집(국내학술편); 한국전력공사연수원, 서울; 21-22 Oct. 1988
    • /
    • pp.374-379
    • /
    • 1988
  • We propose a framework for modelling and operation management of robotic assembly cells via knowledge base. In the framework, each component of the cell is considered as a state variable, the relations among the state variables are stored in state transition maps(STMs) and then transformed into the form of knowledge. The assembly job tree(AJT) which includes the precedence relations and the constraints for assembly tasks is also described. Finally, an algorithm is presented to manage the cell operation.

  • PDF

다수 표면실장기계를 포함하는 PCB 조립라인의 라인균형화 알고리즘 설계 (Design of a line balancing algorithm for the PCB assembly line including multiple surface mounters)

  • 김진철;이성한;김대원;이범희
    • 제어로봇시스템학회논문지
    • /
    • 제3권4호
    • /
    • pp.381-388
    • /
    • 1997
  • This paper proposes a heuristic algorithm to efficiently perform line balancing in the PCB assembly line including multiple surface mounters efficiently. Generally, the problems in line balancing are classified into two kinds. Firstly, is the determining of the minimum number of machines required for achieving the desired production rate. Secondly, is the assign of jobs to multiple machines in order to minimize the cycle time which is defined as a maximum among the working times of machines when the number of machines is fixed. In this paper, we deal with the latter. We consider a PCB assembly line, including the multiple surface mounters arranged serially as a target system. Also, the conveyor is assumed to move at a constant speed and have no buffer. Considering that the minimum number of machines required for the desired production rate is a discrete nonincreasing function which is inversely proportional to the cycle time, we propose an optimization algorithm for line balancing by using the binary search method. The algorithm is validated through computer simulation, the results of which show that their shapes coincide nearly with those of optimal line balancing efficiency graphs regardless of the number of components, the performance of surface mounters, and the structure of assembly line.

  • PDF

Two-Phase Genetic Algorithm for Solving the Paired Single Row Facility Layout Problem

  • Parwananta, Hutama;Maghfiroh, Meilinda F.N.;Yu, Vincent F.
    • Industrial Engineering and Management Systems
    • /
    • 제12권3호
    • /
    • pp.181-189
    • /
    • 2013
  • This paper proposes a two-phase genetic algorithm (GA) to solve the problem of obtaining an optimum configuration of a paired single row assembly line. We pair two single-row assembly lines due to the shared usage of several workstations, thus obtaining an optimum configuration by considering the material flow of the two rows simultaneously. The problem deals with assigning workstations to a sequence and selecting the best arrangement by looking at the length and width for each workstation. This can be considered as an enhancement of the single row facility layout problem (SRFLP), or the so-called paired SRFLP (PSRFLP). The objective of this PSRFLP is to find an optimal configuration that seeks to minimize the distance traveled by the material handler and even the use of the material handler itself if this is possible. Real-world applications of such a problem can be found for apparel, shoe, and other manual assembly lines. This research produces the schematic representation solution using the heuristic approach. The crossover and mutation will be utilized using the schematic representation solution to obtain the neighborhood solutions. The first phase of the GA result is recorded to get the best pair. Based on these best matched pairs, the second-phase GA can commence.

PCB 생산 자동화를 위한 데이터 변환 시스템 구현 (Data Transformation System Implementation for the Automation of PCB Product)

  • 이승혁;김귀정;한정수
    • 한국콘텐츠학회논문지
    • /
    • 제5권5호
    • /
    • pp.17-25
    • /
    • 2005
  • 본 논문은 PCB 생산 자동화를 위한 데이터 변환 시스템을 구현한다. CAD로 설계한 데이터는 PCB 생산라인과의 데이터 호환을 이루지 못하기 때문에 데이터 호환을 갖는 자동화 시스템이 필요하다. 본 논문에서는 PCB 생산 자동화를 위한 PCB 부품 정보를 분석하고 IC 부품 정보를 DB로 구축한다. CAD 설계자의 Human error 검출 알고리즘을 개발하고, PCB 생산 라인에 적합한 데이터로 변환하는 알고리즘을 개발한다. PCB 생산라인의 부품의 정보 추가, 수정하기 위한 데이터 변환 인터페이스를 설계 및 구현한다. 기존의 수작업 공정을 자동화함으로서 처리속도를 대폭 개선하였으며, 신뢰성 있는 칙적화된 데이터로 PCB 생산 자동화에 일조를 할 수 있다.

  • PDF

Assembly performance evaluation method for prefabricated steel structures using deep learning and k-nearest neighbors

  • Hyuntae Bang;Byeongjun Yu;Haemin Jeon
    • Smart Structures and Systems
    • /
    • 제32권2호
    • /
    • pp.111-121
    • /
    • 2023
  • This study proposes an automated assembly performance evaluation method for prefabricated steel structures (PSSs) using machine learning methods. Assembly component images were segmented using a modified version of the receptive field pyramid. By factorizing channel modulation and the receptive field exploration layers of the convolution pyramid, highly accurate segmentation results were obtained. After completing segmentation, the positions of the bolt holes were calculated using various image processing techniques, such as fuzzy-based edge detection, Hough's line detection, and image perspective transformation. By calculating the distance ratio between bolt holes, the assembly performance of the PSS was estimated using the k-nearest neighbors (kNN) algorithm. The effectiveness of the proposed framework was validated using a 3D PSS printing model and a field test. The results indicated that this approach could recognize assembly components with an intersection over union (IoU) of 95% and evaluate assembly performance with an error of less than 5%.

자동조립에서 시뮬레이트 어닐링을 이용한 조립순서 최적화 (Geneation of Optimized Robotic Assembly Sequences Via Simulated Annealing Method)

  • 홍대선;조형석
    • 대한기계학회논문집A
    • /
    • 제20권1호
    • /
    • pp.213-221
    • /
    • 1996
  • An assembly sequence is considered to be optimal when is minimizes assembly cost while satisfying assembly constraints. To derive such an optimal sequence for robotic assembly, this paper proposes a method using a simulated annealing algorithm. In this method, an energy funciton is derived inconsideration of both the assembly constraints and the assembly cost. The energy function thus derived is iteratively minimized until no further change in energy occurs. During the minimization, the energy is occationally perturbed probabilistically in order to escape from local minima. The minimized energy yields an optimal assembly sequence. To show the effectiveness of the proposed method, case studies are presented for industrial products such as an electrical relay and an automobil alternator. The performance is analyzed by comparing the results with those of a neural network-based method, based upon the optimal solutions of an expert system.

항공기 패널 조립체 구조물의 스트링거 형상 최적화 (Stringer Shape Optimization of Aircraft Panel Assembly Structure)

  • 김형래;박찬우
    • 한국정밀공학회지
    • /
    • 제23권6호
    • /
    • pp.136-142
    • /
    • 2006
  • Optimization of the aircraft panel assembly constructed by skin and stringers is investigated. For the design of panel assembly of the aircraft structure, it is necessary to determine the best shape of the stringer which accomplishes lowest weight under the condition of no instability. A panel assembly can fail in a variety of instability modes under compression. Overall modes of flexure or torsion can occur and these can interact in a combined flexural/torsion mode. Flexure and torsion can occur symmetrically or anti-symmetrically. Local instabilities can also occur. The local instabilities considered in this paper are buckling of the free and attached flanges, the stiffener web and the inter-rivet buckling. A program is developed to find out critical load for each instability mode at the specific stringer shape. Based on the developed program, optimization is performed to find optimum stringer shape. The developed instability analysis program is not adequate for sensitivity analysis, therefore RSM (Response Surface Method) is utilized instead to model weight and instability constraints. Since the problem has many local minimum, Genetic algorithm is utilized to find global optimum.

양방향 군집 알고리즘을 적용한 교차혼합 U자형 조립라인 균형문제 (Balancing Problem of Cross-over U-shaped Assembly Line Using Bi-directional Clustering Algorithm)

  • 이상운
    • 한국인터넷방송통신학회논문지
    • /
    • 제22권2호
    • /
    • pp.89-96
    • /
    • 2022
  • 본 논문은 NP-난제로 알려진 단일모델 교차혼합 조립라인 균형문제에 대해 휴리스틱 알고리즘을 제안하였다. 조립라인 균형문제는 주로 메타휴리스틱 방법들을 적용하고 있는 추세로 다항시간의 정확한 해를 찾는 알고리즘이 제안되지 않고 있어 실무에 적용하기가 매우 어렵다. 제안된 알고리즘은 주어진 총 조립시간 W와 순환시간 c에 대해 m* = ⌈W/c⌉의 최소 작업자수와 c* = ⌈W/m*⌉의 목표 순환시간을 구하고, i=1,2,…,m* 개의 작업대에 Ti=c* ±α≤ c가 되도록 양방향의 공정들을 배정하는 양방향 군집방법을 적용하였다. 7개의 다양한 실험 데이터에 적용한 결과 제안된 양방향 군집 알고리즘은 타 방법들과 동일한 성능을 보였다.

A Fundamental Study for Creating 3D CG Animation of an Assembly Work

  • Yamanaka, Hiroki;Matsumoto, Toshiyuki;Shinoda, Shinji;Niwa, Akira
    • Industrial Engineering and Management Systems
    • /
    • 제11권2호
    • /
    • pp.188-195
    • /
    • 2012
  • This paper presents a new mode of expressing a 3D assembly work for creating a 3D CG animation without judgment by human from minimal required information. In the field of manufacturing, there are favorable movements in the utilization of 3D CAD for 3D simulation to shorten lead time for product development and pre-production. But simulating an assembly work has troubles to need huge quantity of manually input data. This paper discusses what minimal necessary information for creating 3D CG animations of assembly works is, focusing on the features of assembly works. Furthermore, a new mode of expressing a 3D assembly work is proposed as "state/change transition diagrams" (SCTD), which express arbitrary scenes in an assembly work as "state" and describe a sequential assembly work with "state" and "change", and the outline of its stepwise generation algorithm is also described. SCTD can be converted to a 3D CG animation of an assembly work without judgment by human. This paper focuses on the creating 3D CG animation of assembly works which workers use only their both hands.

유전알고리듬에 기반을 둔 혼합제품 유연조립라인 밸런싱 (Mixed-product flexible assembly line balancing based on a genetic algorithm)

  • 송원섭;김형수;김여근
    • 한국경영과학회지
    • /
    • 제30권1호
    • /
    • pp.43-54
    • /
    • 2005
  • A flexible assembly line (FAL) is a production system that assembles various parts in unidirectional flow line with many constraints and manufacturing flexibilities. In this research we deal with a FAL balancing problem with the objective of minimizing the maximum workload allocated to the stations. However, almost all the existing researches do not appropriately consider various constraints due to the problem complexity. Therefore, this study addresses a balancing problem of FAL with many constraints and manufacturing flexibilities, unlike the previous researches. We use a genetic algorithm (GA) to solve this problem. To apply GA to FAL. we suggest a genetic representation suitable for FAL balancing and devise evaluation method for individual's fitness and genetic operators specific to the problem, including efficient repair method for preserving solution feasibility. After we obtain a solution using the proposed GA. we use a heuristic method for reassigning some tasks of each product to one or more stations. This method can improve workload smoothness and raise work efficiency of each station. The proposed algorithm is compared and analyzed in terms of solution quality through computational experiments.