• Title/Summary/Keyword: automation algorithm

Search Result 1,032, Processing Time 0.025 seconds

Design of comprehensive mechanical properties by machine learning and high-throughput optimization algorithm in RAFM steels

  • Wang, Chenchong;Shen, Chunguang;Huo, Xiaojie;Zhang, Chi;Xu, Wei
    • Nuclear Engineering and Technology
    • /
    • v.52 no.5
    • /
    • pp.1008-1012
    • /
    • 2020
  • In order to make reasonable design for the improvement of comprehensive mechanical properties of RAFM steels, the design system with both machine learning and high-throughput optimization algorithm was established. As the basis of the design system, a dataset of RAFM steels was compiled from previous literatures. Then, feature engineering guided random forests regressors were trained by the dataset and NSGA II algorithm were used for the selection of the optimal solutions from the large-scale solution set with nine composition features and two treatment processing features. The selected optimal solutions by this design system showed prospective mechanical properties, which was also consistent with the physical metallurgy theory. This efficiency design mode could give the enlightenment for the design of other metal structural materials with the requirement of multi-properties.

A Constrained Multi-objective Computation Offloading Algorithm in the Mobile Cloud Computing Environment

  • Liu, Li;Du, Yuanyuan;Fan, Qi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.9
    • /
    • pp.4329-4348
    • /
    • 2019
  • Mobile cloud computing (MCC) can offload heavy computation from mobile devices onto nearby cloudlets or remote cloud to improve the performance as well as to save energy for these devices. Therefore, it is essential to consider how to achieve efficient computation offloading with constraints for multiple users. However, there are few works that aim at multi-objective problem for multiple users. Most existing works concentrate on only single objective optimization or aim to obtain a tradeoff solution for multiple objectives by simply setting weight values. In this paper, a multi-objective optimization model is built to minimize the average energy consumption, time and cost while satisfying the constraint of bandwidth. Furthermore, an improved multi-objective optimization algorithm called D-NSGA-II-ELS is presented to get Pareto solutions with better convergence and diversity. Compared to other existing works, the simulation results show that the proposed algorithm can achieve better performance in terms of energy consumption, time and cost while satisfying the constraint of the bandwidth.

Power Flow Algorithm for Weakly Meshed Distribution Network with Distributed Generation Based on Loop-analysis in Different Load Models

  • Su, Hongsheng;Zhang, Zezhong
    • Journal of Electrical Engineering and Technology
    • /
    • v.13 no.2
    • /
    • pp.608-619
    • /
    • 2018
  • As distributed generation (DG) is connected to grid, there is new node-type occurring in distribution network. An efficient algorithm is proposed in this paper to calculate power flow for weakly meshed distribution network with DGs in different load models. The algorithm respectively establishes mathematical models focusing on the wind power, photovoltaic cell, fuel cell, and gas turbine, wherein the different DGs are respectively equivalent to PQ, PI, PQ (V) and PV node-type. When dealing with PV node, the algorithm adopts reactive power compensation device to correct power, and the reactive power allocation principle is proposed to determine reactive power initial value to improve convergence of the algorithm. In addition, when dealing with the weakly meshed network, the proposed algorithm, which builds path matrix based on loop-analysis and establishes incident matrix of node voltage and injection current, possesses good convergence and strong ability to process the loops. The simulation results in IEEE33 and PG&G69 node distribution networks show that with increase of the number of loops, the algorithm's iteration times will decrease, and its convergence performance is stronger. Clearly, it can be effectively used to solve the problem of power flow calculation for weakly meshed distribution network containing different DGs.

An Improved Method of Fault Indication Information Using Filtering Algorithm (배전자동화 중앙장치에서 필터링 알고리즘을 통한 고장표시 오류 개선방법)

  • Seo, Jung-Soo;Kim, Hyung-Seung;Lim, Sung-Il;Choi, Myeon-Song;Lee, Seung-Jae
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.64 no.10
    • /
    • pp.1418-1425
    • /
    • 2015
  • In this paper, an filtering method of FI(Fault Indication) information generated by FRTU(Feeder Remote Terminal Unit)s is proposed for the present DAS(Distribution Automation System). In order to find fault area, correct FI information should be generated. But when a single line-to-ground fault occurs, FI information is generated in downside of the fault in some circumstance because existing FI algorithm considers only magnitude. These wrong FI information can be removed by changing existing algorithm. An improved algorithm considers both the direction of zero-sequence current and the phase of three-phase current&voltage. But many FRTUs are distributed in DAS and Changing the algorithm all of FRTU will spend a lot of time and cost. On the other hand, an filtering algorithm proposed in this paper can substitute for it. The filtering algorithm also considers both the direction of zero-sequence current and the phase of three-phase current&voltage. In case study, the proposed method has been shown the reasonability in filtering the fault indication information.

Algorithm on the power Cell AVR(Auto Voltage Regulation) of H-Bridge Multi-level Inverter (H-bridge 멀티-레벨 인버터의 파워Cell AVR에 관한 알고리즘)

  • Jeon, J.H.;Yun, H.M.;Kim, M.K.;Lee, J.P.;Jang, D.J.;Na, S.H.;Kwon, B.H.
    • Proceedings of the KIPE Conference
    • /
    • 2005.07a
    • /
    • pp.317-320
    • /
    • 2005
  • 본 논문은 멀티-레벨 H-bridge 인버터에서 입력전압 변동에 따른 AVR(Auto Voltage Regulation)기능을 적용 그 타당성을 제안하였다. 기존의 범용 인버터에서 (V/F)로 구동되는 전동기 시스템에 있어서 인버터에 공급되는 입력 전압은 출력 주파수에 따라 출력 전압 비율을 일정하게 하고 기동에 필요한 전압을 더하여 출력하는 방식이다. 집중 제어 방식의 멀티-레벨 H-bridge 인버터에서는 Cell의 DC-Link 전압을 Master에서 받아들여서 각각의 Cell에 기준 전압값을 지령하게 된다. 그러므로 입력 전압 변동에 따른 DC-Link 전압의 변동이 발생하게 되면 상전압 Unbalance 가 발생하게 되어 부하가 원하는 출력 전압을 낼 수가 없게 된다. 또한 각각의 Cell을 제어하는 Master 제어기가 가지고 있는 문제점을 보완하여 각각의 Cell 제어기 스스로가 AVR을 수행하는 좀더 나은 방법을 제안하였다.

  • PDF

A Realization of Deburring Robot using Vision Sensor (비젼 센서를 이용한 디버링 로봇의 구현)

  • 배준영;주윤명;김준업;이상룡
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2002.05a
    • /
    • pp.466-469
    • /
    • 2002
  • Burr is a projected part of finished workpiece. It is unavoidable and undesirable by-product of most metal cutting or shearing process. Also, it must be removed to improve the fit of machined parts, safety of workers, and the effectiveness of finishing operation. But deburring process is one of manufacturing processes that have net been successfully automated, so deburring automation is strongly needed. This paper focused on developing a basic algorithm to find edge of workpiece and match two different image data for deburring automation which includes automatic recognition of parts, generation of deburring tool paths and edge/corner finding ability by analyzing the DXF drawing file which contains information of part geometry. As an algorithm for corner finding, SUSAN method was chosen. It makes good performance in finding edge and corner in suitable time. And this paper suggested a simple algorithm to find matching point between CCD image and drawing file.

  • PDF

Autonomous Sensor Center Position Calibration with Linear Laser-Vision Sensor

  • Jeong, Jeong-Woo;Kang, Hee-Jun
    • International Journal of Precision Engineering and Manufacturing
    • /
    • v.4 no.1
    • /
    • pp.43-48
    • /
    • 2003
  • A linear laser-vision sensor called ‘Perception TriCam Contour' is mounted on an industrial robot and often used for various application of the robot such as the position correction and the inspection of a part. In this paper, a sensor center position calibration is presented for the most accurate use of the robot-Perceptron system. The obtained algorithm is suitable for on-site calibration in an industrial application environment. The calibration algorithm requires the joint sensor readings, and the Perceptron sensor measurements on a specially devised jig which is essential for this calibration process. The algorithm is implemented on the Hyundai 7602 AP robot, and Perceptron's measurement accuracy is increased up to less than 1.4mm.

A study on the Obstacle Avoidance for a Biped Walking Robot Using Genetic-Fuzzy Algorithm (퍼지와 유전알고리즘을 이용한 이족보행로봇의 방해물 회피에 관한 연구)

  • Kong, Jung-Shik;Kim, Jin-Geol
    • Proceedings of the KIEE Conference
    • /
    • 2001.11c
    • /
    • pp.304-306
    • /
    • 2001
  • This paper presents the obstacle avoidance of a biped walking robot using GA-Fuzzy algorithm. In the case of our previous studies the surface has been assumed to be flat. For the case of the environment with obstacles, however, the walking robot might be unnatural. Thus, we considered the surface contained obstacles that the robot can pass through. We propose the optimal leg trajectory data-base by using genetic algorithm and optimal leg trajectory movement about obstacles that exist in front of the robot using fuzzy approach. It is shown that the robot can move more naturally on the surface that contains obstacles.

  • PDF

A New Test Algorithm for High-Density Memories (고집적 메모리를 위한 새로운 테스트 알고리즘)

  • Kang, Dong-Chual;Cho, Sang-Bock
    • Proceedings of the IEEK Conference
    • /
    • 2000.11b
    • /
    • pp.59-62
    • /
    • 2000
  • As the density of memories increases, unwanted interference between cells and coupling noise between bit-lines are increased and testing high density memories for a high degree of fault coverage can require either a relatively large number of test vectors or a significant amount of additional test circuitry. From now on, conventional test algorithms have focused on faults between neighborhood cells, not neighborhood bit-lines. In this paper, a new algorithm for NPSFs, and neighborhood bit-line sensitive faults (NBLSFs) based on the NPSFs are proposed. Instead of the conventional five-cell and nine-cell physical neighborhood layouts to test memory cells, a three-cell layout which is minimum size for NBLSFs detection is used. To consider faults by maximum coupling noise by neighborhood bit-lines, we added refresh operation after write operation in the test procedure(i.e., write \longrightarrow refresh \longrightarrow read). Also, we present properties of the algorithm, such as its capability to detect stuck-at faults, transition faults, conventional pattern sensitive faults, and neighborhood bit-line sensitive faults.

  • PDF

Conflict Graph-based Downlink Resource Allocation and Scheduling for Indoor Visible Light Communications

  • Liu, Huanlin;Dai, Hongyue;Chen, Yong;Xia, Peijie
    • Journal of the Optical Society of Korea
    • /
    • v.20 no.1
    • /
    • pp.36-41
    • /
    • 2016
  • Visible Light Communication (VLC) using Light Emitting Diodes (LEDs) within the existing lighting infrastructure can reduce the implementation cost and may gain higher throughput than radio frequency (RF) or Infrared (IR) based wireless systems. Current indoor VLC systems may suffer from poor downlink resource allocation problems and small system throughput. To address these two issues, we propose an algorithm called a conflict graph scheduling (CGS) algorithm, including a conflict graph and a scheme that is based on the conflict graph. The conflict graph can ensure that users are able to transmit data without interference. The scheme considers the user fairness and system throughput, so that they both can get optimum values. Simulation results show that the proposed algorithm can guarantee significant improvement of system throughput under the premise of fairness.