• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1992년도 한국자동제어학술회의논문집(국내학술편); KOEX, Seoul; 19-21 Oct. 1992
• /
• pp.1072-1077
• /
• 1992

In ths paper a new active assembly algorithm for chamferless precision parts mating, is considered. The successful assembly task requires an extremely high position accuracy and a good knowledge of mating parts. However, conventional assembly mehtod alone makes it difficult to achieve satisfactory assembly performance because of the complexity and the uncertainties of the process and its environments such as imperfect knowledge of the parts being assembled as well as the limitation of the devices performing the assebled as well as the limitation of the devices performing the assembly. To cope with these problems, a self-learning rule-based assembly algorithm is proposed by intergaring fuzzy set theory and neural network. In this algortihm, fuzzy set theory copes with the complexity and the uncertainties of the assembly process, while neural network enhances the assembly schemen so as to learn fuzzy rules form experience and adapt to changes in environment of uncertainty and imprecision. The performance of the proposed assembly algorithm is evaluated through a series of experiments. The results show that the self-learning fuzzy assembly scheme can be effecitively applied to chamferless precision parts mating.

• 대한안전경영과학회지
• /
• 제4권2호
• /
• pp.83-101
• /
• 2002

In this thesis presents line balancing problems of two-sided and mixed model assembly line widely used in practical fields using genetic algorithm for reducing throughput time, cost of tools and fixtures and improving flexibility of assembly lines. Two-sided and mixed model assembly line is a special type of production line where variety of product similar in product characteristics are assembled in both sides. This thesis proposes the genetic algorithm adequate to each step in tow-sided and mixed model assembly line with suitable presentation, individual, evaluation function, selection and genetic parameter. To confirm proposed genetic algorithm, we apply to increase the number of tasks in case study. And for evaluation the performance of proposed genetic algorithm, we compare to existing algorithm of one-sided and mixed model assembly line. The results show that the algorithm is outstanding in the problems with a larger number of stations or larger number of tasks.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1997년도 한국자동제어학술회의논문집; 한국전력공사 서울연수원; 17-18 Oct. 1997
• /
• pp.1267-1270
• /
• 1997

An assembly sequence is considered to be optimal when it minimizes assembly cost while satisfying assembly constraints. to generate such sequences for robotic assembly, this paper proposes a method using a genetic algorithm (GA). This method denotes an assembly sequence as an individual, which is assigned a fitness related to the assembly cost. Then, a population consisting of a number of individuals evolves to the next generation through genetic operations of crossover and mutation based upon the fitness of the individuals. The population continues to repetitively evolve, and finally the fittest individual and its corresponding assembly sequence is found. Through case study for an electrical relay, the effectiveness of the proposed method is demonstrated. Also, the performance is evaluated by-comparing with those of previously presented approaches such as a neural-netowork-based method and a simulated annealing method.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 1995년도 추계학술대회 논문집
• /
• pp.938-941
• /
• 1995

This paper is concerned with the determination of assembly unit for hull block assembly processes for shipbuilding. In this study,genetic algorithm is adopted for assembly level allocation and assemaly unit is determined by rule-based reasoning. The criteria to detemine assembly unit is to minimize welding operation time for the block assembly.

• 산업공학
• /
• 제17권2호
• /
• pp.208-217
• /
• 2004

This paper deals with a process planning problem in the flexible assembly system (FAS). The problem is to assign assembly tasks to stations with limited working space and to determine assembly routing with the objective of minimizing transfer time of the products among stations, while satisfying precedence relations among the tasks and upper-bound workload constraints for each station. In the process planning of FAS, the optimality of assembly routing depends on tasks loading. The integration of tasks loading and assembly routing is therefore important for an efficient utilization of FAS. To solve the integrated problem at the same time, in this paper we propose a new method using an artificial intelligent search technique, named 2-leveled symbiotic evolutionary algorithm. Through computational experiments, the performance of the proposed algorithm is compared with those of a traditional evolutionary algorithm and a symbiotic evolutionary algorithm. The experimental results show that the proposed algorithm outperforms the algorithms compared.

• 대한안전경영과학회:학술대회논문집
• /
• 대한안전경영과학회 2002년도 춘계학술대회
• /
• pp.91-97
• /
• 2002

In this thesis presents line balancing problems of two-sided and mixed model assembly line widely used in practical fields using genetic algorithm for reducing throughput time, cost of tools and fixtures and improving flexibility of assembly lines. Two-sided and mixed model assembly line is a special type of production line where variety of product similar in product characteristics are assembled in both sides. This thesis proposes the genetic algorithm adequate to each step in tow-sided and mixed model assembly line with suitable presentation, individual, evaluation function, selection and genetic parameter. To confirm proposed genetic algorithm, we apply to increase the number of tasks in case study. And for evaluation the performance of proposed genetic algorithm, we compare to existing algorithm of one-sided and mixed model assembly line. The results show that the algorithm is outstanding in the problems with a larger number of stations or larger number of tasks.

• 제어로봇시스템학회논문지
• /
• 제5권7호
• /
• pp.841-847
• /
• 1999

For successful assembly of flexible parts, informations about their deformation as well as possible misalignments between the holes and their mating parts are essential. Such informations can be acquired from visual sensors. For robotic assembly, the corrective assembly motion to compensate for such misalignments has to be determined from the measured informations. However, this may not be simply derived from the measured misalignment alone because the part deformation progressively occurs during misalignment compensation. Based on the analysis of flexible parts assembly process, this paper presents a neural net-based inference system that can infer the complex relationship between the corrective motion and the measured information of parts deformation and misalignments. And it verifies the performance of the implemented inference system. The results show that the proposed neural net-based misalignment compensation algorithm Is effective in compensating for the lateral misalignment, and that it can be extended to the assembly tasks under more general conditions.

• 제어로봇시스템학회논문지
• /
• 제11권2호
• /
• pp.144-151
• /
• 2005

We propose an optimization method to reduce the assembly time of chip mounters. Feeder arrangement and assembly sequence are determined considering the multiple feeder assignment. The problem is divided into two sub-problems: feeder arrangement problem and assembly sequence problem. We present mathematical model for each sub-problem. The clustering algorithm and assignment algorithm are applied to solve the feeder arrangement problem. The assignment algorithm and connection algorithm are applied to solve the assembly sequence problem. Simulation results are then presented to verity the usefulness of the proposed method.

• 제어로봇시스템학회논문지
• /
• 제6권6호
• /
• pp.506-513
• /
• 2000

This paper proposes a path planning algorithm for dispensers to increase the productivity in printed circuit board assembly lines. We analyze the assembly sequence of the dispenser, and formulate it as an integer programming problem. The mathematical formulation can accomodate multiple heads and different types of heads through extended cost matrix. The TSP algorithms are then applied to the formulated problem to find the near-optimal solution. Simulation results are presented to verify the usefulness of the proposed scheme.

• 대한산업공학회지
• /
• 제29권1호
• /
• pp.49-64
• /
• 2003

Although assembly sequence planning is an essential task in assembly process planning, it is known as one of the most difficult and time consuming jobs because its complexity is increased geometrically when the number of parts in an assembly is increased. The purpose of this study is to develop a more efficient algorithm for generating assembly sequences automatically. By considering subassemblies, a new heuristic method generates a preferred parallel assembly sequence that can be used in robotic assembly systems. A parallel assembly sequence concept provides a new representation scheme for an assembly in which the assembly sequence precedence information is not required. After an user inputs both the directional mating relation information and the mating condition information, an assembly product is divided into subgroups if the product has cut-vertices. Then, a virtual disassembly process is executed to generate alternate parallel assembly sequences with intermediate assembly stability. Through searching parts relations in the virtual disassembly process, stable subassemblies are extracted from translation-free parts along disassembling directions and this extraction continues until no more subassemblies are existed. Also, the arithmetic mean parallelism formula as a preference criterion is adapted to select the best parallel assembly sequence among others. Finally a preferred parallel assembly sequence is converted to an assembly BOM structure. The results from this study can be utilized for developing CAAPP(Computer-Aided Assembly Process Planning) systems as an efficient assembly sequence planning algorithm.