• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.23 no.6
• /
• pp.703-712
• /
• 1999

This paper suggests an automatic elliptic grid generation method that is well-suited for the numerical mapping of complex geometries which are easily obtained from general CAD programs. An LBLADI solver is used for the governing mapping equations to have the strong diagonal dominance. The full boundary control method is adopted to determine the control functions of the equations, which allows the control of the grid regarding spacing and angle control at all boundary surfaces. The solution method presented here provides the capability of mapping very complicated geometries by defining grid point locations only along the boundaries. In the automated elliptic grid generation procedure, it is showed that strong diagonal dominance is essential to achieve successful mapping irrespective of the initial grid condition provided. To demonstrate the robustness of this method, it is applied to the thermal flow like the natural convection between eccentric cylinders. The results agree well with others.

• 한국전산유체공학회:학술대회논문집
• /
• 1995.10a
• /
• pp.82-89
• /
• 1995

In the present paper, a method of nearly orthogonal grid generation in an arbitrary simply-connected 3D domain will be presented. The method is a new direct and non-iterative scheme based on the concept of the decomposition of the global orthogonal transformation into consecutive mapping of a conformal mapping and an auxiliary orthogonal mapping, which was suggested by King and Leal [4]. In our numerical scheme. Kang and Leal's method is extended from 2D problems to 3D problems while the advantage of the non-iterative algorithm is maintained. The essence of the present mapping method is that an iterative scheme can be avoided by introducing a preliminary step. This preliminary step corresponds to a conformal map and is based on the boundary element method(BEM). This scheme is applied to generate several nearly-orthogonal grid systems which are orthogonal at boundaries.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.8
• /
• pp.1605-1614
• /
• 2009

The technique of simultaneous localization and mapping is the most important research topic in mobile robotics. In the process of building a map in its available memory, the robot memorizes environmental information on the plane of grid or topology. Several approaches about this technique have been presented so far, but most of them use mapping technique as either grid-based map or topology-based map. In this paper we propose a frame of solving the SLAM problem of linking map covering, map building, localizing, path finding and obstacle avoiding in an automatic way. Some algorithms integrating grid and topology map are considered and this make the SLAM performance faster and more stable. The proposed scheme uses an occupancy grid map in representing the environment and then formulate topological information in path finding by A${\ast}$ algorithm. The mapping process is shown and the shortest path is decided on grid based map. Then topological information such as direction, distance is calculated on simulator program then transmitted to robot hardware devices. The localization process and the dynamic obstacle avoidance can be accomplished by topological information on grid map. While mapping and moving, pose of the robot is adjusted for correct localization by implementing additional pixel based image layer and tracking some features. A laser range finer and electronic compass systems are implemented on the mobile robot and DC geared motor wheels are individually controlled by the adaptive PD control method. Simulations and experimental results show its performance and efficiency of the proposed scheme are increased.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2003.06a
• /
• pp.1127-1130
• /
• 2003

This paper introduces histogramic in-motion mapping for real-time map building with the Eyebot in motion. A histogram grid used in HIMM is updated through three PSD sensors. HIMM makes it possible to make fast map-building and avoid obstacles in real-time. Fast map-building allows the robot to immediately use the mapped information in real-time obstacle-avoidance algorithms. HIMM has been tested on the Eyebot. The Eyebot sends PSD data to computer and computer builds a 3D-Map based on PSD data.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.63 no.11
• /
• pp.1564-1570
• /
• 2014

An electric vehicle (EV) not only receives electric power from the electric vehicle supply equipment (EVSE), but it also exchanges the information regarding charging process with the power gird through the EVSE. However, the EV and EVSE communicate using the ISO/IEC 15118 standard while the EVSE and power grid communicate using the IEC 61850 standard. Therefore, the EVSE should support both the ISO/IEC 15118 and IEC 61850 standards, and provide a data mapping function between the two communication protocols so that the EV and power grid, which support different protocols, can communicate with each other throughout the charging process. In this paper, we propose a mapping method of the EVSE, which converts the ISO/IEC 15118 data to IEC 61850 and vice versa, based on the XML schema of each protocol. The proposed method converts the data using the XSL (eXtensible Stylesheet Language) method, which defines the data mapping between two XML schemas. Our approach is more flexible and easier to maintain against changes in charging scenarios and the standards than other existing approaches such as one-to-one data mapping methods.

• Journal of computational fluids engineering
• /
• v.5 no.1
• /
• pp.14-21
• /
• 2000

A method of two and three dimensional orthogonal grid generation with control of spacing by using the covariant Laplace equation is presented. An important feature of the methodology is its ability to control effectively the grid spacing especially near the boundaries still maintaining good orthogonality in whole field. The method is based on the concept of decomposition of the global transformation into consecutive transformation of an approximate conformal mapping and an auxiliary orthogonal mapping to have linear and uncoupled equations. Control of cell spacing is based on the concept of reference arc length, and orthogonal correction is peformed in the auxiliary domain. It is concluded that the methodology can successfully generate well controlled orthogonal grids around bodies of 2 and 3 dimensional configurations.

• Journal of the Korea Convergence Society
• /
• v.8 no.8
• /
• pp.41-49
• /
• 2017

The 'NIST Framework and Road Map for Smart Grid Interoperability Standards' proposes an architecture framework to secure the direction of development and standard interoperability of smart grid and provides a list of identified standard, standard cyber security strategies, and certification framework. In particular, SEP 2.0 and OpenADR 2.0 are the examples. SEP 2.0 and OpenADR 2.0 can functionally link HEMS and Smart Grid, but interoperability standards between the two protocols are not planned in above document. The OpenADR Alliance also announced that work is underway to define mapping tables for interoperability between OpenADR 2.0 and SEP 2.0, but no information is yet available. Therefore, In this paper, in developing energy efficiency improvement HEMS, we propose a mapping model that supports syntactic and semantic founded interoperability between SEP 2.0 and OpenADR 2.0b for ICT grid convergence based on the standard specification document of each protocol and confirmed through an example of the semantic mapping function based on the demand response service scenario.

• The KIPS Transactions:PartA
• /
• v.12A no.4 s.94
• /
• pp.289-296
• /
• 2005

Many jobs in Grid environments consist of several subtasks, and these subtasks can be represented by a workflow, which is executed effectively on a Grid. In this paper, we present Meta services which describe a mapping from a service request to a workflow in Grid environments. By using Meta services, a workflow in Grid environments could adapts various service concepts such as portal services, Grid services, and Web services. And the workflow can be shared and reused among workflow users. Furthermore, historical performance data can be included in Meta services, so effective scheduling of the workflow is also possible.

• The KIPS Transactions:PartD
• /
• v.11D no.5
• /
• pp.1011-1020
• /
• 2004

A lot of work has been done to improve the I/O performance of such a system that store and manage a massive amount of data by distributing them across multiple disks and access them in parallel. Most of the previous work has focused on an efficient mapping from a grid ceil, which is determined bY the interval number of each dimension, to a disk number on the assumption that each dimension is split into disjoint intervals such that entire data space is GRID-like partitioned. However, they have ignored the effects of a GRID partitioning scheme on declustering performance. In this paper, we enhance the performance of mapping function based declustering algorithms by applying a good GRID par-titioning method. For this, we propose an estimation model to count the number of grid cells intersected by a range query and apply a GRID partitioning scheme which minimizes query result size among the possible schemes. While it is common to do binary partition for high-dimensional data, we choose less number of dimensions than needed for binary partition and split several times along that dimensions so that we can reduce the number of grid cells touched by a query. Several experimental results show that the proposed estimation model gives accuracy within 0.5% error ratio regardless of query size and dimension. We can also improve the performance of declustering algorithm based on mapping function, called Kronecker Sequence, which has been known to be the best among the mapping functions for high-dimensional data, up to 23 times by applying an efficient GRID partitioning scheme.

• 한국전산유체공학회:학술대회논문집
• /
• 2000.05a
• /
• pp.99-106
• /
• 2000

A method of two and three dimensional orthogonal grid generation with control of spacing by using the covariant Laplace equation is Presented. An important feature of the methodology is its ability to control effectively the grid spacing especially near the boundaries still maintaining good orthogonality in whole field. The method is based on the concept of decomposition of the global transformation into consecutive transformation of an approximate conformal mapping and au auxiliary orthogonal mapping to have linear and uncoupled equations. Control of cell spacing is based on the concept of reference arc length, and orthogonal correction is performed in the auxiliary domain. It is concluded that the methodology can successfully generate well controlled orthogonal grids around bodies of 2 and 3 dimensional configurations.