• Title/Summary/Keyword: automation algorithm

Search Result 1,037, Processing Time 0.035 seconds

A Study on Various Structural Characteristics of 100W Linear Generator for Vehicle Suspension (차량 현가장치적용 100W급 선형발전기의 다양한 구조 특성)

  • Kim, Ji-Hye;Kim, Jin-Ho
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.19 no.4
    • /
    • pp.683-688
    • /
    • 2018
  • Recently, the demand for electric energy has been increasing due to the spread of hybrid electric vehicles. In this study, to meet this demand, the ANSYS MAXWELL electromagnetic simulation system was used to compare the power generation characteristics of three types of suspension system that can generate electricity using energy harvesting technology. Next, the optimal design was determined for each model by using the commercial PIDO (Process Integration and Design Optimization) tool, PIANO (Process Integration, Automation and Optimization). We selected three design variables and constructed an approximate model based on the experimental design method through electromagnetic analysis for 18 experimental points derived from Orthogonal Arrays among the experimental design methods. Then, we determined the optimal design by applying the Evolutionary Algorithm. Finally, the optimal design results were verified by electromagnetic simulation of the optimum design result model using the same analysis conditions as those of the initial model. After comparing the power generation characteristics for the optimal structure for each linear generator model, the maximum power generation amounts in the 8pole-8slot, 12pole-12slot, and 16pole-16slot structures were 366.5W, 466.7W and 579.7W, respectively, and it was found that as the number of slots and poles increases, the power generation increases.

Fingerprint Recognition Algorithm using Clique (클릭 구조를 이용한 지문 인식 알고리즘)

  • Ahn, Do-Sung;Kim, Hak-Il
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.36S no.2
    • /
    • pp.69-80
    • /
    • 1999
  • Recently, social requirements of personal identification techniques are rapidly expanding in a number of new application ares. Especially fingerprint recognition is the most important technology. Fingerprint recognition technologies are well established, proven, cost and legally accepted. Therefore, it has more spot lighted among the any other biometrics technologies. In this paper we propose a new on-line fingerprint recognition algorithm for non-inked type live scanner to fit their increasing of security level under the computing environment. Fingerprint recognition system consists of two distinct structural blocks: feature extraction and feature matching. The main topic in this paper focuses on the feature matching using the fingerprint minutiae (ridge ending and bifurcation). Minutiae matching is composed in the alignment stage and matching stage. Success of optimizing the alignment stage is the key of real-time (on-line) fingerprint recognition. Proposed alignment algorithm using clique shows the strength in the search space optimization and partially incomplete image. We make our own database to get the generality. Using the traditional statistical discriminant analysis, 0.05% false acceptance rate (FAR) at 8.83% false rejection rate (FRR) in 1.55 second average matching speed on a Pentium system have been achieved. This makes it possible to construct high performance fingerprint recognition system.

  • PDF

Development of the Shortest Path Algorithm for Multiple Waypoints Based on Clustering for Automatic Book Management in Libraries (도서관의 자동 도서 관리를 위한 군집화 기반 다중경유지의 최단 경로 알고리즘 개발)

  • Kang, Hyo Jung;Jeon, Eun Joo;Park, Chan Jung
    • The Journal of the Korea Contents Association
    • /
    • v.21 no.1
    • /
    • pp.541-551
    • /
    • 2021
  • Among the numerous duties of a librarian in a library, the work of arranging books is a job that the librarian has to do one by one. Thus, the cost of labor and time is large. In order to solve this problem, the interest in book-arranging robots based on artificial intelligence has recently increased. In this paper, we propose the K-ACO algorithm, which is the shortest path algorithm for multi-stops that can be applied to the library book arrangement robots. The proposed K-ACO algorithm assumes multiple robots rather than one robot. In addition, the K-ACO improves the ANT algorithm to create K clusters and provides the shortest path for each cluster. In this paper, the performance analysis of the proposed algorithm was carried out from the perspective of book arrangement time. The proposed algorithm, the K-ACO algorithm, was applied to a university library and compared with the current book arrangement algorithm. Through the simulation, we found that the proposed algorithm can allocate fairly, without biasing the work of arranging books, and ultimately significantly reduce the time to complete the entire work. Through the results of this study, we expect to improve quality services in the library by reducing the labor and time costs required for arranging books.

A Study on the Vision Sensor Using Scanning Beam for Welding Process Automation (용접자동화를 위한 주사빔을 이용한 시각센서에 관한 연구)

  • You, Won-Sang;Na, Suck-Joo
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.20 no.3
    • /
    • pp.891-900
    • /
    • 1996
  • The vision sensor which is based on the optical triangulation theory with the laser as an auxiliary light source can detect not only the seam position but the shape of seam. In this study, a vision sensor using the scanning laser beam was investigated. To design the vision sensor which considers the reflectivity of the sensing object and satisfies the desired resolution and measuring range, the equation of the focused laser beam which has a Gaussian irradiance profile was firstly formulated, Secondly, the image formaing sequence, and thirdly the relation between the displacement in the measuring surface and the displacement in the camera plane was formulated. Therefore, the focused beam diameter in the measuring range could be determined and the influence of the relative location between the laser and camera plane could be estimated. The measuring range and the resolution of the vision sensor which was based on the Scheimpflug's condition could also be calculated. From the results mentioned above a vision sensor was developed, and an adequate calibration technique was proposed. The image processing algorithm which and recognize the center of joint and its shape informaitons was investigated. Using the developed vision sensor and image processing algorithm, the shape informations was investigated. Using the developed vision sensor and image processing algorithm, the shape informations of the vee-, butt- and lap joint were extracted.

The Study of Methods for Improve the Linearity of the Walking Assistant Robot to Move on Lateral Slopes (횡단경사면에서 지능형 보행보조로봇의 직진성 향상 방안 연구)

  • Lee, Won-Young;Eom, Su-Hong;Jang, Mun-Suck;Kwon, O-Sang;Lee, Eung-Hyuk
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.1
    • /
    • pp.261-268
    • /
    • 2013
  • In this paper, we propose the algorithm that improves the linearity of the walking assistant robot on lateral slopes. The walking assistant robot goes out of the course due to the rotational moment which is caused by the weight of the robot and the slope. To compensate this, we give the weight to each driving axle after comparing the real rotational angular velocity with the target rotational angular velocity which is entered by an user. The results of applying the algorithm to the real walking assistant robot show that the yaw axis deviation of the robot without the algorithm diverges, but the yaw axis deviation of the robot with the algorithm lies within 20cm, which can be recognized as stable. In addition, the changing rate of the course deviation is stabilized and shows no more course deviation, after moving 300cm.

A Study on the Development of Pavement Crack Recognition Algorithm Using Artificial Neural Network (신경망 학습 기법을 이용한 도로면 크랙 인식 알고리즘 개발에 관한 연구)

  • Yoo Hyun-Seok;Lee Jeong-Ho;Kim Young-suk;Sung Nak-won
    • Proceedings of the Korean Institute Of Construction Engineering and Management
    • /
    • 2004.11a
    • /
    • pp.561-564
    • /
    • 2004
  • Crack sealing automation machines' have been continually developed since the early 1990's because of the effectiveness of crack sealing that would be able to improve safety, quality and productivity. It has been considered challenging problem to detect crack network in pavement which includes noise (oil marks, skid marks, previously sealed cracks and inherent noise). It is required to develop crack network mapping and modeling algorithm in order to accurately inject sealant along to the middle of cut crack network. The primary objective of this study is to propose a crack network mapping and modeling algorithm using neural network for improving the accuracy of the algorithm used in the APCS. It is anticipated that the effective use of the proposed algorithms would be able to reduce error rate in image processing for detecting, mapping and modeling crack network as well as improving quality and productivity compared to existing vision algorithms.

  • PDF

Game Model Based Co-evolutionary Solution for Multiobjective Optimization Problems

  • Sim, Kwee-Bo;Kim, Ji-Yoon;Lee, Dong-Wook
    • International Journal of Control, Automation, and Systems
    • /
    • v.2 no.2
    • /
    • pp.247-255
    • /
    • 2004
  • The majority of real-world problems encountered by engineers involve simultaneous optimization of competing objectives. In this case instead of single optima, there is a set of alternative trade-offs, generally known as Pareto-optimal solutions. The use of evolutionary algorithms Pareto GA, which was first introduced by Goldberg in 1989, has now become a sort of standard in solving Multiobjective Optimization Problems (MOPs). Though this approach was further developed leading to numerous applications, these applications are based on Pareto ranking and employ the use of the fitness sharing function to maintain diversity. Another scheme for solving MOPs has been presented by J. Nash to solve MOPs originated from Game Theory and Economics. Sefrioui introduced the Nash Genetic Algorithm in 1998. This approach combines genetic algorithms with Nash's idea. Another central achievement of Game Theory is the introduction of an Evolutionary Stable Strategy, introduced by Maynard Smith in 1982. In this paper, we will try to find ESS as a solution of MOPs using our game model based co-evolutionary algorithm. First, we will investigate the validity of our co-evolutionary approach to solve MOPs. That is, we will demonstrate how the evolutionary game can be embodied using co-evolutionary algorithms and also confirm whether it can reach the optimal equilibrium point of a MOP. Second, we will evaluate the effectiveness of our approach, comparing it with other methods through rigorous experiments on several MOPs.

Development of a Inspection System for Automotive Part (자동차 부품 누락 방지를 위한 자동 선별 시스템)

  • Shin, Seok-Woo;Lee, Jong-Hun;Park, Sang-Heup
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.18 no.10
    • /
    • pp.756-760
    • /
    • 2017
  • Meeting the growing demand deadlines, reducing the production cost and upgrading the quality control measurements are the reasons why the automotive part manufacturers are venturing into automation. Attaining these objectives is impossible with human inspection for many reasons. Accordingly, the introduction of inspection system purposely for door hinge bracket inspection is presented in this study as an alternative for human inspection. This proposal is designed to meet the demands, features and specifications of door hinge bracket manufacturing companies in striving for increased throughput of better quality. To improve demerits of this manual operation, inspection system is introduced. As the inspection algorithm, template matching algorithm is applied to distinguish the articles of good quality and the poorly made articles. Through the verification test of the inspection process algorithm and the similarity metric matching algorithm, the detection accuracy was 98%, and it was applied to the production site to contribute to the improvement of the productivity due to the decrease of the defective product.

Design of Evolvable Hardware based on Genetic Algorithm Processor(GAP)

  • Sim Kwee-Bo;Harashiam Fumio
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.5 no.3
    • /
    • pp.206-215
    • /
    • 2005
  • In this paper, we propose a new design method of Genetic Algorithm Processor(GAP) and Evolvable Hardware(EHW). All sorts of creature evolve its structure or shape in order to adapt itself to environments. Evolutionary Computation based on the process of natural selection not only searches the quasi-optimal solution through the evolution process, but also changes the structure to get best results. On the other hand, Genetic Algorithm(GA) is good fur finding solutions of complex optimization problems. However, it has a major drawback, which is its slow execution speed when is implemented in software of a conventional computer. Parallel processing has been one approach to overcome the speed problem of GA. In a point of view of GA, long bit string length caused the system of GA to spend much time that clear up the problem. Evolvable Hardware refers to the automation of electronic circuit design through artificial evolution, and is currently increased with the interested topic in a research domain and an engineering methodology. The studies of EHW generally use the XC6200 of Xilinx. The structure of XC6200 can configure with gate unit. Each unit has connected up, down, right and left cell. But the products can't use because had sterilized. So this paper uses Vertex-E (XCV2000E). The cell of FPGA is made up of Configuration Logic Block (CLB) and can't reconfigure with gate unit. This paper uses Vertex-E is composed of the component as cell of XC6200 cell in VertexE

Algorithm development of SMES model using RTDS (RTDS를 이용한 SMES model Algorithm 개발)

  • Jung, Hee-Yeol;Park, Dae-Jin;Kim, Jae-Ho;Lee, Jae-Deuk;Kim, A-Rong;Park, Min-Won;Yu, In-Keun;Sim, Ki-Deok;Kim, Seok-Ho;Kim, Hae-Jong;Seong, Ki-Chul
    • Proceedings of the KIEE Conference
    • /
    • 2007.07a
    • /
    • pp.38-39
    • /
    • 2007
  • Recently, utility network is becoming more and more complicated and huge due to IT(Information Technology) and OA(Office Automation) devices. In addition to, demands of power conversion devices which have non-linear switching devices are getting more and more increased. Voltage sag from sudden increasing loads is also one of the major problems inside of the utility network. In order to compensate the voltage sag problem, power compensation devices systems could be a good solution method. In case of voltage sag, it needs an energy source to overcome the energy caused by voltage sag. Superconducting Magnet Energy Storage (SMES) is a very good promising source due to the high response time of charge and discharge. This paper presents a real-time simulation algorithm for the SMES by using Real Time Digital Simulator (RTDS). With this algorithm users can easily do the simulation of utility power network applied by SMES system with the SMES coil modeled in RTDS.

  • PDF