Application of Generic Algorithm to Inspection Planning of Fatigue Deteriorating Structure

Kim, Sung-chan,Fujimoto, Yukio,Hamada, Kunihiro The Society of Naval Architects of Korea 1998 Journal of ship and ocean technology Vol.2 No.1

Genetic Algorithm (GA) is applied to obtain optimal Inspection plan for fatigue deteriorating structures. The optimization problem is defined so as to minimize inspection cost in the 1ifs-time of the structure under the constraint that the increment of failure probability in each inspection interval is maintained below a target value. Optimization parameters are the inspection timing and the inspection quality. The inspection timing is selected from the discrete intervals such as one year, two years, three years, etc. The inspection quality is selected from the followings; no inspection, normal inspection, sampling inspection or precise inspection. The applicability of the proposed GA approach is demonstrated through the numerical calculations assuming a structure consisting of four member sets. Influences of the level of target failure probability, initial defect condition and stress increase due to plate thickness reduction caused by corrosion on inspection planning are discussed.

자동외관검사를 위한 확률기반 불량 확인 알고리즘 개발

김영흡,유선중 한국반도체디스플레이기술학회 2017 반도체디스플레이기술학회지 Vol.16 No.2

The visual inspection of electronic parts consists of two steps: automatic visual inspection and verification inspection. In the stage of a verification inspection, the human inspector sequentially inspects all the areas which detected in the automatic inspection. In this study, we propose an algorithm to determine the order of verification inspection by Bayes inference well known in the field of machine learning. This is a method of prioritizing a region estimated to have a high probability of defect using experience data of past inspection. This algorithm was applied to the visual inspection of ultraviolet filters to verify its effectiveness. As a result of the comparison experiment, it was confirmed that the verification inspection can be completed 30% of the conventional method by adapting proposed algorithm.

원격계측을 위한 무선 통신 에러 검사 알고리즘 개발

김희식(H. S. Kim),김영일(Y. I. Kim),설대연(D. Y. Seol),남철(C. Nam),Odgerel 한국정밀공학회 2004 한국정밀공학회 학술발표대회 논문집 Vol.2004 No.10월

A data error inspection algorithm for wireless digital data communication was developed. Original data converted By wireless digital data error inspection algorithm. Wireless digital data is high possibility to get distortion and lose by noise and barrier on wireless. If the data check damaged and lost at receiver, can"t make it clear and can"t judge whether this data is right or not. Therefore, by wireless transmission data need the data error inspection algorithm in order to decrease the data distortion and lose and to monitoring the transmission data as real time. This study consists of RF station for wireless transmission, Water Level Meter station for water level measurement and Error inspection algorithm for error check of transmission data. This study is also that investigation and search for error inspection algorithm in order to wireless digital data transmission in condition of the least data"s damage and lose. Designed transmitter and receiver with one - chip micro process to protect to swell the volume of circuit. Had designed RF transmitter - receiver station simply by means of ATMEL one - chip micro processing the systems. Used 10mW of the best RF power and 448MHz-449MHz on frequency band which is open to public touse free within the limited power.

Trajectory Planning of Rail Inspection Robot Based on an Improved Penalty Function Simulated Annealing Particle Swarm Algorithm

Ruoyu Xu,Jianyan Tian,Jifu Li,Xinpeng Zhai 제어·로봇·시스템학회 2023 International Journal of Control, Automation, and Vol.21 No.10

To ensure the smooth operation of each joint and shorten the joint movement time of a rail inspection robot, a trajectory planning method based on time optimization with a penalty function is proposed. According to the Denavit-Hartenberg (D-H) model of the inspection robot, a kinematic solution is found, and the trajectory of each joint is generated using a mixed polynomial interpolation algorithm. Taking time optimization as the standard, the traditional particle swarm algorithm cannot handle complex constraints, easily falls to local optimum solutions, and has a slow convergence speed. An improved simulated annealing particle swarm algorithm with a penalty function (IPF-SA-PSO) is proposed to optimize the trajectory generated by the mixed polynomial interpolation algorithm. The simulation results show that the proposed algorithm, compared with the mixed polynomial interpolation method, can limit the angular velocity and reduce the running time of each manipulator joint. The two algorithms are experimentally verified based on a rail inspection robot, and the results show that after adopting the optimization algorithm, the angular velocity of each joint is within the angular velocity limit, the run time is shorter, and the operation is smoother, which indicates the effectiveness of the proposed algorithm. The proposed algorithm can optimize the robot running time, improve the smoothness, and be applied to the fields of the automatic tracking of abnormal targets and video acquisition.

SMT 검사기의 경로계획을 위한 클러스터링 알고리즘

김화중,박태형,Kim, Hwa-Jung,Park, Tae-Hyoung 한국지능시스템학회 2003 한국지능시스템학회논문지 Vol.14 No.7

인쇄회로기판을 조립하는 SMT (surface mount technology) 라인의 AOI (automatic optical inspection) 형 검사기를 대상으로, 검사시간 단축을 위한 경로계획 방법을 제안한다. 기판에 존재하는 검사 윈도우들은 카메라의 FOV (field-of-view) 크기를 고려하여 클러스터링 되어야 하며, 전체 검사시간의 단축을 위하여 클러스터의 수를 최소화하는 것이 바람직하다. 주어진 기판에 대한 클러스터의 수를 최소화하기 위한 유전자 알고리즘을 새로이 제안하며, 이를 사용한 효과적 경로계획 방법을 제시한다. 상용 검사기를 대강으로 시뮬레이션을 수행하며, 비교 평가를 통하여 제안된 방법의 유용성을 검증한다. We Propose a Path planning method to reduce the Inspection time of AOI (automatic optical inspection) machines in SMT (surface mount technology) in-line system. Inspection windows of board should be clustered to consider the FOV (field-of-view) of camera. The number of clusters is desirable to be minimized in order to reduce the overall inspection time. We newly propose a genetic algorithm to minimize the number of clusters for a given board. Comparative simulation results are presented to verify the usefulness of proposed algorithm.

검사지연시간을 고려한 SMT 검사기의 통합적 경로 계획 알고리즘

이철희,박태형,Lee, Chul-Hee,Park, Tae-Hyoung 제어로봇시스템학회 2015 제어·로봇·시스템학회 논문지 Vol.21 No.8

This paper proposes a path planning algorithm to reduce the inspection time of AOI (Automatic Optical Inspection) machines for SMT (Surface Mount Technology) in-line system. Since the field-of-view of the camera attached at the machine is much less than the entire inspection region of board, the inspection region should be clustered to many groups. The image acquisition time depends on the number of groups, and camera moving time depends on the sequence of visiting the groups. The acquired image is processed while the camera moves to the next position, but it may be delayed if the group includes many components to be inspected. The inspection delay has influence on the overall job time of the machine. In this paper, we newly considers the inspection delay time for path planning of the inspection machine. The unified approach using genetic algorithm is applied to generates the groups and visiting sequence simultaneously. The chromosome, crossover operator, and mutation operator is proposed to develop the genetic algorithm. The experimental results are presented to verify the usefulness of the proposed method.

검사지연시간을 고려한 SMT 검사기의 통합적 경로 계획 알고리즘

이철희(Chul-Hee Lee),박태형(Tae-Hyoung Park) 제어로봇시스템학회 2015 제어·로봇·시스템학회 논문지 Vol.18 No.1

This paper proposes a path planning algorithm to reduce the inspection time of AOI (Automatic Optical Inspection) machines for SMT (Surface Mount Technology) in-line system. Since the field-of-view of the camera attached at the machine is much less than the entire inspection region of board, the inspection region should be clustered to many groups. The image acquisition time depends on the number of groups, and camera moving time depends on the sequence of visiting the groups. The acquired image is processed while the camera moves to the next position, but it may be delayed if the group includes many components to be inspected. The inspection delay has influence on the overall job time of the machine. In this paper, we newly considers the inspection delay time for path planning of the inspection machine. The unified approach using genetic algorithm is applied to generates the groups and visiting sequence simultaneously. The chromosome, crossover operator, and mutation operator is proposed to develop the genetic algorithm. The experimental results are presented to verify the usefulness of the proposed method.

칼라팔레트의 불량 식별을 위한 영상처리 시스템 구현

김경민,박중조,송명현 한국정보통신학회 2001 한국정보통신학회논문지 Vol.5 No.6

본 논문에서는 영상 처리 기법을 이용하여 칼라 팔레트 외형상의 불량품을 식별하는 연구를 수행하고자 한다 먼저 기본적인 팔레트 자동선별시스템의 필요성에 대해 기술하며, 각 샘플링된 팔레트에 대해 영상처리기법을 이용한 불순물 검출 알고리즘을 제안하고자 한다. 또한 이를 상용화할 수 있도록 윈도우환경의 비전처리 프로그램을 제시하였다. 끝으로 본 연구에 대한 평가와 앞으로의 연구과제에 대해 기술하고자 한다. This paper deals with inspect algorithm using visual system. One of the major problems that arise during polymer production is the estimation of the noise of the color product.(bad pallets) An erroneous output can cause a lot of losses (production and financial losses). Therefore new methods for real-time inspection of the noise are demanded. For this reason, we have presented a development of vision system algorithm for the defect inspection of PE color pallets. First of all, in order to detect the edge of object, the differential filter is used. And we apply to the labelling algorithm for feature extraction. This algorithm is designed for the defect inspection of pallets. The labelling algorithm permits to separate all of the connected components appearing on the pallets. Labelling the connected regions of a image is a fundamental computation in image analysis and machine vision, with a large number of application. Also, we suggested vision processing program in window environment. Simulations and experimental results demonstrate the performance of the proposal algorithm.

Metaheuristic-based inspection policy for a one-shot system with two types of units

윤원영,Li Liu,한영진 대한기계학회 2014 JOURNAL OF MECHANICAL SCIENCE AND TECHNOLOGY Vol.28 No.10

In this paper, we address an inspection policy problem for a one-shot system with two types of units, namely, Type 1 units that fail atrandom times and Type 2 units that degrade with time. Interval availability and life cycle cost are used as optimization criteria and estimatedby simulation. We determine inspection intervals, preventive replacement ages of Type 1 units, and preventive maintenancethresholds of Type 2 units that have minimal life cycle cost and satisfy the target interval availability during inspection periods. A simulation-based optimization procedure using a hybrid genetic algorithm is proposed to find near-optimal solutions. Numerical examples arestudied to investigate the effects of model parameters on optimal solutions and compare the hybrid genetic algorithm with the generalgenetic algorithm.

Genetic Algorithm-based Optimum Inspection Interval Determination for Plant Maintenance

(Kwang Kyu Seo) 상명대학교 공학기술연구소 2004 공학기술연구 Vol.2004 No.1

The operation and management of a plant require proper accounting for the constraints coming from reliability requirements as well as from budget and resource considerations. Most of the mathematical methods to decide the inspection time interval for plant maintenance by reliability theory are too complicated to be solved. Moreover, the mathematical and theoretical models are not usually cases in the practical applications. In order to overcome these problems, we propose a new the method for a genetic algorithm based optimal inspection interval determination to minimize the maintenance cost with reliability theory. The most merit of the proposed method is to decide the inspection interval for a plant machine of which failure rate λ(t) conforms to any probability distribution. Therefore, this method is more practical. The efficiency of the proposed method is verified by comparing the results obtained by GA-based method with the inspection model having regular time interval.