• Journal of Power Electronics
• /
• v.17 no.2
• /
• pp.368-379
• /
• 2017

In this paper, a direct torque control algorithm with novel duty cycle-based modulation is proposed for permanent magnet synchronous motor drives fed by neutral-point clamped three-level inverters. Compared with the standard DTC, the proposed algorithm can suppress steady-state torque ripples as well as ensure neutral-point potential balance and smooth vector switching. A unified torque/flux evaluation table with multiple voltage vectors and precise control levels is established and used in this method. This table can be used to evaluate the effects of duty-cycle vectors on torque and flux directly, and the elements of the table are independent of the motor parameters. Consequently, a high number of appropriate voltage vectors and their corresponding duty cycles can be selected as candidate vectors to reduce torque ripples by looking up the table. Furthermore, small vectors are incorporated into the table to ensure the neutral-point potential balance with the numerous candidate vectors. The feasibility and effectiveness of the proposed algorithm are verified by both simulations and experiments.

• Journal of Electrical Engineering and Technology
• /
• v.5 no.3
• /
• pp.423-430
• /
• 2010

Particle swarm optimization (PSO) algorithm is designed to find a single global optimal point. However, the PSO needs to be modified in order to find multiple optimal points of a multimodal function. These modifications usually divide a swarm of particles into multiple subswarms; in turn, these subswarms try to find their own optimal point, resulting in multiple optimal points. In this work, we present a new PSO algorithm, called coupling PSO to find multiple optimal points of a multimodal function based on coupling particles. In the coupling PSO, each main particle may generate a new particle to form a couple, after which the couple searches its own optimal point using non-stop-moving PSO algorithm. We tested the suggested algorithm and other ones, such as clustering PSO and niche PSO, over three analytic functions. The coupling PSO algorithm was also applied to solve a significant benchmark problem, the TEAM workshop problem 22.

• Korean Journal of Computational Design and Engineering
• /
• v.22 no.2
• /
• pp.110-117
• /
• 2017

Delaunay refinement algorithm is a classical method to generate quality triangular meshes when point cloud and/or constrained edges are given in two- or three-dimensional space. It computes the Delaunay triangulation for given points and edges to obtain an initial solution, and update the triangulation by inserting steiner points one by one to get an improved quality triangulation. This process repeats until it satisfies given quality criteria. The efficiency of the algorithm depends on the criteria and point insertion method. In this paper, we propose a method to accelerate the Delaunay refinement algorithm by applying geometric hashing technique called bucketing when inserting a new steiner point so that it can localize necessary computation. We have tested the proposed method with a few types of data sets, and the experimental result shows strong linear time behavior.

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 2000.04a
• /
• pp.252-257
• /
• 2000

This paper describes a look-ahead algorithm of PCNC(personal computer numerical control). The algorithm is based on acceleration/deceleration before interpolation never including a command error and determines a velocity value in end point of each block(or start point of each block). The algorithm is represented as following; 1) calculating two maximum arrival velocity(v1, v2) by a acceleration value, a command velocity and distance in a previous block and a next block, 2) getting a tangent velocity(v3) of the adjacent blocks, 3) choosing a minimum value among these three velocities, and 4) setting the value to a velocity of a start point of the next block(or a end point of the previous block). The proposed look-ahead algorithm was implemented and tested by using a commercial RTOS(real time operation system) on the MS-Windows NT 4.0 in a PC platform. For interfacing to a machine, a counter board, a DAC board and a DIO board were used. The result of the algorithm increased a machining precision and a machining speed in many short blocks.

• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.9 no.6
• /
• pp.71-81
• /
• 2000

This paper describers a look ahead algorithm of PC-NC(personal computer numerical control). The algorithm is based on acceleration/deceleration before interpolation which doesn\`t include a command error and determines a feedrate value at the end point of each block(or start point of each block). The algorithm is represented as following; 1) calculating two maximum arrival feedrates(F$_1$,F$_2$) by an acceleration value, a command feedrate, and the distance of a NC block, 2) getting a tangent feedrate (F$_3$) of the adjacent blocks, 3) choosing a minimum value among these three feedrates, and 4) setting the value to a feedrate of a start point of the next block(or a end point of the previous block). The proposed look ahead algorithm was implemented and tested by using a commercial TROS(real time operation system) on the MS-Windows NT 4.0 in a PC platform. For interfacing to a machine, a counter board, a DAC board and a DIO board were used. The result of the algorithm increased a machining precision and a machining speed in many short blocks.

• Structural Engineering and Mechanics
• /
• v.42 no.2
• /
• pp.175-189
• /
• 2012

This paper presents an algorithm for structural reliability with the response surface method. For this aim, an approach with three stages is proposed named as improved response surface method. In the algorithm, firstly, a quadratic approximate function is formed and design point is determined with First Order Reliability Method. Secondly, a point close to the exact limit state function is searched using the design point. Lastly, vector projected method is used to generate the sample points and Second Order Reliability Method is performed to obtain reliability index and probability of failure. Five numerical examples are selected to illustrate the proposed algorithm. The limit state functions of three examples (cantilever beam, highly nonlinear limit state function and dynamic response of an oscillator) are defined explicitly and the others (frame and truss structures) are defined implicitly. ANSYS finite element program is utilized to obtain the response of the structures which are needed in the reliability analysis of implicit limit state functions. The results (reliability index, probability of failure and limit state function evaluations) obtained from the improved response surface are compared with those of Monte Carlo Simulation, First Order Reliability Method, Second Order Reliability Method and Classical Response Surface Method. According to the results, proposed algorithm gives better results for both reliability index and limit state function evaluations.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1998.10a
• /
• pp.36-39
• /
• 1998

It is very difficult for the large-scale retailers, who deal with tens of thousands of items, to price all the items dynamically reflecting all the constraints and policies. In spite of its importance, the prices are determined by human experts because the process of setting the prices of all the items is not established yet. To solve this problem, we adopt a mixed model that combines three typical pricing models: cost-plus model, competition-oriented model, and demand-oriented model. Since each model an be converted to a set of constraints in point and interval forms, solving the pricing problem with the three groups of models requires an algorithm which can solve the problem with weighted constraints of intervals and points. So we have devised an algorithm named “Point Determination Algorithm”. From the rules that represents tile models, the constraints are extracted to be solvable by tile Point Determination Algorithm. A prototype KAPA (Knowledge Assisted pricing Advisor) is developed with this idea using the expert system environment UNIK - a tool developed by KAIST. According to the experiment with 76 items in comparison with 53 human pricing experts we confirmed that the KAPA can perform highly consistent with human experts. This implies KAPA system is applicable to pricing millions of items dynamically.

• Journal of Electrical Engineering and Technology
• /
• v.8 no.3
• /
• pp.490-498
• /
• 2013

This paper discusses the application of evolutionary multi-objective optimization algorithms namely Non-dominated Sorting Genetic Algorithm-II (NSGA-II) and Modified NSGA-II (MNSGA-II) for solving the Combined Economic Emission Dispatch (CEED) problem with valve-point loading. The valve-point loading introduce ripples in the input-output characteristics of generating units and make the CEED problem as a non-smooth optimization problem. IEEE 57-bus and IEEE 118-bus systems are taken to validate its effectiveness of NSGA-II and MNSGA-II. To compare the Pareto-front obtained using NSGA-II and MNSGA-II, reference Pareto-front is generated using multiple runs of Real Coded Genetic Algorithm (RCGA) with weighted sum of objectives. Furthermore, three different performance metrics such as convergence, diversity and Inverted Generational Distance (IGD) are calculated for evaluating the closeness of obtained Pareto-fronts. Numerical results reveal that MNSGA-II algorithm performs better than NSGA-II algorithm to solve the CEED problem effectively.

• Journal of Electrical Engineering and Technology
• /
• v.9 no.6
• /
• pp.2168-2180
• /
• 2014

In this paper, a generalized power loss algorithm for multilevel neutral-point clamped (NPC) PWM inverters is presented, which is applicable to any level number of multilevel inverters. In the case of three-level inverters, the conduction loss depends on the MI (modulation index) and the PF (power factor), and the switching loss depends on a switching frequency, turn-on and turn-off energy. However, in the higher level of inverters than the three-level, the loss of semiconductor devices cannot be analyzed by conventional methods. The modulation depth should be considered in addition, to find the different conducting devices depending on the MI. In a case study, the power loss analysis for the three- and five-level NPC inverters has been performed with the proposed algorithm. The validity of the proposed algorithm is verified by simulation for the three-and five-level NPC inverters and experiment for three-level NPC inverter.

• Journal of Korea Multimedia Society
• /
• v.12 no.6
• /
• pp.804-814
• /
• 2009

In this paper, a novel system for avatar motion controlling by tracking face is presented. The system is composed of three main parts: firstly, LCS (Local Cluster Searching) method based face feature detection algorithm, secondly, HMM based feature points recognition algorithm, and finally, avatar controlling and animation generation algorithm. In LCS method, face region can be divided into many small piece regions in horizontal and vertical direction. Then the method will judge each cross point that if it is an object point, edge point or the background point. The HMM method will distinguish the mouth, eyes, nose etc. from these feature points. Based on the detected facial feature points, the 3D avatar is controlled by two ways: avatar orientation and animation, the avatar orientation controlling information can be acquired by analyzing facial geometric information; avatar animation can be generated from the face feature points smoothly. And finally for evaluating performance of the developed system, we implement the system on Window XP OS, the results show that the system can have an excellent performance.