• Proceedings of the Korea Committee for Ocean Resources and Engineering Conference
• /
• 2001.05a
• /
• pp.65-69
• /
• 2001

In this paper, consider the three cases of decide for appling point a general Simple Genetic Algorithm about heuristic method(Bottom and Left Sliding) at the piece auto-nesting on the row plate. The 1st case, about only using the Simple Genetic Algorithm. The 2nd case, applied the heuristic method to the genetic operating of the Simple Genetic Algorithm. The 3rd case, applied the heuristic method to the final result of the Simple Genetic Algorirhm. The estimation of final result were proceed to developed simulation program in this research.

• Journal of Power Electronics
• /
• v.16 no.5
• /
• pp.1964-1980
• /
• 2016

This paper presents a new simplified harmonics extraction algorithm based on the synchronous reference frame (SRF) for an indirect current controlled (ICC) three-level neutral point diode clamped (NPC) inverter-based shunt active power filter (SAPF). The shunt APF is widely accepted as one of the most effective current harmonics mitigation tools due to its superior adaptability in dynamic state conditions. In its controller, the SRF algorithm which is derived based on the direct-quadrature (DQ) theory has played a significant role as a harmonics extraction algorithm due to its simple implementation features. However, it suffers from significant delays due to its dependency on a numerical filter and unnecessary computation workloads. Moreover, the algorithm is mostly implemented for the direct current controlled (DCC) based SAPF which operates based on a non-sinusoidal reference current. This degrades the mitigation performances since the DCC based operation does not possess exact information on the actual source current which suffers from switching ripples problems. Therefore, three major improvements are introduced which include the development of a mathematical based fundamental component identifier to replace the numerical filter, the removal of redundant features, and the generation of a sinusoidal reference current. The proposed algorithm is developed and evaluated in MATLAB / Simulink. A laboratory prototype utilizing a TMS320F28335 digital signal processor (DSP) is also implemented to validate effectiveness of the proposed algorithm. Both simulation and experimental results are presented. They show significant improvements in terms of total harmonic distortion (THD) and dynamic response when compared to a conventional SRF algorithm.

• Journal of the Korea Computer Graphics Society
• /
• v.17 no.3
• /
• pp.9-19
• /
• 2011

Computing triangle-triangle intersections has been a fundamental task required for many 3D geometric problems. We propose a novel robust GPU algorithm to efficiently compute intersections in a large triangle set. The algorithm has three stages:k-d tree construction, triangle pair generation, and exact intersection computation. All three stages are executed on GPU except, for unsafe triangle pairs. Unsafe triangle pairs are robustly handled by CLP(controlled linear perturbation) on a CPU thread. They are identified by floating-point filtering while exact intersection is computed on GPU. Many triangles crossing a split plane are duplicated in k-d tree construction, which form a lot of redundant triangle pairs later. To eliminate them efficiently, we use a split index which can determine redundancy of a pair by a simple bitwise operation. We applied the proposed algorithm to computing 3D Minkowski sum boundaries to verify its efficiency and robustness.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.50 no.8
• /
• pp.531-540
• /
• 2022

In this paper, we present an algorithm that identifies artillery type and rapidly predicts the impact point based on the IMM filter. The ballistic trajectory equation is used as a system model, and three models with different ballistic coefficient values are used. Acceleration was divided into three components of gravity, air resistance, and lift. And lift acceleration was added as a new state variable. The kinematic condition that the velocity vector and lift acceleration are perpendicular was used as a pseudo-measurement value. The impact point was predicted based on the state variable estimated through the IMM filter and the ballistic coefficient of the model with the highest mode probability. Instead of the commonly used Runge-Kutta numerical integration for impact point prediction, a semi-analytic method was used to predict impact point with a small amount of calculation. Finally, a state variable initialization method using the least-square method was proposed. An integrated algorithm including artillery type identification, impact point prediction and initialization was presented, and the validity of the proposed method was verified through simulation.

• Journal of Electrical Engineering and Technology
• /
• v.10 no.2
• /
• pp.676-687
• /
• 2015

Path planning algorithms are used to allow mobile robots to avoid obstacles and find ways from a start point to a target point. The general path planning algorithm focused on constructing of collision free path. However, a high continuous path can make smooth and efficiently movements. To improve the continuity of the path, the searched waypoints are connected by the proposed polynomial interpolation. The existing polynomial interpolation methods connect two points. In this paper, point groups are created with three points. The point groups have each polynomial. Polynomials are made by matching the differential values and simple matrix calculation. Membership functions are used to distribute the weight of each polynomial at overlapped sections. As a result, the path has $G^2$ continuity. In addition, the proposed method can analyze path numerically to obtain curvature and heading angle. Moreover, it does not require complex calculation and databases to save the created path.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1997.04a
• /
• pp.73-77
• /
• 1997

This paper describes the analysis of measuring error of on the machine measuring(OMM) system which can directly measure the three dimensional machined free surface dimension using scanning probe on milling machine. 21 inch TV shadow mask mould was measured using PTP(point to point)measurement algorithm at pallet clamped and unclamped state on OMM system, and using coordinate measuring machine(CMM) one after another. The OMM system was evaluated probe error, stylus contact error, center shift error, repeatability and so on. Consequencely, the conclusion derived that elastic displacement of pallet had effect on measuring error mainly, and pallet design and setup method would be important.

• IEIE Transactions on Smart Processing and Computing
• /
• v.3 no.2
• /
• pp.59-64
• /
• 2014

This paper presents a method for estimating the bounding volume for image-based 3D object reconstruction. The bounding volume of an object is a three-dimensional space where the object is expected to exist, and the size of the bounding volume strongly affects the resolution of the reconstructed geometry. Therefore, the size of a bounding volume should be as small as possible while it encloses an actual object. To this end, the proposed method uses a set of silhouettes of an object and generates a point cloud using a point filter. A bounding volume is then determined as the minimum sphere that encloses the point cloud. The experimental results show that the proposed method generates a bounding volume that encloses an actual object as small as possible.

• Proceedings of the KIEE Conference
• /
• 2008.07a
• /
• pp.1142-1143
• /
• 2008

As well known, the maximum power point tracking (MPPT) is an important role in photovoltaic (PV) power systems. MPPT finds and maintains the operation of PV at the maximum power point when the irradiation and cell-temperature change. In this paper, the studied system includes a PV array, a Buck-Boost DC/DC converter, a DC/AC inverter and it is connected to the three phase power system. The solar array operates as a non-linear voltage source. The P&O algorithm with power feed-back is used to control the operating point of PV array at the maximum power point. The effects of irradiation and cell-temperature on the dynamic responses are also considered.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.11
• /
• pp.1482-1484
• /
• 2019

We present a method for transmitting 3D object information in real time in a telepresence system. Three-dimensional object information consists of a large amount of point cloud data, which requires high performance computing power and ultra-wideband network transmission environment to process and transmit such a large amount of data in real time. In this paper, multiple users can transmit object motion and facial expression information in real time even in small network bands by using GANs (Generative Adversarial Networks), a non-supervised learning machine learning algorithm, for real-time transmission of 3D point cloud data. In particular, we propose the creation of an object similar to the original using only the feature information of 3D objects using conditional GANs.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.7
• /
• pp.2650-2667
• /
• 2021

In this paper, we derive the expression of the cache hitting probability with random caching policy and propose the joint optimization algorithm based on difference of convex algorithm (DCA) in the three-tier caching heterogeneous cellular network assisted by macro base stations, helpers and users. Under the constraint of the caching capacity of caching devices, we establish the optimization problem to maximize the cache hitting probability of the network. In order to solve this problem, a convex function is introduced to convert the nonconvex problem to a difference of convex (DC) problem and then we utilize DCA to obtain the optimal caching probability of macro base stations, helpers and users for each content respectively. Simulation results show that when the density of caching devices is relatively low, popular contents should be cached to achieve a good performance. However, when the density of caching devices is relatively high, each content ought to be cached evenly. The algorithm proposed in this paper can achieve the higher cache hitting probability with the same density.